Skip to main content

Dependency Map

What must exist before work can progress?

DEPENDENCY MAP
════════════════════════════════════════════════════════════

┌─────────┐
│ START │
└────┬────┘

┌──────────────┼──────────────┐
│ │ │
▼ ▼ ▼
┌─────────┐ ┌─────────┐ ┌─────────┐
│ DEP A │ │ DEP B │ │ DEP C │
│ (team) │ │ (team) │ │(external)│
└────┬────┘ └────┬────┘ └────┬────┘
│ ═════╪══════ │
│ │ │
└──────────────┼────────────┘


┌─────────┐
│ TASK │
└────┬────┘


┌─────────┐
│ DONE │
└─────────┘

─────── = Soft (can proceed with mocks)
═══════ = HARD (cannot proceed without)

════════════════════════════════════════════════════════════

The Dependency Map is the third flow engineering map. The critical path is the longest chain of hard dependencies — it determines minimum project duration.

Dependency Types

TypeDescriptionTypical Risk
DataSchema, seed data, migrationsMedium
APIEndpoint must exist before consumerHigh
InfrastructureDatabase, server, serviceHigh
DecisionArchitecture choice, approvalMedium
ResourcePerson, license, accessMedium
ExternalThird-party API, vendorVery High

Hard vs Soft

ClassificationMeaningImplication
HARDCannot proceed without itDefines critical path
SOFTCan mock or parallel-trackParallelization opportunity

Every hard dependency on the critical path is a risk multiplier. Every soft dependency reclassified from hard is time recovered.

Parallelization

CURRENT (Sequential)           OPTIMIZED (Parallel)
──────────────────── ────────────────────

A ── B ── C ── D A ──┐
├──► D
Lead time: 4 weeks B ──┤

C ──┘

Lead time: 2 weeks

Gate

Before moving to Capability Map:

  • All dependencies identified and classified
  • Hard vs soft classification complete
  • Critical path identified
  • Risk matrix populated
  • Parallelization opportunities documented
  • Every blocker has an owner and escalation path

If critical path has unowned blockers, escalate before proceeding.

Context