Stack overflow in large dependency graphs fixed

Recursive graph traversals in circular dependency linting, cycle detection, topological sorting, module map mapping, and static product linting have been replaced with iterative implementations. This prevents tuist generate from crashing with a stack overflow on large, valid dependency graphs.