8 Services from graph-algorithms.x402tookit.com

Computes Dijkstra shortest path and distances from a source node on a weighted edge list, returning the optimal path and distances to all reachable nodes.

Computes all-pairs shortest distances for a weighted directed or undirected graph of up to 100 nodes using Floyd-Warshall, detecting negative cycles.

Computes a topological ordering of a directed graph using Kahn's algorithm, grouping nodes into parallel execution layers; if a cycle exists, returns the cycle's nodes instead.

Computes the minimum spanning tree (or spanning forest if disconnected) of an undirected weighted edge list using Kruskal's algorithm.

Computes graph statistics including degree sequence, density, bipartite check, tree/forest test, and diameter for a given edge list.

Computes the Edmonds-Karp maximum flow from a source to a sink on a directed capacity edge list, returning flow per edge and minimum cut edges.

Finds connected components of an undirected edge list, or strongly and weakly connected components of a directed graph using Tarjan's algorithm.

Computes single-source shortest paths using the Bellman-Ford algorithm, supporting negative edge weights and detecting negative cycles reachable from the source.