Revision as of 14:21, 28 January 2022 edit Lollipoplollipoplollipop (talk \| contribs) Extended confirmed users, IP block exemptions 21,175 edits 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) ← Previous edit		Revision as of 16:42, 28 January 2022 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,640 edits tighter shortdesc Next edit →
Line 1: {{Short description\|~~Algorithm~~Method for finding minimum spanning ~~tree of a graph~~trees}} [[File:Boruvka's algorithm (Sollin's algorithm) Anim.gif\|thumb\|upright=1.35\|Animation of Boruvka's algorithm]] {{graph search algorithm}}

Borůvka's algorithm: Difference between revisions