 Tree (graph theory)

In graph theory, a tree is an undirected graph in which any two vertices are connected by "exactly one" path, or equivalently a connected acyclic undirected graph.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.