Definitionv1
Dependency graph: a Directed Acyclic Graph (DAG)
Dependency graph: a Directed Acyclic Graph (DAG) representing tasks as nodes and directed edges showing which tasks must complete before others can begin, with tasks having no incoming edges starting immediately and the longest chain of dependent tasks determining the minimum project completion time
Why This Is a Definition
This definition precisely establishes what a dependency graph is by identifying it as a formal structure (DAG) with specific operational characteristics (nodes for tasks, directed edges for dependencies, immediate start for nodes with no incoming edges) and includes the key differentiating feature of critical path determination, distinguishing it from general network structures.