Implement Hopcroft-Karp algorithm for maximum bipartite matching. Issue: #214#525
Merged
ZigRazor merged 3 commits intoZigRazor:masterfrom Aug 25, 2025
Merged
Implement Hopcroft-Karp algorithm for maximum bipartite matching. Issue: #214#525ZigRazor merged 3 commits intoZigRazor:masterfrom
ZigRazor merged 3 commits intoZigRazor:masterfrom
Conversation
Added new unit tests for the Hopcroft-Karp algorithm to cover more scenarios and edge cases. This led to a fix for a bug where graphs with no possible matching were handled incorrectly. Also updated the README documentation.
ZigRazor
approved these changes
Aug 25, 2025
ZigRazor
added
enhancement
awesohame
force-pushed
the
hopcroft-karp
branch
from
d98be03 to
8eb4a3d
Compare
Contributor
Author
|
@ZigRazor fixed cross-platform compatibility issue, tests now run on macOS and Ubuntu. sorry if I triggered extra CI runs. let me know if anything else is missing. |
ZigRazor
approved these changes
Aug 25, 2025
Owner
|
It's ok! |
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
2 participants
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.
Implements the Hopcroft-Karp algorithm for finding maximum cardinality matching in bipartite graphs with O(E√V) time complexity.
hopcroftKarp()method to Graph classPull Request for Issue #214