Content deleted Content added
moravia -> bohemia (in line with minimum spanning tree) -- source, anyone? |
Fixed an error in the description of the algorithm |
||
Line 5:
*Copy the vertices of ''G'' into a new graph, ''L'', with no edges.
*While the graph has more than one component
**
**Add all of these edges to ''L''.
|