AbstractLookupTable< E, V > Class Template Reference

#include <AStarLookupTable.h>

Inheritance diagram for AbstractLookupTable< E, V >:

Public Member Functions
virtual bool	consistent () const =0
	whether the heuristic ist consistent (found nodes are always visited on the shortest path the first time)
virtual double	lowerBound (const E *from, const E *to, double speed, double speedFactor, double fromEffort, double toEffort) const =0
	provide a lower bound on the distance between from and to (excluding traveltime of both edges)
virtual	~AbstractLookupTable ()

Detailed Description

template<class E, class V>
class AbstractLookupTable< E, V >

Definition at line 60 of file AStarLookupTable.h.

Constructor & Destructor Documentation

~AbstractLookupTable()

template<class E , class V >

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

inlinevirtual

Definition at line 62 of file AStarLookupTable.h.

Member Function Documentation

consistent()

template<class E , class V >

virtual bool AbstractLookupTable< E, V >::consistent ( ) const

pure virtual

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

Implemented in FullLookupTable< E, V >, and LandmarkLookupTable< E, V >.

lowerBound()

template<class E , class V >

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

pure virtual

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

Implemented in LandmarkLookupTable< E, V >, and FullLookupTable< E, V >.

---

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

• AStarLookupTable.h