![]() |
SUMO - Simulation of Urban MObility
|
Go to the source code of this file.
Data Structures | |
class | AbstractLookupTable< E, V > |
class | FullLookupTable< E, V > |
class | LandmarkLookupTable< E, V > |
Computes the shortest path through a network using the A* algorithm. More... | |
Macros | |
#define | UNREACHABLE (std::numeric_limits<double>::max() / 1000.0) |
#define UNREACHABLE (std::numeric_limits<double>::max() / 1000.0) |
Definition at line 33 of file AStarLookupTable.h.
Referenced by LandmarkLookupTable< E, V >::lowerBound().