Open
In Progress
Blocked
Actionable
Closed
Dependency Graph
Visualize connections & find optimal paths
Quick Wins
High impact
All caught up!
No quick wins at the moment
Blockers to Clear
Blocking the most issuesNo blocking issues
Your project flow is clear
By Type
No data
By Priority
No data
Top Picks
No issues to display
Start by creating some beads
Progress Over Time
Priority Distribution
Issues by Type
Label Dependency Heatmap
Expand to load heatmap
Recent Activity
No recent activity
Filters
ActiveShowing of issues
No matching issues
No results for "" No issues match the selected filters There are no issues to display
- of
Active Nodes
Graph Engine
Dependency Cycles
Actionable Now
Blocked
AI Priority Picks
Greedy optimization: maximize unblocks
Cascade Impact Analysis
What-if: closing these unlocks the most downstream work
Project Velocity
Work completion rate
No weekly data available
Graph Health
Dependency structure
Circular Dependencies Detected
cycle(s) found in dependency graph
Current Cycle Path
Click "Highlight Cycles" to visualize dependency loops in the graph view.
Suggested Fixes
Remove these edges to break dependency cycles
Graph Analysis
Deep structural insights powered by graph algorithms
Bottlenecks
Betweenness Centrality
How often a bead lies on shortest paths between other beads in the dependency graph.
High-scoring beads are critical junctions. Delays here ripple across the entire project.
Prioritize these to unblock parallel workstreams. Consider breaking them into smaller pieces.
for all pairs of nodes s,t where s≠v≠t
📐 What: Measures how often a bead lies on shortest paths between other beads.
💡 Why: High-scoring beads are critical junctions. Delays here ripple across the entire project.
🎯 Action: Prioritize these to unblock parallel workstreams. Consider breaking them into smaller pieces.
No betweenness data available
Keystones
Impact Depth
How deep in the dependency chain a bead sits (downstream chain length).
Keystones are foundational. Everything above them depends on their completion.
Complete these first. Blocking a keystone blocks the entire chain above it.
for all u depending on v
📐 What: Measures how deep in the dependency chain a bead sits.
💡 Why: Keystones are foundational. Everything above them depends on their completion.
🎯 Action: Complete these first. Blocking a keystone blocks the entire chain above it.
No critical path data available
Influencers
PageRank / Eigenvector
Scores beads by their connections to other well-connected beads.
Influencers are connected to important beads. Changes here have wide-reaching effects.
Review carefully before changes. They're central to project structure.
λ = largest eigenvalue, A = adjacency
📐 What: Scores beads by connections to other well-connected beads (eigenvector centrality).
💡 Why: Influencers are connected to important beads. Changes have wide-reaching effects.
🎯 Action: Review carefully before changes. They're central to project structure.
No PageRank data available
Most Blocking
Direct Blocker Count
Issues that are directly blocking the most other issues from being worked on.
Clearing these blockers enables parallel work on multiple dependent tasks.
High-priority targets for immediate resolution to maximize team velocity.
📐 What: Issues directly blocking the most other issues from being worked on.
💡 Why: Clearing these enables parallel work on multiple dependent tasks.
🎯 Action: High-priority targets for immediate resolution to maximize velocity.
No blocking data available
HITS Hubs
Aggregator Score
Beads that depend on many important authorities (aggregators).
Hubs collect dependencies. They often represent high-level features or epics.
Track for milestones. Their completion signals major project progress.
for all u where v→u
📐 What: Beads that depend on many important authorities (aggregators).
💡 Why: Hubs are coordination points. They represent high-level features or epics.
🎯 Action: Track for milestones. Their completion signals major project progress.
No HITS hub data available
HITS Authorities
Provider Score
Beads that are depended upon by many important hubs (providers).
Authorities are foundational services/components that many features need.
Stabilize early. Breaking an authority breaks many dependent hubs.
for all u where u→v
📐 What: Beads depended upon by many important hubs (providers).
💡 Why: Authorities are foundational services that many features need.
🎯 Action: Stabilize early. Breaking an authority breaks many dependent hubs.
No HITS authority data available
K-Core Cohesion
Dense Clusters
Nodes with highest k-core numbers (embedded in dense subgraphs).
High-core nodes sit in tightly knit clusters—changes can ripple locally.
Use for resilience checks; prioritize when breaking apart tightly coupled areas.
after iterative degree peeling
📐 What: Nodes with highest k-core numbers (embedded in dense subgraphs).
💡 Why: High-core items are in tightly coupled clusters—changes ripple through the group.
🎯 Action: Handle together as a batch. They often form natural work packages.
No k-core data available
Cut Points
Articulation Vertices
Nodes whose removal disconnects the undirected graph.
Single points of failure. Instability here can isolate workstreams.
Harden or split these nodes; avoid piling more dependencies onto them.
on undirected graph view
📐 What: Nodes whose removal disconnects parts of the dependency graph.
💡 Why: Single points of failure. Instability here can isolate workstreams.
🎯 Action: Consider adding parallel paths to reduce dependency on these critical bridges.
No cut points found (graph is well-connected)
Quick Wins
Low effort, high impact
No quick wins identified
Blockers to Clear
Unblock downstream work
Blocking issues
No blockers identified
Triage Score Rankings
AI-computed priority scores combining multiple signals
Top Priority Issues
Score Distribution
Score Component Weights
AI Recommendations
Detailed analysis from robot-triage
Click a recommendation to see breakdown
Score Breakdown
Reasons
- •