Large dependency graphs no longer crash from recursion overflow

Recursive graph traversals in circular dependency linting, cycle detection, topological sort, module map mapping, and static product linting have been replaced with iterative implementations. Valid but very deep dependency graphs now generate without stack overflow crashes.