Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Public Member Functions | |
void | SimpleLambdaCallback (bool callGC) |
void | TestTransitMatrix () |
void | TestTransitCallback () |
void | TestMatrixDimension () |
void | TestUnaryTransitVector () |
void | TestUnaryTransitCallback () |
void | TestVectorDimension () |
Definition at line 21 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Convert from routing variable Index to distance matrix NodeIndex.
Define cost of each arc.
Setting first solution heuristic.
0 –(+1)-> 1 –(+1)-> 2 –(+1)-> 3 –(+1)-> 4 –(+4)-> 0 := +8
Definition at line 26 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Define cost of each arc.
Setting first solution heuristic.
0 –(+1)-> 1 –(+1)-> 2 –(+1)-> 3 –(+1)-> 4 –(+1)-> 0 := +5
Definition at line 113 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Convert from routing variable Index to distance matrix NodeIndex.
Define cost of each arc.
Setting first solution heuristic.
Definition at line 85 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Define cost of each arc.
Setting first solution heuristic.
0 –(+1)-> 1 –(+1)-> 2 –(+1)-> 3 –(+1)-> 4 –(+1)-> 0 := +5
Definition at line 59 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Convert from routing variable Index to distance matrix NodeIndex.
Define cost of each arc.
Setting first solution heuristic.
0 –(+1)-> 1 –(+2)-> 2 –(+3)-> 3 –(+4)-> 4 –(+5)-> 0 := +15
Definition at line 164 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Define cost of each arc.
Setting first solution heuristic.
0 –(+1)-> 1 –(+1)-> 2 –(+1)-> 3 –(+1)-> 4 –(+1)-> 0 := +5
Definition at line 141 of file RoutingSolverTests.cs.
|
inline |
Create Routing Index Manager
Create Routing Model.
Create a distance callback.
Define cost of each arc.
Setting first solution heuristic.
0 –(+1)-> 1 –(+1)-> 2 –(+1)-> 3 –(+1)-> 4 –(+1)-> 0 := +5
Definition at line 193 of file RoutingSolverTests.cs.