#include <Node2EdgeRouter.h>

Inheritance diagram for Node2EdgeRouter< E, N, V, M >:

Collaboration diagram for Node2EdgeRouter< E, N, V, M >:

Public Types
typedef FullLookupTable< E, V >	FLT
typedef LandmarkLookupTable< E, V, M >	LMLT
typedef AbstractLookupTable< E, V >	LookupTable
typedef double(*	Operation) (const E const, const V const, double)
	Type of the function that is used to retrieve the edge effort.
typedef std::map< const E *, double >	Prohibitions
	Prohibitions and their estimated end time.

Public Member Functions
void	buildPathFrom (const typename SUMOAbstractRouter< E, V >::EdgeInfo rbegin, std::vector< const E > &edges)
	Builds the path from marked edges.
virtual SUMOAbstractRouter< E, V > *	clone ()
	Cloning method.
bool	compute (const E from, const E to, const V const vehicle, SUMOTime msTime, std::vector< const E > &into, bool silent=false)
	Builds the route between the given edges using the minimum travel time.
bool	compute (const E from, double fromPos, const E to, double toPos, const V const vehicle, SUMOTime msTime, std::vector< const E > &into, bool silent=false)
	Builds the route between the given edges using the minimum effort at the given time, also taking into account position along the edges to ensure currect handling of looped routes The definition of the effort depends on the wished routing scheme.
bool	computeLooped (const E from, const E to, const V const vehicle, SUMOTime msTime, std::vector< const E > &into, bool silent=false)
	Builds the route between the given edges using the minimum effort at the given time if from == to, return the shortest looped route.
bool	computeNode2Edge (const N fromNode, const E to, const V const vehicle, SUMOTime msTime, std::vector< const E > &into, bool silent=false)
	Builds the route between the given node and edge using the minimum travel time.
bool	computeNode2Edges (const N fromNode, const std::unordered_set< const E > &toEdges, const V *const vehicle, SUMOTime msTime, bool silent=false)
	Builds the routes between the given node and all given edges using the minimum travel time.
SUMOAbstractRouter< E, V >::EdgeInfo *	edgeInfo (const E *const edge)
	Returns the edge information for the passed edge.
const SUMOAbstractRouter< E, V >::EdgeInfo *	edgeInfo (const E *const edge) const
	Returns the edge information for the passed edge.
void	endQuery (int visits)
const SUMOAbstractRouter< E, V >::EdgeInfo &	getEdgeInfo (int index) const
double	getEffort (const E const e, const V const v, double t) const
double	getTravelTime (const E const e, const V const v, const double t, const double effort) const
const std::string &	getType () const
void	init (const int edgeID, const SUMOTime msTime)
bool	isProhibited (const E const edge, const V const vehicle) const
bool	isValid (const std::vector< const E * > &edges, const V *const v) const
	Node2EdgeRouter (const std::vector< E * > &edges, bool unbuildIsWarning, typename SUMOAbstractRouter< E, V >::Operation operation, const std::shared_ptr< const LookupTable > lookup=nullptr, const bool havePermissions=false, const bool haveRestrictions=false)
	Constructor.
	Node2EdgeRouter (const std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo > &edgeInfos, bool unbuildIsWarning, typename SUMOAbstractRouter< E, V >::Operation operation, const std::shared_ptr< const LookupTable > lookup=nullptr, const bool havePermissions=false, const bool haveRestrictions=false)
	Cloning constructor.
virtual void	prohibit (const Prohibitions &toProhibit)
virtual double	recomputeCosts (const std::vector< const E * > &edges, const V const v, SUMOTime msTime, double lengthp=nullptr) const
double	recomputeCostsNoLastEdge (const std::vector< const E * > &edges, const V const v, SUMOTime msTime, double lengthp=nullptr) const
	Returns the recomputed cost for traversing the given edges, excluding the last one.
double	recomputeCostsPos (const std::vector< const E * > &edges, const V const v, double fromPos, double toPos, SUMOTime msTime, double lengthp=nullptr) const
virtual void	reset (const V *const vehicle)
	Reset method.
void	setAutoBulkMode (const bool mode)
virtual void	setBulkMode (const bool mode)
	Bulk mode is not supported.
