Interface MinimumCostFlowAlgorithm<V,E>

Type Parameters:
V - graph vertex type
E - 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
  • 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

      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.