LinearSumAssignment.cs

Go to the documentation of this file.

//------------------------------------------------------------------------------
// <auto-generated />
//
// This file was automatically generated by SWIG (http://www.swig.org).
// Version 3.0.12
//
// 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 LinearSumAssignment : global::System.IDisposable {
  private global::System.Runtime.InteropServices.HandleRef swigCPtr;
  protected bool swigCMemOwn;

  internal LinearSumAssignment(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(LinearSumAssignment obj) {
    return (obj == null) ? new global::System.Runtime.InteropServices.HandleRef(null, global::System.IntPtr.Zero) : obj.swigCPtr;
  }

  ~LinearSumAssignment() {
    Dispose();
  }

  public virtual void Dispose() {
    lock(this) {
      if (swigCPtr.Handle != global::System.IntPtr.Zero) {
        if (swigCMemOwn) {
          swigCMemOwn = false;
          operations_research_graphPINVOKE.delete_LinearSumAssignment(swigCPtr);
        }
        swigCPtr = new global::System.Runtime.InteropServices.HandleRef(null, global::System.IntPtr.Zero);
      }
      global::System.GC.SuppressFinalize(this);
    }
  }

  public LinearSumAssignment() : this(operations_research_graphPINVOKE.new_LinearSumAssignment(), true) {
  }

  public int AddArcWithCost(int left_node, int right_node, long cost) {
    int ret = operations_research_graphPINVOKE.LinearSumAssignment_AddArcWithCost(swigCPtr, left_node, right_node, cost);
    return ret;
  }

  public int NumNodes() {
    int ret = operations_research_graphPINVOKE.LinearSumAssignment_NumNodes(swigCPtr);
    return ret;
  }

  public int NumArcs() {
    int ret = operations_research_graphPINVOKE.LinearSumAssignment_NumArcs(swigCPtr);
    return ret;
  }

  public int LeftNode(int arc) {
    int ret = operations_research_graphPINVOKE.LinearSumAssignment_LeftNode(swigCPtr, arc);
    return ret;
  }

  public int RightNode(int arc) {
    int ret = operations_research_graphPINVOKE.LinearSumAssignment_RightNode(swigCPtr, arc);
    return ret;
  }

  public long Cost(int arc) {
    long ret = operations_research_graphPINVOKE.LinearSumAssignment_Cost(swigCPtr, arc);
    return ret;
  }

  public LinearSumAssignment.Status Solve() {
    LinearSumAssignment.Status ret = (LinearSumAssignment.Status)operations_research_graphPINVOKE.LinearSumAssignment_Solve(swigCPtr);
    return ret;
  }

  public long OptimalCost() {
    long ret = operations_research_graphPINVOKE.LinearSumAssignment_OptimalCost(swigCPtr);
    return ret;
  }

  public int RightMate(int left_node) {
    int ret = operations_research_graphPINVOKE.LinearSumAssignment_RightMate(swigCPtr, left_node);
    return ret;
  }

  public long AssignmentCost(int left_node) {
    long ret = operations_research_graphPINVOKE.LinearSumAssignment_AssignmentCost(swigCPtr, left_node);
    return ret;
  }

  public enum Status {
    OPTIMAL,
    INFEASIBLE,
    POSSIBLE_OVERFLOW
  }

}

}