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.
22 Commits 1 Branch 7 Tags 148 KiB
Rust 100%
d33071e044
Go to file
Michael Neumann d33071e044 Improve performance of map_row() 
Before:

    test bench_solve100  ... bench:      64,727 ns/iter (+/- 691)
    test bench_solve1000 ... bench:   7,160,735 ns/iter (+/- 315,280)

After:

    test bench_solve100  ... bench:      59,998 ns/iter (+/- 4,502)
    test bench_solve1000 ... bench:   6,761,411 ns/iter (+/- 379,337)
2015-10-20 01:00:25 +02:00
src Improve performance of map_row() 2015-10-20 01:00:25 +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 Get rid of nalgebra. Simplify traits 2015-10-19 23:31:40 +02:00
LICENSE Initial import 2015-10-19 19:27:11 +02:00
README.md Add travis image 2015-10-19 19:36:50 +02: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.