MinCostFlow.cs

Go to the documentation of this file.

//------------------------------------------------------------------------------
// <auto-generated />
//
// This file was automatically generated by SWIG (http://www.swig.org).
// Version 4.0.2
//
// Do not make changes to this file unless you know what you are doing--modify
// the SWIG interface file instead.
//------------------------------------------------------------------------------
 
namespace Google.OrTools.Graph {
 
public class MinCostFlow : MinCostFlowBase {
  private global::System.Runtime.InteropServices.HandleRef swigCPtr;
 
  internal MinCostFlow(global::System.IntPtr cPtr, bool cMemoryOwn) : base(operations_research_graphPINVOKE.MinCostFlow_SWIGUpcast(cPtr), cMemoryOwn) {
    swigCPtr = new global::System.Runtime.InteropServices.HandleRef(this, cPtr);
  }
 
  internal static global::System.Runtime.InteropServices.HandleRef getCPtr(MinCostFlow obj) {
    return (obj == null) ? new global::System.Runtime.InteropServices.HandleRef(null, global::System.IntPtr.Zero) : obj.swigCPtr;
  }
 
  protected override void Dispose(bool disposing) {
    lock(this) {
      if (swigCPtr.Handle != global::System.IntPtr.Zero) {
        if (swigCMemOwn) {
          swigCMemOwn = false;
          operations_research_graphPINVOKE.delete_MinCostFlow(swigCPtr);
        }
        swigCPtr = new global::System.Runtime.InteropServices.HandleRef(null, global::System.IntPtr.Zero);
      }
      base.Dispose(disposing);
    }
  }
 
  public MinCostFlow(int reserve_num_nodes, int reserve_num_arcs) : this(operations_research_graphPINVOKE.new_MinCostFlow__SWIG_0(reserve_num_nodes, reserve_num_arcs), true) {
  }
 
  public MinCostFlow(int reserve_num_nodes) : this(operations_research_graphPINVOKE.new_MinCostFlow__SWIG_1(reserve_num_nodes), true) {
  }
 
  public MinCostFlow() : this(operations_research_graphPINVOKE.new_MinCostFlow__SWIG_2(), true) {
  }
 
  public int AddArcWithCapacityAndUnitCost(int tail, int head, long capacity, long unit_cost) {
    int ret = operations_research_graphPINVOKE.MinCostFlow_AddArcWithCapacityAndUnitCost(swigCPtr, tail, head, capacity, unit_cost);
    return ret;
  }
 
  public void SetNodeSupply(int node, long supply) {
    operations_research_graphPINVOKE.MinCostFlow_SetNodeSupply(swigCPtr, node, supply);
  }
 
  public MinCostFlowBase.Status Solve() {
    MinCostFlowBase.Status ret = (MinCostFlowBase.Status)operations_research_graphPINVOKE.MinCostFlow_Solve(swigCPtr);
    return ret;
  }
 
  public MinCostFlowBase.Status SolveMaxFlowWithMinCost() {
    MinCostFlowBase.Status ret = (MinCostFlowBase.Status)operations_research_graphPINVOKE.MinCostFlow_SolveMaxFlowWithMinCost(swigCPtr);
    return ret;
  }
 
  public long OptimalCost() {
    long ret = operations_research_graphPINVOKE.MinCostFlow_OptimalCost(swigCPtr);
    return ret;
  }
 
  public long MaximumFlow() {
    long ret = operations_research_graphPINVOKE.MinCostFlow_MaximumFlow(swigCPtr);
    return ret;
  }
 
  public long Flow(int arc) {
    long ret = operations_research_graphPINVOKE.MinCostFlow_Flow(swigCPtr, arc);
    return ret;
  }
 
  public int NumNodes() {
    int ret = operations_research_graphPINVOKE.MinCostFlow_NumNodes(swigCPtr);
    return ret;
  }
 
  public int NumArcs() {
    int ret = operations_research_graphPINVOKE.MinCostFlow_NumArcs(swigCPtr);
    return ret;
  }
 
  public int Tail(int arc) {
    int ret = operations_research_graphPINVOKE.MinCostFlow_Tail(swigCPtr, arc);
    return ret;
  }
 
  public int Head(int arc) {
    int ret = operations_research_graphPINVOKE.MinCostFlow_Head(swigCPtr, arc);
    return ret;
  }
 
  public long Capacity(int arc) {
    long ret = operations_research_graphPINVOKE.MinCostFlow_Capacity(swigCPtr, arc);
    return ret;
  }
 
  public long Supply(int node) {
    long ret = operations_research_graphPINVOKE.MinCostFlow_Supply(swigCPtr, node);
    return ret;
  }
 
  public long UnitCost(int arc) {
    long ret = operations_research_graphPINVOKE.MinCostFlow_UnitCost(swigCPtr, arc);
    return ret;
  }
 
}
 
}