Uses of Class
org.jgrapht.alg.flow.MaximumFlowAlgorithmBase
Package | Description |
---|---|
org.jgrapht.alg.flow |
Flow related algorithms.
|
-
Uses of MaximumFlowAlgorithmBase in org.jgrapht.alg.flow
Subclasses of MaximumFlowAlgorithmBase in org.jgrapht.alg.flow 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
PushRelabelMFImpl<V,E>
Push-relabel maximum flow algorithm designed by Andrew V.