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

Packages that use MinimumSTCutAlgorithm

Package	Description
org.jgrapht.alg.densesubgraph	Algorithms for computing maximum density subgraphs.
org.jgrapht.alg.flow	Flow related algorithms.

Uses of MinimumSTCutAlgorithm in org.jgrapht.alg.densesubgraph

Constructor parameters in org.jgrapht.alg.densesubgraph with type arguments of type MinimumSTCutAlgorithm

Constructor	Description
GoldbergMaximumDensitySubgraphAlgorithm(Graph<V,E> graph, V s, V t, double epsilon, Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)	Constructor
GoldbergMaximumDensitySubgraphAlgorithmBase(Graph<V,E> graph, V s, V t, boolean checkWeights, double epsilon, Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)	Constructor
GoldbergMaximumDensitySubgraphAlgorithmNodeWeightPerEdgeWeight(Graph<V,E> graph, V s, V t, double epsilon, Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)	Constructor
GoldbergMaximumDensitySubgraphAlgorithmNodeWeights(Graph<V,E> graph, V s, V t, double epsilon, Function<Graph<V,DefaultWeightedEdge>,MinimumSTCutAlgorithm<V,DefaultWeightedEdge>> algFactory)	Constructor

Uses of MinimumSTCutAlgorithm in org.jgrapht.alg.flow

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

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>.
class	EdmondsKarpMFImpl<V,E>	This class computes a maximum flow in a flow network using Edmonds-Karp algorithm.
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.

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.