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

#include <DijkstraRouterEffort.h>

---

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 81 of file DijkstraRouterEffort.h.

Public Member Functions
	EdgeInfo (size_t id)
	Constructor.
	EdgeInfo ()
	Constructor.
Data Fields
const E *	edge
	The current edge.
SUMOReal	effort
	Effort to reach the edge.
SUMOReal	leaveTime
	The time the vehicle leaves the edge.
EdgeInfo *	prev
	The previous edge.
bool	visited
	The previous edge.

---

Constructor & Destructor Documentation

template<class E, class V, class PF>

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

(

)

[inline]

Constructor.

Definition at line 84 of file DijkstraRouterEffort.h.

: edge(0), effort(0), leaveTime(0), prev(0) {}

template<class E, class V, class PF>

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

(

size_t

id

)

[inline]

Constructor.

Definition at line 87 of file DijkstraRouterEffort.h.

                : edge(E::dictionary(id)), effort(0), leaveTime(0), prev(0), visited(false) {}

---

Field Documentation

template<class E, class V, class PF>

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

The current edge.

Definition at line 91 of file DijkstraRouterEffort.h.

Referenced by DijkstraRouterEffortBase< E, V, PF >::buildPathFrom(), DijkstraRouterEffortBase< E, V, PF >::compute(), and 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 94 of file DijkstraRouterEffort.h.

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

template<class E, class V, class PF>

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

The time the vehicle leaves the edge.

Definition at line 100 of file DijkstraRouterEffort.h.

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

template<class E, class V, class PF>

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

The previous edge.

Definition at line 97 of file DijkstraRouterEffort.h.

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

template<class E, class V, class PF>

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

The previous edge.

Definition at line 103 of file DijkstraRouterEffort.h.

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

---

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

• DijkstraRouterEffort.h