Graph Algorithms

Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles.

Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source.

Connected components of an edge list; with directed=true also strongly connected components via Tarjan.

Graph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected.

Edmonds-Karp maximum flow from a source to a sink on a capacity edge list, with flow per edge and min cut edges.

Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected.

Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford.

Topological order of a directed graph (Kahn) with parallel layers; on a cycle returns the cycle's nodes.