Hi, the implementation returns the pos of least cost , how do I change it to return me the pos of max cost array?

KevinStern / software-and-algorithms

Neat algorithm implementations in Java.

MIT License

118 stars 70 forks source link

Hi, the implementation returns the pos of least cost , how do I change it to return me the pos of max cost array? #13

Open SangeetaSingh opened 5 years ago

rocinant commented 3 years ago

The easiest way is just negative the cost matrix and get the matching result. Of course you can choose to realize the Max-Weighted Bipartite Matching, it is very similar to this one, just change the labeling mechanism and updating policy.