Stack-safe graph processing for large dependency graphs

tuist generate no longer crashes with a stack overflow on large valid acyclic dependency graphs. The recursive traversals in CircularDependencyLinter, GraphCircularDetector, topologicalSort, ModuleMapMapper, and StaticProductsGraphLinter are now iterative and explicitly stack-based, keeping cycle detection and module map metadata intact while removing the per-node growth of the Swift call stack.