(definition)
Definition: A collection of one or more trees.
Formal Definition: An undirected, acyclic graph.
See also connected graph.
Note: Different vertices of a forest need not be connected.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Mon Sep 11 09:46:03 2006.
Cite this as:
Paul E. Black, "forest", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/forest.html
