Directed Acyclic Graph

A graph $G=(V,E)$ is said to be a directed acyclic graph:

• if it is a irreflexive relation
• if it does not contain any cycles of length $\ge 2$

If there is a path $u⇝v$ then there is no path $v⇝u$.