graph_csharp_wrap.cc

Go to the documentation of this file.

/* ----------------------------------------------------------------------------
 * This file was automatically generated by SWIG (http://www.swig.org).
 * Version 4.0.2
 *
 * This file is not intended to be easily readable and contains a number of
 * coding conventions designed to improve portability and efficiency. Do not make
 * changes to this file unless you know what you are doing--modify the SWIG
 * interface file instead.
 * ----------------------------------------------------------------------------- */
 
 
#ifndef SWIGCSHARP
#define SWIGCSHARP
#endif
 
 
 
#ifdef __cplusplus
/* SwigValueWrapper is described in swig.swg */
template<typename T> class SwigValueWrapper {
  struct SwigMovePointer {
    T *ptr;
    SwigMovePointer(T *p) : ptr(p) { }
    ~SwigMovePointer() { delete ptr; }
    SwigMovePointer& operator=(SwigMovePointer& rhs) { T* oldptr = ptr; ptr = 0; delete oldptr; ptr = rhs.ptr; rhs.ptr = 0; return *this; }
  } pointer;
  SwigValueWrapper& operator=(const SwigValueWrapper<T>& rhs);
  SwigValueWrapper(const SwigValueWrapper<T>& rhs);
public:
  SwigValueWrapper() : pointer(0) { }
  SwigValueWrapper& operator=(const T& t) { SwigMovePointer tmp(new T(t)); pointer = tmp; return *this; }
  operator T&() const { return *pointer.ptr; }
  T *operator&() { return pointer.ptr; }
};
 
template <typename T> T SwigValueInit() {
  return T();
}
#endif
 
/* -----------------------------------------------------------------------------
 *  This section contains generic SWIG labels for method/variable
 *  declarations/attributes, and other compiler dependent labels.
 * ----------------------------------------------------------------------------- */
 
/* template workaround for compilers that cannot correctly implement the C++ standard */
#ifndef SWIGTEMPLATEDISAMBIGUATOR
# if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
#  define SWIGTEMPLATEDISAMBIGUATOR template
# elif defined(__HP_aCC)
/* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
/* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
#  define SWIGTEMPLATEDISAMBIGUATOR template
# else
#  define SWIGTEMPLATEDISAMBIGUATOR
# endif
#endif
 
/* inline attribute */
#ifndef SWIGINLINE
# if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
#   define SWIGINLINE inline
# else
#   define SWIGINLINE
# endif
#endif
 
/* attribute recognised by some compilers to avoid 'unused' warnings */
#ifndef SWIGUNUSED
# if defined(__GNUC__)
#   if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
#     define SWIGUNUSED __attribute__ ((__unused__))
#   else
#     define SWIGUNUSED
#   endif
# elif defined(__ICC)
#   define SWIGUNUSED __attribute__ ((__unused__))
# else
#   define SWIGUNUSED
# endif
#endif
 
#ifndef SWIG_MSC_UNSUPPRESS_4505
# if defined(_MSC_VER)
#   pragma warning(disable : 4505) /* unreferenced local function has been removed */
# endif
#endif
 
#ifndef SWIGUNUSEDPARM
# ifdef __cplusplus
#   define SWIGUNUSEDPARM(p)
# else
#   define SWIGUNUSEDPARM(p) p SWIGUNUSED
# endif
#endif
 
/* internal SWIG method */
#ifndef SWIGINTERN
# define SWIGINTERN static SWIGUNUSED
#endif
 
/* internal inline SWIG method */
#ifndef SWIGINTERNINLINE
# define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
#endif
 
/* exporting methods */
#if defined(__GNUC__)
#  if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
#    ifndef GCC_HASCLASSVISIBILITY
#      define GCC_HASCLASSVISIBILITY
#    endif
#  endif
#endif
 
