Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
IntermodalRouter< E, L, N, V > Class Template Referenceabstract

#include <IntermodalRouter.h>

Inheritance diagram for IntermodalRouter< E, L, N, V >:
[legend]
Collaboration diagram for IntermodalRouter< E, L, N, V >:
[legend]

Data Structures

struct  TripItem

Public Types

typedef IntermodalNetwork< E, L, N, V > Network
typedef double(* Operation) (const E *const, const V *const, double)
 Type of the function that is used to retrieve the edge effort.
typedef std::map< const E *, double > Prohibitions
 Prohibitions and their estimated end time.

Public Member Functions

void buildPathFrom (const typename SUMOAbstractRouter< E, V >::EdgeInfo *rbegin, std::vector< const E * > &edges)
 Builds the path from marked edges.
SUMOAbstractRouter< E, _IntermodalTrip > * clone ()
bool compute (const E *, const E *, const _IntermodalTrip *const, SUMOTime, std::vector< const E * > &, bool)
 Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.
bool compute (const E *from, const E *to, const double departPos, const std::string &originStopID, const double arrivalPos, const std::string &stopID, const double speed, const V *const vehicle, const SUMOVTypeParameter &pars, const SVCPermissions modeSet, const SUMOTime msTime, std::vector< TripItem > &into, const double externalFactor=0.)
 Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.
virtual bool compute (const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)=0
 Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.
bool computeLooped (const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)
 Builds the route between the given edges using the minimum effort at the given time if from == to, return the shortest looped route.
void endQuery (int visits)
int getCarWalkTransfer () const
const SUMOAbstractRouter< E, V >::EdgeInfo & getEdgeInfo (int index) const
double getEffort (const E *const e, const V *const v, double t) const
EffortCalculatorgetExternalEffort () const
NetworkgetNetwork () const
double getTravelTime (const E *const e, const V *const v, const double t, const double effort) const
const std::string & getType () const
void init (const int edgeID, const SUMOTime msTime)
 IntermodalRouter (CreateNetCallback callback, const int carWalkTransfer, double taxiWait, const std::string &routingAlgorithm, const int routingMode=0, EffortCalculator *calc=nullptr)
 Constructor.
bool isProhibited (const E *const edge, const V *const vehicle) const
bool isValid (const std::vector< const E * > &edges, const V *const v) const
void prohibit (const std::map< const E *, double > &toProhibit)
virtual double recomputeCosts (const std::vector< const E * > &edges, const V *const v, SUMOTime msTime, double *lengthp=nullptr) const
double recomputeCostsPos (const std::vector< const E * > &edges, const V *const v, double fromPos, double toPos, SUMOTime msTime, double *lengthp=nullptr) const
virtual void reset (const V *const vehicle)
 reset internal caches, used by CHRouter
void setAutoBulkMode (const bool mode)
void setBulkMode (const bool mode)
double setHint (const typename std::vector< const E * >::const_iterator routeBegin, const typename std::vector< const E * >::const_iterator routeEnd, const V *const v, SUMOTime msTime)
void startQuery ()
void updateViaCost (const E *const prev, const E *const e, const V *const v, double &time, double &effort, double &length) const
void updateViaEdgeCost (const E *viaEdge, const V *const v, double &time, double &effort, double &length) const
void writeNetwork (OutputDevice &dev)
void writeWeights (OutputDevice &dev)
virtual ~IntermodalRouter ()
 Destructor.

Protected Attributes

bool myAmClean
 whether we are already initialized
bool myAutoBulkMode
 whether we are currently trying to detect bulk mode automatically
bool myBulkMode
 whether we are currently operating several route queries in a bulk
std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo > myEdgeInfos
 The container of edge information.
MsgHandler *const myErrorMsgHandler
 the handler for routing errors
std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo * > myFound
 list of visited Edges (for resetting)
std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo * > myFrontierList
 A container for reusage of the min edge heap.
const bool myHavePermissions
 whether edge permissions need to be considered
const bool myHaveRestrictions
 whether edge restrictions need to be considered
Operation myOperation
 The object's operation to perform.
Prohibitions myProhibited
 The list of explicitly prohibited edges and estimated end time of prohibition.
