What is a 'Directed Acyclic Graph' (DAG)?

What is a 'Directed Acyclic Graph' (DAG)?

Approach: Define a graph with no cycles.

A mathematical structure used to model dependencies between tasks. It is 'directed' because it has a specific flow and 'acyclic' because it never loops back on itself.

Follow-up: What happens if a cycle is introduced in a pipeline?

Key concepts: dependencies, scheduling.