Uses of Interface
org.jgrapht.alg.interfaces.MaximumFlowAlgorithm

Packages that use MaximumFlowAlgorithm

Package	Description
org.jgrapht.alg.flow	Flow related algorithms.

Uses of MaximumFlowAlgorithm in org.jgrapht.alg.flow

Classes in org.jgrapht.alg.flow that implement MaximumFlowAlgorithm

Modifier and Type	Class	Description
class	BoykovKolmogorovMFImpl<V,E>	This is an implementation of the Boykov-Kolmogorov maximum flow algorithm.
class	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>.
final class	EdmondsKarpMFImpl<V,E>	This class computes a maximum flow in a flow network using Edmonds-Karp algorithm.
class	GusfieldEquivalentFlowTree<V,E>	This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.
class	GusfieldGomoryHuCutTree<V,E>	This class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield.
class	MaximumFlowAlgorithmBase<V,E>	Base class backing algorithms allowing to derive maximum-flow from the supplied flow network
class	PushRelabelMFImpl<V,E>	Push-relabel maximum flow algorithm designed by Andrew V.