Graph recursion no longer overflows on large dependency graphs

Large, valid, acyclic dependency graphs no longer crash tuist generate with a stack overflow. Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, topologicalSort, ModuleMapMapper, and StaticProductsGraphLinter now use explicit DFS stacks, keeping existing diagnostics and ordering behavior while being stack-safe.