Package  Description 

org.jgrapht.alg.flow 
Flow related algorithms.

Modifier and Type  Class and 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 GomoryHu tree (GHT) using the algorithm proposed by Dan Gusfield.

class 
MaximumFlowAlgorithmBase<V,E>
Base class backing algorithms allowing to derive
maximumflow from the supplied
flow network

class 
PushRelabelMFImpl<V,E>
Pushrelabel
maximum flow algorithm designed by Andrew V.

Constructor and 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.

Copyright © 2017. All rights reserved.