Gale-Shapley Algorithm and Tests #5494
Merged
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.
Overview:
This pull request adds the implementation of the Gale-Shapley algorithm (Stable Marriage Problem) to the greedyalgorithms package. The algorithm allows for finding stable matches between two sets (men and women) based on their preferences. In addition to the algorithm, unit tests have been added to ensure correctness, and the DIRECTORY.md file has been updated to reflect this new addition.
Changes:
New Algorithm: Gale-Shapley algorithm for stable matching.
Unit Tests: JUnit tests added to validate the correctness of the Gale-Shapley algorithm with various scenarios, including multiple preferences, single pair matching, and equal preferences.
Directory Update: Updated DIRECTORY.md to include the new Gale-Shapley algorithm under the greedyalgorithms section.
Checklist:
clang-format -i --style=file path/to/your/file.java