Module org.jgrapht.core
Package org.jgrapht.alg.flow
package org.jgrapht.alg.flow
Flow related algorithms.

ClassDescriptionThis is an implementation of the BoykovKolmogorov 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>.EdmondsKarpMFImpl<V,E> This class computes a maximum flow in a flow network using EdmondsKarp algorithm.This class computes an Equivalent Flow Tree (EFT) using the algorithm proposed by Dan Gusfield.This class computes a GomoryHu tree (GHT) using the algorithm proposed by Dan Gusfield.Base class backing algorithms allowing to derive maximumflow from the supplied flow networkImplementation of the algorithm by Padberg and Rao to compute Odd Minimum CutSets.PushRelabelMFImpl<V,E> Pushrelabel maximum flow algorithm designed by Andrew V.