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

Kuhn-Munkres in O(n³) doesn't need matching set sizes #37

Closed
samueltardieu opened this issue Nov 28, 2017 · 1 comment
Closed

Kuhn-Munkres in O(n³) doesn't need matching set sizes #37

samueltardieu opened this issue Nov 28, 2017 · 1 comment

Comments

@samueltardieu
Copy link
Contributor

The same algorithm works fine provided |U| <= |V|. This prevents creating dummy 0 cost matchings that increase the complexity of the algorithm.
@xtof-durr
Copy link
Collaborator

The implementation has been changed to allow this case |U| <= |V|. It computes a matching of maximum profit where every vertex from U is matched.

xtof-durr added a commit that referenced this issue Nov 28, 2017
@xtof-durr
Merge pull request #38 from samueltardieu/issue-37
45106c9 
fix #37: do not require matching sizes in Kuhn-Munkres

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

No branches or pull requests
2 participants
@samueltardieu @xtof-durr