Operation myTTOperation
 The object's operation to perform for travel times.

Private Types

typedef IntermodalEdge< E, L, N, V > _IntermodalEdge
typedef IntermodalTrip< E, N, V > _IntermodalTrip
typedef AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher_InternalAStar
typedef DijkstraRouter< _IntermodalEdge, _IntermodalTrip_InternalDijkstra
typedef SUMOAbstractRouter< _IntermodalEdge, _IntermodalTrip_InternalRouter
typedef MapMatcher< E, L, N > _MapMatcher
typedef void(* CreateNetCallback) (IntermodalRouter< E, L, N, V > &)

Private Member Functions

void createNet ()
 IntermodalRouter (Network *net, const int carWalkTransfer, double taxiWait, const std::string &routingAlgorithm, const int routingMode, EffortCalculator *calc)
bool loopedLineTransfer (const _IntermodalEdge *prev, const _IntermodalEdge *cur, double prevTime, double time)
IntermodalRouteroperator= (const IntermodalRouter &s)
 Invalidated assignment operator.

Static Private Member Functions

static double getCombined (const _IntermodalEdge *const edge, const _IntermodalTrip *const trip, double time)

Private Attributes

const bool myAmClone
CreateNetCallback myCallback
const int myCarWalkTransfer
EffortCalculator *const myExternalEffort
NetworkmyIntermodalNet
_InternalRoutermyInternalRouter
long long int myNumQueries
long long int myQueryStartTime
 the time spent querying in milliseconds
long long int myQueryTimeSum
long long int myQueryVisits
 counters for performance logging
const std::string myRoutingAlgorithm
const int myRoutingMode
const double myTaxiWait
const std::string myType
 the type of this router

Detailed Description

template<class E, class L, class N, class V>
class IntermodalRouter< E, L, N, V >

The router for pedestrians (on a bidirectional network of sidewalks and crossings)

Definition at line 52 of file IntermodalRouter.h.

Member Typedef Documentation

◆ _IntermodalEdge

template<class E, class L, class N, class V>
typedef IntermodalEdge<E, L, N, V> IntermodalRouter< E, L, N, V >::_IntermodalEdge
private

Definition at line 58 of file IntermodalRouter.h.

◆ _IntermodalTrip

template<class E, class L, class N, class V>
typedef IntermodalTrip<E, N, V> IntermodalRouter< E, L, N, V >::_IntermodalTrip
private

Definition at line 59 of file IntermodalRouter.h.

◆ _InternalAStar

template<class E, class L, class N, class V>
typedef AStarRouter<_IntermodalEdge, _IntermodalTrip, _MapMatcher> IntermodalRouter< E, L, N, V >::_InternalAStar
private

Definition at line 63 of file IntermodalRouter.h.

◆ _InternalDijkstra

template<class E, class L, class N, class V>
typedef DijkstraRouter<_IntermodalEdge, _IntermodalTrip> IntermodalRouter< E, L, N, V >::_InternalDijkstra
private

Definition at line 62 of file IntermodalRouter.h.

◆ _InternalRouter

template<class E, class L, class N, class V>
typedef SUMOAbstractRouter<_IntermodalEdge, _IntermodalTrip> IntermodalRouter< E, L, N, V >::_InternalRouter
private

Definition at line 60 of file IntermodalRouter.h.

◆ _MapMatcher

template<class E, class L, class N, class V>
typedef MapMatcher<E, L, N> IntermodalRouter< E, L, N, V >::_MapMatcher
private

Definition at line 61 of file IntermodalRouter.h.

◆ CreateNetCallback

template<class E, class L, class N, class V>
typedef void(* IntermodalRouter< E, L, N, V >::CreateNetCallback) (IntermodalRouter< E, L, N, V > &)
private

Definition at line 57 of file IntermodalRouter.h.

◆ Network

template<class E, class L, class N, class V>
typedef IntermodalNetwork<E, L, N, V> IntermodalRouter< E, L, N, V >::Network

Definition at line 54 of file IntermodalRouter.h.

◆ Operation

typedef double(* SUMOAbstractRouter< E, V >::Operation) (const E *const, const V *const, double)
inherited

