🧮Directed Acyclic Graph (DAG)
Also known as DAG, Acyclic Graph, Directed Acyclic Graphs
A graph of one-way arrows with no loops. It shows what must come first.
Think of it like
Think of it like a family tree. Arrows go from mums and dads to kids, and never back up.
Example
A data job has five steps. Get data comes first, then clean data, then two reports, then one email. That plan is a DAG.
Why it matters
With no loops, a program can always find a safe order to run the steps in.
Definition
Common mistake
Key takeaways
- 1One-way arrows. Each edge points from first to next.
- 2No loops. You never come back to the start.
- 3Gives an order. There is always a safe order to run.