A directed acyclic graph, often abbreviated as DAG, is a graph that has no cycle. This means that all nodes eventually lead to designated endpoints. They show causal relationships between nodes, where one node is the cause and leads to another node(s), the effect(s).