Flow related algorithms.
Class Summary Class Description DinicMFImpl<V,E>Implementation of <a href = "https://en.wikipedia.org/wiki/Dinic%27s_algorithm">Dinic algorithm</a> with scaling for <a href = "https://en.wikipedia.org/wiki/Maximum_flow_problem"maximum"maximum flow problem</a>. EdmondsKarpMFImpl<V,E> GusfieldEquivalentFlowTree<V,E>This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield. GusfieldGomoryHuCutTree<V,E>This class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield. MaximumFlowAlgorithmBase<V,E> PadbergRaoOddMinimumCutset<V,E>Implementation of the algorithm by Padberg and Rao to compute Odd Minimum Cut-Sets. PushRelabelMFImpl<V,E>Push-relabel maximum flow algorithm designed by Andrew V.