Type of the function that is used to retrieve the edge effort.

Definition at line 95 of file SUMOAbstractRouter.h.

◆ Prohibitions

typedef std::map<const E*, double> SUMOAbstractRouter< E, V >::Prohibitions
inherited

Prohibitions and their estimated end time.

Definition at line 98 of file SUMOAbstractRouter.h.

Constructor & Destructor Documentation

◆ IntermodalRouter() [1/2]

template<class E, class L, class N, class V>
IntermodalRouter< E, L, N, V >::IntermodalRouter ( CreateNetCallback callback,
const int carWalkTransfer,
double taxiWait,
const std::string & routingAlgorithm,
const int routingMode = 0,
EffortCalculator * calc = nullptr )
inline

Constructor.

Definition at line 85 of file IntermodalRouter.h.

Referenced by IntermodalRouter< MSEdge, MSLane, MSJunction, SUMOVehicle >::clone().

Here is the caller graph for this function:

◆ ~IntermodalRouter()

template<class E, class L, class N, class V>
virtual IntermodalRouter< E, L, N, V >::~IntermodalRouter ( )
inlinevirtual

Destructor.

Definition at line 95 of file IntermodalRouter.h.

◆ IntermodalRouter() [2/2]

template<class E, class L, class N, class V>
IntermodalRouter< E, L, N, V >::IntermodalRouter ( Network * net,
const int carWalkTransfer,
double taxiWait,
const std::string & routingAlgorithm,
const int routingMode,
EffortCalculator * calc )
inlineprivate

Definition at line 285 of file IntermodalRouter.h.

Member Function Documentation

◆ buildPathFrom()

void SUMOAbstractRouter< E, V >::buildPathFrom ( const typename SUMOAbstractRouter< E, V >::EdgeInfo * rbegin,
std::vector< const E * > & edges )
inlineinherited

Builds the path from marked edges.

Definition at line 382 of file SUMOAbstractRouter.h.

◆ clone()

template<class E, class L, class N, class V>
SUMOAbstractRouter< E, _IntermodalTrip > * IntermodalRouter< E, L, N, V >::clone ( )
inlinevirtual

◆ compute() [1/3]

template<class E, class L, class N, class V>
bool IntermodalRouter< E, L, N, V >::compute ( const E * ,
const E * ,
const _IntermodalTrip * const ,
SUMOTime ,
std::vector< const E * > & ,
bool  )
inline

Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.

Definition at line 227 of file IntermodalRouter.h.

◆ compute() [2/3]

template<class E, class L, class N, class V>
bool IntermodalRouter< E, L, N, V >::compute ( const E * from,
const E * to,
const double departPos,
const std::string & originStopID,
const double arrivalPos,
const std::string & stopID,
const double speed,
const V *const vehicle,
const SUMOVTypeParameter & pars,
const SVCPermissions modeSet,
const SUMOTime msTime,
std::vector< TripItem > & into,
const double externalFactor = 0. )
inline

Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.

Definition at line 113 of file IntermodalRouter.h.

Referenced by ROPerson::computeIntermodal(), LIBSUMO_NAMESPACE::Simulation::findIntermodalRoute(), MSStageTrip::reroute(), and MSTriggeredRerouter::triggerRouting().

Here is the caller graph for this function:

◆ compute() [3/3]

virtual bool SUMOAbstractRouter< E, V >::compute ( const E * from,
const E * to,
const V *const vehicle,
SUMOTime msTime,
std::vector< const E * > & into,
bool silent = false )
pure virtualinherited

Builds the route between the given edges using the minimum effort at the given time The definition of the effort depends on the wished routing scheme.

◆ computeLooped()

bool SUMOAbstractRouter< E, V >::computeLooped ( const E * from,
const E * to,
const V *const vehicle,
SUMOTime msTime,
std::vector< const E * > & into,
bool silent = false )
inlineinherited

Builds the route between the given edges using the minimum effort at the given time if from == to, return the shortest looped route.

Definition at line 206 of file SUMOAbstractRouter.h.

◆ createNet()

◆ endQuery()

