{"id":2201765,"recorded_at":"2026-11-02T19:13:28.820967Z","observed_at":"2026-11-02T19:13:28.820909Z","subject_kind":"source_record","subject":"x402_bazaar:https://graph-algorithms.x402tookit.com/shortest-path","kind":"listing","method":"sync.x402_bazaar/1","body":{"endpoints":[["x402","https://graph-algorithms.x402tookit.com/shortest-path"]],"name":"Graph Algorithms","owner_address":"0xb531320805c5bed1d46aeadcf4f008fdf172dbda","raw":{"accepts":[{"amount":"20000","asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","extra":{"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:8453","payTo":"0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa","scheme":"exact"},{"amount":"20000","asset":"EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v","extra":{"feePayer":"D6ZhtNQ5nT9ZnTHUbqXZsTx5MH2rPFiBBggX4hY1WePM","transactionVersions":[0]},"maxTimeoutSeconds":300,"network":"solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp","payTo":"DUPiupXtuox38dcGoXUKer5mAydCzmaHjrbQ66qeEm8s","scheme":"exact"},{"amount":"20000","asset":"0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359","extra":{"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:137","payTo":"0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa","scheme":"exact"},{"amount":"20000","asset":"0xaf88d065e77c8cC2239327C5EDb3A432268e5831","extra":{"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:42161","payTo":"0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa","scheme":"exact"}],"description":"Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford.","extensions":{"bazaar":{"info":{"input":{"method":"GET","queryParams":{"edges":"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","source":"s","target":"x"},"type":"http"},"output":{"example":{"asOf":"2026-10-21T01:36:15.022Z","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.","distance":9,"distances":{"s":0,"t":8,"x":9,"y":5,"z":7},"edgeCount":10,"hops":3,"nodeCount":5,"notChecked":["graphs over 200 nodes or 1000 edges (refused)","ties: when several shortest paths exist, one is returned","…1 more"],"path":["s","y","…2 more"],"reachableCount":5,"reasons":["Dijkstra settles nodes in order of distance, so each distance is final when settled (valid because no weight is negative)."],"source":"Dijkstra's algorithm with a binary heap, computed locally (CLRS ch. 24.3)","startNode":"s","summary":"Shortest s to x is 9 via s > y > t > x.","target":"x","unreachable":[],"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) edges one way; false treats each edge as two-way","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 200 nodes, 1000 edges, 60000 characters; node names 1-32 characters of letters, digits, _ . : + -","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"},"source":{"description":"Start node name; must appear in edges","type":"string"},"target":{"description":"Optional end node; if given the path to it is returned","type":"string"}},"required":["edges","source"],"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"]},"distance":{"type":["null","number"]},"distances":{"properties":{"s":{"type":["null","number"]},"t":{"type":["null","number"]},"x":{"type":["null","number"]},"y":{"type":["null","number"]},"z":{"type":["null","number"]}},"type":["null","object"]},"edgeCount":{"type":["null","number"]},"hops":{"type":["null","number"]},"nodeCount":{"type":["null","number"]},"notChecked":{"items":{"type":"string"},"type":["array","null"]},"path":{"items":{"type":"string"},"type":["array","null"]},"reachableCount":{"type":["null","number"]},"reasons":{"items":{"type":"string"},"type":["array","null"]},"source":{"type":["null","string"]},"startNode":{"type":["null","string"]},"summary":{"type":["null","string"]},"target":{"type":["null","string"]},"unreachable":{"type":["array","null"]},"verdict":{"type":["null","string"]}},"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"}}},"lastUpdated":"2026-11-01T23:27:06.248Z","quality":{"l30DaysTotalCalls":1,"l30DaysUniquePayers":1,"lastCalledAt":"2026-11-01T23:27:06.047Z"},"resource":"https://graph-algorithms.x402tookit.com/shortest-path","serviceName":"Graph Algorithms","tags":["graph","dijkstra","shortest-path","algorithm"],"type":"http","x402Version":2},"source":"x402_bazaar","summary":"Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford."},"body_sha256":"b19344a4b6ba3d71e42be585c8ebd07abddb73f864505f61f9ae8c7ada53223e","prev_id":null,"leaf":"0x8fdeadd4feab74ddb8dab81c956a6366ccd218f9096df4888d2dba982e124dba","leaf_text":"{\"body\":\"b19344a4b6ba3d71e42be585c8ebd07abddb73f864505f61f9ae8c7ada53223e\",\"id\":2201765,\"kind\":\"listing\",\"method\":\"sync.x402_bazaar/1\",\"observed_us\":1793646808820909,\"prev\":null,\"subject\":\"x402_bazaar:https://graph-algorithms.x402tookit.com/shortest-path\",\"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":["0x8fdeac9be71c4308268c7249180bea2d36e7ec7519cc25fc4738ecb604a56342","0x987cfccae718bb6666a4f79eabaff2aa244ddb62898580bbd92367bb9ec3f900","0x40691097f88e2c8969f67c8f723ff34bf65bb516daaba6c021107ce47cb7e7bd","0xf2c3c8e1df693e67bdf07d6c4752898ff60ad255b4d636206c930f8bde26356f","0x0d39782393e182a50a36f0ae18ac291d8be1d495702dd5d89b0c9fff4da11901","0x3c474ebdef623753054cf0fe1ac863b1e20cc983d9cfaaf386db487868048462","0x147acafe9ee3aae856fc9add36c6614f94428e3bfa35f68dd208031b97b75a0c","0xaa3009390969a2db3c6abc052bac9fe2e56e1e22faf0c9320eff0c147fbf5061","0x368916f9640e53e6bd6d0dc1253925a3db42c80e3eecd4a2738e4fff6472a930","0xf380449714a93abab9ca4da9d7c8ac1e0976d94f86a150ca293e441cb00e3c10","0xf7b335097508ee8bf9a9421eb3e38f8c8156af4ae4502105f8f8caef64bd9d04","0xcc41efda675fd5f31ee9b82e2920f27c5b96c51ec4eacef941b7e4116cbf2ac5","0x680e2eb544f0b0d7118b76ffef0a533f49c97860e3c70eaa1d07167760b4968c","0x3f15e4f2fd3ab4091e7284edf8bfed23163b8ef6b0c8fdbd458a498a9bb35a32","0x5d92631d189bd0292c27a05f85a5ec38ec5f4197dfe4660eb991dc6a511e25a6","0x5e23ec5954c11a4530aab8c635a72b12bcfeb6fcb03c6cb1a990cc1743424543","0x1805ef693fbdb2c23fcb61616f830408ca89bec1dc5b68ee47a770ffc0b9760a","0x4d205063c881c48edbbb37762a8d3bbb7444d4c42daa882f663a231893d25c35","0x365b161a4b68d750dcc4b3ecce1154a2163c87b08762079428e68f0ebb6a754e"]}