Pijls, Pijls, W.H.L.M.; Post, Post, H. - Faculteit der Economische Wetenschappen, Erasmus … - 2008
For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional~A* that is considered the most appropriate in literature hitherto, uses...