Add Hopcroft-Karp matching algorithm #291
Open
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
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 Hopcroft-Karp algorithm computes a maximum-cardinality matching of a bipartite graph. This algorithm is very useful, and I would like to use it in some other projects.
I'm opening this PR here rather than in GraphsMatching as this PR does not add dependencies, and there has been some talk, e.g. in #191, of adding basic matching functionality to the Graphs.jl repository.
Additions
maximum_cardinality_matchingfunction. This accepts a graph, and an optionalAbstractMaximumMatchingAlgorithmto specify which algorithm to use (only Hopcroft-Karp is available for now). This design is motivated by the discussion in Rename algorithms by what they return instead of their creator #264.hopcroft_karp_matchingfunction, which implements the Hopcroft-Karp algorithm for maximum cardinality matching on a bipartite graph