Shortest paths, spanning trees, topological order, components, max flow, graph statistics and all-pairs distances from a caller-supplied edge list.
payments ON MAINNET (real money) · 8 live endpoints
| Endpoint | Price | What it answers |
|---|---|---|
GET /all-pairs-shortest | $0.03 | Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles. |
GET /bellman-ford | $0.02 | Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source. |
GET /connected-components | $0.02 | Connected components of an edge list; with directed=true also strongly connected components via Tarjan. |
GET /graph-stats | $0.02 | Graph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected. |
GET /max-flow | $0.03 | Edmonds-Karp maximum flow from a source to a sink on a capacity edge list, with flow per edge and min cut edges. |
GET /minimum-spanning-tree | $0.02 | Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected. |
GET /shortest-path | $0.02 | Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford. |
GET /topological-sort | $0.02 | Topological order of a directed graph (Kahn) with parallel layers; on a cycle returns the cycle's nodes. |
GET /catalog returns this list as JSON. Activity hub · uptime.
Textbook graph algorithms computed locally on the edge list you send, capped at 200 nodes and 1000 edges. Provided as is; check results before relying on them. Every paid response carries a disclaimer field.