Package edu.uci.ics.jung.algorithms.flows
package edu.uci.ics.jung.algorithms.flows
Methods for calculating properties relating to network flows (such as max flow/min cut).
-
ClassesClassDescriptionEdmondsKarpMaxFlow<V,
E> Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem.