bipartiteMatch: Bipartite graph matching
In zdebruine/LSMF: Least squares matrix factorization

Hungarian algorithm for matching samples in a bipartite graph from a distance ("cost") matrix

1	bipartiteMatch(costMatrix)

costMatrix

A distance matrix giving the cost of each possible pairing

This algorithm was cloned from RcppHungarian, an Rcpp wrapper for the original C implementation by Cong Ma (2016).

n x 2 matrix of pairings

List of components "cost" and "parings", with pairings given as an n x 2 matrix

costMatrix <- rbind(c(1, 2, 0), 
              c(2, 0, 1), 
              c(1, 4, 19))
matched <- bipartiteMatch(costMatrix)
matched

zdebruine/LSMF documentation built on Jan. 1, 2021, 1:50 p.m.

zdebruine/LSMF index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description