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 2 September 2014.
HTML page formatted Tue Sep 2 08:59:50 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. 2 September 2014. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/minimumCostSpanningTree.html