Content deleted Content added
upgrade from start to C |
→Current pseudocode assumes connected graph: new section |
||
Line 143:
it says T is the set of nodes, but later you add edges to it, so you would have maybe in the beginning T = {A, B, C} and after adding edges you'd actually have T = {A, B, C, {A, B}}? That does not cover with what is done in the example.
[[Special:Contributions/141.53.220.30|141.53.220.30]] ([[User talk:141.53.220.30|talk]]) 14:07, 21 July 2013 (UTC)
== Current pseudocode assumes connected graph ==
Borůvka's algorithm is normally presented in a variant, which works for disconnected graphs and generates a minimum spanning forest. But the pseudocode assumes, that the graph is connected by saying:
<source lang="text" start="2" line>
While T has more than one component:
</source>
I believe this should read:
<source lang="text" start="2" line>
While there is an edge between any two components:
</source>
| |||