- Type Parameters:
V
- graph vertex typeE
- graph edge type
- All Superinterfaces:
FlowAlgorithm<V,
E>
- All Known Implementing Classes:
CapacityScalingMinimumCostFlow
Allows to calculate minimum cost flow on the specified
minimum cost flow problem.
For more information see: K. Ahuja, Ravindra & L. Magnanti, Thomas & Orlin, James. (1993). Network Flows.
- Author:
- Timofey Chudakov
-
Nested Class Summary
Modifier and TypeInterfaceDescriptionstatic interface
Represents a minimum cost flow.static class
Default implementation of theMinimumCostFlowAlgorithm.MinimumCostFlow
Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.FlowAlgorithm
FlowAlgorithm.Flow<E>, FlowAlgorithm.FlowImpl<E>
-
Method Summary
Modifier and TypeMethodDescriptiondefault double
getFlowCost
(MinimumCostFlowProblem<V, E> minimumCostFlowProblem) Returns the objective value (cost) of a solution to the minimum cost flow problem.getMinimumCostFlow
(MinimumCostFlowProblem<V, E> minimumCostFlowProblem) Calculates feasible flow of minimum cost for the minimum cost flow problem.Methods inherited from interface org.jgrapht.alg.interfaces.FlowAlgorithm
getFlow, getFlowDirection, getFlowMap
-
Method Details
-
getMinimumCostFlow
MinimumCostFlowAlgorithm.MinimumCostFlow<E> getMinimumCostFlow(MinimumCostFlowProblem<V, E> minimumCostFlowProblem) Calculates feasible flow of minimum cost for the minimum cost flow problem.- Parameters:
minimumCostFlowProblem
- minimum cost flow problem- Returns:
- minimum cost flow
-
getFlowCost
Returns the objective value (cost) of a solution to the minimum cost flow problem.- Parameters:
minimumCostFlowProblem
- minimum cost flow problem- Returns:
- the objective value (cost) of a solution to the minimum cost flow problem.
-