Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem in O(n^3), written in Rust.
Go to file
2019-04-06 20:05:22 +02:00
src Changes for Cargo edition 2018 2019-04-06 20:05:22 +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 And avoid line breaks within the string 2018-02-05 10:13:45 +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 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