HungarianSolver: Hungarian Algorithm Solver

In RcppHungarian: Solves Minimum Cost Bipartite Matching Problems

Hungarian Algorithm Solver

Description

Solves weighted bipartite matching problems (e.g., optimal matching of people to cars or optimal matching of students to colleges, etc...)

Usage

HungarianSolver(costMatrix)

Arguments

costMatrix

matrix giving cost of each possible pairing - can be rectangular

Details

this is a copy/wrapper for the code developed by Cong Ma and made available as a github repository (mcximing/hungarian-algorithm-cpp). Code was changed to a header only file for use in other Rcpp packages.

Value

List with cost and parings, pairings are given as an Nx2 matrix giving edges that are matched (1-indexed rather than 0-indexed as it will be returned to R)

Examples

cost <- rbind(c(1, 2, 0), 
              c(2, 0, 1), 
              c(1, 4, 19))
soln <- HungarianSolver(cost)
soln                

RcppHungarian documentation built on Sept. 8, 2023, 6:13 p.m.