Linked from
The 17 pages that link to Directed acyclic graph, each with the reason it gives.
Depth-first searchRelated: DFS finish times support topological sorting of this graph type.
Topological sortingBroader topic: Only graphs without directed cycles admit a topological ordering.
Hasse diagramRelated: Orienting cover edges upward gives an acyclic representation of the order.
Directed cycleCompared with: It is the defining opposite condition to containing a directed cycle.