Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Hopcroft-Karp algorithm for maximum matchings in bipartite graphs #229

Open
wants to merge 11 commits into
base: master
from

Conversation

@vasalf
Copy link
Contributor

commented Aug 5, 2019

No description provided.

vasalf added 9 commits Jul 23, 2019
@snowleopard

This comment has been minimized.

Copy link
Owner

commented Aug 7, 2019

@vasalf I only managed to have a quick look, but this PR looks very very cool!

I'll give it a proper review as soon as I can. In the meanwhile, I think all these nice algorithms and new data structures should go into a separate Algorithm submodule.

@snowleopard snowleopard added the blocked label Sep 10, 2019
@snowleopard

This comment has been minimized.

Copy link
Owner

commented Sep 10, 2019

I temporarily labelled this blocked since it's difficult to review before #226 is merged.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
2 participants
You can’t perform that action at this time.