SUMO - Simulation of Urban MObility
|
#include <DijkstraRouterTT.h>
Public Types | |
typedef SUMOReal(EC::* | Operation )(const E *const, 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_ByProxi (size_t noE, bool unbuildIsWarningOnly, EC *receiver, 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< 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. | |
Private Attributes | |
Operation | myOperation |
The object's operation to perform. | |
EC * | myReceiver |
The object the action is directed to. |
Definition at line 262 of file DijkstraRouterTT.h.
typedef SUMOReal(EC::* DijkstraRouterTT_ByProxi< E, V, PF, EC >::Operation)(const E *const, const V *const, SUMOReal) const |
Type of the function that is used to retrieve the edge effort.
Definition at line 265 of file DijkstraRouterTT.h.
DijkstraRouterTT_ByProxi< E, V, PF, EC >::DijkstraRouterTT_ByProxi | ( | size_t | noE, |
bool | unbuildIsWarningOnly, | ||
EC * | receiver, | ||
Operation | operation | ||
) | [inline] |
Definition at line 267 of file DijkstraRouterTT.h.
void DijkstraRouterTTBase< E, V, PF >::buildPathFrom | ( | EdgeInfo * | rbegin, |
std::vector< const E * > & | edges | ||
) | [inline, inherited] |
Builds the path from marked edges.
Definition at line 236 of file DijkstraRouterTT.h.
References DijkstraRouterTTBase< E, V, PF >::EdgeInfo::edge, and DijkstraRouterTTBase< E, V, PF >::EdgeInfo::prev.
Referenced by DijkstraRouterTTBase< E, V, PF >::compute().
virtual void DijkstraRouterTTBase< E, V, PF >::compute | ( | const E * | from, |
const E * | to, | ||
const V *const | vehicle, | ||
SUMOTime | msTime, | ||
std::vector< const E * > & | into | ||
) | [inline, virtual, inherited] |
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 DijkstraRouterTT.h.
References DijkstraRouterTTBase< E, V, PF >::buildPathFrom(), DijkstraRouterTTBase< E, V, PF >::EdgeInfo::edge, SUMOAbstractRouter< E, V >::endQuery(), DijkstraRouterTTBase< E, V, PF >::getEffort(), MsgHandler::inform(), DijkstraRouterTTBase< E, V, PF >::init(), max, DijkstraRouterTTBase< E, V, PF >::myComparator, DijkstraRouterTTBase< E, V, PF >::myEdgeInfos, DijkstraRouterTTBase< E, V, PF >::myErrorMsgHandler, DijkstraRouterTTBase< E, V, PF >::myFound, DijkstraRouterTTBase< E, V, PF >::myFrontierList, DijkstraRouterTTBase< E, V, PF >::EdgeInfo::prev, SUMOAbstractRouter< E, V >::startQuery(), STEPS2TIME, SUMOReal, toString(), DijkstraRouterTTBase< E, V, PF >::EdgeInfo::traveltime, and DijkstraRouterTTBase< E, V, PF >::EdgeInfo::visited.
Referenced by MSTriggeredRerouter::notifyEnter(), and TraCIServerAPI_Vehicle::processSet().
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().
SUMOReal DijkstraRouterTT_ByProxi< E, V, PF, EC >::getEffort | ( | const E *const | e, |
const V *const | v, | ||
SUMOReal | t | ||
) | const [inline, virtual] |
Implements DijkstraRouterTTBase< E, V, PF >.
Definition at line 271 of file DijkstraRouterTT.h.
References DijkstraRouterTT_ByProxi< E, V, PF, EC >::myOperation, and DijkstraRouterTT_ByProxi< E, V, PF, EC >::myReceiver.
void DijkstraRouterTTBase< E, V, PF >::init | ( | ) | [inline, inherited] |
Definition at line 135 of file DijkstraRouterTT.h.
References DijkstraRouterTTBase< E, V, PF >::myFound, and DijkstraRouterTTBase< E, V, PF >::myFrontierList.
Referenced by DijkstraRouterTTBase< 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 DijkstraRouterTTBase< E, V, PF >::recomputeCosts | ( | const std::vector< const E * > & | edges, |
const V *const | v, | ||
SUMOTime | msTime | ||
) | const [inline, virtual, inherited] |
Implements SUMOAbstractRouter< E, V >.
Definition at line 222 of file DijkstraRouterTT.h.
References DijkstraRouterTTBase< E, V, PF >::getEffort(), 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().
EdgeInfoByTTComparator DijkstraRouterTTBase< E, V, PF >::myComparator [protected, inherited] |
Definition at line 254 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< E, V, PF >::compute().
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().
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().
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().
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().
Operation DijkstraRouterTT_ByProxi< E, V, PF, EC >::myOperation [private] |
The object's operation to perform.
Definition at line 280 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTT_ByProxi< E, V, PF, EC >::getEffort().
EC* DijkstraRouterTT_ByProxi< E, V, PF, EC >::myReceiver [private] |
The object the action is directed to.
Definition at line 277 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTT_ByProxi< E, V, PF, EC >::getEffort().