Communications of the ACM

Two Ways Into the Maze: From Bidirectional BFS to Bidirectional Dijkstra

Now bring back the two groups. One search starts at A and moves forward, always taking the cheapest next town. The other ...