#ifndef SWIGEXPORT
# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
#   if defined(STATIC_LINKED)
#     define SWIGEXPORT
#   else
#     define SWIGEXPORT __declspec(dllexport)
#   endif
# else
#   if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
#     define SWIGEXPORT __attribute__ ((visibility("default")))
#   else
#     define SWIGEXPORT
#   endif
# endif
#endif
 
/* calling conventions for Windows */
#ifndef SWIGSTDCALL
# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
#   define SWIGSTDCALL __stdcall
# else
#   define SWIGSTDCALL
# endif
#endif
 
/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
#if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
# define _CRT_SECURE_NO_DEPRECATE
#endif
 
/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
# define _SCL_SECURE_NO_DEPRECATE
#endif
 
/* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
#if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
# define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
#endif
 
/* Intel's compiler complains if a variable which was never initialised is
 * cast to void, which is a common idiom which we use to indicate that we
 * are aware a variable isn't used.  So we just silence that warning.
 * See: https://github.com/swig/swig/issues/192 for more discussion.
 */
#ifdef __INTEL_COMPILER
# pragma warning disable 592
#endif
 
 
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
 
 
/* Support for throwing C# exceptions from C/C++. There are two types: 
 * Exceptions that take a message and ArgumentExceptions that take a message and a parameter name. */
typedef enum {
  SWIG_CSharpApplicationException,
  SWIG_CSharpArithmeticException,
  SWIG_CSharpDivideByZeroException,
  SWIG_CSharpIndexOutOfRangeException,
  SWIG_CSharpInvalidCastException,
  SWIG_CSharpInvalidOperationException,
  SWIG_CSharpIOException,
  SWIG_CSharpNullReferenceException,
  SWIG_CSharpOutOfMemoryException,
  SWIG_CSharpOverflowException,
  SWIG_CSharpSystemException
} SWIG_CSharpExceptionCodes;
 
typedef enum {
  SWIG_CSharpArgumentException,
  SWIG_CSharpArgumentNullException,
  SWIG_CSharpArgumentOutOfRangeException
} SWIG_CSharpExceptionArgumentCodes;
 
typedef void (SWIGSTDCALL* SWIG_CSharpExceptionCallback_t)(const char *);
typedef void (SWIGSTDCALL* SWIG_CSharpExceptionArgumentCallback_t)(const char *, const char *);
 
typedef struct {
  SWIG_CSharpExceptionCodes code;
  SWIG_CSharpExceptionCallback_t callback;
} SWIG_CSharpException_t;
 
typedef struct {
  SWIG_CSharpExceptionArgumentCodes code;
  SWIG_CSharpExceptionArgumentCallback_t callback;
} SWIG_CSharpExceptionArgument_t;
 
static SWIG_CSharpException_t SWIG_csharp_exceptions[] = {
  { SWIG_CSharpApplicationException, NULL },
  { SWIG_CSharpArithmeticException, NULL },
  { SWIG_CSharpDivideByZeroException, NULL },
  { SWIG_CSharpIndexOutOfRangeException, NULL },
  { SWIG_CSharpInvalidCastException, NULL },
  { SWIG_CSharpInvalidOperationException, NULL },
  { SWIG_CSharpIOException, NULL },
  { SWIG_CSharpNullReferenceException, NULL },
  { SWIG_CSharpOutOfMemoryException, NULL },
  { SWIG_CSharpOverflowException, NULL },
  { SWIG_CSharpSystemException, NULL }
};
 
static SWIG_CSharpExceptionArgument_t SWIG_csharp_exceptions_argument[] = {
  { SWIG_CSharpArgumentException, NULL },
  { SWIG_CSharpArgumentNullException, NULL },
  { SWIG_CSharpArgumentOutOfRangeException, NULL }
};
 
