Add brute force #8
Closed
Conversation
This file contains 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
added 14 commits
October 10, 2019 10:06
- updated readme to reference gitignore
- fixed general format to be readable in vs code
- added output and isStable-test for matchings in Main - fixed typing error - added some formatting for console output
- renamed fiancee arrays to fiance (because these are the assigned fiances to the women) - fixed trivialMatching generator - added helper functions for isStable
- added some comments - cleaned up console logging in main - isStable now only logs if giveInfo is true (preparation for brute force algorithm) - expanded readme
- refactored matching prints - added brute force printout
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Closes #3. Based upon #7 (as it requires isStable to function)
Closes #5, closes #6 and closes #7.
Plain, recursive implementation of a brute force search for a stable matching.
Further verified that the implementation of the Gale-Shapley algorithm (talked about in #7) is errornous.