# DAG (Directed Acyclic Graphs) (DAGs)

  - [[Directed Graph]] - A graph consists of edges and nodes where each edge points towards a node.
    - {{ https://i.imgur.com/TDw2LA4.jpg }}
  - [[Directed Acyclic Graph]] - A directly acyclic graph is one in which the edges in the graph do not form a cycle.
    - {{ https://i.imgur.com/qYwr6Dr.jpg }}


## Ref

- https://www.youtube.com/watch?v=2nhdhIYueIE