networkx

Graph algorithms for network analysis including shortest paths, cycle detection, and connectivity analysis. Create directed/undirected graphs with weighted edges. Use when modeling currency exchange networks, detecting arbitrage opportunities via negative cycles, finding optimal trading routes, calculating path lengths, analyzing network topology, or working with any connected data structures. Supports Bellman-Ford, Dijkstra, and other graph algorithms.