(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 Black.
Entry modified 19 April 2004.
HTML page formatted Mon May 11 15:07:57 2026.
Cite this as:
Paul E. Black, "forest", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed TODAY)
Available from: /HTML/forest.html