Definition: An algorithm for computing a minimum spanning tree. It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest edge in the graph whose vertices are in different partial minimum spanning trees.
See also Prim-Jarnik algorithm.
Eppstein's lecture outlining and contrasting MST algorithms.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 19 April 2006.
HTML page formatted Mon Nov 18 10:44:09 2013.
Cite this as:
Joseph L. Ganley, "Kruskal's algorithm", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/kruskalsalgo.html