Borůvka's Algorithm

Borůvka's Algorithm is a greedy approach to find a Minimum Spanning Tree (MST) in a graph. It works by repeatedly selecting the cheapest edge connecting two components and adding all such edges at once. By merging multiple components in every iteration, the algorithm quickly reduces the number of components until the entire graph becomes a single connected tree.