Expand description
Dependency graph analysis for task queues.
Responsibilities:
- Provide the
queue::graphmodule public API via focused submodules. - Re-export the minimal set of types/functions consumed by CLI/GUI clients and other crate code.
Not handled here:
- Graph construction (see
build). - Algorithms (see
algorithms). - Traversal helpers (see
traversal).
Invariants/assumptions:
- The graph represents a DAG in normal operation (cycles are rejected elsewhere).
- Task IDs used as graph keys are normalized via
trim()during graph construction.
Structs§
- Bounded
Chain Result - Result of a bounded chain traversal.
- Critical
Path Result - Result of critical path analysis.
- Dependency
Graph - Dependency graph containing all tasks and their relationships.
- Task
Node - A node in the dependency graph representing a task and its relationships.
Enums§
- Graph
Format - Output format for graph serialization.