Module algorithm 

CPM Algorithm Implementation

Implements the Critical Path Method (CPM) algorithm:

1. Forward pass: Calculate earliest start/finish times (ES/EF)
2. Backward pass: Calculate latest start/finish times (LS/LF)
3. Float calculation: slack = LS - ES
4. Critical path: critical_path is one longest prerequisite chain in execution order; critical_ids lists every zero-float (critical) task.
5. Batch identification: Group tasks by earliest start time
6. Bottleneck analysis: Identify tasks that block the most work

Structs

CpmAlgorithm

CPM Algorithm calculator

Constants

CPM_VERSION

Version of the CPM kernel’s output semantics. Bump whenever a change alters any field of CriticalPathResult for the same input, so stored plans are recomputed on open (see plan_store). Bump also when EffortEstimator defaults change, since stored plans are recomputed with the current estimator.