DijkstraRouterTTBase< E, V, PF > Class Template Reference

#include <DijkstraRouterTT.h>

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

Data Structures
struct	EdgeInfo
class	EdgeInfoByTTComparator
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.
	DijkstraRouterTTBase (size_t noE, bool unbuildIsWarning)
	Constructor.
virtual SUMOReal	getEffort (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	~DijkstraRouterTTBase ()
	Destructor.
Protected Attributes
EdgeInfoByTTComparator	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 DijkstraRouterTTBase< E, V, PF >

Definition at line 67 of file DijkstraRouterTT.h.

---

Constructor & Destructor Documentation

template<class E , class V , class PF >

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

Constructor.

Definition at line 70 of file DijkstraRouterTT.h.

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

template<class E , class V , class PF >

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

(

)

[inline, virtual]

Destructor.

Definition at line 78 of file DijkstraRouterTT.h.

---

Member Function Documentation

template<class E , class V , class PF >

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

Builds the path from marked edges.

Definition at line 196 of file DijkstraRouterTT.h.

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

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

template<class E , class V , class PF >

virtual void DijkstraRouterTTBase< 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 125 of file DijkstraRouterTT.h.

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

Referenced by MSTriggeredRerouter::notifyEnter(), and TraCIServerAPI_Vehicle::processSet().

template<class E , class V , class PF >

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

Implemented in DijkstraRouterTT_ByProxi< E, V, PF, EC >, and DijkstraRouterTT_Direct< E, V, PF >.

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

template<class E , class V , class PF >

SUMOReal DijkstraRouterTTBase< 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 182 of file DijkstraRouterTT.h.

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

---

Field Documentation

template<class E , class V , class PF >

EdgeInfoByTTComparator DijkstraRouterTTBase< E, V, PF >::myComparator [protected]

Definition at line 212 of file DijkstraRouterTT.h.

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

template<class E , class V , class PF >

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

The container of edge information.

Definition at line 207 of file DijkstraRouterTT.h.

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

template<class E , class V , class PF >

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

the handler for routing errors

Definition at line 215 of file DijkstraRouterTT.h.

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

template<class E , class V , class PF >

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

A container for reusage of the min edge heap.

Definition at line 210 of file DijkstraRouterTT.h.

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

---

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

• DijkstraRouterTT.h