Package org.jgrapht.alg.flow
Flow related algorithms.
-
Class Summary Class Description EdmondsKarpMFImpl<V,E> A flow network is a directed graph where each edge has a capacity and each edge receives a flow.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> Base class backing algorithms allowing to derive maximum-flow from the supplied flow networkPadbergRaoOddMinimumCutset<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.