A matching algorithm for groups of persons, giving the specified number of pairings between persons of different groups, with no meeting repeating.
Uses Edmonds Blossom matching algorithm, implemented by David Eppstein and published "https://code.activestate.com/recipes/221251-maximum-cardinality-matching-in-general-graphs/" on Fri, 12 Sep 2003, just modified for our purposes.