A clear run-through of Dijkstra's algorithm which requires much less caffeine than the one in my class (perhaps a lame consideration, but I studied this and Floyd's 23+ years ago and haven't used them since)