From plan-cascade
Displays dependency graph for all stories in the PRD with ASCII visualization, dependency details, critical path analysis, and detects issues like circular dependencies or bottlenecks.
How this command is triggered — by the user, by Claude, or both
Slash command
/plan-cascade:show-dependenciesThe summary Claude sees in its command listing — used to decide when to auto-load this command
# Hybrid Ralph - Show Dependencies You are displaying the dependency graph and analysis for all stories in the PRD. ## Path Storage Modes PRD file location depends on the storage mode: - **New Mode**: `~/.plan-cascade/<project-id>/prd.json` or in worktree directory - **Legacy Mode**: `prd.json` in project root or worktree ## Step 1: Verify PRD Exists ## Step 2: Read PRD Read the PRD file at `$PRD_PATH` to get all stories and their dependencies. ## Step 3: Build Dependency Graph Create a mapping of: - Story → Dependencies (what this story depends on) - Story → Dependents (what depe...
You are displaying the dependency graph and analysis for all stories in the PRD.
PRD file location depends on the storage mode:
~/.plan-cascade/<project-id>/prd.json or in worktree directoryprd.json in project root or worktree# Get PRD path from PathResolver
PRD_PATH=$(uv run python -c "from plan_cascade.state.path_resolver import PathResolver; from pathlib import Path; print(PathResolver(Path.cwd()).get_prd_path())" 2>/dev/null || echo "prd.json")
# Also check local prd.json (in worktree)
if [ -f "prd.json" ]; then
PRD_PATH="prd.json"
elif [ ! -f "$PRD_PATH" ]; then
echo "ERROR: No PRD found at: $PRD_PATH"
exit 1
fi
Read the PRD file at $PRD_PATH to get all stories and their dependencies.
Create a mapping of:
Use depth-first search to detect cycles:
For each story:
Mark as visiting
For each dependency:
If dependency is visiting → CYCLE DETECTED
If dependency not visited → recurse
Mark as visited
Find stories with:
Find stories with many dependents (threshold: 4+).
============================================================
DEPENDENCY GRAPH
============================================================
## Visual Graph
{ASCII tree showing dependencies}
Example:
story-001 (Database Schema)
│
├─── story-002 (User Registration)
│ │
│ └─── story-004 (Password Reset)
│
└─── story-003 (User Login)
│
└─── story-004 (Password Reset)
## Dependency Details
{For each story, show:
- ID and title
- Dependencies (if any)
- Depth level
- Dependents (if any)
- Type (root, intermediate, endpoint, orphan, bottleneck)
}
## Analysis
- Maximum depth: {depth} levels
- Critical path length: {count} stories
- Bottleneck stories: {list}
- Circular dependencies: {count or "none detected"}
- Orphan stories: {count or "none detected"}
============================================================
If issues detected, show them:
⚠️ Circular dependency detected:
story-001 → story-002 → story-003 → story-001
This will prevent any story from starting. Break the cycle by removing a dependency.
⚠️ Bottleneck warning:
story-001 has 5 dependents
Consider breaking this story into smaller pieces
ℹ️ Orphan story:
story-005 has no dependencies and nothing depends on it
This story may not be part of the main workflow
Using This Information:
For Parallel Execution:
Root stories (depth 0) can all run in parallel.
For Optimization:
Bottleneck stories should be kept small to avoid blocking others.
For Planning:
The critical path shows the minimum number of sequential steps.
Next steps:
- /plan-cascade:approve - See execution plan with batches
- /plan-cascade:edit - Modify dependencies
- /plan-cascade:hybrid-status - Check execution progress
npx claudepluginhub taoidle/plan-cascade --plugin plan-cascade/dependency-mapperMaps and analyzes project dependencies from code imports, git history, and Linear tasks, producing visual graphs, cycle detection, blockers, and task ordering.
/map-dependenciesIdentify and visualize dependencies across teams and projects to prevent blocked work.
/validate-dependenciesValidates all project task dependencies for circular issues, missing tasks, logical problems, and complexity; outputs report with graph, critical path, bottlenecks, and fix suggestions.