Dijkstra's Algorithm

Expand cheapest node first (regardless of search level).

Won't necessarily bring us in the right direction, but if it does, we get there cheaply!

\epsfig {file=l0503.ps,height=2in,angle=270}

As a result, we find the cheapest path.


next up previous
Next: Dijkstra Example Up: Heuristic Search Previous: Breadth-first Search