Pathfinding Algorithms

Eight route-finding algorithms on a generated city of thousands of streets. Drop a start and a goal, then watch Dijkstra flood outward, A* head for the target and the bidirectional searches meet in the middle.

One page each

Complexity, how it works, and code where it helps.

A* searchDijkstra with a sense of direction.
Greedy best-first searchAlways walk toward the goal, and hope.
Bidirectional searchSearch from both ends and meet in the middle.
Beam searchBreadth-first, but only keep the best few.