Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem in O(n^3), written in Rust.
Go to file
Andrey Tkachenko a1ee35d6fe
All checks were successful
continuous-integration/drone/push Build is passing
Add CI
2022-03-09 13:39:48 +04:00
benches Run benchmark with N=50 2019-04-07 11:48:22 +02:00
src Update weight_matrix.rs 2021-02-24 22:56:37 +04:00
.drone.yml Add CI 2022-03-09 13:39:48 +04: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.lock Add CI 2022-03-09 13:39:48 +04: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 Add CI 2022-03-09 13:39:48 +04:00

munkres-rs Build Status

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

This is a modified port from https://github.com/bmc/munkres.

TODO

  • Implement SIMD f32x4 weight matrix