stable_matching
| Crates.io | stable_matching |
| lib.rs | stable_matching |
| version | 0.2.0 |
| source | src |
| created_at | 2023-01-12 17:07:26.05625 |
| updated_at | 2024-12-12 01:31:00.592221 |
| description | Implementation of the Gale-Shapley stable matching algorithm |
| homepage | https://github.com/gjf2a/stable_matching |
| repository | https://github.com/gjf2a/stable_matching |
| max_upload_size | |
| id | 757337 |
| size | 23,845 |
Gabriel Ferrer (gjf2a)
documentation
README
stable_matching
Implementation of the Gale-Shapley algorithm, as described on page 6 of Algorithm Design by Kleinberg and Tardos.
Client supplies two slices representing each of the two groups seeking a match, and distance functions indicating preferences.
A Vec of pairs of slice indices is returned to indicate the stable matches.
License
Licensed under either of
- Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Contributions
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.