void SUMOAbstractRouter< E, V >::endQuery ( int visits)
inlineinherited

Definition at line 352 of file SUMOAbstractRouter.h.

◆ getCarWalkTransfer()

template<class E, class L, class N, class V>
int IntermodalRouter< E, L, N, V >::getCarWalkTransfer ( ) const
inline

Definition at line 107 of file IntermodalRouter.h.

Referenced by MSNet::adaptIntermodalRouter(), and RONet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getCombined()

template<class E, class L, class N, class V>
double IntermodalRouter< E, L, N, V >::getCombined ( const _IntermodalEdge *const edge,
const _IntermodalTrip *const trip,
double time )
inlinestaticprivate

Definition at line 295 of file IntermodalRouter.h.

◆ getEdgeInfo()

const SUMOAbstractRouter< E, V >::EdgeInfo & SUMOAbstractRouter< E, V >::getEdgeInfo ( int index) const
inlineinherited

Definition at line 177 of file SUMOAbstractRouter.h.

◆ getEffort()

double SUMOAbstractRouter< E, V >::getEffort ( const E *const e,
const V *const v,
double t ) const
inlineinherited

Definition at line 338 of file SUMOAbstractRouter.h.

◆ getExternalEffort()

template<class E, class L, class N, class V>
EffortCalculator * IntermodalRouter< E, L, N, V >::getExternalEffort ( ) const
inline

Definition at line 280 of file IntermodalRouter.h.

Referenced by MSNet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getNetwork()

template<class E, class L, class N, class V>
Network * IntermodalRouter< E, L, N, V >::getNetwork ( ) const
inline

Definition at line 276 of file IntermodalRouter.h.

Referenced by MSInsertionControl::adaptIntermodalRouter(), MSNet::adaptIntermodalRouter(), MSVehicleControl::adaptIntermodalRouter(), and RONet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getTravelTime()

double SUMOAbstractRouter< E, V >::getTravelTime ( const E *const e,
const V *const v,
const double t,
const double effort ) const
inlineinherited

Definition at line 239 of file SUMOAbstractRouter.h.

◆ getType()

const std::string & SUMOAbstractRouter< E, V >::getType ( ) const
inlineinherited

Definition at line 173 of file SUMOAbstractRouter.h.

◆ init()

void SUMOAbstractRouter< E, V >::init ( const int edgeID,
const SUMOTime msTime )
inlineinherited

Definition at line 144 of file SUMOAbstractRouter.h.

◆ isProhibited()

bool SUMOAbstractRouter< E, V >::isProhibited ( const E *const edge,
const V *const vehicle ) const
inlineinherited

Definition at line 235 of file SUMOAbstractRouter.h.

◆ isValid()

bool SUMOAbstractRouter< E, V >::isValid ( const std::vector< const E * > & edges,
const V *const v ) const
inlineinherited

Definition at line 268 of file SUMOAbstractRouter.h.

◆ loopedLineTransfer()

template<class E, class L, class N, class V>
bool IntermodalRouter< E, L, N, V >::loopedLineTransfer ( const _IntermodalEdge * prev,
const _IntermodalEdge * cur,
double prevTime,
double time )
inlineprivate

Definition at line 337 of file IntermodalRouter.h.

◆ operator=()

template<class E, class L, class N, class V>
IntermodalRouter & IntermodalRouter< E, L, N, V >::operator= ( const IntermodalRouter< E, L, N, V > & s)
private

Invalidated assignment operator.

◆ prohibit()

template<class E, class L, class N, class V>
void IntermodalRouter< E, L, N, V >::prohibit ( const std::map< const E *, double > & toProhibit)
inlinevirtual

Reimplemented from SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.

Definition at line 239 of file IntermodalRouter.h.

Referenced by MSRoutingEngine::reroute().

Here is the caller graph for this function:

◆ recomputeCosts()

virtual double SUMOAbstractRouter< E, V >::recomputeCosts ( const std::vector< const E * > & edges,
const V *const v,
SUMOTime msTime,
double * lengthp = nullptr ) const
inlinevirtualinherited

Definition at line 277 of file SUMOAbstractRouter.h.

◆ recomputeCostsPos()

