Agent skill · data analytics · aiskillstore
bv
Beads Viewer - Graph-aware triage engine for Beads projects. Computes PageRank, betweenness, critical path, and cycles. Use --robot-* flags for AI agents.
Why this skill is useful
Adds executable commands for graph analysis and project triage that enhance AI capabilities in managing Beads projects.
What it needs
Requires bv installed locally. About 5k tokens when loaded. Last updated 2026-08-07. 405 stars on the source repository.
What this skill does
BV - Beads Viewer A graph-aware triage engine for Beads projects (.beads/beads.jsonl). Computes 9 graph metrics, generates execution plans, and provides deterministic recommendations. Human TUI for browsing; robot flags for AI agents. Why BV vs Raw Beads Capability Raw beads.jsonl BV Robot Mode ------------ ----------------- --------------- Query "List all issues" "List the top 5 bottlenecks blocking the release" Context Cost High (linear with issue count) Low (fixed summary struct) Graph Logic Agent must compute Pre-computed (PageRank, betweenness, cycles) Safety Agent might miss cycles Cycles explicitly flagged Use BV instead of parsing beads.jsonl directly. It computes graph metrics deterministically. CRITICAL: Robot Mode for Agents Never run bare bv. It launches an interactive TUI that blocks your session. Always use --robot- flags: The 9 Graph Metrics BV computes these metrics to surface hidden project dynamics: Metric What It Measures Key Insight -------- ------------------ ------------- PageRank Recursive dependency importance Foundational blockers Betweenness Shortest-path traffic Bottlenecks and bridges HITS Hub/Authority duality Epics vs utilities Critical Path Longest dependency chain Keystones with zero slack Eigenvector Influence via neighbors Strategic dependencies Degree Direct connection counts Immediate blockers/blocked Density Edge-to-node ratio Project coupling health Cycles Circular dependencies Structural errors (must fix!) Topo Sort Valid execution order Work queue foundation Two-Phase Analysis BV uses async computation with timeouts: Phase 1 (instant): degree, topo sort, density Phase 2 (500ms timeout): PageRank, betweenness, HITS, eigenvector, cycles Always check status field in output. For large graphs (>500 nodes), some metrics may be approx or skipped. …
How to use it
Reference it in AdaL, Claude Code, Cursor or any coding agent — nothing to install:
@skills aiskillstore/bv