Revision as of 18:58, 14 July 2017 edit 2.219.26.139 (talk) →Current pseudocode assumes connected graph: new section ← Previous edit		Revision as of 19:19, 14 July 2017 edit undo 2.219.26.139 (talk) →Current pseudocode assumes connected graph Next edit →
Line 146: == Current pseudocode assumes connected graph == Borůvka's algorithm is ~~normally~~in many cases presented in a variant, which works for disconnected graphs and generates a minimum spanning forest, by presenting it using edge contractions. But the pseudocode assumes, that the graph is connected by saying: <source lang="text" start="2" line> While T has more than one component:

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