double	setHint (const typename std::vector< const E * >::const_iterator routeBegin, const typename std::vector< const E * >::const_iterator routeEnd, const V *const v, SUMOTime msTime)
void	startQuery ()
void	updateViaCost (const E const prev, const E const e, const V *const v, double &time, double &effort, double &length) const
void	updateViaCostUpToEdge (const E const prev, const E const e, const V *const v, double &time, double &effort, double &length) const
	Updates the via cost up to a given edge.
void	updateViaEdgeCost (const E viaEdge, const V const v, double &time, double &effort, double &length) const
virtual	~Node2EdgeRouter ()
	Destructor.

Protected Member Functions
void	init (std::vector< const E * > fromEdges, const V *const vehicle, const SUMOTime msTime)
	Initialize the node-to-edge router.

Protected Attributes
bool	myAmClean
	whether we are already initialized
bool	myAutoBulkMode
	whether we are currently trying to detect bulk mode automatically
bool	myBulkMode
	whether we are currently operating several route queries in a bulk
EdgeInfoComparator	myComparator
std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo >	myEdgeInfos
	The container of edge information.
MsgHandler *const	myErrorMsgHandler
	the handler for routing errors
std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo * >	myFound
	list of visited Edges (for resetting)
std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo * >	myFrontierList
	A container for reusage of the min edge heap.
const bool	myHavePermissions
	whether edge permissions need to be considered
const bool	myHaveRestrictions
	whether edge restrictions need to be considered
const std::shared_ptr< const LookupTable >	myLookupTable
	the lookup table for travel time heuristics
double	myMaxSpeed
	maximum speed in the network
Operation	myOperation
	The object's operation to perform.
Prohibitions	myProhibited
	The list of explicitly prohibited edges and estimated end time of prohibition.
Operation	myTTOperation
	The object's operation to perform for travel times.

Private Attributes
long long int	myNumQueries
long long int	myQueryStartTime
	the time spent querying in milliseconds
long long int	myQueryTimeSum
long long int	myQueryVisits
	counters for performance logging
const std::string	myType
	the type of this router

Detailed Description

template<class E, class N, class V, class M>
class Node2EdgeRouter< E, N, V, M >

Computes shortest paths from a node to one edge (using A*) or to all edges (using Dijkstra's algorithm)

The template parameters are:

Parameters

E	The edge class to use (MSEdge/ROEdge)
V	The vehicle class to use (MSVehicle/ROVehicle)

The router is edge-based. It must know the number of edges for internal reasons and whether a missing connection between two given edges (unbuild route) shall be reported as an error or as a warning

Definition at line 47 of file Node2EdgeRouter.h.

Member Typedef Documentation

◆ FLT

template<class E, class V, class M>

typedef FullLookupTable<E, V> AStarRouter< E, V, M >::FLT

inherited

Definition at line 79 of file AStarRouter.h.

◆ LMLT

template<class E, class V, class M>

typedef LandmarkLookupTable<E, V, M> AStarRouter< E, V, M >::LMLT

inherited

Definition at line 80 of file AStarRouter.h.

◆ LookupTable

template<class E, class N, class V, class M>

typedef AbstractLookupTable<E, V> Node2EdgeRouter< E, N, V, M >::LookupTable

Definition at line 49 of file Node2EdgeRouter.h.

◆ Operation

template<class E, class V>

typedef double(* SUMOAbstractRouter< E, V >::Operation) (const E *const, const V *const, double)

inherited

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

Definition at line 95 of file SUMOAbstractRouter.h.

◆ Prohibitions

template<class E, class V>

typedef std::map<const E*, double> SUMOAbstractRouter< E, V >::Prohibitions

inherited

Prohibitions and their estimated end time.

Definition at line 98 of file SUMOAbstractRouter.h.

Constructor & Destructor Documentation

◆ Node2EdgeRouter() [1/2]

template<class E, class N, class V, class M>

Node2EdgeRouter< E, N, V, M >::Node2EdgeRouter	(	const std::vector< E * > &	edges,
		bool	unbuildIsWarning,
		typename SUMOAbstractRouter< E, V >::Operation	operation,
		const std::shared_ptr< const LookupTable >	lookup = nullptr,
		const bool	havePermissions = false,
		const bool	haveRestrictions = false )

inline

Constructor.

Parameters

[in]	edges	The edges
[in]	unbuildIsWarning	The flag indicating whether network unbuilds should issue warnings or errors
[in]	operation	The operation
[in]	lookup	The lookup table
[in]	havePermissions	The flag indicating whether to respect edge permissions
[in]	haveRestrictions	The flag indicating whether to respect edge restrictions

Definition at line 74 of file Node2EdgeRouter.h.

References AStarRouter< E, V, M >::AStarRouter().

Referenced by clone().

Here is the caller graph for this function:

◆ Node2EdgeRouter() [2/2]

template<class E, class N, class V, class M>

Node2EdgeRouter< E, N, V, M >::Node2EdgeRouter	(	const std::vector< typename SUMOAbstractRouter< E, V >::EdgeInfo > &	edgeInfos,
		bool	unbuildIsWarning,
		typename SUMOAbstractRouter< E, V >::Operation	operation,
		const std::shared_ptr< const LookupTable >	lookup = nullptr,
		const bool	havePermissions = false,
		const bool	haveRestrictions = false )

inline

Cloning constructor.

Parameters

[in]	edgeInfos	The vector of edge information
[in]	unbuildIsWarning	The flag indicating whether network unbuilds should issue warnings or errors
[in]	operation	The operation
[in]	lookup	The lookup table
[in]	havePermissions	The flag indicating whether to respect edge permissions
[in]	haveRestrictions	The flag indicating whether to respect edge restrictions

Definition at line 88 of file Node2EdgeRouter.h.

References AStarRouter< E, V, M >::AStarRouter().

◆ ~Node2EdgeRouter()

template<class E, class N, class V, class M>

virtual Node2EdgeRouter< E, N, V, M >::~Node2EdgeRouter ( )

inlinevirtual

Destructor.

Definition at line 94 of file Node2EdgeRouter.h.

References WRITE_MESSAGE.

Member Function Documentation

◆ buildPathFrom()

template<class E, class V>

void SUMOAbstractRouter< E, V >::buildPathFrom	(	const typename SUMOAbstractRouter< E, V >::EdgeInfo *	rbegin,
		std::vector< const E * > &	edges )

inlineinherited

Builds the path from marked edges.

Definition at line 382 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), and Node2EdgeRouter< E, N, V, M >::computeNode2Edge().

