NIST

shortest 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 25 July 2022.
HTML page formatted Mon Jul 25 09:56:30 2022.

Cite this as:
Joseph L. Ganley, "shortest spanning tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 July 2022. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/shortestSpanningTree.html