Boruvka's algorithm is a greedy MST algorithm. The algorithm works by joining
components/groups of nodes together. Initially, each node starts in its own
group. We loop through the groups and add the lowest-weighted edge, which
connects one group to another different group, to the MST.
This process continues until there is one group remaining/the number of edges
in the MST is V - 1, where V is the number of nodes/vertices in the graph.
Look below for an example run of Boruvka's algorithm: