{"id":2189803,"recorded_at":"2026-11-02T18:20:41.875724Z","observed_at":"2026-11-02T18:20:41.875666Z","subject_kind":"source_record","subject":"agentic_market:graph-algorithms-x402tookit-com","kind":"listing","method":"sync.agentic_market/1","body":{"endpoints":[["x402","https://graph-algorithms.x402tookit.com/all-pairs-shortest"],["x402","https://graph-algorithms.x402tookit.com/bellman-ford"],["x402","https://graph-algorithms.x402tookit.com/connected-components"],["x402","https://graph-algorithms.x402tookit.com/graph-stats"],["x402","https://graph-algorithms.x402tookit.com/max-flow"],["x402","https://graph-algorithms.x402tookit.com/minimum-spanning-tree"],["x402","https://graph-algorithms.x402tookit.com/shortest-path"],["x402","https://graph-algorithms.x402tookit.com/topological-sort"]],"name":"graph-algorithms.x402tookit.com","owner_address":null,"raw":{"caip2_networks":["eip155:137","eip155:42161","eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"category":"","description":"","domain":"graph-algorithms.x402tookit.com","endpoints":[{"description":"Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"1,2,3; 1,3,8; 1,5,-4; 2,4,1; 2,5,7; 3,2,4; 4,1,2; 4,3,-5; 5,4,6","group":"query","name":"edges","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"3","group":"query","name":"from","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"5","group":"query","name":"to","required":false,"type":"string"}],"pricing":{"amount":"0.03","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","floyd-warshall","all-pairs","shortest-path"],"url":"https://graph-algorithms.x402tookit.com/all-pairs-shortest"},{"description":"Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"s,t,6; s,y,7; t,x,5; t,y,8; t,z,-4; x,t,-2; y,x,-3; y,z,9; z,x,7; z,s,2","group":"query","name":"edges","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"s","group":"query","name":"source","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"z","group":"query","name":"target","required":false,"type":"string"}],"pricing":{"amount":"0.02","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","bellman-ford","negative-weights","algorithm"],"url":"https://graph-algorithms.x402tookit.com/bellman-ford"},{"description":"Connected components of an edge list; with directed=true also strongly connected components via Tarjan.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":true,"group":"query","name":"directed","required":false,"type":"boolean"},{"default":null,"description":"","enumValues":[],"example":"a,b; b,c; c,a; c,d; d,e; e,d","group":"query","name":"edges","required":false,"type":"string"}],"pricing":{"amount":"0.02","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","connected-components","tarjan","scc"],"url":"https://graph-algorithms.x402tookit.com/connected-components"},{"description":"Graph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"0,1; 1,2; 2,3; 3,4; 4,0; 0,5; 1,7; 2,9; 3,6; 4,8; 5,7; 7,9; 9,6; 6,8; 8,5","group":"query","name":"edges","required":false,"type":"string"}],"pricing":{"amount":"0.02","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","degree","bipartite","diameter"],"url":"https://graph-algorithms.x402tookit.com/graph-stats"},{"description":"Edmonds-Karp maximum flow from a source to a sink on a capacity edge list, with flow per edge and min cut edges.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"s,v1,16; s,v2,13; v1,v3,12; v2,v1,4; v2,v4,14; v3,v2,9; v3,t,20; v4,v3,7; v4,t,4","group":"query","name":"edges","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"t","group":"query","name":"sink","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"s","group":"query","name":"source","required":false,"type":"string"}],"pricing":{"amount":"0.03","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","max-flow","min-cut","edmonds-karp"],"url":"https://graph-algorithms.x402tookit.com/max-flow"},{"description":"Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"a,b,4; a,h,8; b,c,8; b,h,11; c,d,7; c,f,4; c,i,2; d,e,9; d,f,14; e,f,10; f,g,2; g,h,1; g,i,6; h,i,7","group":"query","name":"edges","required":false,"type":"string"}],"pricing":{"amount":"0.02","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","kruskal","mst","algorithm"],"url":"https://graph-algorithms.x402tookit.com/minimum-spanning-tree"},{"description":"Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"s,t,10; s,y,5; t,x,1; t,y,2; y,t,3; y,x,9; y,z,2; x,z,4; z,x,6; z,s,7","group":"query","name":"edges","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"s","group":"query","name":"source","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"x","group":"query","name":"target","required":false,"type":"string"}],"pricing":{"amount":"0.02","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","dijkstra","shortest-path","algorithm"],"url":"https://graph-algorithms.x402tookit.com/shortest-path"},{"description":"Topological order of a directed graph (Kahn) with parallel layers; on a cycle returns the cycle's nodes.","method":"GET","parameters":[{"default":null,"description":"","enumValues":[],"example":"undershorts,pants; undershorts,shoes; socks,shoes; pants,shoes; pants,belt; belt,jacket; shirt,belt; shirt,tie; tie,jacket","group":"query","name":"edges","required":false,"type":"string"},{"default":null,"description":"","enumValues":[],"example":"watch","group":"query","name":"nodes","required":false,"type":"string"}],"pricing":{"amount":"0.02","currency":"USDC","maxAmount":"","minAmount":"","network":"eip155:8453","scheme":"exact"},"providerName":"","quality":{"l30DaysTotalCalls":"1","l30DaysUniquePayers":"1"},"serviceName":"Graph Algorithms","tags":["graph","topological-sort","dag","dependencies"],"url":"https://graph-algorithms.x402tookit.com/topological-sort"}],"enriched":false,"iconUrl":"","id":"graph-algorithms-x402tookit-com","integrationType":"","isNew":false,"name":"graph-algorithms.x402tookit.com","networks":["Base","eip155:137","eip155:42161","solana:5eykt4usfv8p8njdtrepy1vzqkqzkvdp"],"priceSummary":{"avgCostBasis":"exact","avgCostPerTransaction":"0.0225","currency":"USDC","maxAmount":"0.03","minAmount":"0.02"},"provider":"graph-algorithms.x402tookit.com","providerUrl":"","serviceName":"Graph Algorithms","tags":["graph","floyd-warshall","all-pairs","shortest-path","bellman-ford","negative-weights","algorithm","connected-components","tarjan","scc","degree","bipartite","diameter","max-flow","min-cut","edmonds-karp","kruskal","mst","dijkstra","topological-sort","dag","dependencies"]},"source":"agentic_market","summary":""},"body_sha256":"3bae3a7ad5cd86866dc9fe79649df8a44448405ed95de744902b3834fe632132","prev_id":null,"leaf":"0xb3b2aa272fb7212753311c1585f319b21dbd2860743664d30ccbc44d7dfe7f59","leaf_text":"{\"body\":\"3bae3a7ad5cd86866dc9fe79649df8a44448405ed95de744902b3834fe632132\",\"id\":2189803,\"kind\":\"listing\",\"method\":\"sync.agentic_market/1\",\"observed_us\":1793643641875666,\"prev\":null,\"subject\":\"agentic_market:graph-algorithms-x402tookit-com\",\"subject_kind\":\"source_record\"}","day":{"day":"2026-11-02","leaves":444186,"root":"0x78fecaabbe319e56f5c4b80fc02e2052e198ad24781da8832a475ff65f2002d1","chained":"0xdc35957db5d1371ca382b9152878ffece28ec7c5cb4f98fd71ddb367f8b999b2","anchor_chain":"eip155:5042002","anchor_tx":"0x56b814612eb2e3e544153df3e91e1f7199106d1e430c7d8c6b653feeb9ebe9af","anchor_block":70432815},"proof":["0xb3b28678ef71af6794f643504cc6b7997bc1607769b80ce57c6c26778f25a1fd","0x1fc316d9157cdbeca77fbcddb864582da915391ec706f47731f40a455aab7ace","0xb1bcfbec6790cf50971c0ff465102071c20ee6f267e2d5d0fc10d41279cb837a","0xba43dd963833c1022c2ea618728564b3c61066fb393d2fef3d0f180a4d6243b8","0x4f6ddcf41a4b46a4749e74bfd81d60739091c2d466be75628df41711a406fbc7","0x7fd17317c9182d54e56d2dfca3cbc6102d981fcc13cd38476a7d54169ff59861","0x592c4b7fbe6163cc0b03145f7fb708800484f380b47f4d591d2a1f994e720604","0x2de0c3459a8408953c338954451409f4352104856067a784686f9d846d595ac1","0x8ed9c5efd70d41268d029e9ba0e9e253b6a8f57c49e285f9666793d647826393","0x61706778c9036e81971ddefc8a76c5e11783a4a8cd03fbb252d5a11889713a91","0x4b73edf36be1455061b42d181bf1261a1a1aab171bf37e6107e4dae40d9756e1","0x21e290c87b8dfbee1c890c9b97a09ed0f5503884eaeabff86472db1c091c14cd","0x8f3b097427a1bfae26e9231cb5b00552011a27ad93aa4c0d3e267190fcbbb962","0x08da04eef748b7ac08271324db18913501d72c52afa240bf3f08b6da46e3b97f","0x834b6b9a36b42da183e2542785e8d2d7548ace455268a81922edbe6020cef644","0x2922573a524a0694086782ac45fa3083d3fc3f6a2a479b2105e1e2f06b2916f7","0x07ad80c0c234ecea379a2f4450dfd0804db049dbc62abe77af6306049ca6b6c2","0x98cbbf2c68ab4c0b4db782aeb88bea1f30b02178cf8b5d3d24a931d19492ea6d","0x252cce55f1a3d5391c16f82d7f62494429a5f69b03486d4cfcfb7b2c96d6c884"]}