graph-algorithms
graph-algorithms is a Career & job search skill for AI agents, published by sequenzia in the agent-alchemy repository on GitHub. Skillspace rates graph-algorithms D (57/100) and it passed the safety scan; the rating is based on static analysis only.
Reference patterns for graph algorithm problems including BFS, DFS, Dijkstra, topological sort, union-find, MST, Bellman-Ford, and bipartite checking. Provides recognition signals, Python templates, edge cases, and common mistakes for each technique. Use when solving problems involving graphs, trees, shortest paths, connectivity, or dependency ordering.
- Grade
- D
- Quality
- 57 / 100
- Safety
- Passed
- GitHub stars
- 41
Unproven: rated by static analysis only, not yet compared head-to-head.
Our two independent classifiers differ on this skill's category, so treat the placement as provisional.
This rating describes the version of the repository we crawled; it may have changed since, so go by its current files.
Our review
- Architecture
- 80 / 100
- Maturity
- Basic: a single SKILL.md
- Security scan
- No issues found
- License
- MIT
- Adoption
- Adopted by 0 other repositories, in 1 collections
Not checked yet
- Not judged on the rubric yet (not a contender in its category)
- No blind task eval yet
- Scope (portable / vendor / repo-internal) not assessed; only the top of each category is read for scope
- Sibling files (scripts, references) not fetched; security scan covers SKILL.md only
Skillspace indexes and rates this skill; it does not host or endorse it. Run third-party skills at your own risk.