Definition at line 11 of file LinearSumAssignment.java.
◆ LinearSumAssignment() [1/2]
com.google.ortools.graph.LinearSumAssignment.LinearSumAssignment |
( |
long | cPtr, |
|
|
boolean | cMemoryOwn ) |
|
protected |
◆ LinearSumAssignment() [2/2]
com.google.ortools.graph.LinearSumAssignment.LinearSumAssignment |
( |
| ) |
|
◆ addArcWithCost()
int com.google.ortools.graph.LinearSumAssignment.addArcWithCost |
( |
int | left_node, |
|
|
int | right_node, |
|
|
long | cost ) |
◆ delete()
synchronized void com.google.ortools.graph.LinearSumAssignment.delete |
( |
| ) |
|
◆ finalize()
void com.google.ortools.graph.LinearSumAssignment.finalize |
( |
| ) |
|
|
protected |
◆ getAssignmentCost()
long com.google.ortools.graph.LinearSumAssignment.getAssignmentCost |
( |
int | left_node | ) |
|
◆ getCost()
long com.google.ortools.graph.LinearSumAssignment.getCost |
( |
int | arc | ) |
|
◆ getCPtr()
◆ getLeftNode()
int com.google.ortools.graph.LinearSumAssignment.getLeftNode |
( |
int | arc | ) |
|
◆ getNumArcs()
int com.google.ortools.graph.LinearSumAssignment.getNumArcs |
( |
| ) |
|
◆ getNumNodes()
int com.google.ortools.graph.LinearSumAssignment.getNumNodes |
( |
| ) |
|
◆ getOptimalCost()
long com.google.ortools.graph.LinearSumAssignment.getOptimalCost |
( |
| ) |
|
◆ getRightMate()
int com.google.ortools.graph.LinearSumAssignment.getRightMate |
( |
int | left_node | ) |
|
◆ getRightNode()
int com.google.ortools.graph.LinearSumAssignment.getRightNode |
( |
int | arc | ) |
|
◆ solve()
LinearSumAssignment.Status com.google.ortools.graph.LinearSumAssignment.solve |
( |
| ) |
|
◆ swigRelease()
static long com.google.ortools.graph.LinearSumAssignment.swigRelease |
( |
LinearSumAssignment | obj | ) |
|
|
staticprotected |
◆ swigCMemOwn
transient boolean com.google.ortools.graph.LinearSumAssignment.swigCMemOwn |
|
protected |
The documentation for this class was generated from the following file: