DAG
Also known as
Directed acyclic graph
What is a DAG?
A directed acyclic graph (DAG) is a graph in which it’s impossible to get back to any starting node by following the links between nodes.
Also known as
A directed acyclic graph (DAG) is a graph in which it’s impossible to get back to any starting node by following the links between nodes.