Uses of Interface
Algorithms for computing maximum density subgraphs.
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
BoykovKolmogorovMFImpl<V,E>This is an implementation of the Boykov-Kolmogorov maximum flow algorithm.
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>.
GusfieldGomoryHuCutTree<V,E>This class computes a Gomory-Hu tree (GHT) using the algorithm proposed by Dan Gusfield.
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.