The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.
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.
You can install the released version of RcppHungarian from CRAN with:
install.packages("RcppHungarian")
Or the GitHub Version with:
::install_github("jsilve24/RcppHungarian") devtools
A simple example, of the function usage below. Please see the Vignette for more detailed overview and examples.
library(RcppHungarian)
<- rbind(c(0,1,2,3),
cost.of.matchings c(4,2,1,0),
c(9, 1, 0, 5))
HungarianSolver(cost.of.matchings)
#> $cost
#> [1] 0
#>
#> $pairs
#> [,1] [,2]
#> [1,] 1 1
#> [2,] 2 4
#> [3,] 3 3
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.