Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem in O(n^3), written in Rust.

Go to file

Michael Neumann beef90e23b Update dependencies		2021-01-07 15:50:40 +01:00
benches	Run benchmark with N=50	2019-04-07 11:48:22 +02:00
src	Refactor control flow of algorithm	2019-04-07 17:30:57 +02:00
.gitignore	Initial commit	2015-10-19 19:18:47 +02:00
.travis.yml	Add travis	2015-10-19 19:28:06 +02:00
Cargo.toml	Update dependencies	2021-01-07 15:50:40 +01:00
LICENSE	Initial import	2015-10-19 19:27:11 +02:00
README.md	Document time complexity O(n^3) of the algorithm	2018-01-30 15:03:03 +01:00

munkres-rs

Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem written in Rust. Time complexity is O(n^3).

TODO