Search - PRIM c

Search - PRIM c - List

[CSharp] superprimclass2 DL : 0: 描述求超级素数的c++程序，用来求解超级素数的c++程序-this is a prim solve
Date : 2026-01-12 Size : 1kb User : 李烨
[CSharp] Prim DL : 0: 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characterized by the formation of the current set of T is always a tree. The T, U and TE were seen as red dots and red edge set, VU as a blue dot set. Every step of the algorithm are connecting the red, blue, choose a set of purple fringing to expand into the T in the light side. The nature side of MST to ensure that this is safe. T starting from any root r, and gradually grow up to U = V, ie T contains all the vertices of C so far. MST to ensure that this time the nature of the tree T is a G MST. Because each side is to add the right tree as small as possible, so this is a " greedy" strategy.
Date : 2026-01-12 Size : 1kb User : 吕济根
[CSharp] Graph DL : 0: 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity.
Date : 2026-01-12 Size : 1.03mb User : 易新宇