double SUMOAbstractRouter< E, V >::recomputeCostsPos ( const std::vector< const E * > & edges,
const V *const v,
double fromPos,
double toPos,
SUMOTime msTime,
double * lengthp = nullptr ) const
inlineinherited

Definition at line 295 of file SUMOAbstractRouter.h.

◆ reset()

virtual void SUMOAbstractRouter< E, V >::reset ( const V *const vehicle)
inlinevirtualinherited

reset internal caches, used by CHRouter

Definition at line 169 of file SUMOAbstractRouter.h.

◆ setAutoBulkMode()

void SUMOAbstractRouter< E, V >::setAutoBulkMode ( const bool mode)
inlineinherited

Definition at line 361 of file SUMOAbstractRouter.h.

◆ setBulkMode()

template<class E, class L, class N, class V>
void IntermodalRouter< E, L, N, V >::setBulkMode ( const bool mode)
inlinevirtual

Reimplemented from SUMOAbstractRouter< E, IntermodalTrip< E, N, V > >.

Definition at line 232 of file IntermodalRouter.h.

◆ setHint()

double SUMOAbstractRouter< E, V >::setHint ( const typename std::vector< const E * >::const_iterator routeBegin,
const typename std::vector< const E * >::const_iterator routeEnd,
const V *const v,
SUMOTime msTime )
inlineinherited

Definition at line 307 of file SUMOAbstractRouter.h.

◆ startQuery()

void SUMOAbstractRouter< E, V >::startQuery ( )
inlineinherited

Definition at line 347 of file SUMOAbstractRouter.h.

◆ updateViaCost()

void SUMOAbstractRouter< E, V >::updateViaCost ( const E *const prev,
const E *const e,
const V *const v,
double & time,
double & effort,
double & length ) const
inlineinherited

Definition at line 253 of file SUMOAbstractRouter.h.

◆ updateViaEdgeCost()

void SUMOAbstractRouter< E, V >::updateViaEdgeCost ( const E * viaEdge,
const V *const v,
double & time,
double & effort,
double & length ) const
inlineinherited

Definition at line 243 of file SUMOAbstractRouter.h.

◆ writeNetwork()

template<class E, class L, class N, class V>
void IntermodalRouter< E, L, N, V >::writeNetwork ( OutputDevice & dev)
inline

Definition at line 250 of file IntermodalRouter.h.

Referenced by RONet::writeIntermodal().

Here is the caller graph for this function:

◆ writeWeights()

template<class E, class L, class N, class V>
void IntermodalRouter< E, L, N, V >::writeWeights ( OutputDevice & dev)
inline

Definition at line 262 of file IntermodalRouter.h.

Referenced by RONet::writeIntermodal().

Here is the caller graph for this function:

Field Documentation

◆ myAmClean

bool SUMOAbstractRouter< E, V >::myAmClean
protectedinherited

whether we are already initialized

Definition at line 408 of file SUMOAbstractRouter.h.

◆ myAmClone

template<class E, class L, class N, class V>
const bool IntermodalRouter< E, L, N, V >::myAmClone
private

Definition at line 351 of file IntermodalRouter.h.

◆ myAutoBulkMode

bool SUMOAbstractRouter< E, V >::myAutoBulkMode
protectedinherited

whether we are currently trying to detect bulk mode automatically

Definition at line 405 of file SUMOAbstractRouter.h.

◆ myBulkMode

bool SUMOAbstractRouter< E, V >::myBulkMode
protectedinherited

whether we are currently operating several route queries in a bulk

Definition at line 402 of file SUMOAbstractRouter.h.

◆ myCallback

template<class E, class L, class N, class V>
CreateNetCallback IntermodalRouter< E, L, N, V >::myCallback
private

◆ myCarWalkTransfer

template<class E, class L, class N, class V>
const int IntermodalRouter< E, L, N, V >::myCarWalkTransfer
private

Definition at line 355 of file IntermodalRouter.h.

◆ myEdgeInfos

std::vector<typename SUMOAbstractRouter<E, V>::EdgeInfo> SUMOAbstractRouter< E, V >::myEdgeInfos
protectedinherited

