It was first published in 1926 by Otakar Borůvka as a method of constructing an efficient electricity network for Moravia.

[1][2][3] The algorithm was rediscovered by Choquet in 1938;[4] again by Florek, Łukasiewicz, Perkal, Steinhaus, and Zubrzycki in 1951;[5] and again by Georges Sollin in 1965.

Then a cycle could be created if we select ab as the minimal weight edge for {a}, bc for {b}, and ca for {c}.

A tie-breaking rule which orders edges first by source, then by destination, will prevent creation of a cycle, resulting in the minimal spanning tree {ab, bc}.

[10] These randomized and deterministic algorithms combine steps of Borůvka's algorithm, reducing the number of components that remain to be connected, with steps of a different type that reduce the number of edges between pairs of components.