NIST

Boruvka's algorithm

(algorithm)

Definition: Compute a minimum spanning tree.

See also Kruskal's algorithm, Prim-Jarnik algorithm.

Author: PEB

More information

Eppstein's lecture outlining and contrasting MST algorithms.

O. Boruvka, O jistem problemu minimalnim, Praca Moravske Prirodovedecke Spolecnosti, 3:37-58, 1926. (in Czech) (The u in Boruvka has a small o above it.)


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 19 April 2006.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "Boruvka's algorithm", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2006. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/boruvkasAlgorithm.html