Borůvka's algorithm: Difference between revisions

Revision as of 18:31, 16 March 2003

Revision as of 21:14, 14 April 2003

Line 1:

'''Boruvka's algorithm''' finds minimum spanning [[tree (graph theory)|tree]]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.

Other algorithms for this problem include [[Prim's algorithm]] and [[Kruskal's algorithm]].