I am trying to find the optional pairing in an even number of players. Between the different players there is a “weight” (a double value). My task is to pair the players so the sum of all the pairweights became as so small as possible.
From the internet I have seen this kind of problems may be treated as “the optimal roommate problem” and there should be algorithms to solve this type of problems.
In the QuickGraph project you have included a lot of algorithms. Could any of these algorithms help me?
