Kruskal's algorithm

Kruskal's algorithm is a greedy algorithm to find a minimum spanning tree in a weighted, undirected graph. Joseph Kruskal first described it in 1956:
In this case, the shortest edge is the one with the lowest weight.
Example.
Download the example data.