Directed Acyclic Graph (DAG)

A directed graph structure (e.g., flow chart) that has no recursive routes (i.e., traversing the graph will never go twice through the same route or branch).