tuist generate no longer crashes on large dependency graphs

Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, the topological sort, ModuleMapMapper, and StaticProductsGraphLinter were replaced with iterative implementations using explicit stacks. Large but valid acyclic dependency graphs that previously crashed tuist generate with a stack overflow now complete successfully, while existing caching, ordering, and linting behavior is preserved.