Agent skill

graph-algorithm-selector

Select optimal graph algorithm based on problem constraints

a5c-aigithub.com/a5c-aiGitHub ↗
claude-codecodexcan modify filesMIT
Install
npx skills add a5c-ai/babysitter --skill graph-algorithm-selector --agent claude-code

Same command for any agent — swap --agent for codex, cursor, copilot.

Facts
Files in the skill folder: 2
SKILL.md size: 2 KB
Bundled scripts: none
Allowed tools: -Read-Write-Grep-Glob
Path: library/specializations/algorithms-optimization/skills/graph-algorithm-selector/SKILL.md
Open the folder on GitHub →
Where it comes from
Stars: 1,642
Language: JavaScript

Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.

From the SKILL.md

# Graph Algorithm Selector Skill ## Purpose Select the optimal graph algorithm based on problem constraints, graph properties, and performance requirements. ## Capabilities - Constraint analysis for algorithm selection - Trade-off analysis (Dijkstra vs Bellman-Ford vs Floyd-Warshall) - Special case detection (sparse vs dense, negative edges) - Algorithm complexity mapping to constraints - Suggest algorithm variants and optimizations ## Target Processes - shortest-path-algorithms - advanced-graph-algorithms - graph-traversal - graph-modeling ## Algorithm Selection Matrix ### Shortest Path | Scenario | Algorithm | Complexity | |----------|-----------|------------| | Unweighted | BFS | O(V+E) | | Non-negative weights | Dijkstra | O((V+E)log V) | | Negative weights | Bellman-Ford | O(VE) | | All pairs | Floyd-Warshall | O(V^3) | | DAG | Topological + DP | O(V+E) | ### MST | Scenario | Algorithm | Complexity | |----------|-----------|------------| | Sparse graph | Kruskal | O(E log E) | | Dense graph | Prim | O(V^2) or O(E log V) | ## Input Schema ```json { "type": "object", "properties": { "problemType": { "type": "string", "enum": ["shortestPath", "mst", "connectivity", "flow", "match

What's inside
Steps it walks through
  1. Purpose
  2. Capabilities
  3. Target Processes
  4. Algorithm Selection Matrix
  5. Shortest Path
  6. MST
  7. Input Schema
  8. Output Schema
Ships with 1 file
  • README.md
More from babysitter
All skills →
About this skill
What does the graph-algorithm-selector skill do?

Select optimal graph algorithm based on problem constraints

How do I install it?

Run `npx skills add a5c-ai/babysitter --skill graph-algorithm-selector --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.

Where does this skill come from?

From a5c-ai/babysitter, a repository with 1,642 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.

Is a popular skill a good skill?

Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.

Keep going