next.js

92f72373 - Turbopack: refactor graph traveral and fix module graph determinism (#87312)

Turbopack: refactor graph traveral and fix module graph determinism (#87312) ### What? Simplifies the graph traversal. Allows the GraphStore to store edges and nodes. This no longer forces us to abuse the node type to store edge info, which actually has lead to a race condition problem which made the module graph non-deterministic. Removes `skip_duplicated` and made the AdjacencyMap always skip duplicates. That simplifies the implementation. We never not skipped duplicates and that rarely makes sense anyway since any cycle would make it traverse forever... Also removed a bunch of unused stuff...