22 #ifndef FIFE_PATHFINDER_SINGLELAYERSEARCH 23 #define FIFE_PATHFINDER_SINGLELAYERSEARCH int32_t m_destCoordInt
The destination coordinate as an int32_t.
PriorityQueue< int32_t, double > m_sortedfrontier
Priority queue to hold nodes on the sf in order.
int32_t m_next
The next coordinate to check out.
Location m_from
A location object representing where the search ended.
A CellCache is an abstract depiction of one or a few layers and contains additional information...
int32_t m_startCoordInt
The start coordinate as an int32_t.
std::vector< int32_t > m_spt
The shortest path tree.
CellCache * m_cellCache
A pointer to the CellCache.
SingleLayerSearch using A*.
void updateSearch()
Updates the search.
Location m_to
A location object representing where the search started.
void calcPath()
Calculates final path.
RoutePatherSearch using A*.
SingleLayerSearch(Route *route, const int32_t sessionId)
Constructor.
~SingleLayerSearch()
Destructor.
std::vector< int32_t > m_sf
The search frontier.
std::vector< double > m_gCosts
A table to hold the costs.