克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为的该算法的代码进行了综合和改进，把各个版本存在的简单理解的一个。本程序对网上的很多版本错误都进行了改正，并用多个例子进行测试。欢迎大家找出错误。-Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning tree for each connected component). Kruskal s algorithm is an example of a greedy algorithm.