CHRouter< E, V, PF >::EdgeInfo Struct Reference

#include <CHRouter.h>

Collaboration diagram for CHRouter< E, V, PF >::EdgeInfo:

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...

Detailed Description

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

Constructor & Destructor Documentation

template<class E, class V, class PF>

CHRouter< E, V, PF >::EdgeInfo::EdgeInfo ( size_t  id )

inline

Constructor.

Definition at line 110 of file CHRouter.h.

Member Function Documentation

template<class E, class V, class PF>

void CHRouter< E, V, PF >::EdgeInfo::reset ( )

inline

Definition at line 135 of file CHRouter.h.

References max.

Referenced by CHRouter< E, V, PF >::Unidirectional::init().

Field Documentation

template<class E, class V, class PF>

const E* CHRouter< E, V, PF >::EdgeInfo::edge

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().

template<class E, class V, class PF>

EdgeInfo* CHRouter< E, V, PF >::EdgeInfo::prev

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().

template<class E, class V, class PF>

int CHRouter< E, V, PF >::EdgeInfo::rank

the contraction rank (higher means more important)

Definition at line 133 of file CHRouter.h.

Referenced by CHRouter< E, V, PF >::buildContractionHierarchy().

template<class E, class V, class PF>

SUMOReal CHRouter< E, V, PF >::EdgeInfo::traveltime

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().

template<class E, class V, class PF>

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().

template<class E, class V, class PF>

bool CHRouter< E, V, PF >::EdgeInfo::visited

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().

---

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

• CHRouter.h