MinimumCostFlowAlgorithm.MinimumCostFlow (JGraphT : a free Java graph library)

Type Parameters:

E - graph edge type

All Superinterfaces:

FlowAlgorithm.Flow<E>

All Known Implementing Classes:

MinimumCostFlowAlgorithm.MinimumCostFlowImpl

Enclosing interface:

MinimumCostFlowAlgorithm<V,E>
```
public static interface MinimumCostFlowAlgorithm.MinimumCostFlow<E>
extends FlowAlgorithm.Flow<E>
```
Represents a minimum cost flow.

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  double getCost()
  Returns the cost of the flow
  - Methods inherited from interface org.jgrapht.alg.interfaces.FlowAlgorithm.Flow
    getFlow, getFlowMap

- Method Detail
  - getCost
```
double getCost()
```
    Returns the cost of the flow
    
    Returns:
    
    the cost of the flow