Understanding Dijkstra's Algorithm(aos.github.io) |
Understanding Dijkstra's Algorithm(aos.github.io) |
Dijkstra’s algorithm is on page 36 and explained in 8 paragrpahs.
First finish your bread, and only then attempt the search.
Dijkstra's algorithm seems rather obvious to me, as I discovered it myself after I head the problem description. A note in my diary seems to imply that I implemented it in LISP.
Then I found out that Dijkstra's algorithm is 'just' A* where the heuristic function is zero. :| Which is both incredibly simple and intuitive.