Here is the caller graph for this function:

◆ clone()

template<class E, class N, class V, class M>

virtual SUMOAbstractRouter< E, V > * Node2EdgeRouter< E, N, V, M >::clone ( )

inlinevirtual

Cloning method.

Reimplemented from AStarRouter< E, V, M >.

Definition at line 99 of file Node2EdgeRouter.h.

References MsgHandler::getWarningInstance(), SUMOAbstractRouter< E, V >::myEdgeInfos, SUMOAbstractRouter< E, V >::myErrorMsgHandler, SUMOAbstractRouter< E, V >::myHavePermissions, SUMOAbstractRouter< E, V >::myHaveRestrictions, AStarRouter< E, V, M >::myLookupTable, SUMOAbstractRouter< E, V >::myOperation, Node2EdgeRouter(), and SUMOAbstractRouter< E, V >::SUMOAbstractRouter().

◆ compute() [1/2]

template<class E, class V, class M>

bool AStarRouter< E, V, M >::compute	(	const E *	from,
		const E *	to,
		const V *const	vehicle,
		SUMOTime	msTime,
		std::vector< const E * > &	into,
		bool	silent = false )

inlinevirtualinherited

Builds the route between the given edges using the minimum travel time.

Implements SUMOAbstractRouter< E, V >.

Definition at line 129 of file AStarRouter.h.

◆ compute() [2/2]

template<class E, class V>

bool SUMOAbstractRouter< E, V >::compute	(	const E *	from,
		double	fromPos,
		const E *	to,
		double	toPos,
		const V *const	vehicle,
		SUMOTime	msTime,
		std::vector< const E * > &	into,
		bool	silent = false )

inlineinherited

Builds the route between the given edges using the minimum effort at the given time, also taking into account position along the edges to ensure currect handling of looped routes The definition of the effort depends on the wished routing scheme.

Definition at line 191 of file SUMOAbstractRouter.h.

◆ computeLooped()

template<class E, class V>

bool SUMOAbstractRouter< E, V >::computeLooped	(	const E *	from,
		const E *	to,
		const V *const	vehicle,
		SUMOTime	msTime,
		std::vector< const E * > &	into,
		bool	silent = false )

inlineinherited

Builds the route between the given edges using the minimum effort at the given time if from == to, return the shortest looped route.

