-
Notifications
You must be signed in to change notification settings - Fork 26
Open
Description
Implement a task dependency system that allows tasks to be linked with predecessor-successor relationships (finish-to-start, start-to-start, finish-to-finish, start-to-finish) and automatically calculate and visualize the critical path on the roadmap.
Technical Complexity
- Requires implementing a directed acyclic graph (DAG) structure for task relationships
- Need topological sorting algorithm to validate dependencies
- Critical path calculation using forward and backward pass algorithms
- Visual representation of dependencies using arrows/lines between tasks
- Automatic slack time calculation for non-critical tasks
- Support for lag/lead times between dependent tasks
Key Components
- New
Dependencyclass inroadmapper/dependency.py - Methods:
task.add_dependency(other_task, relationship_type, lag_days) roadmap.calculate_critical_path()method- Visual indicators for critical vs non-critical tasks (different colors/styles)
- Dependency arrows rendered on the roadmap surface
Use Cases
- Project managers need to identify bottlenecks
- Teams need to understand task sequencing constraints
- Visual identification of which tasks can be parallelized
- Automatic scheduling adjustments when dependencies change
Metadata
Metadata
Assignees
Labels
No labels