Swarm Optimization Patterns

Critical Path Method (CPM)

Task A (3min) ─┐
               ├── Task D (5min) ── Task F (2min)
Task B (2min) ─┘        │
                         └── Task E (3min) ── Task G (1min)
Task C (4min) ─────────────────────────────── Task H (2min)

Critical Path: C → H = 6min (longest path)
Zero-slack: C, H (gecikme tüm timeline'ı etkiler)

Dependency DAG Construction