The container of edge information.

Definition at line 420 of file SUMOAbstractRouter.h.

◆ myErrorMsgHandler

MsgHandler* const SUMOAbstractRouter< E, V >::myErrorMsgHandler
protectedinherited

the handler for routing errors

Definition at line 393 of file SUMOAbstractRouter.h.

◆ myExternalEffort

template<class E, class L, class N, class V>
EffortCalculator* const IntermodalRouter< E, L, N, V >::myExternalEffort
private

Definition at line 359 of file IntermodalRouter.h.

◆ myFound

std::vector<typename SUMOAbstractRouter<E, V>::EdgeInfo*> SUMOAbstractRouter< E, V >::myFound
protectedinherited

list of visited Edges (for resetting)

Definition at line 425 of file SUMOAbstractRouter.h.

◆ myFrontierList

std::vector<typename SUMOAbstractRouter<E, V>::EdgeInfo*> SUMOAbstractRouter< E, V >::myFrontierList
protectedinherited

A container for reusage of the min edge heap.

Definition at line 423 of file SUMOAbstractRouter.h.

◆ myHavePermissions

const bool SUMOAbstractRouter< E, V >::myHavePermissions
protectedinherited

whether edge permissions need to be considered

Definition at line 411 of file SUMOAbstractRouter.h.

◆ myHaveRestrictions

const bool SUMOAbstractRouter< E, V >::myHaveRestrictions
protectedinherited

whether edge restrictions need to be considered

Definition at line 414 of file SUMOAbstractRouter.h.

◆ myIntermodalNet

template<class E, class L, class N, class V>
Network* IntermodalRouter< E, L, N, V >::myIntermodalNet
private

Definition at line 353 of file IntermodalRouter.h.

◆ myInternalRouter

template<class E, class L, class N, class V>
_InternalRouter* IntermodalRouter< E, L, N, V >::myInternalRouter
private

Definition at line 352 of file IntermodalRouter.h.

◆ myNumQueries

long long int SUMOAbstractRouter< E, V >::myNumQueries
privateinherited

Definition at line 433 of file SUMOAbstractRouter.h.

◆ myOperation

Operation SUMOAbstractRouter< E, V >::myOperation
protectedinherited

The object's operation to perform.

Definition at line 396 of file SUMOAbstractRouter.h.

◆ myProhibited

Prohibitions SUMOAbstractRouter< E, V >::myProhibited
protectedinherited

The list of explicitly prohibited edges and estimated end time of prohibition.

Definition at line 417 of file SUMOAbstractRouter.h.

◆ myQueryStartTime

long long int SUMOAbstractRouter< E, V >::myQueryStartTime
privateinherited

the time spent querying in milliseconds

Definition at line 435 of file SUMOAbstractRouter.h.

◆ myQueryTimeSum

long long int SUMOAbstractRouter< E, V >::myQueryTimeSum
privateinherited

Definition at line 436 of file SUMOAbstractRouter.h.

◆ myQueryVisits

long long int SUMOAbstractRouter< E, V >::myQueryVisits
privateinherited

counters for performance logging

Definition at line 432 of file SUMOAbstractRouter.h.

◆ myRoutingAlgorithm

template<class E, class L, class N, class V>
const std::string IntermodalRouter< E, L, N, V >::myRoutingAlgorithm
private

Definition at line 357 of file IntermodalRouter.h.

◆ myRoutingMode

template<class E, class L, class N, class V>
const int IntermodalRouter< E, L, N, V >::myRoutingMode
private

Definition at line 358 of file IntermodalRouter.h.

◆ myTaxiWait

template<class E, class L, class N, class V>
const double IntermodalRouter< E, L, N, V >::myTaxiWait
private

Definition at line 356 of file IntermodalRouter.h.

◆ myTTOperation

Operation SUMOAbstractRouter< E, V >::myTTOperation
protectedinherited

The object's operation to perform for travel times.

Definition at line 399 of file SUMOAbstractRouter.h.

◆ myType

const std::string SUMOAbstractRouter< E, V >::myType
privateinherited

the type of this router

Definition at line 429 of file SUMOAbstractRouter.h.


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