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

#include <CHRouter.h>

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

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

Data Fields
const E *	edge
	The current edge. More...
EdgeInfo *	prev
	The previous edge. More...
double	traveltime
	Effort to reach the edge. 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 80 of file CHRouter.h.

Constructor & Destructor Documentation

template<class E, class V, class PF>

CHRouter< E, V, PF >::EdgeInfo::EdgeInfo ( const E *  e )

inline

Constructor.

Definition at line 83 of file CHRouter.h.

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

Member Function Documentation

template<class E, class V, class PF>

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

inline

Definition at line 102 of file CHRouter.h.

References max.

Field Documentation

template<class E, class V, class PF>

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

The current edge.

Definition at line 91 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 97 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>

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

Effort to reach the edge.

Definition at line 94 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>

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

Whether the shortest path to this edge is already found.

Definition at line 100 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