Listing paths works for four activities, not for forty. The critical path method finds the same answer in two passes.
Forward pass (early dates), first activity to last:
- ES of the first activity is 0. EF = ES + duration.
- At a merge, an activity starts after the latest EF of its predecessors (plus any lag).
Backward pass (late dates), last activity to first:
- LF of the last activity is the project finish. LS = LF - duration.
- At a burst, an activity must finish by the earliest LS of its successors.
Total float = LS - ES (or LF - EF): how far an activity can slip without moving the project finish. Activities with zero float form the critical path.
The two rules at merges and bursts are where most mistakes happen: largest going forward, smallest coming back.
Both passes on a four-activity network.