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

#include <DijkstraRouterEffort.h>

Inheritance diagram for DijkstraRouterEffort_ByProxi< E, V, PF >:
DijkstraRouterEffortBase< E, V, PF > SUMOAbstractRouter< E, V > PF

Public Types

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

Public Member Functions

void buildPathFrom (EdgeInfo *rbegin, std::vector< const E * > &edges)
 Builds the path from marked edges. More...
 
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. More...
 
 DijkstraRouterEffort_ByProxi (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. More...
 
MsgHandler *const myErrorMsgHandler
 the handler for routing errors More...
 
std::vector< EdgeInfo * > myFound
 list of visited Edges (for resetting) More...
 
std::vector< EdgeInfo * > myFrontierList
 A container for reusage of the min edge heap. More...
 

Private Attributes

Operation myEffortOperation
 The object's operation to perform for obtaining the effort. More...
 
Operation myTTOperation
 The object's operation to perform for obtaining the travel time. More...
 

Detailed Description

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

Definition at line 253 of file DijkstraRouterEffort.h.

Member Typedef Documentation

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

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

Definition at line 256 of file DijkstraRouterEffort.h.

Constructor & Destructor Documentation

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

Definition at line 258 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_ByProxi< E, V, PF >::getEffort ( const E *const  e,
const V *const  v,
SUMOReal  t 
) const
inlinevirtual

Implements DijkstraRouterEffortBase< E, V, PF >.

Definition at line 263 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>
SUMOReal DijkstraRouterEffort_ByProxi< E, V, PF >::getTravelTime ( const E *const  e,
const V *const  v,
SUMOReal  t 
) const
inlinevirtual

Implements DijkstraRouterEffortBase< E, V, PF >.

Definition at line 267 of file DijkstraRouterEffort.h.

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 81 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_ByProxi< E, V, PF >::myEffortOperation
private

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

Definition at line 273 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffort_ByProxi< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::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_ByProxi< E, V, PF >::myTTOperation
private

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

Definition at line 276 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffort_ByProxi< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::getTravelTime().


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