NIST

minimum cost spanning tree

(definition)

Definition: See minimum spanning tree.

Author: JLG


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 17 July 2006.
HTML page formatted Tue May 6 13:48:56 2014.

Cite this as:
Joseph L. Ganley, "minimum cost spanning tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 July 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/minimumCostSpanningTree.html