说明：  最小生成树是数据结构中图的一种重要应用,它的要求是从一个带权无向完全图中选择n-1条边并使这个图仍然连通...为了得到最小生成树,人们设计了很多算法,最著名的有prim算法和kruskal算法。
(Minimum spanning tree data structure is an important application of graph, and its request is from a weighted undirected complete graph to select n-1 edges and the graph is still connected ... in order to get minimum spanning tree, it is designed a lot of algorithms, the most famous are prim algorithm and Kruskal algorithm.)