AlgorithmsComputerScienceDataStructuresGraphTheoryMath
A directed acyclic graph (DAG) is a triple
is a discrete set of vertices is a set of edges which are ordered pairs of distinct vertices is a partial order on such that whenever a directed path from to
Every DAG has a topological ordering.