Kruskal's Algorithm -- from Wolfram MathWorld

Kruskal's Algorithm An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge separate components until the graph is fully connected (Pemmaraju

mathworld.wolfram.com