Showing 1 - 1 of 1
For finding a shortest path in a network bidirectional A* is a widely known algorithm. This algorithm distinguishes between the main phase and the postprocessing phase. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses a so-called balanced...
Persistent link: https://www.econbiz.de/10004973587