graph-algorithm-library
// Comprehensive graph algorithms implementation
$ git log --oneline --stat
stars:384
forks:73
updated:March 4, 2026
SKILL.mdreadonly
SKILL.md Frontmatter
namegraph-algorithm-library
descriptionComprehensive graph algorithms implementation
allowed-toolsBash,Read,Write,Edit,Glob,Grep
metadata[object Object]
Graph Algorithm Library
Purpose
Provides comprehensive graph algorithms for combinatorial analysis and network computations.
Capabilities
- Shortest path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)
- Network flow algorithms
- Matching algorithms
- Graph coloring
- Planarity testing
- Graph isomorphism
Usage Guidelines
- Representation: Choose appropriate graph representation
- Algorithm Selection: Match algorithm to problem structure
- Complexity Analysis: Consider time/space tradeoffs
- Sparse Graphs: Use specialized algorithms for sparse graphs
Tools/Libraries
- NetworkX
- igraph
- LEMON
- Boost Graph Library