Reading time: 15 minutes | Coding time: 10 minutes
Borůvka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct, or a minimum spanning forest in the case of a graph that is not connected.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/boruvka-minimum-spanning-tree/