Large dependency graphs no longer cause recursion overflow

Recursive graph traversals used for circular dependency detection, topological sorting, module map mapping, and static product linting have been replaced with iterative implementations. This prevents stack overflow crashes when generating very large but valid acyclic dependency graphs.