Definition at line 206 of file SUMOAbstractRouter.h.

Referenced by SUMOAbstractRouter< MSEdge, SUMOVehicle >::compute(), MSBaseVehicle::optimizeSkipped(), MSBaseVehicle::reroute(), and MSBaseVehicle::routeAlongStops().

Here is the caller graph for this function:

◆ computeNode2Edge()

template<class E, class N, class V, class M>

bool Node2EdgeRouter< E, N, V, M >::computeNode2Edge	(	const N *	fromNode,
		const E *	to,
		const V *const	vehicle,
		SUMOTime	msTime,
		std::vector< const E * > &	into,
		bool	silent = false )

inline

Builds the route between the given node and edge using the minimum travel time.

Parameters

[in]	fromNode	The node the route starts with
[in]	to	The edge at which the route ends
[in]	vehicle	The vehicle
[in]	msTime	The start time of the route in milliseconds
[out]	into	The vector of edges, into which the solution route is written
[in]	silent	The boolean flag indicating whether the method stays silent or puts out messages

Definition at line 251 of file Node2EdgeRouter.h.

◆ computeNode2Edges()

template<class E, class N, class V, class M>

bool Node2EdgeRouter< E, N, V, M >::computeNode2Edges	(	const N *	fromNode,
		const std::unordered_set< const E * > &	toEdges,
		const V *const	vehicle,
		SUMOTime	msTime,
		bool	silent = false )

inline

Builds the routes between the given node and all given edges using the minimum travel time.

Parameters

[in]	fromNode	The node which the routes start with
[in]	toEdges	The edges at which the routes end
[in]	vehicle	The vehicle
[in]	msTime	The start time of the routes in milliseconds
[in]	silent	The boolean flag indicating whether the method stays silent or puts out messages

Definition at line 126 of file Node2EdgeRouter.h.

◆ edgeInfo() [1/2]

template<class E, class N, class V, class M>

SUMOAbstractRouter< E, V >::EdgeInfo * Node2EdgeRouter< E, N, V, M >::edgeInfo ( const E *const edge )

inline

Returns the edge information for the passed edge.

Parameters

[in] edge The edge

Note: Non-const version

Definition at line 55 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::myEdgeInfos.

Referenced by init(), and reset().

Here is the caller graph for this function:

◆ edgeInfo() [2/2]

template<class E, class N, class V, class M>

const SUMOAbstractRouter< E, V >::EdgeInfo * Node2EdgeRouter< E, N, V, M >::edgeInfo ( const E *const edge ) const

inline

Returns the edge information for the passed edge.

Parameters

[in] edge The edge

Note: Const version

Definition at line 62 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::myEdgeInfos.

◆ endQuery()

template<class E, class V>

void SUMOAbstractRouter< E, V >::endQuery ( int visits )

inlineinherited

Definition at line 352 of file SUMOAbstractRouter.h.

Referenced by AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), CHRouter< E, V >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), and AFRouter< E, N, V, M >::endQuery().

Here is the caller graph for this function:

◆ getEdgeInfo()

template<class E, class V>

const SUMOAbstractRouter< E, V >::EdgeInfo & SUMOAbstractRouter< E, V >::getEdgeInfo ( int index ) const

inlineinherited

Definition at line 177 of file SUMOAbstractRouter.h.

◆ getEffort()

template<class E, class V>

double SUMOAbstractRouter< E, V >::getEffort	(	const E *const	e,
		const V *const	v,
		double	t ) const

inlineinherited

