Rooted Directed Acyclic Graph

A rooted directed acyclic graph is a rooted acyclic graph that is also a directed acyclic graph.

• AKA: Directed Rooted Acyclic Graph.
• Example(s):
  • a Tree Data Structure.
  • …
• Counter-Example(s):
  • an Unrooted Directed Acyclic Graph.
• See: Directed Acyclic Graph.

---