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

Packages that use MinimumSTCutAlgorithm

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

Uses of MinimumSTCutAlgorithm in org.jgrapht.alg.flow

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

Modifier and Type	Class	Description
class	EdmondsKarpMFImpl<V,E>	A flow network is a directed graph where each edge has a capacity and each edge receives a flow.
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.

Fields in org.jgrapht.alg.flow declared as MinimumSTCutAlgorithm

Modifier and Type	Field	Description
private MinimumSTCutAlgorithm<V,E>	GusfieldEquivalentFlowTree.minimumSTCutAlgorithm
private MinimumSTCutAlgorithm<V,E>	GusfieldGomoryHuCutTree.minimumSTCutAlgorithm

Constructors in org.jgrapht.alg.flow with parameters of type MinimumSTCutAlgorithm

Constructor	Description
GusfieldEquivalentFlowTree(Graph<V,E> network, MinimumSTCutAlgorithm<V,E> minimumSTCutAlgorithm)	Constructs a new GusfieldEquivalentFlowTree instance.
GusfieldGomoryHuCutTree(Graph<V,E> network, MinimumSTCutAlgorithm<V,E> minimumSTCutAlgorithm)	Constructs a new GusfieldEquivalentFlowTree instance.
PadbergRaoOddMinimumCutset(Graph<V,E> network, MinimumSTCutAlgorithm<V,E> minimumSTCutAlgorithm)	Creates a new instance of the PadbergRaoOddMinimumCutset algorithm.