Content deleted Content added
→Pseudocode: fix typo, we prefer edge1 over edge2 if the latter one is None, not the first one. |
Adding local short description: "Algorithm for finding minimum spanning tree of a graph", overriding Wikidata description "algorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forest" (Shortdesc helper) |
||
Line 1:
{{Short description|Algorithm for finding minimum spanning tree of a graph}}
[[File:Boruvka's algorithm (Sollin's algorithm) Anim.gif|thumb|upright=1.35|Animation of Boruvka's algorithm]]
{{graph search algorithm}}
| |||