Discover / graph-algorithms.x402tookit.com

Graph Algorithms

■ Live

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

Listed price
$0.03
Live
1 of the last check
Median response
198 ms
Last checked
2 Nov, 00:23 UTC
In our index since
2 Nov 2026

Endpoint

curl -i https://graph-algorithms.x402tookit.com/all-pairs-shortest
# 402 Payment Required: pay with an x402 client (USDC on Arbitrum),
# then send the same request again with the payment attached.
8 listed endpoints · on x402 Bazaar

Checks and payment terms on this page refer to the endpoint above. Other listed endpoints have not been checked individually.

Base URLhttps://graph-algorithms.x402tookit.com

  • GET/all-pairs-shortestNo price listedFloyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles.
  • GET/minimum-spanning-treeNo price listedKruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected.
  • GET/shortest-pathNo price listedDijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford.
  • GET/connected-componentsNo price listedConnected components of an edge list; with directed=true also strongly connected components via Tarjan.
  • GET/topological-sortNo price listedTopological order of a directed graph (Kahn) with parallel layers; on a cycle returns the cycle's nodes.
  • GET/bellman-fordNo price listedBellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source.
  • GET/max-flowNo price listedEdmonds-Karp maximum flow from a source to a sink on a capacity edge list, with flow per edge and min cut edges.
  • GET/graph-statsNo price listedGraph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected.

A dash means the listing gives no price or method. Copy buttons copy the full URL.

Showing 8 of 8 listed endpoints.

Agents can find it through the Superstables MCP server and JSON API: GET /api/v1/services/graph-algorithms.x402tookit.com

Recent checks

2 Nov 2026One bar per check, showing up to 20 recent checks. Coloured bars show relative response time, with a minimum visible height; full-height grey bars mean the endpoint was not live. “Live” means it answered with HTTP 402 or another detected payment-challenge signal.2 Nov 2026
All 1 checks
When (UTC)ResultHTTPResponse
2 Nov, 00:23 UTCLive402198ms

Questions

Did our last probe detect a payment challenge?

At our last probe on 2 Nov, 00:23 UTC, it returned HTTP 402 or another detected payment-challenge signal. This check did not test payment, delivery or compatibility with the Superstables client.

What price is recorded for Graph Algorithms?

Its listed price is $0.03.

What payment terms does Graph Algorithms advertise?

The listing advertises x402, Arbitrum, Base, Polygon, Solana and USDC. It names cdp as its facilitator. Check the seller's current payment challenge and authentication requirements before paying.

Where is Graph Algorithms listed?

In x402 Bazaar. Superstables first indexed it on 2 Nov 2026.

Something wrong on this page? Tell us.