# Rooted Directed Acyclic Graph

Jump to navigation
Jump to search

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):****See:**Directed Acyclic Graph.