(definition)
Definition: A connected, acyclic subgraph containing all the vertices of a graph.
See also minimum spanning tree.
Note: From Algorithms and Theory of Computation Handbook, page 1-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 18 March 2005.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "spanning tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 18 March 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/spanningtree.html
