Revision as of 19:19, 14 July 2017 edit 2.219.26.139 (talk) →Current pseudocode assumes connected graph ← Previous edit		Revision as of 19:25, 14 July 2017 edit undo 2.219.26.139 (talk) →Current pseudocode assumes connected graph Next edit →
Line 154: While there is an edge between any two components: </source> Although it is possible, that the original paper covers only the connected case.

Talk:Borůvka's algorithm: Difference between revisions