# Services from graph-algorithms.x402tookit.com on Zero

> graph-algorithms.x402tookit.com serves 8 paid API services for AI agents, indexed by Zero. Each is callable per call with payment handled by Zero.

Canonical page: https://www.zero.xyz/host/graph-algorithms.x402tookit.com
Live health (JSON, refreshed every minute): https://www.zero.xyz/host/graph-algorithms.x402tookit.com/health.json

## Services

- [Graph Algorithms: Dijkstra Shortest Path](https://www.zero.xyz/c/graph-algorithms-dijkstra-shortest-path-7bc795ed/llms.txt): $0.02/call via x402. 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.
- [Graph Algorithms: Floyd-Warshall All-Pairs Shortest Distances](https://www.zero.xyz/c/graph-algorithms-floyd-warshall-all-pairs-shortest-distances-277825e3/llms.txt): $0.03/call via x402. Computes all-pairs shortest distances for a weighted directed or undirected graph of up to 100 nodes using Floyd-Warshall, detecting negative cycles.
- [Graph Algorithms – Topological Sort (Kahn with Parallel Layers)](https://www.zero.xyz/c/graph-algorithms-topological-sort-kahn-with-parallel-layers-25056efd/llms.txt): $0.02/call via x402. 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.
- [Graph Algorithms – Kruskal Minimum Spanning Tree](https://www.zero.xyz/c/graph-algorithms-kruskal-minimum-spanning-tree-a8186c31/llms.txt): $0.02/call via x402. Computes the minimum spanning tree (or spanning forest if disconnected) of an undirected weighted edge list using Kruskal's algorithm.
- [Graph Algorithms – Graph Statistics](https://www.zero.xyz/c/graph-algorithms-graph-statistics-44252476/llms.txt): $0.02/call via x402. Computes graph statistics including degree sequence, density, bipartite check, tree/forest test, and diameter for a given edge list.
- [Graph Algorithms – Edmonds-Karp Maximum Flow](https://www.zero.xyz/c/graph-algorithms-edmonds-karp-maximum-flow-11663b1d/llms.txt): $0.03/call via x402. 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.
- [Graph Algorithms – Connected Components](https://www.zero.xyz/c/graph-algorithms-connected-components-b5aa7b07/llms.txt): $0.02/call via x402. Finds connected components of an undirected edge list, or strongly and weakly connected components of a directed graph using Tarjan's algorithm.
- [Graph Algorithms: Bellman-Ford Shortest Paths](https://www.zero.xyz/c/graph-algorithms-bellman-ford-shortest-paths-f6969ee1/llms.txt): $0.02/call via x402. Computes single-source shortest paths using the Bellman-Ford algorithm, supporting negative edge weights and detecting negative cycles reachable from the source.

Status and success rate cover calls made through Zero and Zero's own probes. Third-party monitors may report differently.

- [Zero catalog index](https://www.zero.xyz/llms.txt)