- An undirected graph in which any two vertices are connected by at most one path. Equivalently, it is an undirected acyclic graph, all of whose connected components are trees; in other words, the graph consists of a disjoint union of trees. ← Wikipedia
- More about this term (beta): Web search, articles and videos, books
- Previous term: Foreign key
- Next term: Fork
- Random term: Navigator