andrey/munkres-rs
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Document time complexity O(n^3) of the algorithm

Browse Source
This commit is contained in:
Michael Neumann 2018-01-30 15:03:03 +01:00
parent 4e6ba86258
commit 75f19c85cd
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Cargo.toml
View File

@ -4,10 +4,10 @@ version = "0.3.0"
authors = ["Michael Neumann <mneumann@ntecs.de>"]
license = "BSD-3-Clause"
repository = "https://github.com/mneumann/munkres-rs"
description = "Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem"
description = "Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem with O(n^3) time complexity"
keywords = ["algorithm", "optimization"]
include = ["src/*.rs", "Cargo.toml", "LICENSE", "README.md"]
[dependencies]
fixedbitset = "0.1"
ndarray = "0.10"
ndarray = "0.11"

3
README.md
View File

@ -3,7 +3,8 @@
[travis-image]: https://travis-ci.org/mneumann/munkres-rs.svg?branch=master
[travis-link]: https://travis-ci.org/mneumann/munkres-rs
Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem written in Rust.
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.

1
rustfmt.toml
View File

@ -1 +0,0 @@
reorder_imports = true