Prevent stack overflow crashes on large dependency graphs

Several graph-processing paths that used recursive traversal are now iterative. This prevents tuist generate from crashing with a stack overflow on large, valid acyclic dependency graphs while keeping the same circular-dependency detection, topological ordering, and linting behavior.