{"uid":"cap_wvqfT-F6Qgv5C-bTnH_Mp","slug":"dep-halowerk-com-dependency-depth-calculator-5490ca11","name":"dep.halowerk.com Dependency Depth Calculator","description":"Calculates reachable transitive dependency count and maximum depth from a supplied graph. Missing facts are returned as null and named in unavailable_fields where applicable. Derived values disclose their method; source-backed values disclose source, time window and age. ","url":"https://dep.halowerk.com/v1/dependency-depth","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"root":{"type":"string","maxLength":512,"minLength":1,"description":""},"graph":{"type":"object","additionalProperties":{"type":"array","items":{"type":"string","maxLength":512,"minLength":1,"description":""},"maxItems":10000}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.004","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.004/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_qVekc8xekklP9reht3yrv","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.004","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Calculates the reachable transitive dependency count and maximum dependency tree depth from a caller-supplied directed dependency graph","exampleAgentPrompt":"Given my package 'myapp' and its dependency graph — where myapp depends on lodash and axios, lodash depends on underscore, and axios depends on follow-redirects — calculate the total number of reachable transitive dependencies and the maximum depth of the tree.","exampleUseCases":[{"title":"Audit dependency bloat before release","prompt":"I have a Node package called 'my-cli-tool' and I've mapped out its full dependency graph. Can you calculate how many total transitive dependencies it pulls in and how deep the deepest chain goes? Here's the graph: my-cli-tool depends on commander and chalk, commander depends on minimist, chalk depends on ansi-styles and supports-color."},{"title":"Compare dependency complexity of two packages","prompt":"I want to know which of my two libraries has a more complex dependency tree. Start with 'lib-a' as the root — it depends on react and redux, react depends on react-dom, redux depends on immer. What's the transitive count and max depth?"},{"title":"Check if dependency refactor reduced graph depth","prompt":"After our refactor, our app 'payment-service' now only depends on stripe and axios directly, stripe depends on node-fetch, and axios has no further deps. Can you compute the new total transitive dependency count and maximum tree depth so I can compare it to our old graph?"}],"resultDescription":"Returns the total count of all reachable transitive dependencies from the root node and the maximum depth of the dependency graph. Fields that cannot be determined are returned as null and listed in 'unavailable_fields'. The response also discloses whether each derived value was computed or source-backed, including the method of derivation.","failureModes":["Missing or empty root field causes validation error","Graph contains cycles which may cause infinite traversal or incorrect depth","Graph node references in edges that are not defined as keys may return null or partial results","Excessively large graphs approaching 10,000 edges per node may be rejected or time out","Malformed adjacency list structure returns schema validation error"],"whenToPreferThis":"Use this endpoint when you need a fast, stateless computation of transitive dependency reach and tree depth from a graph you have already constructed locally. It is ideal when you have your own dependency resolution data and want a reliable count and depth metric without having to traverse the graph yourself. Prefer this over registry-fetch endpoints when the graph is already known; prefer registry endpoints when you need to first discover the graph from package metadata.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T12:31:01.987Z","isFirstParty":false}