Large dependency graphs no longer crash from stack overflow during generation

Recursive graph traversals in CircularDependencyLinter, GraphCircularDetector, topological sort, ModuleMapMapper, and StaticProductsGraphLinter have been replaced with iterative implementations. Generation can now handle deep, valid acyclic workspaces without crashing.