static void SWIGUNUSED SWIG_CSharpSetPendingException(SWIG_CSharpExceptionCodes code, const char *msg) {
  SWIG_CSharpExceptionCallback_t callback = SWIG_csharp_exceptions[SWIG_CSharpApplicationException].callback;
  if ((size_t)code < sizeof(SWIG_csharp_exceptions)/sizeof(SWIG_CSharpException_t)) {
    callback = SWIG_csharp_exceptions[code].callback;
  }
  callback(msg);
}
 
static void SWIGUNUSED SWIG_CSharpSetPendingExceptionArgument(SWIG_CSharpExceptionArgumentCodes code, const char *msg, const char *param_name) {
  SWIG_CSharpExceptionArgumentCallback_t callback = SWIG_csharp_exceptions_argument[SWIG_CSharpArgumentException].callback;
  if ((size_t)code < sizeof(SWIG_csharp_exceptions_argument)/sizeof(SWIG_CSharpExceptionArgument_t)) {
    callback = SWIG_csharp_exceptions_argument[code].callback;
  }
  callback(msg, param_name);
}
 
 
#ifdef __cplusplus
extern "C" 
#endif
SWIGEXPORT void SWIGSTDCALL SWIGRegisterExceptionCallbacks_operations_research_graph(
                                                SWIG_CSharpExceptionCallback_t applicationCallback,
                                                SWIG_CSharpExceptionCallback_t arithmeticCallback,
                                                SWIG_CSharpExceptionCallback_t divideByZeroCallback, 
                                                SWIG_CSharpExceptionCallback_t indexOutOfRangeCallback, 
                                                SWIG_CSharpExceptionCallback_t invalidCastCallback,
                                                SWIG_CSharpExceptionCallback_t invalidOperationCallback,
                                                SWIG_CSharpExceptionCallback_t ioCallback,
                                                SWIG_CSharpExceptionCallback_t nullReferenceCallback,
                                                SWIG_CSharpExceptionCallback_t outOfMemoryCallback, 
                                                SWIG_CSharpExceptionCallback_t overflowCallback, 
                                                SWIG_CSharpExceptionCallback_t systemCallback) {
  SWIG_csharp_exceptions[SWIG_CSharpApplicationException].callback = applicationCallback;
  SWIG_csharp_exceptions[SWIG_CSharpArithmeticException].callback = arithmeticCallback;
  SWIG_csharp_exceptions[SWIG_CSharpDivideByZeroException].callback = divideByZeroCallback;
  SWIG_csharp_exceptions[SWIG_CSharpIndexOutOfRangeException].callback = indexOutOfRangeCallback;
  SWIG_csharp_exceptions[SWIG_CSharpInvalidCastException].callback = invalidCastCallback;
  SWIG_csharp_exceptions[SWIG_CSharpInvalidOperationException].callback = invalidOperationCallback;
  SWIG_csharp_exceptions[SWIG_CSharpIOException].callback = ioCallback;
  SWIG_csharp_exceptions[SWIG_CSharpNullReferenceException].callback = nullReferenceCallback;
  SWIG_csharp_exceptions[SWIG_CSharpOutOfMemoryException].callback = outOfMemoryCallback;
  SWIG_csharp_exceptions[SWIG_CSharpOverflowException].callback = overflowCallback;
  SWIG_csharp_exceptions[SWIG_CSharpSystemException].callback = systemCallback;
}
 
