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.
