[jgrapht-users] Iterating all solutions

[Claude B. <cl...@re...>]

First of all, congrats for the speed and reliability of the algorithms 
in this library.

My question concerns a Kolmogorov weighted perfect matching. In the 
specific problem I'm trying to solve, there can sometimes be a few 
optimal solutions, with the same score, and which only differ one from 
the other by the permutation of some edges (A->D, B->C instead of A->C, 
B->D for instance).

Would it be possible to somehow iterate all those solutions, or at least 
those reachable with a single permutation, either with the existing 
algorithm or by patching it?