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...

In a previous paper "A new bidirectional algorithm for shortest paths" we presented a bidirectional algorithm for finding the shortest path in a network. After the publication we designed an equivalent but shorter description for that algorithm. Due to this new description a considerably simpler...