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

#include <PedestrianRouter.h>

Inheritance diagram for PedestrianRouterDijkstra< E, L, N >:
PedestrianRouter< E, L, N, DijkstraRouterTT< 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
 
typedef SUMOReal(* Operation )(const E *const, const PedestrianTrip< E, N > *const, SUMOReal)
 Type of the function that is used to retrieve the edge effort. More...
 

Public Member Functions

virtual SUMOAbstractRouter< E,
PedestrianTrip< E, N > > * 
clone () const
 
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)
 
SUMOReal getEffort (const E *const e, const PedestrianTrip< E, N > *const v, SUMOReal t) const
 
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 ()
 

Protected Attributes

Operation myOperation
 The object's operation to perform. More...
 

Detailed Description

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

Definition at line 544 of file PedestrianRouter.h.

Member Typedef Documentation

typedef PedestrianEdge<E, L, N> PedestrianRouter< E, L, N, DijkstraRouterTT< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::_PedestrianEdge
inherited

Definition at line 452 of file PedestrianRouter.h.

Definition at line 453 of file PedestrianRouter.h.

typedef SUMOReal(* SUMOAbstractRouter< E, PedestrianTrip< E, N > >::Operation)(const E *const, const PedestrianTrip< E, N > *const, SUMOReal)
inherited

Type of the function that is used to retrieve the edge effort.

Definition at line 56 of file SUMOAbstractRouter.h.

Member Function Documentation

virtual SUMOAbstractRouter<E, PedestrianTrip<E, N> >* PedestrianRouter< E, L, N, DijkstraRouterTT< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::clone ( ) const
inlinevirtualinherited
void PedestrianRouter< E, L, N, DijkstraRouterTT< 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 473 of file PedestrianRouter.h.

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

void PedestrianRouter< E, L, N, DijkstraRouterTT< 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 * > &   
)
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, PedestrianTrip< E, N > >.

Definition at line 512 of file PedestrianRouter.h.

SUMOReal SUMOAbstractRouter< E, PedestrianTrip< E, N > >::getEffort ( const E *const  e,
const PedestrianTrip< E, N > *const  v,
SUMOReal  t 
) const
inlineinherited

Definition at line 91 of file SUMOAbstractRouter.h.

References SUMOAbstractRouter< E, V >::myOperation.

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

Definition at line 87 of file SUMOAbstractRouter.h.

void PedestrianRouter< E, L, N, DijkstraRouterTT< PedestrianEdge< E, L, N >, PedestrianTrip< E, N >, prohibited_withRestrictions< PedestrianEdge< E, L, N >, PedestrianTrip< E, N > > > >::prohibit ( const std::vector< E * > &  toProhibit)
inlineinherited
SUMOReal PedestrianRouter< E, L, N, DijkstraRouterTT< 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
inlinevirtualinherited

Field Documentation

Operation SUMOAbstractRouter< E, PedestrianTrip< E, N > >::myOperation
protectedinherited

The object's operation to perform.

Definition at line 107 of file SUMOAbstractRouter.h.


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