Definition at line 338 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), RailwayRouter< E, V >::recomputeCosts(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::recomputeCostsPos(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::setHint(), CHBuilder< E, V >::synchronize(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::updateViaCost(), and SUMOAbstractRouter< MSEdge, SUMOVehicle >::updateViaEdgeCost().

Here is the caller graph for this function:

◆ getTravelTime()

template<class E, class V>

double SUMOAbstractRouter< E, V >::getTravelTime	(	const E *const	e,
		const V *const	v,
		const double	t,
		const double	effort ) const

inlineinherited

Definition at line 239 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::updateViaCost(), and SUMOAbstractRouter< MSEdge, SUMOVehicle >::updateViaEdgeCost().

Here is the caller graph for this function:

◆ getType()

template<class E, class V>

const std::string & SUMOAbstractRouter< E, V >::getType ( ) const

inlineinherited

Definition at line 173 of file SUMOAbstractRouter.h.

◆ init() [1/2]

template<class E, class N, class V, class M>

void Node2EdgeRouter< E, N, V, M >::init	(	std::vector< const E * >	fromEdges,
		const V *const	vehicle,
		const SUMOTime	msTime )

protected

Initialize the node-to-edge router.

Parameters

[in]	fromEdges	The vector of start edges
[in]	vehicle	The vehicle
[in]	msTime	The start time in milliseconds

Definition at line 434 of file Node2EdgeRouter.h.

References edgeInfo(), SUMOAbstractRouter< E, V >::myEdgeInfos, SUMOAbstractRouter< E, V >::myFound, SUMOAbstractRouter< E, V >::myFrontierList, and STEPS2TIME.

Referenced by computeNode2Edge(), and computeNode2Edges().

Here is the caller graph for this function:

◆ init() [2/2]

template<class E, class V>

void SUMOAbstractRouter< E, V >::init	(	const int	edgeID,
		const SUMOTime	msTime )

inlineinherited

Definition at line 144 of file SUMOAbstractRouter.h.

Referenced by AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), and SUMOAbstractRouter< MSEdge, SUMOVehicle >::setHint().

Here is the caller graph for this function:

◆ isProhibited()

template<class E, class V>

bool SUMOAbstractRouter< E, V >::isProhibited	(	const E *const	edge,
		const V *const	vehicle ) const

inlineinherited

Definition at line 235 of file SUMOAbstractRouter.h.

Referenced by SUMOAbstractRouter< MSEdge, SUMOVehicle >::isValid(), Node2EdgeRouter< E, N, V, M >::recomputeCostsNoLastEdge(), and SUMOAbstractRouter< MSEdge, SUMOVehicle >::setHint().

Here is the caller graph for this function:

◆ isValid()

template<class E, class V>

bool SUMOAbstractRouter< E, V >::isValid	(	const std::vector< const E * > &	edges,
		const V *const	v ) const

inlineinherited

Definition at line 268 of file SUMOAbstractRouter.h.

Referenced by RORouteDef::addAlternative().

Here is the caller graph for this function:

◆ prohibit()

template<class E, class V>

virtual void SUMOAbstractRouter< E, V >::prohibit ( const Prohibitions & toProhibit )

inlinevirtualinherited

Reimplemented in CHRouter< E, V >, CHRouterWrapper< E, V >, IntermodalRouter< E, L, N, V >, PedestrianRouter< E, L, N, V >, and RailwayRouter< E, V >.

Definition at line 365 of file SUMOAbstractRouter.h.

◆ recomputeCosts()

template<class E, class V>

virtual double SUMOAbstractRouter< E, V >::recomputeCosts	(	const std::vector< const E * > &	edges,
		const V *const	v,
		SUMOTime	msTime,
		double *	lengthp = nullptr ) const

inlinevirtualinherited

Reimplemented in RailwayRouter< E, V >.

Definition at line 277 of file SUMOAbstractRouter.h.

Referenced by RORouteDef::addAlternative(), AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::computeLooped(), ROMAAssignments::computePath(), MSDispatch::computePickupTime(), computeRoutes(), MSDevice_StationFinder::estimateConsumption(), MSStoppingPlaceRerouter::evaluateDestination(), LIBSUMO_NAMESPACE::Simulation::findRoute(), NBPTLineCont::getCost(), MSBaseVehicle::insertStop(), LandmarkLookupTable< E, V, M >::LandmarkLookupTable(), RailwayRouter< E, V >::recomputeCosts(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::recomputeCostsPos(), MSBaseVehicle::replaceStop(), MSBaseVehicle::reroute(), MSBaseVehicle::rerouteBetweenStops(), MSVehicle::rerouteParkingArea(), and MSTriggeredRerouter::triggerRouting().

Here is the caller graph for this function:

◆ recomputeCostsNoLastEdge()

template<class E, class N, class V, class M>

double Node2EdgeRouter< E, N, V, M >::recomputeCostsNoLastEdge	(	const std::vector< const E * > &	edges,
		const V *const	v,
		SUMOTime	msTime,
		double *	lengthp = nullptr ) const

inline

Returns the recomputed cost for traversing the given edges, excluding the last one.

Parameters

[in]	edges	The vector of edges
[in]	v	The vehicle
[in]	msTime	The start time in milliseconds
[in,out]	lengthp	The passed and updated length

Definition at line 378 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::isProhibited(), STEPS2TIME, SUMOAbstractRouter< E, V >::updateViaCost(), and updateViaCostUpToEdge().

◆ recomputeCostsPos()

template<class E, class V>

double SUMOAbstractRouter< E, V >::recomputeCostsPos	(	const std::vector< const E * > &	edges,
		const V *const	v,
		double	fromPos,
		double	toPos,
		SUMOTime	msTime,
		double *	lengthp = nullptr ) const

inlineinherited

Definition at line 295 of file SUMOAbstractRouter.h.

Referenced by MSDispatch::computeDetourTime(), MSBaseVehicle::optimizeSkipped(), MSBaseVehicle::reroute(), and MSBaseVehicle::routeAlongStops().

Here is the caller graph for this function:

◆ reset()

template<class E, class N, class V, class M>

virtual void Node2EdgeRouter< E, N, V, M >::reset ( const V *const vehicle )

inlinevirtual

Reset method.

Parameters

[in] vehicle The vehicle

Reimplemented from SUMOAbstractRouter< E, V >.

Definition at line 107 of file Node2EdgeRouter.h.

References edgeInfo(), SUMOAbstractRouter< E, V >::myFound, SUMOAbstractRouter< E, V >::myFrontierList, and UNUSED_PARAMETER.

◆ setAutoBulkMode()

template<class E, class V>

void SUMOAbstractRouter< E, V >::setAutoBulkMode ( const bool mode )

inlineinherited

Definition at line 361 of file SUMOAbstractRouter.h.

Referenced by LandmarkLookupTable< E, V, M >::LandmarkLookupTable().

Here is the caller graph for this function:

◆ setBulkMode()

template<class E, class N, class V, class M>

virtual void Node2EdgeRouter< E, N, V, M >::setBulkMode ( const bool mode )

inlinevirtual

Bulk mode is not supported.

Reimplemented from SUMOAbstractRouter< E, V >.

Definition at line 404 of file Node2EdgeRouter.h.

References UNUSED_PARAMETER.

◆ setHint()

template<class E, class V>

double SUMOAbstractRouter< E, V >::setHint	(	const typename std::vector< const E * >::const_iterator	routeBegin,
		const typename std::vector< const E * >::const_iterator	routeEnd,
		const V *const	v,
		SUMOTime	msTime )

inlineinherited

Definition at line 307 of file SUMOAbstractRouter.h.

◆ startQuery()

template<class E, class V>

void SUMOAbstractRouter< E, V >::startQuery ( )

inlineinherited

Definition at line 347 of file SUMOAbstractRouter.h.

Referenced by AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), CHRouter< E, V >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), and AFRouter< E, N, V, M >::startQuery().

Here is the caller graph for this function:

◆ updateViaCost()

template<class E, class V>

void SUMOAbstractRouter< E, V >::updateViaCost	(	const E *const	prev,
		const E *const	e,
		const V *const	v,
		double &	time,
		double &	effort,
		double &	length ) const

inlineinherited

Definition at line 253 of file SUMOAbstractRouter.h.

Referenced by RailwayRouter< E, V >::recomputeCosts(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::recomputeCosts(), Node2EdgeRouter< E, N, V, M >::recomputeCostsNoLastEdge(), and SUMOAbstractRouter< MSEdge, SUMOVehicle >::setHint().

Here is the caller graph for this function:

◆ updateViaCostUpToEdge()

template<class E, class N, class V, class M>

void Node2EdgeRouter< E, N, V, M >::updateViaCostUpToEdge	(	const E *const	prev,
		const E *const	e,
		const V *const	v,
		double &	time,
		double &	effort,
		double &	length ) const

Updates the via cost up to a given edge.

Parameters

[in]	prev	The previous edge
[in]	e	The given edge
[in]	v	The vehicle
[in,out]	time	The passed and updated start time in seconds
[in,out]	effort	The passed and updated effort
[in,out]	length	The passed and updated length

Definition at line 423 of file Node2EdgeRouter.h.

References SUMOAbstractRouter< E, V >::updateViaEdgeCost().

Referenced by recomputeCostsNoLastEdge().

Here is the caller graph for this function:

◆ updateViaEdgeCost()

template<class E, class V>

void SUMOAbstractRouter< E, V >::updateViaEdgeCost	(	const E *	viaEdge,
		const V *const	v,
		double &	time,
		double &	effort,
		double &	length ) const

inlineinherited

Definition at line 243 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), AStarRouter< _IntermodalEdge, _IntermodalTrip, _MapMatcher >::compute(), DijkstraRouter< _IntermodalEdge, _IntermodalTrip >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), SUMOAbstractRouter< MSEdge, SUMOVehicle >::updateViaCost(), and Node2EdgeRouter< E, N, V, M >::updateViaCostUpToEdge().

