Tree as a type of graph
Nov 5, 2022
· Tree
· Rooted Trees
Tree
A tree is an undirected graph with no cycles. Equivalently, it is a connected graph with N nodes and N-1 edges.
Rooted Trees
A rooted tree is a tree with a designated root node where every edge either points away from or towards the root node . When edges point away from the root the graph is called an arborescence (out-tree) and anti-arborescence (in-tree) otherwise.
