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, e
claude/cs-tools/skills/graph-algorithms/SKILL.md(main)