One destination NODE of a (node, class) pair, with the class it switches to. More...

#include <line/solvers/ldes/ldes_engine.h>

Collaboration diagram for line::ldes::engine::RouteDest:

Public Attributes
std::size_t	node = 0
	1-based destination NODE
std::size_t	station = 0
	its station index, or M when it is not one
bool	sink = false
double	mass = 0.0
	total probability into this node, over classes
std::vector< std::pair< std::size_t, double > >	cls
	(class, probability)

Detailed Description

One destination NODE of a (node, class) pair, with the class it switches to.

THE STRATEGY CHOOSES THE NODE AND THE SWITCH ROW CHOOSES THE CLASS, in that order, which is selectDestinationWithClassSwitch and the reason the two are separated at all. A strategy applied to (node, class) PAIRS would resample the class as well – uniformly under RAND, in turn under RROBIN – and destroy the class-switch probabilities the pair was carrying.

The list is built in ASCENDING NODE INDEX because a round-robin pointer walks it in order: any other order is a different, and equally arbitrary, cycle.

Definition at line 217 of file ldes_engine.h.

Member Data Documentation

◆ cls

std::vector<std::pair<std::size_t, double> > line::ldes::engine::RouteDest::cls

(class, probability)

Definition at line 222 of file ldes_engine.h.

◆ mass

double line::ldes::engine::RouteDest::mass = 0.0

total probability into this node, over classes

Definition at line 221 of file ldes_engine.h.

◆ node

std::size_t line::ldes::engine::RouteDest::node = 0

1-based destination NODE

Definition at line 218 of file ldes_engine.h.

◆ sink

bool line::ldes::engine::RouteDest::sink = false

Definition at line 220 of file ldes_engine.h.

◆ station

std::size_t line::ldes::engine::RouteDest::station = 0

its station index, or M when it is not one

Definition at line 219 of file ldes_engine.h.

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

include/line/solvers/ldes/ldes_engine.h