-
- Type Parameters:
V
- graph vertex typeE
- graph edge type
- All Superinterfaces:
FlowAlgorithm<V,E>
- All Known Implementing Classes:
CapacityScalingMinimumCostFlow
public interface MinimumCostFlowAlgorithm<V,E> extends FlowAlgorithm<V,E>
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
Nested Classes Modifier and Type Interface Description static interface
MinimumCostFlowAlgorithm.MinimumCostFlow<E>
Represents a minimum cost flow.static class
MinimumCostFlowAlgorithm.MinimumCostFlowImpl<E>
Default implementation of theMinimumCostFlowAlgorithm.MinimumCostFlow
-
Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.FlowAlgorithm
FlowAlgorithm.Flow<E>, FlowAlgorithm.FlowImpl<E>
-
-
Method Summary
All Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description default double
getFlowCost(MinimumCostFlowProblem<V,E> minimumCostFlowProblem)
Returns the objective value (cost) of a solution to the minimum cost flow problem.MinimumCostFlowAlgorithm.MinimumCostFlow<E>
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 Detail
-
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
default double getFlowCost(MinimumCostFlowProblem<V,E> minimumCostFlowProblem)
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.
-
-