Directed Acyclic Graphs

Definition

A directed acyclic graph (DAG) is a directed graph that contains no directed cycles.

If $G$ has a topological order, then $G$ is a DAG.

If $G$ is a DAG, then $G$ has a node with no entering edges.

If $G$ is a DAG, then $G$ has a topological order.