![]() |
SUMO - Simulation of Urban MObility
|
#include <AStarLookupTable.h>
Public Member Functions | |
bool | consistent () const |
whether the heuristic ist consistent (found nodes are always visited on the shortest path the first time) More... | |
FullLookupTable (const std::string &filename, const int size) | |
double | lowerBound (const E *from, const E *to, double, double speedFactor, double, double) const |
provide a lower bound on the distance between from and to (excluding traveltime of both edges) More... | |
Private Attributes | |
std::vector< std::vector< double > > | myTable |
Definition at line 70 of file AStarLookupTable.h.
|
inline |
Definition at line 72 of file AStarLookupTable.h.
|
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 88 of file AStarLookupTable.h.
|
inlinevirtual |
provide a lower bound on the distance between from and to (excluding traveltime of both edges)
Implements AbstractLookupTable< E, V >.
Definition at line 84 of file AStarLookupTable.h.
|
private |
Definition at line 93 of file AStarLookupTable.h.