OR-Tools  9.1
graph_java_wrap.cc
Go to the documentation of this file.
1/* ----------------------------------------------------------------------------
2 * This file was automatically generated by SWIG (http://www.swig.org).
3 * Version 4.0.2
4 *
5 * This file is not intended to be easily readable and contains a number of
6 * coding conventions designed to improve portability and efficiency. Do not make
7 * changes to this file unless you know what you are doing--modify the SWIG
8 * interface file instead.
9 * ----------------------------------------------------------------------------- */
10
11
12#ifndef SWIGJAVA
13#define SWIGJAVA
14#endif
15
16
17
18#ifdef __cplusplus
19/* SwigValueWrapper is described in swig.swg */
20template<typename T> class SwigValueWrapper {
21 struct SwigMovePointer {
22 T *ptr;
23 SwigMovePointer(T *p) : ptr(p) { }
24 ~SwigMovePointer() { delete ptr; }
25 SwigMovePointer& operator=(SwigMovePointer& rhs) { T* oldptr = ptr; ptr = 0; delete oldptr; ptr = rhs.ptr; rhs.ptr = 0; return *this; }
26 } pointer;
27 SwigValueWrapper& operator=(const SwigValueWrapper<T>& rhs);
28 SwigValueWrapper(const SwigValueWrapper<T>& rhs);
29public:
30 SwigValueWrapper() : pointer(0) { }
31 SwigValueWrapper& operator=(const T& t) { SwigMovePointer tmp(new T(t)); pointer = tmp; return *this; }
32 operator T&() const { return *pointer.ptr; }
33 T *operator&() { return pointer.ptr; }
34};
35
36template <typename T> T SwigValueInit() {
37 return T();
38}
39#endif
40
41/* -----------------------------------------------------------------------------
42 * This section contains generic SWIG labels for method/variable
43 * declarations/attributes, and other compiler dependent labels.
44 * ----------------------------------------------------------------------------- */
45
46/* template workaround for compilers that cannot correctly implement the C++ standard */
47#ifndef SWIGTEMPLATEDISAMBIGUATOR
48# if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
49# define SWIGTEMPLATEDISAMBIGUATOR template
50# elif defined(__HP_aCC)
51/* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
52/* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
53# define SWIGTEMPLATEDISAMBIGUATOR template
54# else
55# define SWIGTEMPLATEDISAMBIGUATOR
56# endif
57#endif
58
59/* inline attribute */
60#ifndef SWIGINLINE
61# if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
62# define SWIGINLINE inline
63# else
64# define SWIGINLINE
65# endif
66#endif
67
68/* attribute recognised by some compilers to avoid 'unused' warnings */
69#ifndef SWIGUNUSED
70# if defined(__GNUC__)
71# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
72# define SWIGUNUSED __attribute__ ((__unused__))
73# else
74# define SWIGUNUSED
75# endif
76# elif defined(__ICC)
77# define SWIGUNUSED __attribute__ ((__unused__))
78# else
79# define SWIGUNUSED
80# endif
81#endif
82
83#ifndef SWIG_MSC_UNSUPPRESS_4505
84# if defined(_MSC_VER)
85# pragma warning(disable : 4505) /* unreferenced local function has been removed */
86# endif
87#endif
88
89#ifndef SWIGUNUSEDPARM
90# ifdef __cplusplus
91# define SWIGUNUSEDPARM(p)
92# else
93# define SWIGUNUSEDPARM(p) p SWIGUNUSED
94# endif
95#endif
96
97/* internal SWIG method */
98#ifndef SWIGINTERN
99# define SWIGINTERN static SWIGUNUSED
100#endif
101
102/* internal inline SWIG method */
103#ifndef SWIGINTERNINLINE
104# define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
105#endif
106
107/* exporting methods */
108#if defined(__GNUC__)
109# if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
110# ifndef GCC_HASCLASSVISIBILITY
111# define GCC_HASCLASSVISIBILITY
112# endif
113# endif
114#endif
115
116#ifndef SWIGEXPORT
117# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
118# if defined(STATIC_LINKED)
119# define SWIGEXPORT
120# else
121# define SWIGEXPORT __declspec(dllexport)
122# endif
123# else
124# if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
125# define SWIGEXPORT __attribute__ ((visibility("default")))
126# else
127# define SWIGEXPORT
128# endif
129# endif
130#endif
131
132/* calling conventions for Windows */
133#ifndef SWIGSTDCALL
134# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
135# define SWIGSTDCALL __stdcall
136# else
137# define SWIGSTDCALL
138# endif
139#endif
140
141/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
142#if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
143# define _CRT_SECURE_NO_DEPRECATE
144#endif
145
146/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
147#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
148# define _SCL_SECURE_NO_DEPRECATE
149#endif
150
151/* Deal with Apple's deprecated 'AssertMacros.h' from Carbon-framework */
152#if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
153# define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
154#endif
155
156/* Intel's compiler complains if a variable which was never initialised is
157 * cast to void, which is a common idiom which we use to indicate that we
158 * are aware a variable isn't used. So we just silence that warning.
159 * See: https://github.com/swig/swig/issues/192 for more discussion.
160 */
161#ifdef __INTEL_COMPILER
162# pragma warning disable 592
163#endif
164
165
166/* Fix for jlong on some versions of gcc on Windows */
167#if defined(__GNUC__) && !defined(__INTEL_COMPILER)
168 typedef long long __int64;
169#endif
170
171/* Fix for jlong on 64-bit x86 Solaris */
172#if defined(__x86_64)
173# ifdef _LP64
174# undef _LP64
175# endif
176#endif
177
178#include <jni.h>
179#include <stdlib.h>
180#include <string.h>
181
182
183/* Support for throwing Java exceptions */
184typedef enum {
196
197typedef struct {
199 const char *java_exception;
201
202
203static void SWIGUNUSED SWIG_JavaThrowException(JNIEnv *jenv, SWIG_JavaExceptionCodes code, const char *msg) {
204 jclass excep;
205 static const SWIG_JavaExceptions_t java_exceptions[] = {
206 { SWIG_JavaOutOfMemoryError, "java/lang/OutOfMemoryError" },
207 { SWIG_JavaIOException, "java/io/IOException" },
208 { SWIG_JavaRuntimeException, "java/lang/RuntimeException" },
209 { SWIG_JavaIndexOutOfBoundsException, "java/lang/IndexOutOfBoundsException" },
210 { SWIG_JavaArithmeticException, "java/lang/ArithmeticException" },
211 { SWIG_JavaIllegalArgumentException, "java/lang/IllegalArgumentException" },
212 { SWIG_JavaNullPointerException, "java/lang/NullPointerException" },
213 { SWIG_JavaDirectorPureVirtual, "java/lang/RuntimeException" },
214 { SWIG_JavaUnknownError, "java/lang/UnknownError" },
215 { SWIG_JavaIllegalStateException, "java/lang/IllegalStateException" },
216 { (SWIG_JavaExceptionCodes)0, "java/lang/UnknownError" }
217 };
218 const SWIG_JavaExceptions_t *except_ptr = java_exceptions;
219
220 while (except_ptr->code != code && except_ptr->code)
221 except_ptr++;
222
223 jenv->ExceptionClear();
224 excep = jenv->FindClass(except_ptr->java_exception);
225 if (excep)
226 jenv->ThrowNew(excep, msg);
227}
228
229
230/* Contract support */
231
232#define SWIG_contract_assert(nullreturn, expr, msg) if (!(expr)) {SWIG_JavaThrowException(jenv, SWIG_JavaIllegalArgumentException, msg); return nullreturn; } else
233
234
235#include <stdint.h> // Use the C99 official header
236
237
238#define SWIGWORDSIZE64
239#ifndef LONG_MAX
240#include <limits.h>
241#endif
242#if (__WORDSIZE == 32) || (LONG_MAX == INT_MAX)
243# error "SWIG wrapped code invalid in 32 bit architecture, regenerate code using -DSWIGWORDSIZE32"
244#endif
245
246
247#include <cstdint>
248#include <string>
249#include <vector>
250
252
253
254#include <string>
255
256
260
261
262#ifdef __cplusplus
263extern "C" {
264#endif
265
266SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MaxFlow(JNIEnv *jenv, jclass jcls) {
267 jlong jresult = 0 ;
269
270 (void)jenv;
271 (void)jcls;
273 *(operations_research::SimpleMaxFlow **)&jresult = result;
274 return jresult;
275}
276
277
278SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1addArcWithCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3, jlong jarg4) {
279 jint jresult = 0 ;
285
286 (void)jenv;
287 (void)jcls;
288 (void)jarg1_;
289 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
290 arg2 = (operations_research::NodeIndex)jarg2;
291 arg3 = (operations_research::NodeIndex)jarg3;
293 result = (operations_research::ArcIndex)(arg1)->AddArcWithCapacity(arg2,arg3,arg4);
294 jresult = (jint)result;
295 return jresult;
296}
297
298
299SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getNumNodes(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
300 jint jresult = 0 ;
303
304 (void)jenv;
305 (void)jcls;
306 (void)jarg1_;
307 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
308 result = (operations_research::NodeIndex)((operations_research::SimpleMaxFlow const *)arg1)->NumNodes();
309 jresult = (jint)result;
310 return jresult;
311}
312
313
314SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getNumArcs(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
315 jint jresult = 0 ;
318
319 (void)jenv;
320 (void)jcls;
321 (void)jarg1_;
322 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
323 result = (operations_research::ArcIndex)((operations_research::SimpleMaxFlow const *)arg1)->NumArcs();
324 jresult = (jint)result;
325 return jresult;
326}
327
328
329SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getTail(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
330 jint jresult = 0 ;
334
335 (void)jenv;
336 (void)jcls;
337 (void)jarg1_;
338 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
339 arg2 = (operations_research::ArcIndex)jarg2;
340 result = (operations_research::NodeIndex)((operations_research::SimpleMaxFlow const *)arg1)->Tail(arg2);
341 jresult = (jint)result;
342 return jresult;
343}
344
345
346SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getHead(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
347 jint jresult = 0 ;
351
352 (void)jenv;
353 (void)jcls;
354 (void)jarg1_;
355 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
356 arg2 = (operations_research::ArcIndex)jarg2;
357 result = (operations_research::NodeIndex)((operations_research::SimpleMaxFlow const *)arg1)->Head(arg2);
358 jresult = (jint)result;
359 return jresult;
360}
361
362
363SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
364 jlong jresult = 0 ;
368
369 (void)jenv;
370 (void)jcls;
371 (void)jarg1_;
372 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
373 arg2 = (operations_research::ArcIndex)jarg2;
374 result = (operations_research::FlowQuantity)((operations_research::SimpleMaxFlow const *)arg1)->Capacity(arg2);
375 jresult = (jlong)result;
376 return jresult;
377}
378
379
380SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1solve(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3) {
381 jint jresult = 0 ;
386
387 (void)jenv;
388 (void)jcls;
389 (void)jarg1_;
390 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
391 arg2 = (operations_research::NodeIndex)jarg2;
392 arg3 = (operations_research::NodeIndex)jarg3;
393 result = (operations_research::SimpleMaxFlow::Status)(arg1)->Solve(arg2,arg3);
394 jresult = (jint)result;
395 return jresult;
396}
397
398
399SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getOptimalFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
400 jlong jresult = 0 ;
403
404 (void)jenv;
405 (void)jcls;
406 (void)jarg1_;
407 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
408 result = (operations_research::FlowQuantity)((operations_research::SimpleMaxFlow const *)arg1)->OptimalFlow();
409 jresult = (jlong)result;
410 return jresult;
411}
412
413
414SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
415 jlong jresult = 0 ;
419
420 (void)jenv;
421 (void)jcls;
422 (void)jarg1_;
423 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
424 arg2 = (operations_research::ArcIndex)jarg2;
425 result = (operations_research::FlowQuantity)((operations_research::SimpleMaxFlow const *)arg1)->Flow(arg2);
426 jresult = (jlong)result;
427 return jresult;
428}
429
430
431SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1setArcCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jlong jarg3) {
435
436 (void)jenv;
437 (void)jcls;
438 (void)jarg1_;
439 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
440 arg2 = (operations_research::ArcIndex)jarg2;
442 (arg1)->SetArcCapacity(arg2,arg3);
443}
444
445
446SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1MaxFlow(JNIEnv *jenv, jclass jcls, jlong jarg1) {
448
449 (void)jenv;
450 (void)jcls;
451 arg1 = *(operations_research::SimpleMaxFlow **)&jarg1;
452 delete arg1;
453}
454
455
457 jlong jresult = 0 ;
459
460 (void)jenv;
461 (void)jcls;
463 *(operations_research::MinCostFlowBase **)&jresult = result;
464 return jresult;
465}
466
467
468SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1MinCostFlowBase(JNIEnv *jenv, jclass jcls, jlong jarg1) {
470
471 (void)jenv;
472 (void)jcls;
473 arg1 = *(operations_research::MinCostFlowBase **)&jarg1;
474 delete arg1;
475}
476
477
478SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MinCostFlow_1_1SWIG_10(JNIEnv *jenv, jclass jcls, jint jarg1, jint jarg2) {
479 jlong jresult = 0 ;
483
484 (void)jenv;
485 (void)jcls;
486 arg1 = (operations_research::NodeIndex)jarg1;
487 arg2 = (operations_research::ArcIndex)jarg2;
489 *(operations_research::SimpleMinCostFlow **)&jresult = result;
490 return jresult;
491}
492
493
494SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MinCostFlow_1_1SWIG_11(JNIEnv *jenv, jclass jcls, jint jarg1) {
495 jlong jresult = 0 ;
498
499 (void)jenv;
500 (void)jcls;
501 arg1 = (operations_research::NodeIndex)jarg1;
503 *(operations_research::SimpleMinCostFlow **)&jresult = result;
504 return jresult;
505}
506
507
509 jlong jresult = 0 ;
511
512 (void)jenv;
513 (void)jcls;
515 *(operations_research::SimpleMinCostFlow **)&jresult = result;
516 return jresult;
517}
518
519
520SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1addArcWithCapacityAndUnitCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3, jlong jarg4, jlong jarg5) {
521 jint jresult = 0 ;
528
529 (void)jenv;
530 (void)jcls;
531 (void)jarg1_;
532 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
533 arg2 = (operations_research::NodeIndex)jarg2;
534 arg3 = (operations_research::NodeIndex)jarg3;
536 arg5 = (operations_research::CostValue)jarg5;
537 result = (operations_research::ArcIndex)(arg1)->AddArcWithCapacityAndUnitCost(arg2,arg3,arg4,arg5);
538 jresult = (jint)result;
539 return jresult;
540}
541
542
543SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1setNodeSupply(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jlong jarg3) {
547
548 (void)jenv;
549 (void)jcls;
550 (void)jarg1_;
551 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
552 arg2 = (operations_research::NodeIndex)jarg2;
554 (arg1)->SetNodeSupply(arg2,arg3);
555}
556
557
558SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1solve(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
559 jint jresult = 0 ;
562
563 (void)jenv;
564 (void)jcls;
565 (void)jarg1_;
566 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
568 jresult = (jint)result;
569 return jresult;
570}
571
572
573SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1solveMaxFlowWithMinCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
574 jint jresult = 0 ;
577
578 (void)jenv;
579 (void)jcls;
580 (void)jarg1_;
581 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
583 jresult = (jint)result;
584 return jresult;
585}
586
587
588SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getOptimalCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
589 jlong jresult = 0 ;
592
593 (void)jenv;
594 (void)jcls;
595 (void)jarg1_;
596 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
597 result = (operations_research::CostValue)((operations_research::SimpleMinCostFlow const *)arg1)->OptimalCost();
598 jresult = (jlong)result;
599 return jresult;
600}
601
602
603SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getMaximumFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
604 jlong jresult = 0 ;
607
608 (void)jenv;
609 (void)jcls;
610 (void)jarg1_;
611 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
612 result = (operations_research::FlowQuantity)((operations_research::SimpleMinCostFlow const *)arg1)->MaximumFlow();
613 jresult = (jlong)result;
614 return jresult;
615}
616
617
618SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
619 jlong jresult = 0 ;
623
624 (void)jenv;
625 (void)jcls;
626 (void)jarg1_;
627 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
628 arg2 = (operations_research::ArcIndex)jarg2;
630 jresult = (jlong)result;
631 return jresult;
632}
633
634
635SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getNumNodes(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
636 jint jresult = 0 ;
639
640 (void)jenv;
641 (void)jcls;
642 (void)jarg1_;
643 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
645 jresult = (jint)result;
646 return jresult;
647}
648
649
650SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getNumArcs(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
651 jint jresult = 0 ;
654
655 (void)jenv;
656 (void)jcls;
657 (void)jarg1_;
658 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
660 jresult = (jint)result;
661 return jresult;
662}
663
664
665SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getTail(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
666 jint jresult = 0 ;
670
671 (void)jenv;
672 (void)jcls;
673 (void)jarg1_;
674 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
675 arg2 = (operations_research::ArcIndex)jarg2;
677 jresult = (jint)result;
678 return jresult;
679}
680
681
682SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getHead(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
683 jint jresult = 0 ;
687
688 (void)jenv;
689 (void)jcls;
690 (void)jarg1_;
691 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
692 arg2 = (operations_research::ArcIndex)jarg2;
694 jresult = (jint)result;
695 return jresult;
696}
697
698
699SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
700 jlong jresult = 0 ;
704
705 (void)jenv;
706 (void)jcls;
707 (void)jarg1_;
708 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
709 arg2 = (operations_research::ArcIndex)jarg2;
710 result = (operations_research::FlowQuantity)((operations_research::SimpleMinCostFlow const *)arg1)->Capacity(arg2);
711 jresult = (jlong)result;
712 return jresult;
713}
714
715
716SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getSupply(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
717 jlong jresult = 0 ;
721
722 (void)jenv;
723 (void)jcls;
724 (void)jarg1_;
725 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
726 arg2 = (operations_research::NodeIndex)jarg2;
728 jresult = (jlong)result;
729 return jresult;
730}
731
732
733SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getUnitCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
734 jlong jresult = 0 ;
738
739 (void)jenv;
740 (void)jcls;
741 (void)jarg1_;
742 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
743 arg2 = (operations_research::ArcIndex)jarg2;
744 result = (operations_research::CostValue)((operations_research::SimpleMinCostFlow const *)arg1)->UnitCost(arg2);
745 jresult = (jlong)result;
746 return jresult;
747}
748
749
750SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1MinCostFlow(JNIEnv *jenv, jclass jcls, jlong jarg1) {
752
753 (void)jenv;
754 (void)jcls;
755 arg1 = *(operations_research::SimpleMinCostFlow **)&jarg1;
756 delete arg1;
757}
758
759
761 jlong jresult = 0 ;
763
764 (void)jenv;
765 (void)jcls;
768 return jresult;
769}
770
771
772SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1addArcWithCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3, jlong jarg4) {
773 jint jresult = 0 ;
779
780 (void)jenv;
781 (void)jcls;
782 (void)jarg1_;
784 arg2 = (operations_research::NodeIndex)jarg2;
785 arg3 = (operations_research::NodeIndex)jarg3;
786 arg4 = (operations_research::CostValue)jarg4;
787 result = (operations_research::ArcIndex)(arg1)->AddArcWithCost(arg2,arg3,arg4);
788 jresult = (jint)result;
789 return jresult;
790}
791
792
793SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getNumNodes(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
794 jint jresult = 0 ;
797
798 (void)jenv;
799 (void)jcls;
800 (void)jarg1_;
803 jresult = (jint)result;
804 return jresult;
805}
806
807
808SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getNumArcs(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
809 jint jresult = 0 ;
812
813 (void)jenv;
814 (void)jcls;
815 (void)jarg1_;
818 jresult = (jint)result;
819 return jresult;
820}
821
822
823SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getLeftNode(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
824 jint jresult = 0 ;
828
829 (void)jenv;
830 (void)jcls;
831 (void)jarg1_;
833 arg2 = (operations_research::ArcIndex)jarg2;
835 jresult = (jint)result;
836 return jresult;
837}
838
839
840SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getRightNode(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
841 jint jresult = 0 ;
845
846 (void)jenv;
847 (void)jcls;
848 (void)jarg1_;
850 arg2 = (operations_research::ArcIndex)jarg2;
852 jresult = (jint)result;
853 return jresult;
854}
855
856
857SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
858 jlong jresult = 0 ;
862
863 (void)jenv;
864 (void)jcls;
865 (void)jarg1_;
867 arg2 = (operations_research::ArcIndex)jarg2;
869 jresult = (jlong)result;
870 return jresult;
871}
872
873
874SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1solve(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
875 jint jresult = 0 ;
878
879 (void)jenv;
880 (void)jcls;
881 (void)jarg1_;
884 jresult = (jint)result;
885 return jresult;
886}
887
888
889SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getOptimalCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_) {
890 jlong jresult = 0 ;
893
894 (void)jenv;
895 (void)jcls;
896 (void)jarg1_;
899 jresult = (jlong)result;
900 return jresult;
901}
902
903
904SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getRightMate(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
905 jint jresult = 0 ;
909
910 (void)jenv;
911 (void)jcls;
912 (void)jarg1_;
914 arg2 = (operations_research::NodeIndex)jarg2;
916 jresult = (jint)result;
917 return jresult;
918}
919
920
921SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getAssignmentCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2) {
922 jlong jresult = 0 ;
926
927 (void)jenv;
928 (void)jcls;
929 (void)jarg1_;
931 arg2 = (operations_research::NodeIndex)jarg2;
932 result = (operations_research::CostValue)((operations_research::SimpleLinearSumAssignment const *)arg1)->AssignmentCost(arg2);
933 jresult = (jlong)result;
934 return jresult;
935}
936
937
938SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1LinearSumAssignment(JNIEnv *jenv, jclass jcls, jlong jarg1) {
940
941 (void)jenv;
942 (void)jcls;
944 delete arg1;
945}
946
947
948SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1SWIGUpcast(JNIEnv *jenv, jclass jcls, jlong jarg1) {
949 jlong baseptr = 0;
950 (void)jenv;
951 (void)jcls;
953 return baseptr;
954}
955
956#ifdef __cplusplus
957}
958#endif
959
ArcIndex AddArcWithCost(NodeIndex left_node, NodeIndex right_node, CostValue cost)
Status Solve(NodeIndex source, NodeIndex sink)
Definition: max_flow.cc:55
ArcIndex AddArcWithCapacity(NodeIndex tail, NodeIndex head, FlowQuantity capacity)
Definition: max_flow.cc:28
ArcIndex AddArcWithCapacityAndUnitCost(NodeIndex tail, NodeIndex head, FlowQuantity capacity, CostValue unit_cost)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getHead(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1setArcCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jlong jarg3)
SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1MinCostFlowBase(JNIEnv *jenv, jclass jcls, jlong jarg1)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getMaximumFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getNumNodes(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1LinearSumAssignment(JNIEnv *jenv, jclass jcls, jlong jarg1)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getRightMate(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1MaxFlow(JNIEnv *jenv, jclass jcls, jlong jarg1)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getTail(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getOptimalCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1solve(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1solve(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_delete_1MinCostFlow(JNIEnv *jenv, jclass jcls, jlong jarg1)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1SWIGUpcast(JNIEnv *jenv, jclass jcls, jlong jarg1)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MinCostFlowBase(JNIEnv *jenv, jclass jcls)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getOptimalCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
#define SWIGUNUSED
static void SWIGUNUSED SWIG_JavaThrowException(JNIEnv *jenv, SWIG_JavaExceptionCodes code, const char *msg)
SWIG_JavaExceptionCodes
@ SWIG_JavaIOException
@ SWIG_JavaArithmeticException
@ SWIG_JavaUnknownError
@ SWIG_JavaRuntimeException
@ SWIG_JavaNullPointerException
@ SWIG_JavaDirectorPureVirtual
@ SWIG_JavaOutOfMemoryError
@ SWIG_JavaIllegalStateException
@ SWIG_JavaIllegalArgumentException
@ SWIG_JavaIndexOutOfBoundsException
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1solveMaxFlowWithMinCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1LinearSumAssignment(JNIEnv *jenv, jclass jcls)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1solve(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getAssignmentCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1addArcWithCapacityAndUnitCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3, jlong jarg4, jlong jarg5)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getNumArcs(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getTail(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT void JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1setNodeSupply(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jlong jarg3)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getNumArcs(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MinCostFlow_1_1SWIG_10(JNIEnv *jenv, jclass jcls, jint jarg1, jint jarg2)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1addArcWithCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3, jlong jarg4)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MaxFlow(JNIEnv *jenv, jclass jcls)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MinCostFlow_1_1SWIG_11(JNIEnv *jenv, jclass jcls, jint jarg1)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getHead(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getLeftNode(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1addArcWithCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2, jint jarg3, jlong jarg4)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getOptimalFlow(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_new_1MinCostFlow_1_1SWIG_12(JNIEnv *jenv, jclass jcls)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getNumArcs(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getRightNode(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
#define SWIGEXPORT
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getSupply(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MaxFlow_1getCapacity(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_LinearSumAssignment_1getNumNodes(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jint JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getNumNodes(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_)
SWIGEXPORT jlong JNICALL Java_com_google_ortools_graph_mainJNI_MinCostFlow_1getUnitCost(JNIEnv *jenv, jclass jcls, jlong jarg1, jobject jarg1_, jint jarg2)
SWIG_JavaExceptionCodes code