Borůvka's algorithm: Difference between revisions

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
**Find the safe edges forFor each component, (afind safe edge isthe ancheapest edge with exactly one vertex in the component)
**Add all of these edges to ''L''.