Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
LandmarkLookupTable< E, V, M > Class Template Reference

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

#include <AStarLookupTable.h>

Inheritance diagram for LandmarkLookupTable< E, V, M >:
[legend]
Collaboration diagram for LandmarkLookupTable< E, V, M >:
[legend]

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, M *mapMatcher)
 
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 M>
class LandmarkLookupTable< E, V, M >

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

The template parameters are:

Parameters
EThe edge class to use (MSEdge/ROEdge)
VThe vehicle class to use (MSVehicle/ROVehicle)
PFThe prohibition function to use (prohibited_withPermissions/noProhibitions)
ECThe 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 105 of file AStarLookupTable.h.

Constructor & Destructor Documentation

◆ LandmarkLookupTable()

◆ ~LandmarkLookupTable()

template<class E , class V , class M >
virtual LandmarkLookupTable< E, V, M >::~LandmarkLookupTable ( )
inlinevirtual

Definition at line 352 of file AStarLookupTable.h.

Member Function Documentation

◆ consistent()

template<class E , class V , class M >
bool LandmarkLookupTable< E, V, M >::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 403 of file AStarLookupTable.h.

◆ getLandmark()

template<class E , class V , class M >
std::string LandmarkLookupTable< E, V, M >::getLandmark ( int  i) const
inlineprivate

Definition at line 483 of file AStarLookupTable.h.

References LandmarkLookupTable< E, V, M >::myLandmarks.

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

Here is the caller graph for this function:

◆ lowerBound()

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

Field Documentation

◆ myFirstNonInternal

template<class E , class V , class M >
int LandmarkLookupTable< E, V, M >::myFirstNonInternal
private

◆ myFromLandmarkDists

template<class E , class V , class M >
std::vector<std::vector<double> > LandmarkLookupTable< E, V, M >::myFromLandmarkDists
private

◆ myLandmarks

template<class E , class V , class M >
std::map<std::string, int> LandmarkLookupTable< E, V, M >::myLandmarks
private

◆ myToLandmarkDists

template<class E , class V , class M >
std::vector<std::vector<double> > LandmarkLookupTable< E, V, M >::myToLandmarkDists
private

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