Paste a GraphQL query and we'll walk the selection set to estimate cost, depth, and the total number of resolver calls a server might make. Useful for sizing rate limits, spotting N+1 traps, and budgeting expensive queries before clients hammer them.
We parse the query (operations, selection sets, fragments, arguments) and compute the cost recursively:
first: 50), its subtree cost is multiplied by that value.This is the same shape as graphql-cost-analysis and Shopify's storefront cost rules: it's a worst-case upper bound, ideal for rate-limit sizing and spotting nested list bombs.
Tip. Drop a real production query in here and tweak the budget to mirror your server limits — you'll know in seconds whether a new client query is going to get throttled.