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

Go to file

Michael Neumann 44847c04e1 Breaking API - Return Vec<Position> from solve_assignment() Also simplify some test cases.		2019-04-07 11:02:57 +02:00
benches	Refactor - breaking changes to API	2019-04-07 10:35:52 +02:00
src	Breaking API - Return Vec<Position> from solve_assignment()	2019-04-07 11:02: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	Upgrade ndarray version	2019-04-06 22:53:44 +02: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