Here is the caller graph for this function:

Field Documentation

◆ myAmClean

template<class E, class V>

bool SUMOAbstractRouter< E, V >::myAmClean

protectedinherited

whether we are already initialized

Definition at line 408 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), and Node2EdgeRouter< E, N, V, M >::computeNode2Edges().

◆ myAutoBulkMode

template<class E, class V>

bool SUMOAbstractRouter< E, V >::myAutoBulkMode

protectedinherited

whether we are currently trying to detect bulk mode automatically

Definition at line 405 of file SUMOAbstractRouter.h.

◆ myBulkMode

template<class E, class V>

bool SUMOAbstractRouter< E, V >::myBulkMode

protectedinherited

whether we are currently operating several route queries in a bulk

Definition at line 402 of file SUMOAbstractRouter.h.

◆ myComparator

template<class E, class V, class M>

EdgeInfoComparator AStarRouter< E, V, M >::myComparator

protectedinherited

Definition at line 282 of file AStarRouter.h.

◆ myEdgeInfos

template<class E, class V>

std::vector<typename SUMOAbstractRouter<E, V>::EdgeInfo> SUMOAbstractRouter< E, V >::myEdgeInfos

protectedinherited

The container of edge information.

Definition at line 420 of file SUMOAbstractRouter.h.

