tree
Formally, a forest is an undirected, acyclic graph
. A forest consists of trees, which are themselves acyclic, connected graphs
. For example, the following diagram represents a forest, each connected component
of which is a tree.
Formally, a forest is an undirected, acyclic graph. A forest consists of trees, which are themselves acyclic, connected graphs
. For example, the following diagram represents a forest, each connected component
of which is a tree.