Content deleted Content added
Line 146:
== Current pseudocode assumes connected graph ==
Borůvka's algorithm is in many cases presented in a variant, which works for disconnected graphs and generates a minimum spanning forest, by presenting it using the 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:
| |||