DijkstraRouterEffortBase< E, V, PF > Class Template Reference

#include <DijkstraRouterEffort.h>

Inheritance diagram for DijkstraRouterEffortBase< E, V, PF >:

Data Structures
struct	EdgeInfo
class	EdgeInfoByEffortComparator
Public Member Functions
void	buildPathFrom (EdgeInfo *rbegin, std::vector< const E * > &edges)
	Builds the path from marked edges.
virtual void	compute (const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into)
	Builds the route between the given edges using the minimum afford at the given time The definition of the afford depends on the wished routing scheme.
	DijkstraRouterEffortBase (size_t noE, bool unbuildIsWarning)
	Constructor.
virtual SUMOReal	getEffort (const E *const e, const V *const v, SUMOReal t) const =0
virtual SUMOReal	getTravelTime (const E *const e, const V *const v, SUMOReal t) const =0
SUMOReal	recomputeCosts (const std::vector< const E * > &edges, const V *const v, SUMOTime msTime) const
virtual	~DijkstraRouterEffortBase ()
	Destructor.
Protected Attributes
EdgeInfoByEffortComparator	myComparator
std::vector< EdgeInfo >	myEdgeInfos
	The container of edge information.
MsgHandler *const	myErrorMsgHandler
	the handler for routing errors
std::vector< EdgeInfo * >	myFrontierList
	A container for reusage of the min edge heap.

---

Detailed Description

template<class E, class V, class PF>
class DijkstraRouterEffortBase< E, V, PF >

Definition at line 66 of file DijkstraRouterEffort.h.

---

Constructor & Destructor Documentation

template<class E , class V , class PF >

DijkstraRouterEffortBase< E, V, PF >::DijkstraRouterEffortBase	(	size_t	noE,
		bool	unbuildIsWarning
	)		[inline]

Constructor.

Definition at line 69 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::myEdgeInfos.

template<class E , class V , class PF >

virtual DijkstraRouterEffortBase< E, V, PF >::~DijkstraRouterEffortBase

(

)

[inline, virtual]

Destructor.

Definition at line 77 of file DijkstraRouterEffort.h.

---

Member Function Documentation

template<class E , class V , class PF >

void DijkstraRouterEffortBase< E, V, PF >::buildPathFrom	(	EdgeInfo *	rbegin,
		std::vector< const E * > &	edges
	)		[inline]

Builds the path from marked edges.

Definition at line 205 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::edge, and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::prev.

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

template<class E , class V , class PF >

virtual void DijkstraRouterEffortBase< E, V, PF >::compute	(	const E *	from,
		const E *	to,
		const V *const	vehicle,
		SUMOTime	msTime,
		std::vector< const E * > &	into
	)		[inline, virtual]

Builds the route between the given edges using the minimum afford at the given time The definition of the afford depends on the wished routing scheme.

Implements SUMOAbstractRouter< E, V >.

Definition at line 131 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::buildPathFrom(), DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::edge, DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::effort, DijkstraRouterEffortBase< E, V, PF >::getEffort(), DijkstraRouterEffortBase< E, V, PF >::getTravelTime(), MsgHandler::inform(), DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::leaveTime, max, DijkstraRouterEffortBase< E, V, PF >::myComparator, DijkstraRouterEffortBase< E, V, PF >::myEdgeInfos, DijkstraRouterEffortBase< E, V, PF >::myErrorMsgHandler, DijkstraRouterEffortBase< E, V, PF >::myFrontierList, DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::prev, STEPS2TIME, SUMOReal, and DijkstraRouterEffortBase< E, V, PF >::EdgeInfo::visited.

template<class E , class V , class PF >

virtual SUMOReal DijkstraRouterEffortBase< E, V, PF >::getEffort	(	const E *const	e,
		const V *const	v,
		SUMOReal	t
	)		const [pure virtual]

Implemented in DijkstraRouterEffort_ByProxi< E, V, PF, EC >, and DijkstraRouterEffort_Direct< E, V, PF >.

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

template<class E , class V , class PF >

virtual SUMOReal DijkstraRouterEffortBase< E, V, PF >::getTravelTime	(	const E *const	e,
		const V *const	v,
		SUMOReal	t
	)		const [pure virtual]

Implemented in DijkstraRouterEffort_ByProxi< E, V, PF, EC >, and DijkstraRouterEffort_Direct< E, V, PF >.

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

template<class E , class V , class PF >

SUMOReal DijkstraRouterEffortBase< E, V, PF >::recomputeCosts	(	const std::vector< const E * > &	edges,
		const V *const	v,
		SUMOTime	msTime
	)		const [inline, virtual]

Implements SUMOAbstractRouter< E, V >.

Definition at line 190 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::getEffort(), DijkstraRouterEffortBase< E, V, PF >::getTravelTime(), STEPS2TIME, and SUMOReal.

---

Field Documentation

template<class E , class V , class PF >

EdgeInfoByEffortComparator DijkstraRouterEffortBase< E, V, PF >::myComparator [protected]

Definition at line 221 of file DijkstraRouterEffort.h.

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

template<class E , class V , class PF >

std::vector<EdgeInfo> DijkstraRouterEffortBase< E, V, PF >::myEdgeInfos [protected]

The container of edge information.

Definition at line 216 of file DijkstraRouterEffort.h.

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

template<class E , class V , class PF >

MsgHandler* const DijkstraRouterEffortBase< E, V, PF >::myErrorMsgHandler [protected]

the handler for routing errors

Definition at line 224 of file DijkstraRouterEffort.h.

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

template<class E , class V , class PF >

std::vector<EdgeInfo*> DijkstraRouterEffortBase< E, V, PF >::myFrontierList [protected]

A container for reusage of the min edge heap.

Definition at line 219 of file DijkstraRouterEffort.h.

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

---

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

• DijkstraRouterEffort.h