A forest is an undirected Graph in which any two Vertices are connected by at most one path, or equivalently an acyclic Undirected graph or equivalently a disjoint union of trees.

## References

“Tree (Graph Theory).” 2022.

*Wikipedia*, May. https://en.wikipedia.org/w/index.php?title=Tree_(graph_theory)&oldid=1086807538.