Loading skill
Install any skill in seconds. Free to start, no credit card required.
Get Started Free →vibeeval/graph-algorithms
Problem-solving strategies for graph algorithms in graph number theory
Passed 15 of 21 test cases with the skill, and 14 of 21 without it.
2 fixed14 passed either way5 still failing1 broke
Tokens, turns and time describe resource use, not a dollar price.
One of 2 test cases the skill fixed. Same model, same prompt, with and without the skill.
I need to run an automated check to prove that the minimum weight edge crossing any cut in a graph must belong to the minimum spanning tree. Which script command handles this proof?
| Checked | Without skill | With skill |
|---|---|---|
| Executes scripts/z3_solve.py prove with min_edge_crossing_cut_in_mst argument | Missed | Passed |
The instructions your model reads when the skill loads.
Use this skill when working on graph-algorithms problems in graph number theory.
Traversal selection
Shortest path algorithms
| Algorithm | Use Case | Complexity |
|---|---|---|
| Dijkstra | Non-negative weights | O((V+E) log V) |
| Bellman-Ford | Negative weights | O(VE) |
| Floyd-Warshall | All pairs | O(V^3) |
Minimum Spanning Tree
z3_solve.py prove "cut_property"Network Flow
sympy_compute.py linsolve "flow_conservation"Graph properties
test cases passed, vs 14 / 21 without
Published skills whose descriptions closely match this one, with their headline benchmark lift.
More skills from the same source and nearby in the registry, with their headline benchmark lift.