Iterate over deep dependency graphs without stack overflow

Several graph processors that relied on recursive traversal are now iterative: CircularDependencyLinter, GraphCircularDetector, the local topologicalSort (moved into TuistSupport), ModuleMapMapper, and StaticProductsGraphLinter. Large valid graphs that used to crash with a stack overflow during tuist generate now complete successfully.