GraphQL query complexity estimator

The cost model here is a convention, not a GraphQL standard. Each field costs its weight, and every list multiplies the work under it: cost = weight + list size x the cost of the subselection, and the total is the sum over root fields. List sizes come from a first, last, limit, count, or take argument resolved through your variables, then a Type.field[] rule, then the assumed list size. Paste the schema SDL when you can: with it, lists and leaves come from the schema and every field is checked against its type; without it, a field counts as a list only when an argument or rule sizes it. Unions are costed once through their typed fragments, not once per member. This is a static estimate of what the operation asks for; it does not know your resolvers, and no server was contacted.