graph-algorithms
FeaturedProblem-solving strategies for graph algorithms in graph number theory
AI & Automation 3,951 stars
303 forks Updated 2 days ago MIT
Install
Quality Score: 96/100
Stars 20%
Recency 20%
Frontmatter 20%
Documentation 15%
Issue Health 10%
License 10%
Description 5%
Skill Content
# Graph Algorithms
## When to Use
Use this skill when working on graph-algorithms problems in graph number theory.
## Decision Tree
1. **Traversal selection**
- BFS: shortest paths (unweighted), level structure
- DFS: cycle detection, topological sort, SCC
2. **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) |
3. **Minimum Spanning Tree**
- Prim's: dense graphs, greedy from vertex
- Kruskal's: sparse graphs, union-find
- `z3_solve.py prove "cut_property"`
4. **Network Flow**
- Max-flow = min-cut (Ford-Fulkerson)
- Matching via flow network
- `sympy_compute.py linsolve "flow_conservation"`
5. **Graph properties**
- Spectral: eigenvalues of adjacency matrix
- Connectivity: via DFS/BFS
- Coloring: greedy or SAT reduction
## Tool Commands
### Sympy_Adjacency
```bash
uv run python -m runtime.harness scripts/sympy_compute.py eigenvalues "adjacency_matrix"
```
### Z3_Dijkstra
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "d[v] >= d[u] + w(u,v) for all edges"
```
### Z3_Mst_Cut
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "min_edge_crossing_cut_in_mst"
```
### Sympy_Flow
```bash
uv run python -m runtime.harness scripts/sympy_compute.py linsolve "flow_conservation_equations"
```
## Key Techniq...
Details
- Author
- parcadei
- Repository
- parcadei/Continuous-Claude-v3
- Created
- 11 months ago
- Last Updated
- 2 days ago
- Language
- Python
- License
- MIT
Similar Skills
Semantically similar based on skill content — not just same category
AI & Automation Featured
graph-algorithms
Problem-solving strategies for graph algorithms in graph number theory
552 Updated 6 days ago
vibeeval AI & Automation Listed
graph-algorithms
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.
45 Updated 5 months ago
sequenzia AI & Automation Listed
graph-algorithm-library
Comprehensive graph algorithms implementation
1,919 Updated 2 weeks ago
a5c-ai