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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.3 |
2026-04-09 windows/windows R-4.5 | RcppHungarian_0.3.zip |
470.4 KiB |