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: Tasks where float = 0
5. Batch identification: Group tasks by earliest start time
6. Bottleneck analysis: Identify tasks that block the most work

Structs

CpmAlgorithm

CPM Algorithm calculator