RcppHungarian: Solves Minimum Cost Bipartite Matching Problems

Header library and R functions to solve minimum cost bipartite matching problem using Huhn-Munkres algorithm (Hungarian algorithm; <https://en.wikipedia.org/wiki/Hungarian_algorithm>; Kuhn (1955) doi:10.1002/nav.3800020109). This is a repackaging of code written by Cong Ma in the GitHub repo <https://github.com/mcximing/hungarian-algorithm-cpp>.

Version: 0.1
Imports: Rcpp (≥ 1.0.1)
LinkingTo: Rcpp
Suggests: testthat (≥ 2.1.0), knitr, rmarkdown, ggplot2
Published: 2019-08-02
Author: Justin Silverman [aut, cre], Cong Ma [ctb, cph], Markus Buehren [ctb, cph]
Maintainer: Justin Silverman <Justin.Silverman at duke.edu>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
Copyright: See file COPYRIGHT for details
RcppHungarian copyright details
URL: https://github.com/jsilve24/RcppHungarian
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: RcppHungarian results


Reference manual: RcppHungarian.pdf
Vignettes: Introduction-to-RcppHungarian
Package source: RcppHungarian_0.1.tar.gz
Windows binaries: r-devel: RcppHungarian_0.1.zip, r-devel-gcc8: RcppHungarian_0.1.zip, r-release: RcppHungarian_0.1.zip, r-oldrel: RcppHungarian_0.1.zip
OS X binaries: r-release: RcppHungarian_0.1.tgz, r-oldrel: RcppHungarian_0.1.tgz


Please use the canonical form https://CRAN.R-project.org/package=RcppHungarian to link to this page.