{"uid":"cap_L8Uljaj3s2vbaVkLuDeGY","slug":"minia2a-bfs-breadth-first-search-service-62e71b93","name":"minia2a BFS (Breadth-First Search) Service","description":"minia2a service: x402-bfs","url":"https://minia2a.uk/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_uXs6tfPRBhMyiQ5JdCXrF","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 via a paid x402 API endpoint","exampleAgentPrompt":"Run a breadth-first search on my graph starting from node A and find the shortest path to node Z — the graph has edges A->B, A->C, B->D, C->Z.","exampleUseCases":[{"title":"Shortest path in a network graph","prompt":"I have a network with nodes and edges — can you run BFS starting from node 1 to find the shortest path to node 7? Edges are: 1->2, 1->3, 2->4, 3->5, 4->6, 5->7."},{"title":"Reachability check in dependency graph","prompt":"Given a dependency graph where A depends on B and C, B depends on D, and C depends on E, use breadth-first search from A to tell me all nodes reachable from A."},{"title":"Minimum hops between social nodes","prompt":"In my graph of connections — Alice knows Bob and Carol, Bob knows Dave, Carol knows Eve — do a BFS from Alice to find how many hops it takes to reach Dave."}],"resultDescription":"Returns the result of a breadth-first search traversal, which may include the BFS-ordered list of visited nodes, the shortest path between start and target, distances from the source node, or a structured traversal output depending on the query parameters provided.","failureModes":["Missing required 'input' parameter returns a validation error","Malformed graph structure in query parameters may yield unexpected traversal results","Disconnected graph with unreachable target returns empty path or null","Invalid query parameter types may cause a 400 or processing error","Payment not processed (x402 failure) results in 402 Payment Required response"],"whenToPreferThis":"Choose this endpoint when you need a simple, pay-per-use BFS graph traversal without setting up your own algorithm infrastructure. It is well-suited for one-off pathfinding queries, educational or prototyping use cases, or AI agent workflows that need on-demand graph search as a microservice step. Prefer alternatives if you need DFS, Dijkstra's, or weighted shortest-path algorithms.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T07:08:22.871Z","isFirstParty":false}