English: The graph File:Borůvka Algorithm 1.svg after one iteration of Borůvka's algorithm. Each of the 6 vertices is a single component (blue circles), and selects the nearest edge of minimum weight (blue arrows). All are added to the tree (green edges). There are now two components.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.