Generate large dependency graphs without stack overflow

Recursion in tuist generate graph processing is replaced with iterative implementations for CircularDependencyLinter, GraphCircularDetector, the topological sort moved into TuistSupport, ModuleMapMapper, and StaticProductsGraphLinter. Large, valid, acyclic workspaces with deep target dependency chains no longer crash tuist generate with a stack overflow during circular dependency linting, cycle detection, topological sorting, module map metadata propagation, or static product linting. Existing diagnostics, caching, and ordering behavior are preserved.