SUMO - Simulation of Urban MObility
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
DijkstraRouterEffort_Direct< E, V, PF > Class Template Reference

#include <DijkstraRouterEffort.h>

Inheritance diagram for DijkstraRouterEffort_Direct< E, V, PF >:
DijkstraRouterEffortBase< 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.
 DijkstraRouterEffort_Direct (size_t noE, bool unbuildIsWarningOnly, Operation effortOperation, Operation ttOperation)
void endQuery (int visits)
SUMOReal getEffort (const E *const e, const V *const v, SUMOReal t) const
SUMOReal getTravelTime (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

EdgeInfoByEffortComparator 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 myEffortOperation
 The object's operation to perform for obtaining the effort.
Operation myTTOperation
 The object's operation to perform for obtaining the travel time.

Detailed Description

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

Definition at line 282 of file DijkstraRouterEffort.h.

Member Typedef Documentation

template<class E, class V, class PF>
typedef SUMOReal(E::* DijkstraRouterEffort_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 285 of file DijkstraRouterEffort.h.

Constructor & Destructor Documentation

template<class E, class V, class PF>
DijkstraRouterEffort_Direct< E, V, PF >::DijkstraRouterEffort_Direct ( size_t  noE,
bool  unbuildIsWarningOnly,
Operation  effortOperation,
Operation  ttOperation 
)
inline

Definition at line 287 of file DijkstraRouterEffort.h.

Member Function Documentation

template<class E, class V, class PF>
void DijkstraRouterEffortBase< E, V, PF >::buildPathFrom ( EdgeInfo rbegin,
std::vector< const E * > &  edges 
)
inlineinherited
template<class E, class V, class PF>
virtual void DijkstraRouterEffortBase< E, V, PF >::compute ( const E *  from,
const E *  to,
const V *const  vehicle,
SUMOTime  msTime,
std::vector< const E * > &  into 
)
inlinevirtualinherited

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.

Implements SUMOAbstractRouter< E, V >.

Definition at line 150 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>
SUMOReal DijkstraRouterEffort_Direct< E, V, PF >::getEffort ( const E *const  e,
const V *const  v,
SUMOReal  t 
) const
inlinevirtual
template<class E, class V, class PF>
SUMOReal DijkstraRouterEffort_Direct< E, V, PF >::getTravelTime ( const E *const  e,
const V *const  v,
SUMOReal  t 
) const
inlinevirtual
template<class E, class V, class PF>
void DijkstraRouterEffortBase< E, V, PF >::init ( )
inlineinherited
template<class E, class V>
virtual void SUMOAbstractRouter< E, V >::prepare ( const E *  ,
const V *  ,
bool   
)
inlinevirtualinherited

Definition at line 80 of file SUMOAbstractRouter.h.

template<class E, class V, class PF>
SUMOReal DijkstraRouterEffortBase< E, V, PF >::recomputeCosts ( const std::vector< const E * > &  edges,
const V *const  v,
SUMOTime  msTime 
) const
inlinevirtualinherited

Implements SUMOAbstractRouter< E, V >.

Definition at line 211 of file DijkstraRouterEffort.h.

Field Documentation

template<class E, class V, class PF>
EdgeInfoByEffortComparator DijkstraRouterEffortBase< E, V, PF >::myComparator
protectedinherited
template<class E, class V, class PF>
Operation DijkstraRouterEffort_Direct< E, V, PF >::myEffortOperation
private

The object's operation to perform for obtaining the effort.

Definition at line 301 of file DijkstraRouterEffort.h.

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

template<class E, class V, class PF>
MsgHandler* const DijkstraRouterEffortBase< E, V, PF >::myErrorMsgHandler
protectedinherited
template<class E, class V, class PF>
std::vector<EdgeInfo*> DijkstraRouterEffortBase< E, V, PF >::myFrontierList
protectedinherited
template<class E, class V, class PF>
Operation DijkstraRouterEffort_Direct< E, V, PF >::myTTOperation
private

The object's operation to perform for obtaining the travel time.

Definition at line 304 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffort_Direct< E, V, PF >::getTravelTime().


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