Package | Description |
---|---|
org.jgrapht.alg.flow |
Flow related algorithms.
|
Modifier and Type | Class and Description |
---|---|
class |
EdmondsKarpMFImpl<V,E>
This class computes a maximum flow in a
flow network using
Edmonds-Karp algorithm.
|
class |
GusfieldEquivalentFlowTree<V,E>
This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.
|
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.
|
Copyright © 2017. All rights reserved.