◆ myErrorMsgHandler

template<class E, class V>

MsgHandler* const SUMOAbstractRouter< E, V >::myErrorMsgHandler

protectedinherited

the handler for routing errors

Definition at line 393 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::clone(), CHRouter< E, V >::clone(), Node2EdgeRouter< E, N, V, M >::clone(), AFRouter< E, N, V, M >::compute(), CHRouter< E, V >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), and RailwayRouter< E, V >::ensureInternalRouter().

◆ myFound

template<class E, class V>

std::vector<typename SUMOAbstractRouter<E, V>::EdgeInfo*> SUMOAbstractRouter< E, V >::myFound

protectedinherited

list of visited Edges (for resetting)

Definition at line 425 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), AFRouter< E, N, V, M >::init(), Node2EdgeRouter< E, N, V, M >::init(), and Node2EdgeRouter< E, N, V, M >::reset().

◆ myFrontierList

template<class E, class V>

std::vector<typename SUMOAbstractRouter<E, V>::EdgeInfo*> SUMOAbstractRouter< E, V >::myFrontierList

protectedinherited

A container for reusage of the min edge heap.

Definition at line 423 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::compute(), Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), Node2EdgeRouter< E, N, V, M >::computeNode2Edges(), AFRouter< E, N, V, M >::init(), Node2EdgeRouter< E, N, V, M >::init(), and Node2EdgeRouter< E, N, V, M >::reset().

◆ myHavePermissions

template<class E, class V>

const bool SUMOAbstractRouter< E, V >::myHavePermissions

protectedinherited

whether edge permissions need to be considered

Definition at line 411 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::clone(), CHRouter< E, V >::clone(), CHRouterWrapper< E, V >::clone(), Node2EdgeRouter< E, N, V, M >::clone(), and RailwayRouter< E, V >::ensureInternalRouter().

◆ myHaveRestrictions

template<class E, class V>

const bool SUMOAbstractRouter< E, V >::myHaveRestrictions

protectedinherited

whether edge restrictions need to be considered

Definition at line 414 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::clone(), CHRouter< E, V >::clone(), Node2EdgeRouter< E, N, V, M >::clone(), and RailwayRouter< E, V >::ensureInternalRouter().

◆ myLookupTable

template<class E, class V, class M>

const std::shared_ptr<const LookupTable> AStarRouter< E, V, M >::myLookupTable

protectedinherited

the lookup table for travel time heuristics

Definition at line 285 of file AStarRouter.h.

Referenced by Node2EdgeRouter< E, N, V, M >::clone(), and Node2EdgeRouter< E, N, V, M >::computeNode2Edge().

