Kruskal 算法是一种按照图中边的权值递增的顺序构造最小生成树的方法。其基本思想是：设无向连通网为G＝（V，E），令G 的最小生成树为T，其初态为T＝（V，{}），即开始时，最小生成树T 由图G 中的n 个顶点构成，顶点之间没有一条边，这样T 中各顶点各自构成一个连通分量。然后，按照边的权值由小到大的顺序，考察G 的边集E 中的各条边。若被考察的边的两个顶点属于T 的两个不同的连通分量，则将此边作为最小生成树的边加入到T 中，同时把两个连通分量连接为一个连通分量；若被考察边的两个顶点属于同一个连通分量，则舍去此边，以免造成回路，如此下去，当T 中的连通分量个数为1 时，此连通分量便为G 的一棵最小生成树。-Kruskal algorithm is a value in accordance with the right side of the graph in order of increasing minimum spanning tree approach. The basic idea is: Let undirected network connectivity for G = (V, E), so that the minimum spanning tree of G is T, its initial state is T = (V, {}), when that started, the minimum spanning tree T by The graph G of n vertices, there is an edge between vertices, and the vertices of each of the T constituting a connected component. Then, follow the right side of the value of the order from small to big, examining G' s edge set E of the respective sides. Two vertices belonging to the edge if they are examined two different T connected component, then this edge as the minimum spanning tree edge added to T while the two connected components connected to a connected component　side if they are investigated two vertices belong to the same connected component, then rounding the edges to avoid loops, and so on, when the number of connected components T 1, this co