SUMO - Simulation of Urban MObility
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
PedestrianRouterDijkstra< E, L, N > Class Template Reference

#include <PedestrianRouter.h>

Inheritance diagram for PedestrianRouterDijkstra< E, L, N >:
PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > > SUMOAbstractRouter< E, PedestrianTrip< E, N > >

Public Types

typedef PedestrianEdge< E, L, N > _PedestrianEdge
typedef PedestrianTrip< E, N > _PedestrianTrip

Public Member Functions

virtual void compute (const E *from, const E *to, const PedestrianTrip< E, N > *const vehicle, SUMOTime msTime, std::vector< const E * > &into)=0
 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.
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.
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.
void endQuery (int visits)
virtual void prepare (const E *, const PedestrianTrip< E, N > *, bool)
void prohibit (const std::vector< E * > &toProhibit)
virtual SUMOReal recomputeCosts (const std::vector< const E * > &edges, const PedestrianTrip< E, N > *const v, SUMOTime msTime) const =0
SUMOReal recomputeCosts (const std::vector< const E * > &, const _PedestrianTrip *const, SUMOTime) const
void startQuery ()

Detailed Description

template<class E, class L, class N>
class PedestrianRouterDijkstra< E, L, N >

Definition at line 445 of file PedestrianRouter.h.

Member Typedef Documentation

Definition at line 370 of file PedestrianRouter.h.

Definition at line 371 of file PedestrianRouter.h.

Member Function Documentation

virtual void SUMOAbstractRouter< E, PedestrianTrip< E, N > >::compute ( const E *  from,
const E *  to,
const PedestrianTrip< E, N > *const  vehicle,
SUMOTime  msTime,
std::vector< const E * > &  into 
)
pure virtualinherited

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.

void PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::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 
)
inlineinherited

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.

References PedestrianEdge< E, L, N >::getArrivalEdge(), PedestrianEdge< E, L, N >::getDepartEdge(), PedestrianRouter< E, L, N, INTERNALROUTER >::myInternalRouter, TIME2STEPS, and toString().

void PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::compute ( const E *  ,
const E *  ,
const _PedestrianTrip const,
SUMOTime  ,
std::vector< const E * > &   
)
inlineinherited

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 413 of file PedestrianRouter.h.

virtual void SUMOAbstractRouter< E, PedestrianTrip< E, N > >::prepare ( const E *  ,
const PedestrianTrip< E, N > *  ,
bool   
)
inlinevirtualinherited

Definition at line 81 of file SUMOAbstractRouter.h.

void PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::prohibit ( const std::vector< E * > &  toProhibit)
inlineinherited
virtual SUMOReal SUMOAbstractRouter< E, PedestrianTrip< E, N > >::recomputeCosts ( const std::vector< const E * > &  edges,
const PedestrianTrip< E, N > *const  v,
SUMOTime  msTime 
) const
pure virtualinherited
SUMOReal PedestrianRouter< E, L, N, DijkstraRouterTT_Direct< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::recomputeCosts ( const std::vector< const E * > &  ,
const _PedestrianTrip const,
SUMOTime   
) const
inlineinherited

Definition at line 418 of file PedestrianRouter.h.


The documentation for this class was generated from the following file: