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

#include <DijkstraRouterEffort.h>

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

Data Structures

struct  EdgeInfo
class  EdgeInfoByEffortComparator

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.
 DijkstraRouterEffortBase (size_t noE, bool unbuildIsWarning)
 Constructor.
void endQuery (int visits)
virtual SUMOReal getEffort (const E *const e, const V *const v, SUMOReal t) const =0
virtual SUMOReal getTravelTime (const E *const e, const V *const v, SUMOReal t) const =0
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 ()
virtual ~DijkstraRouterEffortBase ()
 Destructor.

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.

Detailed Description

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

Definition at line 67 of file DijkstraRouterEffort.h.

Constructor & Destructor Documentation

template<class E, class V, class PF>
DijkstraRouterEffortBase< E, V, PF >::DijkstraRouterEffortBase ( size_t  noE,
bool  unbuildIsWarning 
)
inline

Constructor.

Definition at line 73 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>
virtual DijkstraRouterEffortBase< E, V, PF >::~DijkstraRouterEffortBase ( )
inlinevirtual

Destructor.

Definition at line 82 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 
)
inline
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 
)
inlinevirtual

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>
void DijkstraRouterEffortBase< E, V, PF >::init ( )
inline
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
inlinevirtual

Implements SUMOAbstractRouter< E, V >.

Definition at line 211 of file DijkstraRouterEffort.h.

Field Documentation

template<class E, class V, class PF>
MsgHandler* const DijkstraRouterEffortBase< E, V, PF >::myErrorMsgHandler
protected
template<class E, class V, class PF>
std::vector<EdgeInfo*> DijkstraRouterEffortBase< E, V, PF >::myFrontierList
protected

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