Package org.jgrapht.alg.flow

Flow related algorithms.

See: Description

Class Summary

Class	Description
EdmondsKarpMFImpl<V,E>	A flow network is a directed graph where each edge has a capacity and each edge receives a flow.
MaximumFlowAlgorithmBase<V,E>	Base class backing algorithms allowing to derive maximum-flow from the supplied flow network
PushRelabelMFImpl<V,E>	Push-relabel maximum flow algorithm designed by Andrew V.

Package org.jgrapht.alg.flow Description

Flow related algorithms.