Definition at line 1082 of file routing_search.cc.
◆ NodeEntryQueue()
operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::NodeEntryQueue |
( |
int | num_nodes | ) |
|
|
inlineexplicit |
◆ Clear()
void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Clear |
( |
| ) |
|
|
inline |
◆ ClearInsertions()
void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::ClearInsertions |
( |
int64_t | insert_after | ) |
|
|
inline |
◆ IsEmpty() [1/2]
bool operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::IsEmpty |
( |
| ) |
const |
|
inline |
◆ IsEmpty() [2/2]
bool operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::IsEmpty |
( |
int64_t | insert_after | ) |
const |
|
inline |
◆ Pop()
void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Pop |
( |
| ) |
|
|
inline |
◆ PushInsertion()
void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::PushInsertion |
( |
int64_t | node, |
|
|
int64_t | insert_after, |
|
|
int | vehicle, |
|
|
int | bucket, |
|
|
int64_t | value ) |
|
inline |
◆ Top()
Entry * operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Top |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following file: