Borůvka's algorithm: Difference between revisions

Revision as of 23:57, 8 February 2006

Revision as of 03:01, 8 March 2006

Line 7:

*Copy the vertices of ''G'' into a new graph, ''L'', with no edges.

*While the graph has more than one component

**For each component, find the cheapest edge withwhich exactlyhas one vertex in the component

**Add all of these edges to ''L''.