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

#include <DijkstraRouterEffort.h>

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

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

Data Fields
const E *	edge
	The current edge. More...
double	effort
	Effort to reach the edge. More...
double	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

template<class E, class V, class PF>

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

inline

Constructor.

Definition at line 79 of file DijkstraRouterEffort.h.

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

Member Function Documentation

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

template<class E, class V, class PF>

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

The current edge.

Definition at line 83 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffort< E, V, PF >::buildPathFrom(), DijkstraRouterEffort< E, V, PF >::compute(), and DijkstraRouterEffort< E, V, PF >::EdgeInfoByEffortComparator::operator()().

template<class E, class V, class PF>

double DijkstraRouterEffort< E, V, PF >::EdgeInfo::effort

Effort to reach the edge.

Definition at line 86 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffort< E, V, PF >::compute(), and DijkstraRouterEffort< E, V, PF >::EdgeInfoByEffortComparator::operator()().

template<class E, class V, class PF>

double DijkstraRouterEffort< E, V, PF >::EdgeInfo::leaveTime

The time the vehicle leaves the edge.

Definition at line 89 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffort< E, V, PF >::compute().

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.

Referenced by DijkstraRouterEffort< E, V, PF >::buildPathFrom(), and DijkstraRouterEffort< E, V, PF >::compute().

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.

Referenced by DijkstraRouterEffort< E, V, PF >::compute().

---

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

• DijkstraRouterEffort.h