beads-viewer

Analyze .beads.jsonl dependency graphs with PageRank, betweenness, and cycles.

14|5|Updated Jan 29, 2026
One-click install
npx skills add https://github.com/oakoss/agent-skills --skill beads-viewer-oakoss
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: beads-viewer
Source: https://github.com/oakoss/agent-skills/tree/main/skills/beads-viewer
Command: npx skills add https://github.com/oakoss/agent-skills --skill beads-viewer-oakoss

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

This Skill provides advanced graph-based analysis for .beads.jsonl project files, helping to identify bottlenecks, circular dependencies, and prioritize tasks effectively.

Core Features & Use Cases

  • Graph Metrics: Computes PageRank, betweenness, critical path, cycles, and more.
  • Triage & Planning: Generates actionable recommendations, execution plans, and identifies blockers.
  • Use Case: When facing a complex project with many interdependencies, use this Skill to automatically find the most critical tasks blocking progress and plan parallel work streams.

Quick Start

Use the beads-viewer skill to get a full triage with recommendations.

Frequently Asked Questions about beads-viewer

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

FAQPage Schema
How do I identify bottlenecks in a project dependency graph?

To identify bottlenecks in a project dependency graph, analyze pre-computed graph metrics including betweenness and critical path. This process highlights critical tasks blocking progress so you can prioritize work effectively.

What is the best way to prioritize tasks with circular dependencies?

Task prioritization with circular dependencies involves detecting cycles within the graph structure. By analyzing these cycles alongside PageRank scores, you can isolate interdependent tasks and sequence them to resolve execution blockers.

How do I plan parallel execution streams for complex software projects?

Plan parallel execution streams by analyzing the critical path and identifying tasks with low betweenness centrality. This determines which work streams can run concurrently without violating dependency constraints.

Can I analyze Beads project graphs without pre-computed metrics?

No, analyzing Beads project graphs requires pre-computed graph metrics. This prerequisite ensures efficient querying and deterministic output when calculating values like PageRank and cycles for task triage.

Does beads-viewer work with standard project management formats?

Yes, beads-viewer processes `.beads.jsonl` project files. It extracts dependency graph data from this specific format to perform bottleneck analysis, triage, and execution planning.

Why should I not use generic task triage for complex interdependencies?

Generic task triage lacks structural visibility into complex interdependencies. Using graph-based analysis on `.beads.jsonl` files provides specific metrics like betweenness to pinpoint exact blockers, which standard prioritization misses.