Select optimal graph algorithm based on problem constraints
Scanned 9/2/2026
Install to Claude Code
npx -y skills add a5c-ai/babysitter --skill graph-algorithm-selector --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Graph Algorithm Selector?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/a5c-ai-graph-algorithm-selector-babysitter)More formats (shields.io, HTML) on the badges page.
---
name: graph-algorithm-selector
description: Select optimal graph algorithm based on problem constraints
allowed-tools:
- Read
- Write
- Grep
- Glob
graph:
domains: [domain:computer-science]
specializations: [specialization:algorithms-optimization]
skillAreas: [skill-area:graph-algorithms]
roles: [role:backend-engineer, role:computational-scientist]
---
# 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", "matching", "traversal"]
},
"graphProperties": { "type": "object" },
"constraints": {
"type": "object",
"properties": {
"V": { "type": "integer" },
"E": { "type": "integer" },
"negativeWeights": { "type": "boolean" },
"negativeCycles": { "type": "boolean" }
}
}
},
"required": ["problemType", "constraints"]
}
```
## Output Schema
```json
{
"type": "object",
"properties": {
"success": { "type": "boolean" },
"recommendedAlgorithm": { "type": "string" },
"complexity": { "type": "string" },
"alternatives": { "type": "array" },
"reasoning": { "type": "string" }
},
"required": ["success", "recommendedAlgorithm"]
}
```
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!