Generate large dependency graphs without stack overflow crashes

Very large but valid dependency graphs no longer crash tuist generate with a stack overflow. Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, topologicalSort, ModuleMapMapper, and StaticProductsGraphLinter have been replaced with iterative implementations. Deep dependency chains are now processed safely while keeping the same linting, cycle detection, and ordering behavior.