Home / Simulations / Critical Path Explorer
🗓️ Critical Path Explorer
Five activities, a few dependencies, one project deadline. Change each activity's duration and watch the critical path — the chain of zero-float activities that directly controls the finish date — shift live. Slack activities can slip; critical ones cannot.
Activities (days)
A
B
C
D
E
Dependencies (fixed): A→C, A→D, B→D, C→E, D→E.
Live Result
Project duration—
Critical path—
| Act | Dur | ES | EF | LS | LF | Float |
|---|
Powered by the exact Critical Path Method algorithm
(
engine/cpm.js) — independently re-verified before publishing
against a hand-calculated network (both a manual forward/backward pass and a
separate Python implementation agreed exactly: project duration 10, critical
path B→D→E).Method
Kelley & Walker (1959)Forward pass (ES/EF) + backward pass (LS/LF) + total float = LS−ES; critical path = zero-float chain.
Scope: activity-on-node, finish-to-start dependencies only (no lags, no resource leveling). Network topology is fixed here to keep the visualization simple — durations are the live variable.