Hungarian-Munkres: A Linear Sum Assignment Problem (LSAP) solver
This library provide a Haskell binding to the libhungarian, a solver for Linear Sum Assignment Problem (LSAP) implemented in C language. It uses Hungarian algorithm http://en.wikipedia.org/wiki/Hungarian_algorithm, and runs in O(n^3) time. This implementation is efficient. Benchmarks versus pure haskell implementation are included (run "cabal bench").
Downloads
- Hungarian-Munkres-0.1.5.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5 (info) |
|---|---|
| Dependencies | base (>=4.0 && <5.0) [details] |
| License | GPL-3.0-only |
| Copyright | (c) 2014 Kai Zhang |
| Author | Kai Zhang <kai@kzhang.org> |
| Maintainer | Kai Zhang <kai@kzhang.org> |
| Category | Algorithms |
| Source repo | head: git clone https://github.com/kaizhang/hungarian-munkres.git |
| Uploaded | by kaizhang at 2014-10-08T06:27:39Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 5100 total (15 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |