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.