◆ myMaxSpeed

template<class E, class V, class M>

double AStarRouter< E, V, M >::myMaxSpeed

protectedinherited

maximum speed in the network

Definition at line 288 of file AStarRouter.h.

Referenced by Node2EdgeRouter< E, N, V, M >::computeNode2Edge(), and Node2EdgeRouter< E, N, V, M >::computeNode2Edges().

◆ myNumQueries

template<class E, class V>

long long int SUMOAbstractRouter< E, V >::myNumQueries

privateinherited

Definition at line 433 of file SUMOAbstractRouter.h.

◆ myOperation

template<class E, class V>

Operation SUMOAbstractRouter< E, V >::myOperation

protectedinherited

The object's operation to perform.

Definition at line 396 of file SUMOAbstractRouter.h.

Referenced by AFRouter< E, N, V, M >::clone(), CHRouter< E, V >::clone(), CHRouterWrapper< E, V >::clone(), Node2EdgeRouter< E, N, V, M >::clone(), and CHRouterWrapper< E, V >::compute().

◆ myProhibited

template<class E, class V>

Prohibitions SUMOAbstractRouter< E, V >::myProhibited

protectedinherited

The list of explicitly prohibited edges and estimated end time of prohibition.

Definition at line 417 of file SUMOAbstractRouter.h.

Referenced by RailwayRouter< E, V >::_compute(), and RailwayRouter< E, V >::prohibit().

◆ myQueryStartTime

template<class E, class V>

long long int SUMOAbstractRouter< E, V >::myQueryStartTime

privateinherited

the time spent querying in milliseconds

Definition at line 435 of file SUMOAbstractRouter.h.

◆ myQueryTimeSum

template<class E, class V>

long long int SUMOAbstractRouter< E, V >::myQueryTimeSum

privateinherited

Definition at line 436 of file SUMOAbstractRouter.h.

◆ myQueryVisits

template<class E, class V>

long long int SUMOAbstractRouter< E, V >::myQueryVisits

privateinherited

counters for performance logging

Definition at line 432 of file SUMOAbstractRouter.h.

◆ myTTOperation

template<class E, class V>

Operation SUMOAbstractRouter< E, V >::myTTOperation

protectedinherited

The object's operation to perform for travel times.

Definition at line 399 of file SUMOAbstractRouter.h.

◆ myType

template<class E, class V>

const std::string SUMOAbstractRouter< E, V >::myType

privateinherited

the type of this router

Definition at line 429 of file SUMOAbstractRouter.h.

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

Node2EdgeRouter.h

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Private Attributes

Detailed Description

Member Typedef Documentation

◆ FLT

◆ LMLT

◆ LookupTable

◆ Operation

◆ Prohibitions

Constructor & Destructor Documentation

◆ Node2EdgeRouter() [1/2]

◆ Node2EdgeRouter() [2/2]

◆ ~Node2EdgeRouter()

Member Function Documentation

◆ buildPathFrom()

◆ clone()

◆ compute() [1/2]

◆ compute() [2/2]

◆ computeLooped()

◆ computeNode2Edge()

◆ computeNode2Edges()

◆ edgeInfo() [1/2]

◆ edgeInfo() [2/2]

◆ endQuery()

◆ getEdgeInfo()

◆ getEffort()

◆ getTravelTime()

◆ getType()

◆ init() [1/2]

◆ init() [2/2]

◆ isProhibited()

◆ isValid()

◆ prohibit()

◆ recomputeCosts()

◆ recomputeCostsNoLastEdge()

◆ recomputeCostsPos()

◆ reset()

◆ setAutoBulkMode()

◆ setBulkMode()

◆ setHint()

◆ startQuery()

◆ updateViaCost()

◆ updateViaCostUpToEdge()

◆ updateViaEdgeCost()

Field Documentation

◆ myAmClean

◆ myAutoBulkMode

◆ myBulkMode

◆ myComparator

◆ myEdgeInfos

◆ myErrorMsgHandler

◆ myFound

◆ myFrontierList

◆ myHavePermissions

◆ myHaveRestrictions

◆ myLookupTable

◆ myMaxSpeed

◆ myNumQueries

◆ myOperation

◆ myProhibited

◆ myQueryStartTime

◆ myQueryTimeSum

◆ myQueryVisits

◆ myTTOperation

◆ myType