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 E. Black.
Entry modified 19 April 2006.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Joseph L. Ganley, "Kruskal's algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 19 April 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/kruskalsalgo.html