O((V + E) log V)
A* search
Dijkstra with a sense of direction.
Pathfinding Algorithms
A*, greedy best-first, bidirectional and beam search, one page each, on a generated city of thousands of streets. Every page also races all eight route-finding algorithms on the same route.