Revision as of 03:01, 8 March 2006 edit 128.2.247.72 (talk) No edit summary ← Previous edit		Revision as of 03:44, 8 March 2006 edit undo Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 244,927 edits m Reverted edits by 128.2.247.72 (talk) to last version by Toncek Next edit →
Line 7: Copy the vertices of ''G'' into a new graph, ''L'', with no edges. While the graph has more than one component For each component, find the cheapest edge ~~which~~with ~~has~~exactly one vertex in the component Add all of these edges to ''L''.

Borůvka's algorithm: Difference between revisions