tuist generate no longer crashes from stack overflow on very large graphs

Recursive graph traversal in dependency linting, cycle detection, topological sorting, module map mapping, and static product linting has been replaced with iterative implementations. Very large, valid dependency graphs can now be generated without crashing.