tuist generate no longer stack-overflows on large dependency graphs

Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, the local topologicalSort (moved out of TSCBasic), ModuleMapMapper, and StaticProductsGraphLinter were replaced with iterative implementations over explicit stacks. Large, valid, acyclic Tuist graphs that used to crash tuist generate with a stack overflow now generate successfully while keeping the existing linting, ordering, and caching behavior.