Borůvka's algorithm: Difference between revisions

Revision as of 07:14, 23 April 2003

Revision as of 00:36, 23 June 2003

Line 1:

'''Borůvka's algorithm''' finds [[minimum spanning [[tree|minimum (graphspanning theory)|treetrees]]s. A minimum spanning tree is a tree containing each vertex in the graph such that the sum of the edges' weights is minimum. Each vertex in the graph finds its lightest edge, then the vertices at the ends of each lightest edge are identified. This continues until the entire graph collapses into a single point. The tree consists of all the lightest edges so found.

Borůvka's algorithm can be shown to run in time O(m log n), where m is the number of edges, and n is the number of vertices.