Borůvka's algorithm
= Borůvka's algorithm
{wiki=Borůvka's_algorithm}
Borůvka's algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, weighted graph. Named after Czech mathematician Otakar Borůvka, the algorithm operates in the following manner: \#\#\# Steps of Borůvka's Algorithm: 1. **Initialization**: Start with each vertex in the graph as its own separate component (or tree).