How to get a rat out of a maze. http://www.cse.usf.edu/~rtindell/courses/DataStructures/Proj...
On a serious note, you do have a good point. I haven't read much of Dijkstra's work myself.
On a serious note, you do have a good point. I haven't read much of Dijkstra's work myself.
One morning I was shopping in Amsterdam with my young fiancée, and tired, we sat down on the café terrace to drink a cup of coffee and I was just thinking about whether I could do this, and I then designed the algorithm for the shortest path. As I said, it was a twenty-minute invention. In fact, it was published in ’59, three years late. The publication is still readable, it is, in fact, quite nice. One of the reasons that it is so nice was that I designed it without pencil and paper. I learned later that one of the advantages of designing without pencil and paper is that you are almost forced to avoid all avoidable complexities. Eventually that algorithm became, to my great amazement, one of the cornerstones of my fame. I found it in the early ’60’s in a German book on management science - - “Das Dijkstra’sche Verfahren.” Suddenly, there was a method named after me
Source: http://conservancy.umn.edu/bitstream/107247/1/oh330ewd.pdf