Directed acyclic graph (DAG)

A special type of Simple graph that

• There’s no cycles (loops)
• Each edge is directed so $(v_i,v_j)\in E\Rightarrow (v_j,v_i)\notin E$

---

References