Graph processing is stack-safe on large dependency graphs

Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, the local topologicalSort in TuistSupport, ModuleMapMapper, and StaticProductsGraphLinter have been replaced with iterative implementations that use explicit stacks. Projects with large but valid acyclic dependency graphs no longer crash tuist generate with a stack overflow while loading, linting, sorting, or traversing the graph. Existing diagnostics, caching behavior, and ordering are preserved.