bv

Analyze beads issue-tracker dependency graphs with 9 graph metrics.

7|3|Updated Jan 15, 2026
One-click install
npx skills add https://github.com/Zpankz/mcp-skillset --skill bv-zpankz
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: bv
Source: https://github.com/Zpankz/mcp-skillset/tree/main/bv
Command: npx skills add https://github.com/Zpankz/mcp-skillset --skill bv-zpankz

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires jq, bc, and includes scripts (resource) and references (resource) and assets (resource) components.

What problem does it solve?

bv analyzes beads issue tracker graphs to reveal priority and risk using 9 graph metrics and the robot protocol.

Core Features & Use Cases

  • 9 graph metrics (PageRank, Betweenness, HITS, Critical Path, Eigenvector, Degree, Density, Cycles, Topological Sort) to rank issues and reason about work.
  • Robot protocol-powered planning, drift detection, and multi-repo support for CI/CD contexts.
  • Real-world scenarios: sprint planning, dependency analysis, architectural health monitoring, and historical analysis.

Quick Start

Run bv with the robot insights flag to generate the JSON analysis and review the results to determine next actions.

Frequently Asked Questions about bv

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

FAQPage Schema
How do I prioritize issues using dependency graph analysis for sprint planning?

To prioritize issues for sprint planning, dependency graph analysis uses 9 graph metrics like PageRank, Betweenness, and Critical Path to rank issues and reveal structural risks. This approach identifies high-impact tasks to sequence work safely across repositories.

What is the robot protocol for issue tracker drift detection in CI/CD?

The robot protocol for drift detection provides deterministic JSON outputs during CI/CD pipelines to monitor architectural health. It analyzes issue dependency graphs to identify structural changes and topological ordering shifts across single or multi-repo projects.

How do I analyze multi-repo dependency graphs and calculate graph metrics safely?

Analyzing multi-repo dependency graphs involves applying 9 graph metrics including HITS, Eigenvector, and Density to extract safe JSON results. This identifies cycles and topological ordering to monitor architectural health and detect drift across projects.

Do I need jq and bc installed to run dependency graph analysis scripts?

Yes, you need jq and bc installed as dependencies to run the dependency graph analysis scripts. These tools process the mathematical calculations and JSON data parsing required for generating deterministic robot protocol outputs.

What's the best way to monitor architectural health using issue tracker data?

Monitoring architectural health using issue tracker data is best achieved by calculating graph density, cycles, and critical path metrics. This reveals structural risks and dependencies, enabling proactive prioritization and historical analysis of architectural drift.

Why does topological sorting help with task prioritization in dependency analysis?

Topological sorting helps with task prioritization by ordering issues based on their dependencies within the graph. This ensures foundational tasks are addressed first, preventing bottlenecks and providing safe JSON results for dependency analysis.