Large dependency graphs no longer crash during generation

Recursive graph traversals in circular dependency linting, cycle detection, topological sorting, module-map mapping, and static-products linting have been replaced with iterative implementations. This prevents stack overflow crashes on very deep but valid dependency graphs while preserving existing diagnostics.