SUMO - Simulation of Urban MObility
|
#include <PedestrianRouter.h>
Public Types | |
typedef PedestrianEdge< E, L, N > | _PedestrianEdge |
typedef PedestrianTrip< E, N > | _PedestrianTrip |
Public Member Functions | |
void | compute (const E *from, const E *to, SUMOReal departPos, SUMOReal arrivalPos, SUMOReal speed, SUMOTime msTime, const N *onlyNode, std::vector< const E * > &into, bool allEdges=false) |
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... | |
void | compute (const E *, const E *, const _PedestrianTrip *const, SUMOTime, std::vector< const E * > &) |
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... | |
void | endQuery (int visits) |
PedestrianRouter () | |
Constructor. More... | |
virtual void | prepare (const E *, const PedestrianTrip< E, N > *, bool) |
void | prohibit (const std::vector< E * > &toProhibit) |
SUMOReal | recomputeCosts (const std::vector< const E * > &, const _PedestrianTrip *const, SUMOTime) const |
void | startQuery () |
virtual | ~PedestrianRouter () |
Destructor. More... | |
Private Member Functions | |
PedestrianRouter & | operator= (const PedestrianRouter &s) |
Invalidated assignment operator. More... | |
Private Attributes | |
INTERNALROUTER * | myInternalRouter |
The router for pedestrians (on a bidirectional network of sidewalks and crossings
Definition at line 367 of file PedestrianRouter.h.
typedef PedestrianEdge<E, L, N> PedestrianRouter< E, L, N, INTERNALROUTER >::_PedestrianEdge |
Definition at line 370 of file PedestrianRouter.h.
typedef PedestrianTrip<E, N> PedestrianRouter< E, L, N, INTERNALROUTER >::_PedestrianTrip |
Definition at line 371 of file PedestrianRouter.h.
|
inline |
Constructor.
Definition at line 374 of file PedestrianRouter.h.
|
inlinevirtual |
Destructor.
Definition at line 381 of file PedestrianRouter.h.
|
inline |
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.
Definition at line 387 of file PedestrianRouter.h.
Referenced by MSPModel_Striping::getNextLane(), MSRouteHandler::myStartElement(), MSPModel_Striping::PState::PState(), and RORouteHandler::routePedestrian().
|
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, PedestrianTrip< E, N > >.
Definition at line 413 of file PedestrianRouter.h.
|
inlineinherited |
Definition at line 90 of file SUMOAbstractRouter.h.
References SysUtils::getCurrentMillis(), SUMOAbstractRouter< E, V >::myQueryStartTime, SUMOAbstractRouter< E, V >::myQueryTimeSum, and SUMOAbstractRouter< E, V >::myQueryVisits.
|
private |
Invalidated assignment operator.
|
inlinevirtualinherited |
Definition at line 81 of file SUMOAbstractRouter.h.
|
inline |
Definition at line 422 of file PedestrianRouter.h.
Referenced by MSNet::getPedestrianRouter().
|
inlinevirtual |
Implements SUMOAbstractRouter< E, PedestrianTrip< E, N > >.
Definition at line 418 of file PedestrianRouter.h.
|
inlineinherited |
Definition at line 85 of file SUMOAbstractRouter.h.
References SysUtils::getCurrentMillis(), SUMOAbstractRouter< E, V >::myNumQueries, and SUMOAbstractRouter< E, V >::myQueryStartTime.
|
private |
Definition at line 432 of file PedestrianRouter.h.
Referenced by PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::compute(), PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::PedestrianRouter(), PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::prohibit(), and PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::~PedestrianRouter().