andrey/munkres-rs
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem in O(n^3), written in Rust.
52 Commits 1 Branch 7 Tags 148 KiB
Rust 100%
51c5b7638f
Go to file
Michael Neumann 51c5b7638f BUG FIX! If we cover a row and column, we have to leave the column 
loop.

This degrades performance by a LOT!
2016-02-27 20:44:02 +01:00
src BUG FIX! If we cover a row and column, we have to leave the column 2016-02-27 20:44:02 +01: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 Version 0.1.0 2015-12-21 15:48:24 +01:00
LICENSE Initial import 2015-10-19 19:27:11 +02:00
README.md Add todo itemAdd todo itemAdd todo itemAdd todo itemAdd todo itemAdd todo itemAdd todo itemAdd todo item 2015-11-29 17:31:11 +01:00
rustfmt.toml rustfmt 2015-11-29 16:31:50 +01:00

README.md

munkres-rs Build Status

Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem written in Rust.

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

TODO

  • Implement SIMD f32x4 weight matrix