Individual skill
graph-algorithm-selector
Select optimal graph algorithm based on problem constraints
library/specializations/algorithms-optimization/skills/graph-algorithm-selector/SKILL.md
Source commit feb68abe397acc14f32b34984975c48fedba2b33
What was checked
- Matches the observed repository HEAD
- Yes
- Scanner rules are current
- Yes
- Repository scan complete
- No
- Skill scan complete
- No
- Observed behavior
- Instructions only
- Last checked
- Nov 9, 2026
These are observations at the recorded commit, not a guarantee of safety. Review the source before running it.
Install this skill
Choose an agent in your Stack or copy a command below. Commands fetch the pinned commit and copy only this skill directory. Existing destinations are refused. Copying a command does not install anything.
An install command is unavailable: current rules, complete repository and skill scans, an eligible behavior level and a permitted license are required.
Repository context
- Repository stars (not skill ratings)
- 1,903
- Repository last updated
- Nov 1, 2026
- License
- MIT
Observed agent integration: No specific integration evidence. Standard SKILL.md installation does not imply verified compatibility.
- agent-orchestration Repository topic
- agent-skills Repository topic
- agentic-ai Repository topic
- agentic-workflow Repository topic
- ai-automation Repository topic
- babysitter Repository topic
- claude-code Repository topic
- claude-skills Repository topic
- trustworthy-ai Repository topic
- vibe-coding Repository topic
- engineering Derived category
Files and excerpt
File metadata and permitted, redacted excerpts come from the recorded scan. Source links are pinned to that commit.
Read excerpt
# 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
