Editing Borůvka's algorithm (section)

== Example ==

{| class="wikitable"
! | Image
! width="100" | components
! | Description
|-
|[[File:Borůvka Algorithm 1.svg|200px]]
| {A}<br/>{B}<br/>{C}<br/>{D}<br/>{E}<br/>{F}<br/>{G}
|This is our original weighted graph. The numbers near the edges indicate their weight. Initially, every vertex by itself is a component (blue circles).
|-
|[[File:Borůvka Algorithm 2.svg|200px]]
| {A,B,D,F}<br/>{C,E,G}
|In the first iteration of the outer loop, the minimum weight edge out of every component is added. Some edges are selected twice (AD, CE). Two components remain.
|-
|[[File:Borůvka Algorithm 3.svg|200px]]
| {A,B,C,D,E,F,G}
|In the second and final iteration, the minimum weight edge out of each of the two remaining components is added. These happen to be the same edge. One component remains and we are done. The edge BD is not considered because both endpoints are in the same component.
|}