SUMO - Simulation of Urban MObility
|
#include <DijkstraRouterTT.h>
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... | |
DijkstraRouterTT_ByProxi (size_t noE, bool unbuildIsWarningOnly, 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. 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 | myOperation |
The object's operation to perform. More... | |
Definition at line 263 of file DijkstraRouterTT.h.
typedef SUMOReal(* DijkstraRouterTT_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 266 of file DijkstraRouterTT.h.
|
inline |
Definition at line 268 of file DijkstraRouterTT.h.
|
inlineinherited |
Builds the path from marked edges.
Definition at line 237 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::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 151 of file DijkstraRouterTT.h.
|
inlineinherited |
Definition at line 89 of file SUMOAbstractRouter.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and AStarRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
inlinevirtual |
Implements DijkstraRouterTTBase< E, V, PF >.
Definition at line 272 of file DijkstraRouterTT.h.
|
inlineinherited |
Definition at line 136 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
inlinevirtualinherited |
Definition at line 80 of file SUMOAbstractRouter.h.
|
inlinevirtualinherited |
Implements SUMOAbstractRouter< E, V >.
Definition at line 223 of file DijkstraRouterTT.h.
|
inlineinherited |
Definition at line 84 of file SUMOAbstractRouter.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and AStarRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
protectedinherited |
Definition at line 255 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
protectedinherited |
The container of edge information.
Definition at line 248 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::DijkstraRouterTTBase().
|
protectedinherited |
the handler for routing errors
Definition at line 258 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
protectedinherited |
list of visited Edges (for resetting)
Definition at line 253 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::init().
|
protectedinherited |
A container for reusage of the min edge heap.
Definition at line 251 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterTTBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::init().
|
private |
The object's operation to perform.
Definition at line 278 of file DijkstraRouterTT.h.
Referenced by DijkstraRouterTT_ByProxi< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::getEffort().