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

#include <DijkstraRouterEffort.h>

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

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

Constructor & Destructor Documentation

template<class E, class V, class PF>

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

inline

Constructor.

Definition at line 94 of file DijkstraRouterEffort.h.

Member Function Documentation

template<class E, class V, class PF>

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

inline

Definition at line 112 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 98 of file DijkstraRouterEffort.h.

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

template<class E, class V, class PF>

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

Effort to reach the edge.

Definition at line 101 of file DijkstraRouterEffort.h.

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

template<class E, class V, class PF>

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

The time the vehicle leaves the edge.

Definition at line 104 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>

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

The previous edge.

Definition at line 107 of file DijkstraRouterEffort.h.

template<class E, class V, class PF>

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

The previous edge.

Definition at line 110 of file DijkstraRouterEffort.h.

---

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

• DijkstraRouterEffort.h