beads-viewer

Analyze Beads project graphs to compute triage metrics and generate recommendations.

5|Updated Oct 27, 2025
One-click install
npx skills add https://github.com/jbabin91/autocomplete-rs --skill beads-viewer-jbabin91
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: beads-viewer
Source: https://github.com/jbabin91/autocomplete-rs/tree/main/.agents/skills/beads-viewer
Command: npx skills add https://github.com/jbabin91/autocomplete-rs --skill beads-viewer-jbabin91

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

Beads Viewer provides a graph-aware triage engine that computes essential network metrics and generates deterministic recommendations to help teams prioritize work and identify bottlenecks in Beads projects.

Core Features & Use Cases

  • Graph metrics computation (PageRank, Betweenness, HITS, and more) to surface dependencies and risks.
  • Automated triage guidance and execution planning for sprint cycles based on dependency graphs.
  • Deterministic recommendations and sprint burndown data generation from .beads/issues.jsonl.

Quick Start

Run beads-viewer on your Beads project to generate deterministic triage recommendations from the dependency graph.

Frequently Asked Questions about beads-viewer

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I analyze dependency graphs for bottleneck detection in sprint planning?

Beads Viewer computes graph metrics like PageRank and Betweenness to identify bottlenecks and circular dependencies from the .beads/issues.jsonl file, generating deterministic triage recommendations for sprint planning.

What is graph-aware triage and how does it work with Beads projects?

Graph-aware triage uses network analysis algorithms including PageRank, Betweenness, and HITS on dependency graphs. It reads .beads/issues.jsonl files to compute triage metrics and produce structured recommendations for agent workflows and human review.

How do I detect circular dependencies in my Beads project issues?

You can detect circular dependencies by running graph cycle detection on your Beads project data. The Skill reads .beads/issues.jsonl and applies graph metrics to discover cycles and surface dependency risks for triage.

Can I generate sprint burndown data from a Beads issues.jsonl file?

Yes, you can generate sprint burndown data from .beads/issues.jsonl files. The Skill computes dependency graph metrics and produces structured burndown outputs alongside automated triage guidance for sprint cycles.

Does beads-viewer require any external dependencies to compute PageRank and HITS metrics?

No, beads-viewer operates with zero external dependencies. It internally computes PageRank, Betweenness, HITS, and other graph metrics directly from the .beads/issues.jsonl file to deliver triage recommendations.

What's the best way to prioritize work when facing complex dependency cycles and bottlenecks?

The best way to prioritize work under complex dependencies is applying graph betweenness and PageRank metrics to identify critical bottlenecks. This generates deterministic execution plans and triage guidance based on network risk.