Description: Grasp the characteristics of Prim algorithm, learning algorithm constructed by Prim minimum spanning tree if the undirected connected graph is a network, then it must be all the spanning tree in the side of a tree weight value sum for the smallest, spanning tree, we called for minimum spanning tree. In the Prim algorithm, in Figure G = (V, E) (V said vertex, E said that edges) in one point V0, the collection U = (V0) for the initial state, starting from V0 to find the adjacent vertex of U (another vertex in V in) and the cost of the other side of the smallest vertex V1, and V1 to join U, namely U = (V0, V1), at the same time (V0, V1) to include in the collection side of T in (T of the initial state is empty), this continues to expand U, until U = V, then T is the minimum spanning tree in the side.
To Search:
- [Dijkstra_Huffman_Prim] - prim algorithm Huffman algorithm Dijkstr
- [shuxu] - Find the order is a simple way to find t
- [code] - To determine whether a graph is a two-co
- [Prim] - With prim (Prim) Minimum Spanning Tree A
File list (Check if you may need any files):
Download