MaxFlow.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 MaxFlow : global::System.IDisposable {
  private global::System.Runtime.InteropServices.HandleRef swigCPtr;
  protected bool swigCMemOwn;
 
  internal MaxFlow(global::System.IntPtr cPtr, bool cMemoryOwn) {
    swigCMemOwn = cMemoryOwn;
    swigCPtr = new global::System.Runtime.InteropServices.HandleRef(this, cPtr);
  }
 
  internal static global::System.Runtime.InteropServices.HandleRef getCPtr(MaxFlow obj) {
    return (obj == null) ? new global::System.Runtime.InteropServices.HandleRef(null, global::System.IntPtr.Zero) : obj.swigCPtr;
  }
 
  ~MaxFlow() {
    Dispose(false);
  }
 
  public void Dispose() {
    Dispose(true);
    global::System.GC.SuppressFinalize(this);
  }
 
  protected virtual void Dispose(bool disposing) {
    lock(this) {
      if (swigCPtr.Handle != global::System.IntPtr.Zero) {
        if (swigCMemOwn) {
          swigCMemOwn = false;
          operations_research_graphPINVOKE.delete_MaxFlow(swigCPtr);
        }
        swigCPtr = new global::System.Runtime.InteropServices.HandleRef(null, global::System.IntPtr.Zero);
      }
    }
  }
 
  public MaxFlow() : this(operations_research_graphPINVOKE.new_MaxFlow(), true) {
  }
 
  public int AddArcWithCapacity(int tail, int head, long capacity) {
    int ret = operations_research_graphPINVOKE.MaxFlow_AddArcWithCapacity(swigCPtr, tail, head, capacity);
    return ret;
  }
 
  public int NumNodes() {
    int ret = operations_research_graphPINVOKE.MaxFlow_NumNodes(swigCPtr);
    return ret;
  }
 
  public int NumArcs() {
    int ret = operations_research_graphPINVOKE.MaxFlow_NumArcs(swigCPtr);
    return ret;
  }
 
  public int Tail(int arc) {
    int ret = operations_research_graphPINVOKE.MaxFlow_Tail(swigCPtr, arc);
    return ret;
  }
 
  public int Head(int arc) {
    int ret = operations_research_graphPINVOKE.MaxFlow_Head(swigCPtr, arc);
    return ret;
  }
 
  public long Capacity(int arc) {
    long ret = operations_research_graphPINVOKE.MaxFlow_Capacity(swigCPtr, arc);
    return ret;
  }
 
  public MaxFlow.Status Solve(int source, int sink) {
    MaxFlow.Status ret = (MaxFlow.Status)operations_research_graphPINVOKE.MaxFlow_Solve(swigCPtr, source, sink);
    return ret;
  }
 
  public long OptimalFlow() {
    long ret = operations_research_graphPINVOKE.MaxFlow_OptimalFlow(swigCPtr);
    return ret;
  }
 
  public long Flow(int arc) {
    long ret = operations_research_graphPINVOKE.MaxFlow_Flow(swigCPtr, arc);
    return ret;
  }
 
  public enum Status {
    OPTIMAL,
    POSSIBLE_OVERFLOW,
    BAD_INPUT,
    BAD_RESULT
  }
 
}
 
}