Graph Algorithms
graph-algorithms.x402tookit.com
Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford.
- Category
- Service
- Networks
- BaseSolanaPolygonArbitrum
- Starting price
- $0.02
- Paid calls, 30 days
- 8
Paid endpoints
8 endpoints, sorted by usage. Prices are per request.
| Endpoint | Price | Network | Facilitator | Calls / 30d |
|---|---|---|---|---|
GET/all-pairs-shortest Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles. | $0.03 | Base | Coinbase CDP | 1 |
GET/bellman-ford Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source. | $0.02 | Base | Coinbase CDP | 1 |
GET/connected-components Connected components of an edge list; with directed=true also strongly connected components via Tarjan. | $0.02 | Base | Coinbase CDP | 1 |
GET/graph-stats Graph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected. | $0.02 | Base | Coinbase CDP | 1 |
GET/max-flow Edmonds-Karp maximum flow from a source to a sink on a capacity edge list, with flow per edge and min cut edges. | $0.03 | Base | Coinbase CDP | 1 |
GET/minimum-spanning-tree Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected. | $0.02 | Base | Coinbase CDP | 1 |
GET/shortest-path Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford. | $0.02 | Base | Coinbase CDP | 1 |
GET/topological-sort Topological order of a directed graph (Kahn) with parallel layers; on a cycle returns the cycle's nodes. | $0.02 | Base | Coinbase CDP | 1 |
Is this your project? Suggest an edit.