SUMO - Simulation of Urban MObility
DijkstraRouterTT_Direct< E, V, PF > Class Template Reference

#include <DijkstraRouterTT.h>

Inheritance diagram for DijkstraRouterTT_Direct< E, V, PF >:
DijkstraRouterTTBase< E, V, PF > SUMOAbstractRouter< E, V > PF

Public Types

typedef SUMOReal(E::* Operation )(const V *const, SUMOReal) const
 Type of the function that is used to retrieve the edge effort.

Public Member Functions

void buildPathFrom (EdgeInfo *rbegin, std::vector< const E * > &edges)
 Builds the path from marked edges.
virtual void compute (const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into)
 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.
 DijkstraRouterTT_Direct (size_t noE, bool unbuildIsWarningOnly, Operation operation)
void endQuery (int visits)
SUMOReal getEffort (const E *const e, const V *const v, SUMOReal t) const
void init ()
virtual void prepare (const E *, const V *, bool)
SUMOReal recomputeCosts (const std::vector< const E * > &edges, const V *const v, SUMOTime msTime) const
void startQuery ()

Protected Attributes

EdgeInfoByTTComparator myComparator
std::vector< EdgeInfomyEdgeInfos
 The container of edge information.
MsgHandler *const myErrorMsgHandler
 the handler for routing errors
std::vector< EdgeInfo * > myFound
 list of visited Edges (for resetting)
std::vector< EdgeInfo * > myFrontierList
 A container for reusage of the min edge heap.

Private Attributes

Operation myOperation

Detailed Description

template<class E, class V, class PF>
class DijkstraRouterTT_Direct< E, V, PF >

Definition at line 287 of file DijkstraRouterTT.h.


Member Typedef Documentation

template<class E , class V , class PF >
typedef SUMOReal(E::* DijkstraRouterTT_Direct< E, V, PF >::Operation)(const V *const, SUMOReal) const

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

Definition at line 290 of file DijkstraRouterTT.h.


Constructor & Destructor Documentation

template<class E , class V , class PF >
DijkstraRouterTT_Direct< E, V, PF >::DijkstraRouterTT_Direct ( size_t  noE,
bool  unbuildIsWarningOnly,
Operation  operation 
) [inline]

Definition at line 292 of file DijkstraRouterTT.h.


Member Function Documentation

template<class E , class V , class PF >
void DijkstraRouterTTBase< E, V, PF >::buildPathFrom ( EdgeInfo rbegin,
std::vector< const E * > &  edges 
) [inline, inherited]
template<class E, class V>
void SUMOAbstractRouter< E, V >::endQuery ( int  visits) [inline, inherited]
template<class E , class V , class PF >
SUMOReal DijkstraRouterTT_Direct< E, V, PF >::getEffort ( const E *const  e,
const V *const  v,
SUMOReal  t 
) const [inline, virtual]
template<class E , class V , class PF >
void DijkstraRouterTTBase< E, V, PF >::init ( ) [inline, inherited]
template<class E, class V>
virtual void SUMOAbstractRouter< E, V >::prepare ( const E *  ,
const V *  ,
bool   
) [inline, virtual, inherited]

Definition at line 80 of file SUMOAbstractRouter.h.

template<class E , class V , class PF >
SUMOReal DijkstraRouterTTBase< E, V, PF >::recomputeCosts ( const std::vector< const E * > &  edges,
const V *const  v,
SUMOTime  msTime 
) const [inline, virtual, inherited]
template<class E, class V>
void SUMOAbstractRouter< E, V >::startQuery ( ) [inline, inherited]

Field Documentation

template<class E , class V , class PF >
EdgeInfoByTTComparator DijkstraRouterTTBase< E, V, PF >::myComparator [protected, inherited]

Definition at line 254 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTTBase< E, V, PF >::compute().

template<class E , class V , class PF >
std::vector<EdgeInfo> DijkstraRouterTTBase< E, V, PF >::myEdgeInfos [protected, inherited]

The container of edge information.

Definition at line 247 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTTBase< E, V, PF >::compute(), and DijkstraRouterTTBase< E, V, PF >::DijkstraRouterTTBase().

template<class E , class V , class PF >
MsgHandler* const DijkstraRouterTTBase< E, V, PF >::myErrorMsgHandler [protected, inherited]

the handler for routing errors

Definition at line 257 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTTBase< E, V, PF >::compute().

template<class E , class V , class PF >
std::vector<EdgeInfo*> DijkstraRouterTTBase< E, V, PF >::myFound [protected, inherited]

list of visited Edges (for resetting)

Definition at line 252 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTTBase< E, V, PF >::compute(), and DijkstraRouterTTBase< E, V, PF >::init().

template<class E , class V , class PF >
std::vector<EdgeInfo*> DijkstraRouterTTBase< E, V, PF >::myFrontierList [protected, inherited]

A container for reusage of the min edge heap.

Definition at line 250 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTTBase< E, V, PF >::compute(), and DijkstraRouterTTBase< E, V, PF >::init().

template<class E , class V , class PF >
Operation DijkstraRouterTT_Direct< E, V, PF >::myOperation [private]

Definition at line 300 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTT_Direct< E, V, PF >::getEffort().


The documentation for this class was generated from the following file:
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Friends Defines