Package org.jgrapht.alg.flow.mincost

Algorithms for minimum cost flow

See: Description

Interface Summary

Interface	Description
MinimumCostFlowProblem<V,E>	This class represents a minimum cost flow problem.

Class Summary

Class	Description
CapacityScalingMinimumCostFlow<V,E>	This class computes a solution to a minimum cost flow problem using the successive shortest path algorithm with capacity scaling.
MinimumCostFlowProblem.MinimumCostFlowProblemImpl<V,E>	Default implementation of a Minimum Cost Flow Problem

Package org.jgrapht.alg.flow.mincost Description

Algorithms for minimum cost flow