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:
devtools::install_github("jsilve24/RcppHungarian")
A simple example, of the function usage below. Please see the Vignette for more detailed overview and examples.
library(RcppHungarian)
cost.of.matchings <- rbind(c(0,1,2,3),
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
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4