# Package org.jgrapht.alg.flow

- Class Summary
  Class | Description
  --- | ---
  EdmondsKarpMaximumFlow<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
  PushRelabelMaximumFlow<V,E> | Push-relabel maximum flow algorithm designed by Andrew V.

Copyright © 2016. All rights reserved.