#include <DijkstraRouterEffort.h>

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

Public Types
typedef SUMOReal(E::*	Operation )(const V *const, SUMOReal) const
	Type of the function that is used to retrieve the edge effort.
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 effort at the given time The definition of the effort depends on the wished routing scheme.
	DijkstraRouterEffort_Direct (size_t noE, bool unbuildIsWarningOnly, Operation effortOperation, Operation ttOperation)
void	endQuery (int visits)
SUMOReal	getEffort (const E const e, const V const v, SUMOReal t) const
SUMOReal	getTravelTime (const E const e, const V const v, SUMOReal t) const
void	init ()
virtual void	prepare (const E , const V , bool)
SUMOReal	recomputeCosts (const std::vector< const E * > &edges, const V *const v, SUMOTime msTime) const
void	startQuery ()
Protected Attributes
EdgeInfoByEffortComparator	myComparator
std::vector< EdgeInfo >	myEdgeInfos
	The container of edge information.
MsgHandler *const	myErrorMsgHandler
	the handler for routing errors
std::vector< EdgeInfo * >	myFound
	list of visited Edges (for resetting)
std::vector< EdgeInfo * >	myFrontierList
	A container for reusage of the min edge heap.
Private Attributes
Operation	myEffortOperation
	The object's operation to perform for obtaining the effort.
Operation	myTTOperation
	The object's operation to perform for obtaining the travel time.

Detailed Description

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

Definition at line 284 of file DijkstraRouterEffort.h.

Member Typedef Documentation

template<class E, class V, class PF>

typedef SUMOReal(E::* DijkstraRouterEffort_Direct< E, V, PF >::Operation)(const V *const, SUMOReal) const

Type of the function that is used to retrieve the edge effort.

Definition at line 287 of file DijkstraRouterEffort.h.

Constructor & Destructor Documentation

template<class E, class V, class PF>

DijkstraRouterEffort_Direct< E, V, PF >::DijkstraRouterEffort_Direct	(	size_t	noE,
		bool	unbuildIsWarningOnly,
		Operation	effortOperation,
		Operation	ttOperation
	)		`[inline]`

Definition at line 289 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, inherited]`

Builds the path from marked edges.

Definition at line 226 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, inherited]`

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

Implements SUMOAbstractRouter< E, V >.

Definition at line 150 of file DijkstraRouterEffort.h.

template<class E, class V>

void SUMOAbstractRouter< E, V >::endQuery ( int visits ) [inline, inherited]

Definition at line 89 of file SUMOAbstractRouter.h.

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

template<class E, class V, class PF>

SUMOReal DijkstraRouterEffort_Direct< E, V, PF >::getEffort	(	const E *const	e,
		const V *const	v,
		SUMOReal	t
	)		const `[inline, virtual]`

Implements DijkstraRouterEffortBase< E, V, PF >.

Definition at line 293 of file DijkstraRouterEffort.h.

References DijkstraRouterEffort_Direct< E, V, PF >::myEffortOperation.

template<class E, class V, class PF>

SUMOReal DijkstraRouterEffort_Direct< E, V, PF >::getTravelTime	(	const E *const	e,
		const V *const	v,
		SUMOReal	t
	)		const `[inline, virtual]`

Implements DijkstraRouterEffortBase< E, V, PF >.

Definition at line 297 of file DijkstraRouterEffort.h.

References DijkstraRouterEffort_Direct< E, V, PF >::myTTOperation.

template<class E , class V , class PF >

void DijkstraRouterEffortBase< E, V, PF >::init ( ) [inline, inherited]

Definition at line 135 of file DijkstraRouterEffort.h.

References DijkstraRouterEffortBase< E, V, PF >::myFound, and DijkstraRouterEffortBase< E, V, PF >::myFrontierList.

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

template<class E, class V>

virtual void SUMOAbstractRouter< E, V >::prepare	(	const E *	,
		const V *	,
		bool
	)		`[inline, virtual, inherited]`

Definition at line 80 of file SUMOAbstractRouter.h.

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, inherited]`