#ifdef __cplusplus
extern "C" 
#endif
SWIGEXPORT void SWIGSTDCALL SWIGRegisterExceptionArgumentCallbacks_operations_research_graph(
                                                SWIG_CSharpExceptionArgumentCallback_t argumentCallback,
                                                SWIG_CSharpExceptionArgumentCallback_t argumentNullCallback,
                                                SWIG_CSharpExceptionArgumentCallback_t argumentOutOfRangeCallback) {
  SWIG_csharp_exceptions_argument[SWIG_CSharpArgumentException].callback = argumentCallback;
  SWIG_csharp_exceptions_argument[SWIG_CSharpArgumentNullException].callback = argumentNullCallback;
  SWIG_csharp_exceptions_argument[SWIG_CSharpArgumentOutOfRangeException].callback = argumentOutOfRangeCallback;
}
 
 
/* Callback for returning strings to C# without leaking memory */
typedef char * (SWIGSTDCALL* SWIG_CSharpStringHelperCallback)(const char *);
static SWIG_CSharpStringHelperCallback SWIG_csharp_string_callback = NULL;
 
 
#ifdef __cplusplus
extern "C" 
#endif
SWIGEXPORT void SWIGSTDCALL SWIGRegisterStringCallback_operations_research_graph(SWIG_CSharpStringHelperCallback callback) {
  SWIG_csharp_string_callback = callback;
}
 
 
/* Contract support */
 
#define SWIG_contract_assert(nullreturn, expr, msg) if (!(expr)) {SWIG_CSharpSetPendingExceptionArgument(SWIG_CSharpArgumentOutOfRangeException, msg, ""); return nullreturn; } else
 
 
#include <stdint.h>     // Use the C99 official header
 
 
#include <cstdint>
#include <string>
#include <vector>
 
