LandmarkLookupTable< E, V > Class Template Reference

Computes the shortest path through a network using the A* algorithm. More...

#include <AStarLookupTable.h>

Inheritance diagram for LandmarkLookupTable< E, V >:

Collaboration diagram for LandmarkLookupTable< E, V >:

Public Member Functions
bool	consistent () const
	whether the heuristic ist consistent (found nodes are always visited on the shortest path the first time)
	LandmarkLookupTable (const std::string &filename, const std::vector< E * > &edges, SUMOAbstractRouter< E, V > *router, SUMOAbstractRouter< ReversedEdge< E, V >, V > *reverseRouter, const V *defaultVehicle, const std::string &outfile, const int maxNumThreads)
double	lowerBound (const E *from, const E *to, double speed, double speedFactor, double fromEffort, double toEffort) const
	provide a lower bound on the distance between from and to (excluding traveltime of both edges)
virtual	~LandmarkLookupTable ()

Private Member Functions
std::string	getLandmark (int i) const

Private Attributes
int	myFirstNonInternal
std::vector< std::vector< double > >	myFromLandmarkDists
std::map< std::string, int >	myLandmarks
std::vector< std::vector< double > >	myToLandmarkDists

Detailed Description

template<class E, class V>
class LandmarkLookupTable< E, V >

Computes the shortest path through a network using the A* algorithm.

The template parameters are:

Parameters

E	The edge class to use (MSEdge/ROEdge)
V	The vehicle class to use (MSVehicle/ROVehicle)
PF	The prohibition function to use (prohibited_withPermissions/noProhibitions)
EC	The class to retrieve the effort for an edge from

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 104 of file AStarLookupTable.h.

Constructor & Destructor Documentation

LandmarkLookupTable()

template<class E , class V >

LandmarkLookupTable< E, V >::LandmarkLookupTable ( const std::string &  filename, const std::vector< E * > &  edges, SUMOAbstractRouter< E, V > *  router, SUMOAbstractRouter< ReversedEdge< E, V >, V > *  reverseRouter, const V *  defaultVehicle, const std::string &  outfile, const int  maxNumThreads  )

inline

Definition at line 106 of file AStarLookupTable.h.

References MFXWorkerThread::Pool::add(), SUMOAbstractRouter< E, V >::clone(), SUMOAbstractRouter< E, V >::compute(), StringUtils::endsWith(), StringTokenizer::get(), LandmarkLookupTable< E, V >::getLandmark(), MAX2(), LandmarkLookupTable< E, V >::myFirstNonInternal, LandmarkLookupTable< E, V >::myFromLandmarkDists, LandmarkLookupTable< E, V >::myLandmarks, LandmarkLookupTable< E, V >::myToLandmarkDists, SUMOAbstractRouter< E, V >::recomputeCosts(), SUMOAbstractRouter< E, V >::setAutoBulkMode(), StringTokenizer::size(), MFXWorkerThread::Pool::size(), TL, TLF, StringUtils::toDouble(), UNUSED_PARAMETER, MFXWorkerThread::Pool::waitAll(), WRITE_MESSAGE, WRITE_MESSAGEF, and WRITE_WARNINGF.

~LandmarkLookupTable()

template<class E , class V >

virtual LandmarkLookupTable< E, V >::~LandmarkLookupTable ( )

inlinevirtual

Definition at line 309 of file AStarLookupTable.h.

Member Function Documentation

consistent()

template<class E , class V >

bool LandmarkLookupTable< E, V >::consistent ( ) const

inlinevirtual

whether the heuristic ist consistent (found nodes are always visited on the shortest path the first time)

Implements AbstractLookupTable< E, V >.

Definition at line 360 of file AStarLookupTable.h.

getLandmark()

template<class E , class V >

std::string LandmarkLookupTable< E, V >::getLandmark ( int  i ) const

inlineprivate

Definition at line 440 of file AStarLookupTable.h.

References LandmarkLookupTable< E, V >::myLandmarks.

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

Here is the caller graph for this function:

lowerBound()

template<class E , class V >

double LandmarkLookupTable< E, V >::lowerBound ( const E *  from, const E *  to, double  speed, double  speedFactor, double  fromEffort, double  toEffort  ) const

inlinevirtual

provide a lower bound on the distance between from and to (excluding traveltime of both edges)

Implements AbstractLookupTable< E, V >.

Definition at line 312 of file AStarLookupTable.h.

References LandmarkLookupTable< E, V >::getLandmark(), MAX2(), LandmarkLookupTable< E, V >::myFirstNonInternal, LandmarkLookupTable< E, V >::myFromLandmarkDists, LandmarkLookupTable< E, V >::myLandmarks, LandmarkLookupTable< E, V >::myToLandmarkDists, and UNREACHABLE.

Field Documentation

myFirstNonInternal

template<class E , class V >

int LandmarkLookupTable< E, V >::myFirstNonInternal

private

Definition at line 368 of file AStarLookupTable.h.

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

myFromLandmarkDists

template<class E , class V >

std::vector<std::vector<double> > LandmarkLookupTable< E, V >::myFromLandmarkDists

private

Definition at line 366 of file AStarLookupTable.h.

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

myLandmarks

template<class E , class V >

std::map<std::string, int> LandmarkLookupTable< E, V >::myLandmarks

private

Definition at line 365 of file AStarLookupTable.h.

Referenced by LandmarkLookupTable< E, V >::getLandmark(), LandmarkLookupTable< E, V >::LandmarkLookupTable(), and LandmarkLookupTable< E, V >::lowerBound().

myToLandmarkDists

template<class E , class V >

std::vector<std::vector<double> > LandmarkLookupTable< E, V >::myToLandmarkDists

private

Definition at line 367 of file AStarLookupTable.h.

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

---

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

• AStarLookupTable.h