Package edu.uci.ics.jung.algorithms.flows

Methods for calculating properties relating to network flows (such as max flow/min cut).

See: Description

Class Summary

Class	Description
EdmondsKarpMaxFlow<V,E>	Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem.
TestEdmondsKarpMaxFlow

Package edu.uci.ics.jung.algorithms.flows Description

Methods for calculating properties relating to network flows (such as max flow/min cut).