Boruvka MST Algorithm

Borůvka's algorithm is a greedy algorithm for finding a minimal spanning tree in a graph, or a minimal spanning forest in the case of a graph that is not connected. The algorithm was rediscovered by Choquet in 1938; again by Florek, Łukasiewicz, Perkal, Steinhaus, and Zubrzycki in 1951; and again by Georges Sollin in 1965.

Boruvka MST source code, pseudocode and analysis