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.
38 Commits 1 Branch 7 Tags 148 KiB
Rust 100%
856ea59d70
Go to file
Michael Neumann 856ea59d70 Improve performance by replacing bit_vec with fixedbitset. 
Before:
    test bench_solve_100  ... bench:      53,365 ns/iter (+/- 651)
    test bench_solve_1000 ... bench:   5,864,809 ns/iter (+/- 102,059)
    test bench_solve_2000 ... bench:  34,347,333 ns/iter (+/- 200,639)

After:

    test bench_solve_100  ... bench:      41,574 ns/iter (+/- 765)
    test bench_solve_1000 ... bench:   4,693,452 ns/iter (+/- 189,201)
    test bench_solve_2000 ... bench:  29,954,973 ns/iter (+/- 438,573)
2015-11-29 15:03:57 +01:00
src Improve performance by replacing bit_vec with fixedbitset. 2015-11-29 15:03:57 +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 Improve performance by replacing bit_vec with fixedbitset. 2015-11-29 15:03:57 +01: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.