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 E. Black.

Entry modified 17 July 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.

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

to NIST home page