2015-10-19 20:27:11 +03:00
|
|
|
[package]
|
|
|
|
|
name = "munkres"
|
2019-04-07 20:09:34 +04:00
|
|
|
version = "0.5.1"
|
2015-10-19 20:27:11 +03:00
|
|
|
authors = ["Michael Neumann <mneumann@ntecs.de>"]
|
2015-10-20 02:25:35 +03:00
|
|
|
license = "BSD-3-Clause"
|
2015-10-20 02:24:13 +03:00
|
|
|
repository = "https://github.com/mneumann/munkres-rs"
|
2018-02-05 13:13:45 +04:00
|
|
|
description = "Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem in O(n^3)"
|
2015-12-21 17:48:24 +03:00
|
|
|
keywords = ["algorithm", "optimization"]
|
2019-04-07 20:09:34 +04:00
|
|
|
include = ["src/*.rs", "benches/*.rs", "Cargo.toml", "LICENSE", "README.md"]
|
2019-04-06 22:36:00 +04:00
|
|
|
edition = "2018"
|
2015-10-19 20:27:11 +03:00
|
|
|
|
|
|
|
|
[dependencies]
|
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 17:03:57 +03:00
|
|
|
fixedbitset = "0.1"
|
2019-04-07 00:53:44 +04:00
|
|
|
ndarray = "0.12"
|
2019-04-06 22:36:00 +04:00
|
|
|
|
|
|
|
|
[dev-dependencies]
|
|
|
|
|
criterion = "0.2"
|
|
|
|
|
|
|
|
|
|
[[bench]]
|
|
|
|
|
name = "solve_assignment"
|
|
|
|
|
harness = false
|