#include "ortools/base/basictypes.h"
 
 
#include <string>
 
 
#include "ortools/graph/assignment.h"
#include "ortools/graph/max_flow.h"
#include "ortools/graph/min_cost_flow.h"
 
 
#ifdef __cplusplus
extern "C" {
#endif
 
SWIGEXPORT void * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_new_MaxFlow___() {
  void * jresult ;
  operations_research::SimpleMaxFlow *result = 0 ;
  
  result = (operations_research::SimpleMaxFlow *)new operations_research::SimpleMaxFlow();
  jresult = (void *)result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_AddArcWithCapacity___(void * jarg1, int jarg2, int jarg3, long long jarg4) {
  int jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::NodeIndex arg3 ;
  operations_research::FlowQuantity arg4 ;
  operations_research::ArcIndex result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  arg3 = (operations_research::NodeIndex)jarg3; 
  arg4 = (operations_research::FlowQuantity)jarg4; 
  result = (operations_research::ArcIndex)(arg1)->AddArcWithCapacity(arg2,arg3,arg4);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_NumNodes___(void * jarg1) {
  int jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  result = (operations_research::NodeIndex)((operations_research::SimpleMaxFlow const *)arg1)->NumNodes();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_NumArcs___(void * jarg1) {
  int jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::ArcIndex result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  result = (operations_research::ArcIndex)((operations_research::SimpleMaxFlow const *)arg1)->NumArcs();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_Tail___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleMaxFlow const *)arg1)->Tail(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_Head___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleMaxFlow const *)arg1)->Head(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_Capacity___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMaxFlow const *)arg1)->Capacity(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_Solve___(void * jarg1, int jarg2, int jarg3) {
  int jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::NodeIndex arg3 ;
  operations_research::SimpleMaxFlow::Status result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  arg3 = (operations_research::NodeIndex)jarg3; 
  result = (operations_research::SimpleMaxFlow::Status)(arg1)->Solve(arg2,arg3);
  jresult = (int)result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_OptimalFlow___(void * jarg1) {
  long long jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMaxFlow const *)arg1)->OptimalFlow();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MaxFlow_Flow___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMaxFlow const *)arg1)->Flow(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfGraph_delete_MaxFlow___(void * jarg1) {
  operations_research::SimpleMaxFlow *arg1 = (operations_research::SimpleMaxFlow *) 0 ;
  
  arg1 = (operations_research::SimpleMaxFlow *)jarg1; 
  delete arg1;
}
 
 
SWIGEXPORT void * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_new_MinCostFlowBase___() {
  void * jresult ;
  operations_research::MinCostFlowBase *result = 0 ;
  
  result = (operations_research::MinCostFlowBase *)new operations_research::MinCostFlowBase();
  jresult = (void *)result; 
  return jresult;
}
 
 
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfGraph_delete_MinCostFlowBase___(void * jarg1) {
  operations_research::MinCostFlowBase *arg1 = (operations_research::MinCostFlowBase *) 0 ;
  
  arg1 = (operations_research::MinCostFlowBase *)jarg1; 
  delete arg1;
}
 
 
SWIGEXPORT void * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_new_MinCostFlow__SWIG_0___(int jarg1, int jarg2) {
  void * jresult ;
  operations_research::NodeIndex arg1 ;
  operations_research::ArcIndex arg2 ;
  operations_research::SimpleMinCostFlow *result = 0 ;
  
  arg1 = (operations_research::NodeIndex)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::SimpleMinCostFlow *)new operations_research::SimpleMinCostFlow(arg1,arg2);
  jresult = (void *)result; 
  return jresult;
}
 
 
SWIGEXPORT void * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_new_MinCostFlow__SWIG_1___(int jarg1) {
  void * jresult ;
  operations_research::NodeIndex arg1 ;
  operations_research::SimpleMinCostFlow *result = 0 ;
  
  arg1 = (operations_research::NodeIndex)jarg1; 
  result = (operations_research::SimpleMinCostFlow *)new operations_research::SimpleMinCostFlow(arg1);
  jresult = (void *)result; 
  return jresult;
}
 
 
SWIGEXPORT void * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_new_MinCostFlow__SWIG_2___() {
  void * jresult ;
  operations_research::SimpleMinCostFlow *result = 0 ;
  
  result = (operations_research::SimpleMinCostFlow *)new operations_research::SimpleMinCostFlow();
  jresult = (void *)result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_AddArcWithCapacityAndUnitCost___(void * jarg1, int jarg2, int jarg3, long long jarg4, long long jarg5) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::NodeIndex arg3 ;
  operations_research::FlowQuantity arg4 ;
  operations_research::CostValue arg5 ;
  operations_research::ArcIndex result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  arg3 = (operations_research::NodeIndex)jarg3; 
  arg4 = (operations_research::FlowQuantity)jarg4; 
  arg5 = (operations_research::CostValue)jarg5; 
  result = (operations_research::ArcIndex)(arg1)->AddArcWithCapacityAndUnitCost(arg2,arg3,arg4,arg5);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_SetNodeSupply___(void * jarg1, int jarg2, long long jarg3) {
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::FlowQuantity arg3 ;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  arg3 = (operations_research::FlowQuantity)jarg3; 
  (arg1)->SetNodeSupply(arg2,arg3);
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_Solve___(void * jarg1) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::MinCostFlowBase::Status result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  result = (operations_research::MinCostFlowBase::Status)(arg1)->Solve();
  jresult = (int)result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_SolveMaxFlowWithMinCost___(void * jarg1) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::MinCostFlowBase::Status result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  result = (operations_research::MinCostFlowBase::Status)(arg1)->SolveMaxFlowWithMinCost();
  jresult = (int)result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_OptimalCost___(void * jarg1) {
  long long jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::CostValue result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  result = (operations_research::CostValue)((operations_research::SimpleMinCostFlow const *)arg1)->OptimalCost();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_MaximumFlow___(void * jarg1) {
  long long jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMinCostFlow const *)arg1)->MaximumFlow();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_Flow___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMinCostFlow const *)arg1)->Flow(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_NumNodes___(void * jarg1) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  result = (operations_research::NodeIndex)((operations_research::SimpleMinCostFlow const *)arg1)->NumNodes();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_NumArcs___(void * jarg1) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::ArcIndex result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  result = (operations_research::ArcIndex)((operations_research::SimpleMinCostFlow const *)arg1)->NumArcs();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_Tail___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleMinCostFlow const *)arg1)->Tail(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_Head___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleMinCostFlow const *)arg1)->Head(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_Capacity___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMinCostFlow const *)arg1)->Capacity(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_Supply___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::FlowQuantity result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  result = (operations_research::FlowQuantity)((operations_research::SimpleMinCostFlow const *)arg1)->Supply(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_UnitCost___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::CostValue result;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::CostValue)((operations_research::SimpleMinCostFlow const *)arg1)->UnitCost(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfGraph_delete_MinCostFlow___(void * jarg1) {
  operations_research::SimpleMinCostFlow *arg1 = (operations_research::SimpleMinCostFlow *) 0 ;
  
  arg1 = (operations_research::SimpleMinCostFlow *)jarg1; 
  delete arg1;
}
 
 
SWIGEXPORT void * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_new_LinearSumAssignment___() {
  void * jresult ;
  operations_research::SimpleLinearSumAssignment *result = 0 ;
  
  result = (operations_research::SimpleLinearSumAssignment *)new operations_research::SimpleLinearSumAssignment();
  jresult = (void *)result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_AddArcWithCost___(void * jarg1, int jarg2, int jarg3, long long jarg4) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::NodeIndex arg3 ;
  operations_research::CostValue arg4 ;
  operations_research::ArcIndex result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  arg3 = (operations_research::NodeIndex)jarg3; 
  arg4 = (operations_research::CostValue)jarg4; 
  result = (operations_research::ArcIndex)(arg1)->AddArcWithCost(arg2,arg3,arg4);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_NumNodes___(void * jarg1) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  result = (operations_research::NodeIndex)((operations_research::SimpleLinearSumAssignment const *)arg1)->NumNodes();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_NumArcs___(void * jarg1) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::ArcIndex result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  result = (operations_research::ArcIndex)((operations_research::SimpleLinearSumAssignment const *)arg1)->NumArcs();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_LeftNode___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleLinearSumAssignment const *)arg1)->LeftNode(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_RightNode___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleLinearSumAssignment const *)arg1)->RightNode(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_Cost___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::ArcIndex arg2 ;
  operations_research::CostValue result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  arg2 = (operations_research::ArcIndex)jarg2; 
  result = (operations_research::CostValue)((operations_research::SimpleLinearSumAssignment const *)arg1)->Cost(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_Solve___(void * jarg1) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::SimpleLinearSumAssignment::Status result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  result = (operations_research::SimpleLinearSumAssignment::Status)(arg1)->Solve();
  jresult = (int)result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_OptimalCost___(void * jarg1) {
  long long jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::CostValue result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  result = (operations_research::CostValue)((operations_research::SimpleLinearSumAssignment const *)arg1)->OptimalCost();
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_RightMate___(void * jarg1, int jarg2) {
  int jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::NodeIndex result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  result = (operations_research::NodeIndex)((operations_research::SimpleLinearSumAssignment const *)arg1)->RightMate(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfGraph_LinearSumAssignment_AssignmentCost___(void * jarg1, int jarg2) {
  long long jresult ;
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  operations_research::NodeIndex arg2 ;
  operations_research::CostValue result;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  arg2 = (operations_research::NodeIndex)jarg2; 
  result = (operations_research::CostValue)((operations_research::SimpleLinearSumAssignment const *)arg1)->AssignmentCost(arg2);
  jresult = result; 
  return jresult;
}
 
 
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfGraph_delete_LinearSumAssignment___(void * jarg1) {
  operations_research::SimpleLinearSumAssignment *arg1 = (operations_research::SimpleLinearSumAssignment *) 0 ;
  
  arg1 = (operations_research::SimpleLinearSumAssignment *)jarg1; 
  delete arg1;
}
 
 
SWIGEXPORT operations_research::MinCostFlowBase * SWIGSTDCALL CSharp_GooglefOrToolsfGraph_MinCostFlow_SWIGUpcast___(operations_research::SimpleMinCostFlow *jarg1) {
    return (operations_research::MinCostFlowBase *)jarg1;
}
 
#ifdef __cplusplus
}
#endif