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. 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... | |
DijkstraRouterEffortBase (size_t noE, bool unbuildIsWarning) | |
Constructor. More... | |
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. More... | |
Protected Attributes | |
EdgeInfoByEffortComparator | 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... | |
Definition at line 67 of file DijkstraRouterEffort.h.
|
inline |
Constructor.
Definition at line 73 of file DijkstraRouterEffort.h.
|
inlinevirtual |
Destructor.
Definition at line 82 of file DijkstraRouterEffort.h.
|
inline |
Builds the path from marked edges.
Definition at line 226 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
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.
|
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().
|
pure virtual |
Implemented in DijkstraRouterEffort_Direct< E, V, PF >, DijkstraRouterEffort_ByProxi< E, V, PF >, and DijkstraRouterEffort_ByProxi< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::recomputeCosts().
|
pure virtual |
Implemented in DijkstraRouterEffort_Direct< E, V, PF >, DijkstraRouterEffort_ByProxi< E, V, PF >, and DijkstraRouterEffort_ByProxi< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::recomputeCosts().
|
inline |
Definition at line 135 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
inlinevirtualinherited |
Definition at line 80 of file SUMOAbstractRouter.h.
|
inlinevirtual |
Implements SUMOAbstractRouter< E, V >.
Definition at line 211 of file DijkstraRouterEffort.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().
|
protected |
Definition at line 244 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
protected |
The container of edge information.
Definition at line 237 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::DijkstraRouterEffortBase().
|
protected |
the handler for routing errors
Definition at line 247 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute().
|
protected |
list of visited Edges (for resetting)
Definition at line 242 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::init().
|
protected |
A container for reusage of the min edge heap.
Definition at line 240 of file DijkstraRouterEffort.h.
Referenced by DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::compute(), and DijkstraRouterEffortBase< MSEdge, SUMOVehicle, prohibited_withRestrictions< MSEdge, SUMOVehicle > >::init().