About
The Graph Algorithms skill equips Claude with a robust library of optimized graph-based patterns, ranging from basic depth-first and breadth-first searches to complex pathfinding and connectivity logic. It features production-grade Python implementations of Dijkstra’s shortest path, Union-Find (DSU) with path compression, and Kahn’s topological sort. Designed for developers building everything from social networks to dependency resolvers, this skill ensures that generated code is type-safe, performance-conscious, and resilient against edge cases like cycles or disconnected nodes.