operations_research::CheapestInsertionFilteredHeuristic::Seed Struct Reference

#include <routing_search.h>

Public Member Functions
bool	operator> (const Seed &other) const

Public Attributes
uint64_t	num_allowed_vehicles
int64_t	neg_penalty
StartEndValue	start_end_value
bool	is_node_index = true
int	index

Detailed Description

Definition at line 348 of file routing_search.h.

Member Function Documentation

operator>()

bool operations_research::CheapestInsertionFilteredHeuristic::Seed::operator> ( const Seed & other ) const

inline

Definition at line 357 of file routing_search.h.

Member Data Documentation

index

int operations_research::CheapestInsertionFilteredHeuristic::Seed::index

Definition at line 355 of file routing_search.h.

is_node_index

bool operations_research::CheapestInsertionFilteredHeuristic::Seed::is_node_index = true

Indicates whether this Seed corresponds to a pair or a single node. If false, the 'index' is the pair_index, otherwise it's the node index.

Definition at line 354 of file routing_search.h.

neg_penalty

int64_t operations_research::CheapestInsertionFilteredHeuristic::Seed::neg_penalty

Definition at line 350 of file routing_search.h.

num_allowed_vehicles

uint64_t operations_research::CheapestInsertionFilteredHeuristic::Seed::num_allowed_vehicles

Definition at line 349 of file routing_search.h.

start_end_value

StartEndValue operations_research::CheapestInsertionFilteredHeuristic::Seed::start_end_value

Definition at line 351 of file routing_search.h.

---

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

• ortools/constraint_solver/routing_search.h