Large dependency graphs no longer crash from recursive traversal

Several graph-processing paths have been replaced with iterative traversals, including circular dependency linting, cycle detection, topological sorting, module map mapping, and static product linting. tuist generate now handles deep, valid dependency graphs without stack overflow crashes.