SUMO - Simulation of Urban MObility
|
#include <CHRouter.h>
Public Member Functions | |
EdgeInfo (size_t id) | |
Constructor. More... | |
void | reset () |
Data Fields | |
const E * | edge |
The current edge. More... | |
EdgeInfo * | prev |
The previous edge. More... | |
int | rank |
the contraction rank (higher means more important) More... | |
SUMOReal | traveltime |
Effort to reach the edge. More... | |
std::vector< Connection > | upward |
Connections to higher ranked nodes. More... | |
bool | visited |
Whether the shortest path to this edge is already found. More... | |
A definition about a route's edge with the effort needed to reach it and the information about the previous edge.
Definition at line 107 of file CHRouter.h.
Constructor.
Definition at line 110 of file CHRouter.h.
Definition at line 135 of file CHRouter.h.
References max.
Referenced by CHRouter< E, V, PF >::Unidirectional::init().
The current edge.
Definition at line 118 of file CHRouter.h.
Referenced by CHRouter< E, V, PF >::buildPathFromMeeting(), CHRouter< E, V, PF >::Unidirectional::EdgeInfoByTTComparator::operator()(), and CHRouter< E, V, PF >::Unidirectional::step().
The previous edge.
Definition at line 124 of file CHRouter.h.
Referenced by CHRouter< E, V, PF >::buildPathFromMeeting(), CHRouter< E, V, PF >::Unidirectional::init(), and CHRouter< E, V, PF >::Unidirectional::step().
the contraction rank (higher means more important)
Definition at line 133 of file CHRouter.h.
Referenced by CHRouter< E, V, PF >::buildContractionHierarchy().
Effort to reach the edge.
Definition at line 121 of file CHRouter.h.
Referenced by CHRouter< E, V, PF >::Unidirectional::init(), CHRouter< E, V, PF >::Unidirectional::EdgeInfoByTTComparator::operator()(), and CHRouter< E, V, PF >::Unidirectional::step().
std::vector<Connection> CHRouter< E, V, PF >::EdgeInfo::upward |
Connections to higher ranked nodes.
Definition at line 130 of file CHRouter.h.
Referenced by CHRouter< E, V, PF >::buildContractionHierarchy(), and CHRouter< E, V, PF >::Unidirectional::step().
Whether the shortest path to this edge is already found.
Definition at line 127 of file CHRouter.h.
Referenced by CHRouter< E, V, PF >::Unidirectional::step().