BipartiteMatching

Algorithms for finding a bipartite matching. We include one optimal algorithm (KuhnMunkres) and one greedy algorithm (competitive linking).

Algorithms find minimum matchings.

class Object
trait Matchable
class Any
object CompetitiveLinking.type
object KuhnMunkres.type

Value members

Abstract methods

def extractMatching(weights: Seq[Seq[Double]]): (Seq[Int], Double)