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

#include <DijkstraRouterTT.h>

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

Public Member Functions

 EdgeInfo (size_t id)
 Constructor. More...
 
void reset ()
 

Data Fields

const E * edge
 The current edge. More...
 
EdgeInfoprev
 The previous edge. More...
 
SUMOReal traveltime
 Effort to reach the edge. More...
 
bool visited
 The previous edge. More...
 

Detailed Description

template<class E, class V, class PF>
struct DijkstraRouterTT< 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 96 of file DijkstraRouterTT.h.

Constructor & Destructor Documentation

template<class E, class V, class PF>
DijkstraRouterTT< E, V, PF >::EdgeInfo::EdgeInfo ( size_t  id)
inline

Member Function Documentation

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

Definition at line 114 of file DijkstraRouterTT.h.

References max.

Field Documentation

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

The current edge.

Definition at line 103 of file DijkstraRouterTT.h.

Referenced by DijkstraRouterTT< E, V, PF >::EdgeInfoByTTComparator::operator()().

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

The previous edge.

Definition at line 109 of file DijkstraRouterTT.h.

template<class E, class V, class PF>
SUMOReal DijkstraRouterTT< E, V, PF >::EdgeInfo::traveltime
template<class E, class V, class PF>
bool DijkstraRouterTT< E, V, PF >::EdgeInfo::visited

The previous edge.

Definition at line 112 of file DijkstraRouterTT.h.


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