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

#include <DijkstraRouterEffort.h>

Public Member Functions
	EdgeInfo (size_t id)
	Constructor. More...
void	reset ()

Data Fields
const E *	edge
	The current edge. More...
SUMOReal	effort
	Effort to reach the edge. More...
SUMOReal	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 DijkstraRouterEffortBase< 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 89 of file DijkstraRouterEffort.h.

Constructor & Destructor Documentation

template<class E, class V, class PF>

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

inline

Constructor.

Definition at line 92 of file DijkstraRouterEffort.h.

Member Function Documentation

template<class E, class V, class PF>

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

inline

Definition at line 110 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::effort, max, and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::visited.

Field Documentation

template<class E, class V, class PF>

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

The current edge.

Definition at line 96 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffortBase< E, V, PF >::EdgeInfoByEffortComparator::operator()().

template<class E, class V, class PF>

SUMOReal DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::effort

Effort to reach the edge.

Definition at line 99 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffortBase< E, V, PF >::EdgeInfoByEffortComparator::operator()(), and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::reset().

template<class E, class V, class PF>

SUMOReal DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::leaveTime

The time the vehicle leaves the edge.

Definition at line 102 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>

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

The previous edge.

Definition at line 105 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>

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

The previous edge.

Definition at line 108 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::reset().

---

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

• DijkstraRouterEffort.h