SUMO - Simulation of Urban MObility
|
#include <DijkstraRouterEffort.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. | |
DijkstraRouterEffort_ByProxi (size_t noE, bool unbuildIsWarningOnly, EC *receiver, 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< 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 | myEffortOperation |
The object's operation to perform for obtaining the effort. | |
EC * | myReceiver |
The object the action is directed to. | |
Operation | myTTOperation |
The object's operation to perform for obtaining the travel time. |
Definition at line 253 of file DijkstraRouterEffort.h.
typedef SUMOReal(EC::* DijkstraRouterEffort_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 256 of file DijkstraRouterEffort.h.
|
inline |
Definition at line 258 of file DijkstraRouterEffort.h.
|
inlineinherited |
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().
|
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.
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.
|
inlineinherited |
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().
|
inlinevirtual |
Implements DijkstraRouterEffortBase< E, V, PF >.
Definition at line 262 of file DijkstraRouterEffort.h.
References DijkstraRouterEffort_ByProxi< E, V, PF, EC >::myEffortOperation, and DijkstraRouterEffort_ByProxi< E, V, PF, EC >::myReceiver.
|
inlinevirtual |
Implements DijkstraRouterEffortBase< E, V, PF >.
Definition at line 266 of file DijkstraRouterEffort.h.
References DijkstraRouterEffort_ByProxi< E, V, PF, EC >::myReceiver, and DijkstraRouterEffort_ByProxi< E, V, PF, EC >::myTTOperation.
|
inlineinherited |
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().
|
inlinevirtualinherited |
Definition at line 80 of file SUMOAbstractRouter.h.
|
inlinevirtualinherited |
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.
|
inlineinherited |
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().
|
protectedinherited |
Definition at line 244 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute().
|
protectedinherited |
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().
|
private |
The object's operation to perform for obtaining the effort.
Definition at line 275 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffort_ByProxi< E, V, PF, EC >::getEffort().
|
protectedinherited |
the handler for routing errors
Definition at line 247 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< E, V, PF >::compute().
|
protectedinherited |
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().
|
protectedinherited |
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().
|
private |
The object the action is directed to.
Definition at line 272 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffort_ByProxi< E, V, PF, EC >::getEffort(), and DijkstraRouterEffort_ByProxi< E, V, PF, EC >::getTravelTime().
|
private |
The object's operation to perform for obtaining the travel time.
Definition at line 278 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffort_ByProxi< E, V, PF, EC >::getTravelTime().