Eclipse SUMO - Simulation of Urban MObility
|
#include <AStarLookupTable.h>
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 () |
Definition at line 61 of file AStarLookupTable.h.
|
inlinevirtual |
Definition at line 63 of file AStarLookupTable.h.
|
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, M >.
|
pure virtual |
provide a lower bound on the distance between from and to (excluding traveltime of both edges)
Implemented in LandmarkLookupTable< E, V, M >, and FullLookupTable< E, V >.