Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::RoutingModel::NodeNeighborsByCostClass Class Reference

Detailed Description

Definition at line 1704 of file routing.h.

#include <routing.h>

Public Member Functions

 NodeNeighborsByCostClass (const RoutingModel *routing_model)
void ComputeNeighbors (const NodeNeighborsParameters &params)
const std::vector< int > & GetIncomingNeighborsOfNodeForCostClass (int cost_class, int node_index) const
const std::vector< int > & GetOutgoingNeighborsOfNodeForCostClass (int cost_class, int node_index) const
bool IsNeighborhoodArcForCostClass (int cost_class, int64_t from, int64_t to) const
bool IsFullNeighborhood () const

Constructor & Destructor Documentation

◆ NodeNeighborsByCostClass()

operations_research::RoutingModel::NodeNeighborsByCostClass::NodeNeighborsByCostClass ( const RoutingModel * routing_model)
inlineexplicit

Definition at line 1706 of file routing.h.

Member Function Documentation

◆ ComputeNeighbors()

void operations_research::RoutingModel::NodeNeighborsByCostClass::ComputeNeighbors ( const NodeNeighborsParameters & params)

Computes num_neighbors neighbors of all nodes for every cost class in routing_model.

Definition at line 215 of file routing.cc.

◆ GetIncomingNeighborsOfNodeForCostClass()

const std::vector< int > & operations_research::RoutingModel::NodeNeighborsByCostClass::GetIncomingNeighborsOfNodeForCostClass ( int cost_class,
int node_index ) const
inline

Returns the incoming neighbors of the given node for the given cost_class, i.e. all 'neighbor' indices such that neighbor -> node_index is a neighborhood arc for 'cost_class'.

Definition at line 1715 of file routing.h.

◆ GetOutgoingNeighborsOfNodeForCostClass()

const std::vector< int > & operations_research::RoutingModel::NodeNeighborsByCostClass::GetOutgoingNeighborsOfNodeForCostClass ( int cost_class,
int node_index ) const
inline

Returns the neighbors that are outgoing from 'node_index', i.e. 'neighbor' indices such that node_index -> neighbor is a neighborhood arc for 'cost_class'.

Definition at line 1734 of file routing.h.

◆ IsFullNeighborhood()

bool operations_research::RoutingModel::NodeNeighborsByCostClass::IsFullNeighborhood ( ) const
inline

Definition at line 1765 of file routing.h.

◆ IsNeighborhoodArcForCostClass()

bool operations_research::RoutingModel::NodeNeighborsByCostClass::IsNeighborhoodArcForCostClass ( int cost_class,
int64_t from,
int64_t to ) const
inline

Returns true iff arc from_node -> to_node is a neighborhood arc for the given cost_class, i.e. iff arc.to_node is an outgoing neighbor of arc.from_node for 'cost_class'.

Definition at line 1752 of file routing.h.


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