CompetitiveLinking
Value members
Concrete methods
Performs greedy bipartite matching (aka competitive linking). Finds min matches
Performs greedy bipartite matching (aka competitive linking). Finds min matches
- Value parameters:
- matchingPotentials
<n,m> matrix, m >= n
- Returns:
matching of size n, with values in 0..m-1, along with the score of the matching