DAG
A DAG, or directed acyclic graph, is a graph of directed edges with no cycles, used to express steps and their order.
A directed acyclic graph, or DAG, connects nodes with directed edges in such a way that no path leads from a node back to itself. Because it has no cycles, its nodes can always be arranged in a single order that respects every dependency, which is known as a topological sort.
In software, DAGs are widely used to describe dependencies between tasks. Workflow orchestration tools, build systems and data pipelines define jobs as DAGs to decide execution order, and the commit history of version control systems also forms a DAG.
This entry is based on AIPOST articles and widely known facts. If something is wrong, please send us a correction request.