Graph traversals are now stack-safe for large dependency graphs

Several large-graph traversals in the CLI (circular dependency linting, graph cycle detection, topological sort, module map analysis, and static products linting) now use explicit DFS stacks instead of recursive traversal. Large, acyclic dependency graphs that previously crashed tuist generate with a stack overflow now generate successfully while preserving cycle diagnostics, ordering, and lint behavior.