Maximum matching algorithms #25
Draft
Conversation
This file contains 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
rkilar
force-pushed
the
matching-algorithms
branch
from
f853289
to
665c3d3
Compare
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.
The algorithm implementations are mostly final. The code for data structures has to probably be split into different files and cleaned up a bit. Should they be moved to the structures directory or remain in matching since most are kind of specific to the algorithms? So far the implemented algorithms for maximum weight matching are Edmonds n^4, Gabow n^3, Galil/Micali/Gabow nm*logn and Gabow n^(3/4)m logN. There's also an implementation for Micali-Vazirani maximum cardinality matching algorithm that's needed for the Gabow scaling algorithm.