Without any doubt one of the most famous and useful algorithms in OR/MS and CS.
Yet ....!
It is absolutely amazing how this algorithm is presented and explained in the official literature and lecture notes.
For many years this item was on my "to do" list. Well, last year I finally decided to do something about it.
The result: an educationally oriented paper addressing a number of key issues regarding the origin of the algorithm and its relationbship to other well known algorithms. It includes a number of on line interactive modules for experimentation with the algorithm.
Warning: This is a very long paper, .... so it may take a while to load it ....
Dijkstra's Algorithm: The DP Connection I strongly recommend this paper to anyone teaching this subject.
Disclaimer: This page, its contents and style, are the responsibility of the author (Moshe Sniedovich) and do not represent the views, policies or opinions of The University of Melbourne.