- 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): articles and videos, books, web search
- Previous term: Foreign key
- Next term: Fork
- Random term: Delete, add, view, edit (or roll the dice with webglossary.info/random)