GISCup 2015
 All Classes Files Functions Variables Typedefs Enumerations Enumerator Macros
astar.hpp File Reference

Go to the source code of this file.


std::pair< bool, double > search_explicit (size_t s, size_t end)
 search_explicit is a clean A* implementation

Function Documentation

std::pair<bool, double> search_explicit ( size_t  s,
size_t  end 

search_explicit is a clean A* implementation

A trick is used in order not to update the elements of the queue. This pays off in road networks, where updates are seldom enough. Therefore, the last queue valuation of each vertex is recorded and a vertex from the priority queue is ignored, if it does not fit the stored last value...

It uses the distance_heuristics from the boost_astar.hpp header for consistency.