Borůvka's algorithm

Proper noun

 * 1)  A greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected.