A tree is an undirected graph which is both connected and acyclic. Equivalently, a tree is a graph such that for any two vertices with , there is exactly one path connecting and in . Every tree on vertices has exactly edges.
Create a new account
Lost your activation email?
Forgot your password or username?