本文件是数据结构中很重要的一个图的Kruskal算法。Kruskal算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。将文件编译，可完成Kruskal算法-This document is a very important data structure of a graph algorithm of Kruskal. Kruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left side will not have to select a loop with the smallest cost of the edge of the edge has been selected to join the collection. Documents compiled, to be completed by Kruskal Algorithm