E - graph edge typepublic static class MinimumCostFlowAlgorithm.MinimumCostFlowImpl<E> extends FlowAlgorithm.FlowImpl<E> implements MinimumCostFlowAlgorithm.MinimumCostFlow<E>
MinimumCostFlowAlgorithm.MinimumCostFlow| Constructor and Description |
|---|
MinimumCostFlowImpl(double cost,
java.util.Map<E,java.lang.Double> flowMap)
Constructs a new instance of minimum cost flow
|
| Modifier and Type | Method and Description |
|---|---|
double |
getCost()
Returns the cost of the flow
|
getFlowMapclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetFlow, getFlowMappublic MinimumCostFlowImpl(double cost,
java.util.Map<E,java.lang.Double> flowMap)
cost - the cost of the flowflowMap - the mapping defining the flow on the networkpublic double getCost()
getCost in interface MinimumCostFlowAlgorithm.MinimumCostFlow<E>Copyright © 2019. All Rights Reserved.