SUMO - Simulation of Urban MObility
DijkstraRouterEffort< E, V, PF >::EdgeInfo Struct Reference

#include <DijkstraRouterEffort.h>

Collaboration diagram for DijkstraRouterEffort< E, V, PF >::EdgeInfo:
Collaboration graph

Public Member Functions

 EdgeInfo (const E *e)
 Constructor. More...
 
void reset ()
 

Data Fields

const E * edge
 The current edge. More...
 
SUMOReal effort
 Effort to reach the edge. More...
 
SUMOReal leaveTime
 The time the vehicle leaves the edge. More...
 
EdgeInfo * prev
 The previous edge. More...
 
bool visited
 The previous edge. More...
 

Detailed Description

template<class E, class V, class PF>
struct DijkstraRouterEffort< E, V, PF >::EdgeInfo

A definition about a route's edge with the effort needed to reach it and the information about the previous edge.

Definition at line 76 of file DijkstraRouterEffort.h.

Constructor & Destructor Documentation

§ EdgeInfo()

Member Function Documentation

§ reset()

template<class E, class V, class PF>
void DijkstraRouterEffort< E, V, PF >::EdgeInfo::reset ( )
inline

Definition at line 97 of file DijkstraRouterEffort.h.

References max.

Field Documentation

§ edge

template<class E, class V, class PF>
const E* DijkstraRouterEffort< E, V, PF >::EdgeInfo::edge

§ effort

§ leaveTime

template<class E, class V, class PF>
SUMOReal DijkstraRouterEffort< E, V, PF >::EdgeInfo::leaveTime

§ prev

template<class E, class V, class PF>
EdgeInfo* DijkstraRouterEffort< E, V, PF >::EdgeInfo::prev

The previous edge.

Definition at line 92 of file DijkstraRouterEffort.h.

§ visited

template<class E, class V, class PF>
bool DijkstraRouterEffort< E, V, PF >::EdgeInfo::visited

The previous edge.

Definition at line 95 of file DijkstraRouterEffort.h.


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