Graph - Root (Rooted)



A rooted graph is a graph in which one vertex has been distinguished as the root.

A tree is a good example of a rooted graph

Documentation / Reference

Discover More
Data System Architecture
(Tree|Nested Set|Hierarchy) Data Structure

A tree is a node that may have children. Tree's are inherently recursive by definition as each child of a node is a Tree itself, with or without children nodes. A tree is a special case of a graph structure...
Data System Architecture
Boolean - Function

A Boolean function can be represented as a rooted directed, acyclic graph, which consists of several decision nodes and terminal nodes. Viz: Structure: Binary_decision_diagram

Share this page:
Follow us:
Task Runner