| dbp:caption
|
- A multitree, a DAG in which the subgraph reachable from any vertex induces an undirected tree (en)
- A polytree, a DAG formed by orienting the edges of an undirected tree (en)
- A DAG (en)
- Its transitive reduction (en)
- A topological ordering of a directed acyclic graph: every edge goes from earlier in the ordering to later in the ordering . A directed graph is acyclic if and only if it has a topological ordering. (en)
- Adding the red edges to the blue directed acyclic graph produces another DAG, the transitive closure of the blue graph. For each red or blue edge , is reachable from : there exists a blue path starting at and ending at . (en)
|
