task graph
A map of which build tasks depend on which others, used to decide what must run first and what can run at the same time.
In more detail
Each task is a point on the graph and each arrow says “this must finish before that starts”. Tasks with no path between them can run in parallel, and a change only forces the tasks downstream of it to rerun.
Related terms
- directed acyclic graph — A directed graph with no cycles, so following edges can never bring you back to where you started.
- topological sort — An ordering of a directed graph's vertices in which every edge points from an earlier vertex to a later one.
- Turborepo — A build tool for JavaScript monorepos that runs package tasks in dependency order, in parallel, and skips work whose inputs have not changed.
Taught in
- Monorepo Architecture: Workspaces & Turborepo — Production Full-Stack Engineering
- Unified Build Pipelines: Caching & Dependency Graphs — Production Full-Stack Engineering
- Type-Safe Client Generation: Orval & Automated SDKs — Production Full-Stack Engineering