| Package | Description | 
|---|---|
| org.jgrapht.alg | Algorithms provided with JGraphT. | 
| org.jgrapht.alg.flow | Flow related algorithms. | 
| Constructor and Description | 
|---|
| MinSourceSinkCut(DirectedGraph<V,E> graph,
                MaximumFlowAlgorithm<V,E> maximumFlowAlgorithm,
                double epsilon)Deprecated.  Create a new minimum s-t cut algorithm. | 
| 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  | 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. | 
Copyright © 2016. All rights reserved.