Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
Node2EdgeRouter< E, N, V, M > Class Template Reference

#include <Node2EdgeRouter.h>

Inheritance diagram for Node2EdgeRouter< E, N, V, M >:
[legend]
Collaboration diagram for Node2EdgeRouter< E, N, V, M >:
[legend]

Public Types

typedef FullLookupTable< E, V > FLT
 
typedef LandmarkLookupTable< E, V, MLMLT
 
typedef AbstractLookupTable< E, V > LookupTable
 
typedef double(* Operation) (const E *const, const V *const, double)
 Type of the function that is used to retrieve the edge effort.
 

Public Member Functions

void buildPathFrom (const typename SUMOAbstractRouter< E, V >::EdgeInfo *rbegin, std::vector< const E * > &edges)
 Builds the path from marked edges.
 
virtual SUMOAbstractRouter< E, V > * clone ()
 Cloning method.
 
bool compute (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 travel time.
 
bool compute (const E *from, double fromPos, const E *to, double toPos, 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, also taking into account position along the edges to ensure currect handling of looped routes 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.
 
bool computeNode2Edge (const N *fromNode, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)
 Builds the route between the given node and edge using the minimum travel time.
 
bool computeNode2Edges (const N *fromNode, const std::unordered_set< const E * > &toEdges, const V *const vehicle, SUMOTime msTime, bool silent=false)
 Builds the routes between the given node and all given edges using the minimum travel time.
 
SUMOAbstractRouter< E, V >::EdgeInfo * edgeInfo (const E *const edge)
 Returns the edge information for the passed edge.
 
const SUMOAbstractRouter< E, V >::EdgeInfo * edgeInfo (const E *const edge) const
 Returns the edge information for the passed edge.
 
void endQuery (int visits)
 
const SUMOAbstractRouter< E, V >::EdgeInfo & getEdgeInfo (int index) const
 
double getEffort (const E *const e, const V *const v, double t) 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)
 
bool isProhibited (const E *const edge, const V *const vehicle) const
 
bool isValid (const std::vector< const E * > &edges, const V *const v) const
 
 Node2EdgeRouter (const std::vector< E * > &edges, bool unbuildIsWarning, typename SUMOAbstractRouter< E, V >::Operation operation, const std::shared_ptr< const LookupTable > lookup=nullptr, const bool havePermissions=false, const bool haveRestrictions=false)
 Constructor.
 
 Node2EdgeRouter (const std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo > &edgeInfos, bool unbuildIsWarning, typename SUMOAbstractRouter< E, V >::Operation operation, const std::shared_ptr< const LookupTable > lookup=nullptr, const bool havePermissions=false, const bool haveRestrictions=false)
 Cloning constructor.
 
virtual void prohibit (const std::vector< E * > &toProhibit)
 
virtual double recomputeCosts (const std::vector< const E * > &edges, const V *const v, SUMOTime msTime, double *lengthp=nullptr) const
 
double recomputeCostsNoLastEdge (const std::vector< const E * > &edges, const V *const v, SUMOTime msTime, double *lengthp=nullptr) const
 Returns the recomputed cost for traversing the given edges, excluding the last one.
 
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 method.
 
void setAutoBulkMode (const bool mode)
 
virtual void setBulkMode (const bool mode)
 Bulk mode is not supported.
 
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 updateViaCostUpToEdge (const E *const prev, const E *const e, const V *const v, double &time, double &effort, double &length) const
 Updates the via cost up to a given edge.
 
void updateViaEdgeCost (const E *viaEdge, const V *const v, double &time, double &effort, double &length) const
 
virtual ~Node2EdgeRouter ()
 Destructor.
 

Protected Member Functions

void init (std::vector< const E * > fromEdges, const V *const vehicle, const SUMOTime msTime)
 Initialize the node-to-edge router.
 

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
 
EdgeInfoComparator myComparator
 
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
 
const std::shared_ptr< const LookupTablemyLookupTable
 the lookup table for travel time heuristics
 
double myMaxSpeed
 maximum speed in the network
 
Operation myOperation
 The object's operation to perform.
 
std::vector< E * > myProhibited
 The list of explicitly prohibited edges.
 
Operation myTTOperation
 The object's operation to perform for travel times.
 

Private Attributes

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 myType
 the type of this router
 

Detailed Description

template<class E, class N, class V, class M>
class Node2EdgeRouter< E, N, V, M >

Computes shortest paths from a node to one edge (using A*) or to all edges (using Dijkstra's algorithm)

The template parameters are:

Parameters
EThe edge class to use (MSEdge/ROEdge)
VThe vehicle class to use (MSVehicle/ROVehicle)

The router is edge-based. It must know the number of edges for internal reasons and whether a missing connection between two given edges (unbuild route) shall be reported as an error or as a warning

Definition at line 47 of file Node2EdgeRouter.h.

Member Typedef Documentation

◆ FLT

template<class E , class V , class M >
typedef FullLookupTable<E, V> AStarRouter< E, V, M >::FLT
inherited

Definition at line 79 of file AStarRouter.h.

◆ LMLT

template<class E , class V , class M >
typedef LandmarkLookupTable<E, V, M> AStarRouter< E, V, M >::LMLT
inherited

Definition at line 80 of file AStarRouter.h.

◆ LookupTable

template<class E , class N , class V , class M >
typedef AbstractLookupTable<E, V> Node2EdgeRouter< E, N, V, M >::LookupTable

Definition at line 49 of file Node2EdgeRouter.h.

◆ Operation

template<class E , class V >
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 92 of file SUMOAbstractRouter.h.

Constructor & Destructor Documentation

◆ Node2EdgeRouter() [1/2]

template<class E , class N , class V , class M >
Node2EdgeRouter< E, N, V, M >::Node2EdgeRouter ( const std::vector< E * > &  edges,
bool  unbuildIsWarning,
typename SUMOAbstractRouter< E, V >::Operation  operation,
const std::shared_ptr< const LookupTable lookup = nullptr,
const bool  havePermissions = false,
const bool  haveRestrictions = false 
)
inline

Constructor.

Parameters
[in]edgesThe edges
[in]unbuildIsWarningThe flag indicating whether network unbuilds should issue warnings or errors
[in]operationThe operation
[in]lookupThe lookup table
[in]havePermissionsThe flag indicating whether to respect edge permissions
[in]haveRestrictionsThe flag indicating whether to respect edge restrictions

Definition at line 74 of file Node2EdgeRouter.h.

◆ Node2EdgeRouter() [2/2]

template<class E , class N , class V , class M >
Node2EdgeRouter< E, N, V, M >::Node2EdgeRouter ( const std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo > &  edgeInfos,
bool  unbuildIsWarning,
typename SUMOAbstractRouter< E, V >::Operation  operation,
const std::shared_ptr< const LookupTable lookup = nullptr,
const bool  havePermissions = false,
const bool  haveRestrictions = false 
)
inline

Cloning constructor.

Parameters
[in]edgeInfosThe vector of edge information
[in]unbuildIsWarningThe flag indicating whether network unbuilds should issue warnings or errors
[in]operationThe operation
[in]lookupThe lookup table
[in]havePermissionsThe flag indicating whether to respect edge permissions
[in]haveRestrictionsThe flag indicating whether to respect edge restrictions

Definition at line 88 of file Node2EdgeRouter.h.

◆ ~Node2EdgeRouter()

template<class E , class N , class V , class M >
virtual Node2EdgeRouter< E, N, V, M >::~Node2EdgeRouter ( )
inlinevirtual

Destructor.

Definition at line 94 of file Node2EdgeRouter.h.

References WRITE_MESSAGE.

Member Function Documentation

◆ buildPathFrom()

template<class E , class V >
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 364 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::EdgeInfo::edge, and SUMOAbstractRouter< E, V >::EdgeInfo::prev.

Referenced by AFRouter< E, N, V, M >::compute(), AStarRouter< E, V, M >::compute(), DijkstraRouter< E, V >::compute(), and Node2EdgeRouter< E, N, V, M >::computeNode2Edge().

Here is the caller graph for this function:

◆ clone()

◆ compute() [1/2]

◆ compute() [2/2]

template<class E , class V >
bool SUMOAbstractRouter< E, V >::compute ( const E *  from,
double  fromPos,
const E *  to,
double  toPos,
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, also taking into account position along the edges to ensure currect handling of looped routes The definition of the effort depends on the wished routing scheme.

Definition at line 183 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::compute(), and SUMOAbstractRouter< E, V >::computeLooped().

◆ computeLooped()

template<class E , class V >
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 198 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::compute(), MsgHandler::informf(), SUMOAbstractRouter< E, V >::myErrorMsgHandler, SUMOAbstractRouter< E, V >::recomputeCosts(), SVC_IGNORING, and TL.

Referenced by SUMOAbstractRouter< E, V >::compute(), and MSBaseVehicle::reroute().

Here is the caller graph for this function:

◆ computeNode2Edge()

template<class E , class N , class V , class M >
bool Node2EdgeRouter< E, N, V, M >::computeNode2Edge ( const N *  fromNode,
const E *  to,
const V *const  vehicle,
SUMOTime  msTime,
std::vector< const E * > &  into,
bool  silent = false 
)
inline

Builds the route between the given node and edge using the minimum travel time.

Parameters
[in]fromNodeThe node the route starts with
[in]toThe edge at which the route ends
[in]vehicleThe vehicle
[in]msTimeThe start time of the route in milliseconds
[out]intoThe vector of edges, into which the solution route is written
[in]silentThe boolean flag indicating whether the method stays silent or puts out messages

Definition at line 251 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::buildPathFrom(), SUMOAbstractRouter< E, V >::endQuery(), SUMOAbstractRouter< E, V >::getEffort(), Named::getIDSecure(), SUMOAbstractRouter< E, V >::getTravelTime(), MsgHandler::inform(), MsgHandler::informf(), Node2EdgeRouter< E, N, V, M >::init(), SUMOAbstractRouter< E, V >::isProhibited(), MAX2(), MIN2(), SUMOAbstractRouter< E, V >::myAmClean, SUMOAbstractRouter< E, V >::myEdgeInfos, SUMOAbstractRouter< E, V >::myErrorMsgHandler, SUMOAbstractRouter< E, V >::myFound, SUMOAbstractRouter< E, V >::myFrontierList, AStarRouter< E, V, M >::myLookupTable, AStarRouter< E, V, M >::myMaxSpeed, SUMOAbstractRouter< E, V >::startQuery(), SVC_IGNORING, UNREACHABLE, and SUMOAbstractRouter< E, V >::updateViaEdgeCost().

◆ computeNode2Edges()

template<class E , class N , class V , class M >
bool Node2EdgeRouter< E, N, V, M >::computeNode2Edges ( const N *  fromNode,
const std::unordered_set< const E * > &  toEdges,
const V *const  vehicle,
SUMOTime  msTime,
bool  silent = false 
)
inline

Builds the routes between the given node and all given edges using the minimum travel time.

Parameters
[in]fromNodeThe node which the routes start with
[in]toEdgesThe edges at which the routes end
[in]vehicleThe vehicle
[in]msTimeThe start time of the routes in milliseconds
[in]silentThe boolean flag indicating whether the method stays silent or puts out messages

Definition at line 126 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::endQuery(), SUMOAbstractRouter< E, V >::getEffort(), Named::getIDSecure(), SUMOAbstractRouter< E, V >::getTravelTime(), MsgHandler::inform(), MsgHandler::informf(), Node2EdgeRouter< E, N, V, M >::init(), SUMOAbstractRouter< E, V >::isProhibited(), MAX2(), MIN2(), SUMOAbstractRouter< E, V >::myAmClean, SUMOAbstractRouter< E, V >::myEdgeInfos, SUMOAbstractRouter< E, V >::myErrorMsgHandler, SUMOAbstractRouter< E, V >::myFound, SUMOAbstractRouter< E, V >::myFrontierList, AStarRouter< E, V, M >::myMaxSpeed, SUMOAbstractRouter< E, V >::startQuery(), STEPS2TIME, SVC_IGNORING, UNREACHABLE, and SUMOAbstractRouter< E, V >::updateViaEdgeCost().

◆ edgeInfo() [1/2]

template<class E , class N , class V , class M >
SUMOAbstractRouter< E, V >::EdgeInfo * Node2EdgeRouter< E, N, V, M >::edgeInfo ( const E *const  edge)
inline

Returns the edge information for the passed edge.

Parameters
[in]edgeThe edge
Note
Non-const version

Definition at line 55 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::myEdgeInfos.

Referenced by Node2EdgeRouter< E, N, V, M >::reset().

Here is the caller graph for this function:

◆ edgeInfo() [2/2]

template<class E , class N , class V , class M >
const SUMOAbstractRouter< E, V >::EdgeInfo * Node2EdgeRouter< E, N, V, M >::edgeInfo ( const E *const  edge) const
inline

Returns the edge information for the passed edge.

Parameters
[in]edgeThe edge
Note
Const version

Definition at line 62 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::myEdgeInfos.

◆ endQuery()

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

◆ getEdgeInfo()

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

Definition at line 169 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::myEdgeInfos.

◆ getEffort()

◆ getTravelTime()

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

◆ getType()

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

Definition at line 165 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::myType.

◆ init() [1/2]

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

Definition at line 136 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::myAmClean, SUMOAbstractRouter< E, V >::myEdgeInfos, SUMOAbstractRouter< E, V >::myFound, SUMOAbstractRouter< E, V >::myFrontierList, and STEPS2TIME.

Referenced by AStarRouter< E, V, M >::compute(), DijkstraRouter< E, V >::compute(), and SUMOAbstractRouter< E, V >::setHint().

Here is the caller graph for this function:

◆ init() [2/2]

template<class E , class N , class V , class M >
void Node2EdgeRouter< E, N, V, M >::init ( std::vector< const E * >  fromEdges,
const V *const  vehicle,
const SUMOTime  msTime 
)
protected

Initialize the node-to-edge router.

Parameters
[in]fromEdgesThe vector of start edges
[in]vehicleThe vehicle
[in]msTimeThe start time in milliseconds

Definition at line 434 of file Node2EdgeRouter.h.

References STEPS2TIME.

Referenced by Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), and Node2EdgeRouter< E, N, V, M >::computeNode2Edges().

Here is the caller graph for this function:

◆ isProhibited()

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

◆ isValid()

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

Definition at line 260 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::isProhibited().

Referenced by RORouteDef::addAlternative().

Here is the caller graph for this function:

◆ prohibit()

template<class E , class V >
virtual void SUMOAbstractRouter< E, V >::prohibit ( const std::vector< E * > &  toProhibit)
inlinevirtualinherited

Reimplemented in CHRouter< E, V >, CHRouterWrapper< E, V >, IntermodalRouter< E, L, N, V >, PedestrianRouter< E, L, N, V >, and RailwayRouter< E, V >.

Definition at line 352 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::myEdgeInfos, and SUMOAbstractRouter< E, V >::myProhibited.

Referenced by AFBuild< E, N, V, M >::AFBuild(), IntermodalRouter< E, L, N, V >::prohibit(), PedestrianRouter< E, L, N, V >::prohibit(), and RailwayRouter< E, V >::prohibit().

Here is the caller graph for this function:

◆ recomputeCosts()

◆ recomputeCostsNoLastEdge()

template<class E , class N , class V , class M >
double Node2EdgeRouter< E, N, V, M >::recomputeCostsNoLastEdge ( const std::vector< const E * > &  edges,
const V *const  v,
SUMOTime  msTime,
double *  lengthp = nullptr 
) const
inline

Returns the recomputed cost for traversing the given edges, excluding the last one.

Parameters
[in]edgesThe vector of edges
[in]vThe vehicle
[in]msTimeThe start time in milliseconds
[in,out]lengthpThe passed and updated length

Definition at line 378 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::isProhibited(), STEPS2TIME, SUMOAbstractRouter< E, V >::updateViaCost(), and Node2EdgeRouter< E, N, V, M >::updateViaCostUpToEdge().

◆ recomputeCostsPos()

template<class E , class V >
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 287 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::getEffort(), SUMOAbstractRouter< E, V >::recomputeCosts(), and STEPS2TIME.

Referenced by MSDispatch::computeDetourTime().

Here is the caller graph for this function:

◆ reset()

template<class E , class N , class V , class M >
virtual void Node2EdgeRouter< E, N, V, M >::reset ( const V *const  vehicle)
inlinevirtual

◆ setAutoBulkMode()

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

Definition at line 348 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::myAutoBulkMode.

Referenced by LandmarkLookupTable< E, V, M >::LandmarkLookupTable().

Here is the caller graph for this function:

◆ setBulkMode()

template<class E , class N , class V , class M >
virtual void Node2EdgeRouter< E, N, V, M >::setBulkMode ( const bool  mode)
inlinevirtual

Bulk mode is not supported.

Reimplemented from SUMOAbstractRouter< E, V >.

Definition at line 404 of file Node2EdgeRouter.h.

References UNUSED_PARAMETER.

◆ setHint()

template<class E , class V >
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

◆ startQuery()

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

◆ updateViaCost()

template<class E , class V >
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

◆ updateViaCostUpToEdge()

template<class E , class N , class V , class M >
void Node2EdgeRouter< E, N, V, M >::updateViaCostUpToEdge ( const E *const  prev,
const E *const  e,
const V *const  v,
double &  time,
double &  effort,
double &  length 
) const

Updates the via cost up to a given edge.

Parameters
[in]prevThe previous edge
[in]eThe given edge
[in]vThe vehicle
[in,out]timeThe passed and updated start time in seconds
[in,out]effortThe passed and updated effort
[in,out]lengthThe passed and updated length

Definition at line 423 of file Node2EdgeRouter.h.

Referenced by Node2EdgeRouter< E, N, V, M >::recomputeCostsNoLastEdge().

Here is the caller graph for this function:

◆ updateViaEdgeCost()

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

Field Documentation

◆ myAmClean

◆ myAutoBulkMode

template<class E , class V >
bool SUMOAbstractRouter< E, V >::myAutoBulkMode
protectedinherited

whether we are currently trying to detect bulk mode automatically

Definition at line 387 of file SUMOAbstractRouter.h.

Referenced by DijkstraRouter< E, V >::clone(), DijkstraRouter< E, V >::compute(), and SUMOAbstractRouter< E, V >::setAutoBulkMode().

◆ myBulkMode

template<class E , class V >
bool SUMOAbstractRouter< E, V >::myBulkMode
protectedinherited

whether we are currently operating several route queries in a bulk

Definition at line 384 of file SUMOAbstractRouter.h.

Referenced by AStarRouter< E, V, M >::compute(), DijkstraRouter< E, V >::compute(), and SUMOAbstractRouter< E, V >::setBulkMode().

◆ myComparator

template<class E , class V , class M >
EdgeInfoComparator AStarRouter< E, V, M >::myComparator
protectedinherited

Definition at line 282 of file AStarRouter.h.

Referenced by AStarRouter< E, V, M >::compute().

◆ myEdgeInfos

◆ myErrorMsgHandler

◆ myFound

◆ myFrontierList

◆ myHavePermissions

◆ myHaveRestrictions

◆ myLookupTable

template<class E , class V , class M >
const std::shared_ptr<const LookupTable> AStarRouter< E, V, M >::myLookupTable
protectedinherited

◆ myMaxSpeed

◆ myNumQueries

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

◆ myOperation

◆ myProhibited

template<class E , class V >
std::vector<E*> SUMOAbstractRouter< E, V >::myProhibited
protectedinherited

The list of explicitly prohibited edges.

Definition at line 399 of file SUMOAbstractRouter.h.

Referenced by RailwayRouter< E, V >::_compute(), RailwayRouter< E, V >::prohibit(), and SUMOAbstractRouter< E, V >::prohibit().

◆ myQueryStartTime

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

the time spent querying in milliseconds

Definition at line 417 of file SUMOAbstractRouter.h.

Referenced by SUMOAbstractRouter< E, V >::endQuery(), and SUMOAbstractRouter< E, V >::startQuery().

◆ myQueryTimeSum

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

◆ myQueryVisits

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

counters for performance logging

Definition at line 414 of file SUMOAbstractRouter.h.

Referenced by SUMOAbstractRouter< E, V >::endQuery(), and SUMOAbstractRouter< E, V >::~SUMOAbstractRouter().

◆ myTTOperation

template<class E , class V >
Operation SUMOAbstractRouter< E, V >::myTTOperation
protectedinherited

The object's operation to perform for travel times.

Definition at line 381 of file SUMOAbstractRouter.h.

Referenced by DijkstraRouter< E, V >::clone(), and SUMOAbstractRouter< E, V >::getTravelTime().

◆ myType

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

the type of this router

Definition at line 411 of file SUMOAbstractRouter.h.

Referenced by SUMOAbstractRouter< E, V >::getType(), and SUMOAbstractRouter< E, V >::~SUMOAbstractRouter().


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