Expand description
Dependency graph construction and validation
This module handles the critical transformation from hierarchical WBS to flat DAG suitable for CPM scheduling.
Key principle: The WBS (Work Breakdown Structure) is for PRESENTATION. The DAG (Directed Acyclic Graph) is for SCHEDULING. These must be completely separated.
Structs§
- Dependency
Edge - An edge in the dependency graph
- Leaf
Dependency - Dependency declaration from original task
- Leaf
Task - A leaf task extracted from the WBS
- Scheduling
Graph - A flattened, schedulable graph of leaf tasks only
Enums§
- Graph
Error - Errors during graph construction