DAG
You might say
Ten tasks depend on each other. How do I run them in the right order, in parallel, without anything deadlocking?
A directed graph of tasks where each arrow means 'finish first', and no path loops back to its startIn a pre-release check, the build runs first, tests and copy checks run in parallel, and the report comes last; a link from the report back to the build would create a cycle, and the scheduler rejects it.
Also calledDirected Acyclic GraphDependency graph
Further reading