{"id":2201771,"recorded_at":"2026-11-02T19:13:28.845445Z","observed_at":"2026-11-02T19:13:28.845372Z","subject_kind":"source_record","subject":"x402_bazaar:https://graph-algorithms.x402tookit.com/all-pairs-shortest","kind":"listing","method":"sync.x402_bazaar/1","body":{"endpoints":[["x402","https://graph-algorithms.x402tookit.com/all-pairs-shortest"]],"name":"Graph Algorithms","owner_address":"0xb531320805c5bed1d46aeadcf4f008fdf172dbda","raw":{"accepts":[{"amount":"30000","asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","extra":{"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:8453","payTo":"0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa","scheme":"exact"},{"amount":"30000","asset":"EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v","extra":{"feePayer":"D6ZhtNQ5nT9ZnTHUbqXZsTx5MH2rPFiBBggX4hY1WePM","transactionVersions":[0]},"maxTimeoutSeconds":300,"network":"solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp","payTo":"DUPiupXtuox38dcGoXUKer5mAydCzmaHjrbQ66qeEm8s","scheme":"exact"},{"amount":"30000","asset":"0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359","extra":{"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:137","payTo":"0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa","scheme":"exact"},{"amount":"30000","asset":"0xaf88d065e77c8cC2239327C5EDb3A432268e5831","extra":{"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:42161","payTo":"0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa","scheme":"exact"}],"description":"Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles.","extensions":{"bazaar":{"info":{"input":{"method":"GET","queryParams":{"edges":"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","from":"3","to":"5"},"type":"http"},"output":{"example":{"asOf":"2026-10-21T01:36:13.445Z","degraded":false,"directed":true,"disclaimer":"Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.","distances":[[0,1],[3,0]],"edgeCount":9,"nodeCount":5,"notChecked":["graphs over 100 nodes or 1000 edges (refused)","ties: one shortest path is returned when several exist"],"order":["1","2","…3 more"],"path":["3","2","…3 more"],"pathDistance":3,"reachablePairs":20,"reasons":[],"source":"Floyd-Warshall algorithm, computed locally (CLRS ch. 25.2)","summary":"Shortest 3 to 5 is 3 via 3 > 2 > 4 > 1 > 5.","unreachablePairs":0,"verdict":"PATH_FOUND"},"type":"json"}},"schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"method":{"enum":["GET"],"type":"string"},"queryParams":{"properties":{"directed":{"description":"true (default); false makes each edge two-way (a negative edge then is a negative cycle)","type":"boolean"},"edges":{"description":"Edges separated by ; or newline, each 'from,to' or 'from,to,weight' (default weight 1), or a JSON array of [from,to,weight]; up to 100 nodes for this endpoint, 1000 edges, 60000 characters; node names 1-32 characters of letters, digits, _ . : + -","type":"string"},"from":{"description":"Optional node: with 'to', also returns that shortest path","type":"string"},"nodes":{"description":"Optional extra node names (comma or space separated) so isolated nodes are counted; the total still counts toward the 200-node cap","type":"string"},"to":{"description":"Optional node: with 'from', also returns that shortest path","type":"string"}},"required":["edges"],"type":"object"},"type":{"const":"http","type":"string"}},"required":["type","method"],"type":"object"},"output":{"properties":{"example":{"properties":{"asOf":{"type":["null","string"]},"degraded":{"type":["boolean","null"]},"directed":{"type":["boolean","null"]},"disclaimer":{"type":["null","string"]},"distances":{"items":{"items":{"type":"number"},"type":"array"},"type":["array","null"]},"edgeCount":{"type":["null","number"]},"nodeCount":{"type":["null","number"]},"notChecked":{"items":{"type":"string"},"type":["array","null"]},"order":{"items":{"type":"string"},"type":["array","null"]},"path":{"items":{"type":"string"},"type":["array","null"]},"pathDistance":{"type":["null","number"]},"reachablePairs":{"type":["null","number"]},"reasons":{"type":["array","null"]},"source":{"type":["null","string"]},"summary":{"type":["null","string"]},"unreachablePairs":{"type":["null","number"]},"verdict":{"type":["null","string"]}},"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"}}},"lastUpdated":"2026-11-01T23:26:47.025Z","quality":{"l30DaysTotalCalls":1,"l30DaysUniquePayers":1,"lastCalledAt":"2026-11-01T23:26:46.738Z"},"resource":"https://graph-algorithms.x402tookit.com/all-pairs-shortest","serviceName":"Graph Algorithms","tags":["graph","floyd-warshall","all-pairs","shortest-path"],"type":"http","x402Version":2},"source":"x402_bazaar","summary":"Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles."},"body_sha256":"9d0ba393a6dc2e57d1c836de94622db94aafb323b0c8a86d86e800c60c986cb5","prev_id":null,"leaf":"0xde8b7311784ee52e13afd9ed68709e37f00b71aa94ca19fcd89033dcbf1646de","leaf_text":"{\"body\":\"9d0ba393a6dc2e57d1c836de94622db94aafb323b0c8a86d86e800c60c986cb5\",\"id\":2201771,\"kind\":\"listing\",\"method\":\"sync.x402_bazaar/1\",\"observed_us\":1793646808845372,\"prev\":null,\"subject\":\"x402_bazaar:https://graph-algorithms.x402tookit.com/all-pairs-shortest\",\"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":["0xde8b695c7a8830205488bbbdf99ff0498a7c319d00ea921d2126d764f514ee87","0x0cb019c2e9dbae036dd7fbca6b18eac0b2a84b0a95b7d4ea65c3390dcf7e75a7","0x5234c879cc3f14ff1f7aa1d140244a11ba40f9c5f1e174353c4cdedaa2813af1","0x1bbae13f877add0966847fb5ebafe1afafc886424ac1b4d33227576fc28cd88f","0x35ddc33c4493a785a2a40a63bae1b87deb607011877a4ad7fc4180d2c8bf80c9","0xd7c50c5ad63060f85b8502afcf8e5a364159807f279bb73a98c76ad48f3d7e73","0xe8cd0696947c331c6767d1b2d91c0c075006e48a9b366b7bc1b0c0e55054dc82","0xce29514aa5fe972b5c9c9e872881a03e20d6dfcf079904b8d32c3000d02a946b","0xb935ee16f6aff3c3a52d38cf065d95ee70385d656391579da0bf4dc0cba8a837","0x81b56d73f259f04598277bd48002a3a0fa98443e4966fe199f0f12ee9c18a6ef","0x1d4f7107983a6cb8f818f859badeffbb9964454c836d1abb96f96320854655a0","0x933c861a9715acc355546ac1de965c0ed1155480f615b2e5e8679f2112c69496","0x1cd421f1e0b0be98fab8392181e25435047bd7c44fcbda07fa5cd27615d6b674","0x5dd75981e1af83dc5ec1e2b8a2959012484cc3ea2e0defded2187a5a93ba7236","0xa370e8e015a32408a8112e54e5f40a8a65e871bd52bbc6f25fbd1139f2ba5b11","0x7ddefa7d79e7640c3fed21ee4472689415182c41a0258ab04a81d60495f4c40a","0xdb8bd933619a267f9790faac9839143d202be46af284371cc369cdf683f897ba","0x98cbbf2c68ab4c0b4db782aeb88bea1f30b02178cf8b5d3d24a931d19492ea6d","0x252cce55f1a3d5391c16f82d7f62494429a5f69b03486d4cfcfb7b2c96d6c884"]}