Refactor simplex and Lazy simplex improvement#813
Open
nathanneike wants to merge 1 commit into
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Types of changes
Refactor
Performance improvement
Tests
Motivation and context / Related issue
This refactors the network simplex storage used by lazy EMD so that lazy mode avoids materializing dense per-arc storage where possible.
The lazy path now uses explicit storage/accessor modes for costs, flows, endpoints, and arc states. It also returns sparse transport output instead of allocating a dense transport matrix internally. This reduces memory usage for lazy EMD while keeping dense and sparse EMD behavior unchanged.
How has this been tested (if it applies)
Rebuilt the C++/Cython extension and ran the whole test suite
PR checklist