V
- graph vertex typeE
- graph edge typepublic interface MinimumCostFlowAlgorithm<V,E> extends FlowAlgorithm<V,E>
For more information see: K. Ahuja, Ravindra & L. Magnanti, Thomas & Orlin, James. (1993). Network Flows.
Modifier and Type | Interface and Description |
---|---|
static interface |
MinimumCostFlowAlgorithm.MinimumCostFlow<E>
Represents a minimum cost flow.
|
static class |
MinimumCostFlowAlgorithm.MinimumCostFlowImpl<E>
Default implementation of the
MinimumCostFlowAlgorithm.MinimumCostFlow |
FlowAlgorithm.Flow<E>, FlowAlgorithm.FlowImpl<E>
Modifier and Type | Method and 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.
|
getFlow, getFlowDirection, getFlowMap
MinimumCostFlowAlgorithm.MinimumCostFlow<E> getMinimumCostFlow(MinimumCostFlowProblem<V,E> minimumCostFlowProblem)
minimumCostFlowProblem
- minimum cost flow problemdefault double getFlowCost(MinimumCostFlowProblem<V,E> minimumCostFlowProblem)
minimumCostFlowProblem
- minimum cost flow problemCopyright © 2019. All rights reserved.