We present a new algorithm to solve the N+1 Problem in GraphQL that's much more efficient and easier to maintain than current solutions. By resolving breadth-first instead of depth-first, we can reduce concurrency from O(N^2) to O(1) and improve performance by up to 5x while reducing code complexity.
