SUMO - Simulation of Urban MObility
|
#include <DijkstraRouterEffort.h>
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< EdgeInfo > | myEdgeInfos |
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. |
Definition at line 66 of file DijkstraRouterEffort.h.
DijkstraRouterEffortBase< E, V, PF >::DijkstraRouterEffortBase | ( | size_t | noE, |
bool | unbuildIsWarning | ||
) | [inline] |
Constructor.
Definition at line 72 of file DijkstraRouterEffort.h.
References DijkstraRouterEffortBase< E, V, PF >::myEdgeInfos.
virtual DijkstraRouterEffortBase< E, V, PF >::~DijkstraRouterEffortBase | ( | ) | [inline, virtual] |
Destructor.
Definition at line 82 of file DijkstraRouterEffort.h.
void DijkstraRouterEffortBase< E, V, PF >::buildPathFrom | ( | EdgeInfo * | rbegin, |
std::vector< const E * > & | edges | ||
) | [inline] |
Builds the path from marked edges.
Definition at line 226 of file DijkstraRouterEffort.h.
References DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::edge, and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::prev.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute().
virtual void DijkstraRouterEffortBase< E, V, PF >::compute | ( | const E * | from, |
const E * | to, | ||
const V *const | vehicle, | ||
SUMOTime | msTime, | ||
std::vector< const E * > & | into | ||
) | [inline, virtual] |
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.
References DijkstraRouterEffortBase< E, V, PF >::buildPathFrom(), DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::edge, DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::effort, SUMOAbstractRouter< E, V >::endQuery(), DijkstraRouterEffortBase< E, V, PF >::getEffort(), DijkstraRouterEffortBase< E, V, PF >::getTravelTime(), MsgHandler::inform(), DijkstraRouterEffortBase< E, V, PF >::init(), DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::leaveTime, max, DijkstraRouterEffortBase< E, V, PF >::myComparator, DijkstraRouterEffortBase< E, V, PF >::myEdgeInfos, DijkstraRouterEffortBase< E, V, PF >::myErrorMsgHandler, DijkstraRouterEffortBase< E, V, PF >::myFound, DijkstraRouterEffortBase< E, V, PF >::myFrontierList, DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::prev, SUMOAbstractRouter< E, V >::startQuery(), STEPS2TIME, SUMOReal, and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::visited.
void SUMOAbstractRouter< E, V >::endQuery | ( | int | visits | ) | [inline, inherited] |
Definition at line 89 of file SUMOAbstractRouter.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute(), DijkstraRouterTTBase< E, V, PF >::compute(), and AStarRouterTTBase< E, V, PF >::compute().
virtual SUMOReal DijkstraRouterEffortBase< E, V, PF >::getEffort | ( | const E *const | e, |
const V *const | v, | ||
SUMOReal | t | ||
) | const [pure virtual] |
virtual SUMOReal DijkstraRouterEffortBase< E, V, PF >::getTravelTime | ( | const E *const | e, |
const V *const | v, | ||
SUMOReal | t | ||
) | const [pure virtual] |
void DijkstraRouterEffortBase< E, V, PF >::init | ( | ) | [inline] |
Definition at line 135 of file DijkstraRouterEffort.h.
References DijkstraRouterEffortBase< E, V, PF >::myFound, and DijkstraRouterEffortBase< E, V, PF >::myFrontierList.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute().
virtual void SUMOAbstractRouter< E, V >::prepare | ( | const E * | , |
const V * | , | ||
bool | |||
) | [inline, virtual, inherited] |
Definition at line 80 of file SUMOAbstractRouter.h.
SUMOReal DijkstraRouterEffortBase< E, V, PF >::recomputeCosts | ( | const std::vector< const E * > & | edges, |
const V *const | v, | ||
SUMOTime | msTime | ||
) | const [inline, virtual] |
Implements SUMOAbstractRouter< E, V >.
Definition at line 211 of file DijkstraRouterEffort.h.
References DijkstraRouterEffortBase< E, V, PF >::getEffort(), DijkstraRouterEffortBase< E, V, PF >::getTravelTime(), STEPS2TIME, and SUMOReal.
void SUMOAbstractRouter< E, V >::startQuery | ( | ) | [inline, inherited] |
Definition at line 84 of file SUMOAbstractRouter.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute(), DijkstraRouterTTBase< E, V, PF >::compute(), and AStarRouterTTBase< E, V, PF >::compute().
EdgeInfoByEffortComparator DijkstraRouterEffortBase< E, V, PF >::myComparator [protected] |
Definition at line 244 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute().
std::vector<EdgeInfo> DijkstraRouterEffortBase< E, V, PF >::myEdgeInfos [protected] |
The container of edge information.
Definition at line 237 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute(), and DijkstraRouterEffortBase< E, V, PF >::DijkstraRouterEffortBase().
MsgHandler* const DijkstraRouterEffortBase< E, V, PF >::myErrorMsgHandler [protected] |
the handler for routing errors
Definition at line 247 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute().
std::vector<EdgeInfo*> DijkstraRouterEffortBase< E, V, PF >::myFound [protected] |
list of visited Edges (for resetting)
Definition at line 242 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute(), and DijkstraRouterEffortBase< E, V, PF >::init().
std::vector<EdgeInfo*> DijkstraRouterEffortBase< E, V, PF >::myFrontierList [protected] |
A container for reusage of the min edge heap.
Definition at line 240 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute(), and DijkstraRouterEffortBase< E, V, PF >::init().