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.3
Imports: Rcpp (≥ 1.0.1)
LinkingTo: Rcpp
Suggests: testthat (≥ 2.1.0), knitr, rmarkdown, ggplot2
Published: 2023-09-05
Author: Justin Silverman [aut, cre], Cong Ma [ctb, cph], Markus Buehren [ctb, cph]
Maintainer: Justin Silverman <JustinSilverman at psu.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

Documentation:

Reference manual: RcppHungarian.pdf
Vignettes: Introduction-to-RcppHungarian

Downloads:

Package source: RcppHungarian_0.3.tar.gz
Windows binaries: r-devel: RcppHungarian_0.3.zip, r-release: RcppHungarian_0.3.zip, r-oldrel: RcppHungarian_0.3.zip
macOS binaries: r-release (arm64): RcppHungarian_0.3.tgz, r-oldrel (arm64): RcppHungarian_0.3.tgz, r-release (x86_64): RcppHungarian_0.3.tgz
Old sources: RcppHungarian archive

Reverse dependencies:

Reverse imports: sentopics, Ternary
Reverse suggests: tidyclust

Linking:

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