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.

Sign up for GitHub

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

Jump to bottom

bipartite cardinality matching #57

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

bipartite cardinality matching #57

wants to merge 5 commits into from

Conversation

Wikunia
Copy link
Contributor

@Wikunia Wikunia commented Nov 13, 2019 •
edited
Loading

Maybe can be faster with an implementation of the Hopcroft Karp algorithm but read that this is normally not faster than the basic BFS implementation.
If this looks good I'll of course add it to the README.

Additionally:

  • There is probably a faster implementation for unsorted ei
  • Needs implementation for a sparse matrix as bipartite matching has it
  • Remove the m <= n constraint

@dgleich
Copy link
Contributor

dgleich commented Nov 16, 2019

I'm behind on things, but we'll take a look at this soon!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@Wikunia @dgleich