AbstractBipartiteGraph |
An abstract class encoding assignment graphs (matching each left vertex with one single right vertex)
We consider a flow in the graph by adding a source linked to all right vertices
and a sink linked to all left vertices
It is based on computing the strongly connected components of the residual graph,
then remove arcs connecting two different strongly connected components
Computing the strongly connected components is done by an algorithm
of Aho, Hopcroft, Ullman using depth first search (Cormen, Leiserson, p. 478, p. 489)
Note (EGA) on ice traduction from claire to java :
class StrongConnectionDecomposition have been included in this one |