A directed acyclic graph is a way to represent steps that must happen in a specific order without loops.
From “The Factory | Think Like A Coder, Ep 9” — TED-Ed
see it said at 4:04
Did you know?
Surprising facts — each proven at the exact second of its video