#include <AStarLookupTable.h>
|
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...
|
|
virtual | ~FullLookupTable () |
|
|
std::vector< std::vector< double > > | myTable |
|
template<class E, class V>
class FullLookupTable< E, V >
Definition at line 70 of file AStarLookupTable.h.
◆ FullLookupTable()
template<class E , class V >
◆ ~FullLookupTable()
template<class E , class V >
◆ consistent()
template<class E , class V >
◆ lowerBound()
template<class E , class V >
double FullLookupTable< E, V >::lowerBound |
( |
const E * |
from, |
|
|
const E * |
to, |
|
|
double |
speed, |
|
|
double |
speedFactor, |
|
|
double |
fromEffort, |
|
|
double |
toEffort |
|
) |
| const |
|
inlinevirtual |
◆ myTable
template<class E , class V >
The documentation for this class was generated from the following file: