Max bipartite matching #7
Merged
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
Refactor dinic to return the actual flow
EbTech requested changes Jan 14, 2019
EbTech reviewed Jan 14, 2019
Contributor Author
| This PR actually has the requested changes for PR #5 so merging this one will include both. I hadn't branched the other one. Sorry about that. |
EbTech requested changes Jan 15, 2019
Contributor Author
Yeah I was pretty surprised the iterative DFS on the wikipedia page wasn't the most space efficient. Maybe because its a touch trickier to implement. Who knows. |
EbTech approved these changes Jan 17, 2019
Owner
| Awesome, I merged it in. Thanks for your contribution! |
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
3 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.
Another PR adding a test that shows how to use the max flow to find a maximum matching.
I had to refactor the dinic method a bit to return the flow.