A directed acyclic graph (often abbreviated as "DAG") is a directed graph that does not contain any cycles. An example of a DAG is shown in the figure below.
Page:
Context:
