Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue Class Reference

Classes

struct  Entry
 

Public Member Functions

 NodeEntryQueue (int num_nodes)
 
void Clear ()
 
bool IsEmpty () const
 
bool IsEmpty (int64_t insert_after) const
 
EntryTop ()
 
void Pop ()
 
void ClearInsertions (int64_t insert_after)
 
void PushInsertion (int64_t node, int64_t insert_after, int vehicle, int bucket, int64_t value)
 

Detailed Description

Definition at line 1082 of file routing_search.cc.

Constructor & Destructor Documentation

◆ NodeEntryQueue()

operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::NodeEntryQueue ( int num_nodes)
inlineexplicit

Definition at line 1105 of file routing_search.cc.

Member Function Documentation

◆ Clear()

void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Clear ( )
inline

Definition at line 1107 of file routing_search.cc.

◆ ClearInsertions()

void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::ClearInsertions ( int64_t insert_after)
inline

Definition at line 1142 of file routing_search.cc.

◆ IsEmpty() [1/2]

bool operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::IsEmpty ( ) const
inline

Definition at line 1112 of file routing_search.cc.

◆ IsEmpty() [2/2]

bool operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::IsEmpty ( int64_t insert_after) const
inline

Definition at line 1116 of file routing_search.cc.

◆ Pop()

void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Pop ( )
inline

Definition at line 1131 of file routing_search.cc.

◆ PushInsertion()

void operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::PushInsertion ( int64_t node,
int64_t insert_after,
int vehicle,
int bucket,
int64_t value )
inline

Definition at line 1150 of file routing_search.cc.

◆ Top()

Entry * operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Top ( )
inline

Definition at line 1120 of file routing_search.cc.


The documentation for this class was generated from the following file: