{"uid":"cap_gjOYxexLCUWBJerT7pflv","slug":"minia2a-bfs-breadth-first-search-3957c743","name":"minia2a BFS (Breadth-First Search)","description":"minia2a service: x402-bfs","url":"https://minia2a.uk/x402/x402-bfs","method":"GET","headers":{},"bodySchema":{"type":"object","required":["input"],"properties":{"input":{"type":"object","properties":{"type":{"type":"string"},"method":{"type":"string"},"bodyType":{"type":"string"},"queryParams":{"type":"object"}}},"output":{"type":"object","properties":{"type":{"type":"string"}}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.01","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.01/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_2DCUvmZhgl5aFYtNQ3prm","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.01","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Performs a breadth-first search (BFS) graph traversal computation as a paid API service.","exampleAgentPrompt":"Run a breadth-first search on my graph starting from node A — the graph has edges A->B, A->C, B->D, C->D — and give me the BFS traversal order.","exampleUseCases":[{"title":"Shortest path in social network","prompt":"I have a social network graph where each person is a node and friendships are edges. Starting from user ID 42, find all nodes reachable via BFS and give me the traversal order so I can determine the shortest connection path."},{"title":"Dependency resolution ordering","prompt":"I need to resolve dependencies in a software project. Here's my dependency graph: package A depends on B and C, B depends on D. Can you run BFS starting from package A to give me the level-by-level install order?"},{"title":"Web graph reachability check","prompt":"Given this small web link graph with pages as nodes and hyperlinks as edges, starting from the homepage node, traverse it breadth-first and tell me which pages are reachable within 2 hops."}],"resultDescription":"Returns the BFS traversal result including visited nodes in breadth-first order, potentially including level/depth information and path data depending on the query parameters supplied.","failureModes":["Missing required 'input' object returns a validation error","Malformed graph structure or invalid node references cause computation errors","Disconnected graphs may return incomplete traversal if starting node is isolated","Payment failure (402) if x402 micropayment not provided or insufficient funds"],"whenToPreferThis":"Choose this endpoint when you need a hosted, on-demand BFS graph traversal without running your own compute infrastructure. Useful for agents that need graph pathfinding or level-order traversal as a microservice at low per-call cost ($0.01 USDC). Prefer over self-implementing when quick integration matters and graph sizes are moderate.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T00:48:55.152Z","isFirstParty":false}