Provides an algorithm to find blossom inequalities which are violated
or prove that no such inequality exists
We have as entry : one graph G, one map s <=> b(s),
one solution x of the LP,which is a map e <=> x(e),
a map e <=> C(e) where C(e) is the capacity of the edge e