Introduction - If you have any usage issues, please Google them yourself
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