Borůvka's algorithm

Also known as Sollin's algorithm

algorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forest