# Rooted Acyclic Graph

Jump to navigation
Jump to search

A Rooted Acyclic Graph is a graph with a root node and whose undirected graph mapping is an acyclic graph.

**AKA:**Tree Graph.**Context:**- It can (typically) have one or more Tree Leaf Nodes.
- It can range from being a Directed Rooted Acyclic Graph to being an Undirected Rooted Acyclic Graph.
- It can be represented by a Tree Data Structure.
- …

**Counter-Example(s):****See:**Lattice.