Large dependency graphs no longer cause stack overflow

Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, topological sort, ModuleMapMapper, and StaticProductsGraphLinter have been replaced with iterative implementations. This prevents tuist generate from crashing with a stack overflow on large, valid, acyclic dependency graphs.