Create article for Kuhn's algorithm to find the Maximum Bipartite Matching #646
Conversation
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
Create an article describing Kuhn's algorithm for finding the maximum matching in a bipartite graph.
Add the link for Kuhn's algorithm for Maximum Bipartite Matching to the index.
Member
|
Hey. Thanks a lot for the translation. Ideally it would be awesome to refactor the code into a function, that take the graph as input and returns a list of a maximum matching. Then we could add some automated tests that check if the code compiles and returns the correct results. Maybe I'll do this later. Anyway thanks. And I'm already looking forward to the Hungarian algorithm. |
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.
Hi guys,
I recently stumbled upon the problem which used the Hungarian algorithm. I check e-maxx.ru and found that it had a wonderful description for the algorithm which used Kuhn's algorithm as a subroutine. I then went to check Kuhn's algorithm page, and found that it had not yet been translated.
I am creating this PR to translate the page for Kuhn's algorithm, and will translate the page for the Hungarian algorithm once this PR is merged.
Thanks.