{"id":2201766,"recorded_at":"2026-11-02T19:13:28.824831Z","observed_at":"2026-11-02T19:13:28.824770Z","subject_kind":"source_record","subject":"x402_bazaar:https://graph-algorithms.x402tookit.com/minimum-spanning-tree","kind":"listing","method":"sync.x402_bazaar/1","body":{"endpoints":[["x402","https://graph-algorithms.x402tookit.com/minimum-spanning-tree"]],"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":"Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected.","extensions":{"bazaar":{"info":{"input":{"method":"GET","queryParams":{"edges":"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"},"type":"http"},"output":{"example":{"asOf":"2026-10-21T01:36:14.761Z","components":1,"degraded":false,"disclaimer":"Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.","edgeCount":14,"nodeCount":9,"notChecked":["graphs over 200 nodes or 1000 edges (refused)","ties: equal-weight edges are taken in input order, so another equally cheap tree may exist","…1 more"],"reasons":["Kruskal adds the cheapest edge that does not close a cycle; a tree on n nodes has n - 1 edges, a forest n - components."],"skippedSelfLoops":0,"source":"Kruskal's algorithm with union-find, computed locally (CLRS ch. 23.2)","summary":"Minimum spanning tree of 9 nodes: 8 edges, total weight 37.","totalWeight":37,"treeEdgeCount":8,"treeEdges":[{"from":"g","to":"h","weight":1},{"from":"c","to":"i","weight":2}],"verdict":"SPANNING_TREE"},"type":"json"}},"schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"method":{"enum":["GET"],"type":"string"},"queryParams":{"properties":{"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, _ . : + -. Edges are undirected","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"}},"required":["edges"],"type":"object"},"type":{"const":"http","type":"string"}},"required":["type","method"],"type":"object"},"output":{"properties":{"example":{"properties":{"asOf":{"type":["null","string"]},"components":{"type":["null","number"]},"degraded":{"type":["boolean","null"]},"disclaimer":{"type":["null","string"]},"edgeCount":{"type":["null","number"]},"nodeCount":{"type":["null","number"]},"notChecked":{"items":{"type":"string"},"type":["array","null"]},"reasons":{"items":{"type":"string"},"type":["array","null"]},"skippedSelfLoops":{"type":["null","number"]},"source":{"type":["null","string"]},"summary":{"type":["null","string"]},"totalWeight":{"type":["null","number"]},"treeEdgeCount":{"type":["null","number"]},"treeEdges":{"items":{"properties":{"from":{"type":["null","string"]},"to":{"type":["null","string"]},"weight":{"type":["null","number"]}},"type":"object"},"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:02.744Z","quality":{"l30DaysTotalCalls":1,"l30DaysUniquePayers":1,"lastCalledAt":"2026-11-01T23:27:02.579Z"},"resource":"https://graph-algorithms.x402tookit.com/minimum-spanning-tree","serviceName":"Graph Algorithms","tags":["graph","kruskal","mst","algorithm"],"type":"http","x402Version":2},"source":"x402_bazaar","summary":"Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected."},"body_sha256":"e278a70480a8da2783efb8784e43aa55461f561eed590561218ebb3416583a28","prev_id":null,"leaf":"0x2f31ae069512ba48b5b2bfee6cc9ecfda28bb4297d56f9c0cdb7cab3d49a7604","leaf_text":"{\"body\":\"e278a70480a8da2783efb8784e43aa55461f561eed590561218ebb3416583a28\",\"id\":2201766,\"kind\":\"listing\",\"method\":\"sync.x402_bazaar/1\",\"observed_us\":1793646808824770,\"prev\":null,\"subject\":\"x402_bazaar:https://graph-algorithms.x402tookit.com/minimum-spanning-tree\",\"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":["0x2f31efbf5e226bd099d22e0ff23963f2743d9c271b20c516d181c8cb736e45e2","0xe71087904f1bddb54d850e1e6601ea9d60364d57154a33c5f956d40160083190","0x779e2545f66b64143f5f17f314488eeb24260708c6cb038fb4ec22ff3e00a170","0x8632eb00a9b67bc8d4dad36e9cd45d7bfa8bd50f9e0298aefaf112aeb13ee33f","0x2aa9c310b888b3e88748065ce9135d0843904091eab2d88df169f9d70287adad","0x2a59f70452dc1b5d22c40785259c843a94a146d6ebe3f80f1e4adef6e6b33db8","0xe8deb64f2dbaad0c742fc074dc94588f0ef0a58b5be07745b31c00e7470b1c27","0xadb3d14f3a2a51a795364b16f278616dc6c7d6da391043bc6e2a4e6911d6d176","0x5360897e8f88df34b62d065272a12e898e59441f38a7447c79eaf28310b38ad8","0x6fa297047114ca89fd5943c1bd682ddfae4e28cb8fd18c26b47fc1ee1a920449","0x4ea697865e2916c5b16d551fb7b9e33570351dabb1e44f53ddc037de1224d479","0xd02b59f5289a7e4f418fa177885dbe768742fd98e5bf0532eaadff55a79c5864","0xe0a95aa0d153f7a034b0dbeb91c5460c64c47c22ac037e0e8cfa69f4ff734b69","0x74cae95d275254a9c747b603bd40b5086c5725fd3e904782e6447e4647e8b049","0x464ce6fe060d0a6c4e810b71501e55084086148f7daf393caa14462b1a777022","0xd42916b5c6441e9c8d91ff91715af1489cb83dee26d47e7da107caa4d2a68b65","0xa20b9be86af7d690e040c9060a373b2fc5498edf3432f43c26f74fa2febc1e9a","0x050f2978b537f7afb21ee1551577cdf146d1c56f4df12d24315ae5e69366b0a4","0x365b161a4b68d750dcc4b3ecce1154a2163c87b08762079428e68f0ebb6a754e"]}