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

Packages that use FlowAlgorithm

Package	Description
org.jgrapht.alg.flow	Flow related algorithms.
org.jgrapht.alg.flow.mincost	Algorithms for minimum cost flow
org.jgrapht.alg.interfaces	Algorithm related interfaces.

Uses of FlowAlgorithm in org.jgrapht.alg.flow

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

Modifier and Type	Class and Description
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>.
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.

Uses of FlowAlgorithm in org.jgrapht.alg.flow.mincost

Classes in org.jgrapht.alg.flow.mincost that implement FlowAlgorithm

Modifier and Type	Class and Description
class	CapacityScalingMinimumCostFlow<V,E> This class computes a solution to a minimum cost flow problem using the successive shortest path algorithm with capacity scaling.

Uses of FlowAlgorithm in org.jgrapht.alg.interfaces

Subinterfaces of FlowAlgorithm in org.jgrapht.alg.interfaces

Modifier and Type	Interface and Description
interface	MaximumFlowAlgorithm<V,E> Allows to derive maximum-flow from the supplied flow network
interface	MinimumCostFlowAlgorithm<V,E> Allows to calculate minimum cost flow on the specified minimum cost flow problem.