Search - kruskal minimum tree

Search - kruskal minimum tree - List

[WEB Code] Kru DL : 0: Kruskal算法，Kruskal算法的时间复杂度为，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for edge for the sparse network of minimum spanning tree.
Date : 2008-10-13 Size : 6.14kb User : gdfgdfg