RubyoffRails/Episode7 — pull request #5 by HerbCSO (2012-09-11 10:41:47+00:00)
Title: Panda, Tiger and Eagle levels

@jwo I implemented all but the Dijkstra algorithm - see my commit comment for Eagle. I'm not sure I understand how I'm supposed to get the edge weights without calculating ALL distances between ALL cities first, which would kind of negate the advantage of using Dijkstra - all I would save myself would be the sorting of the distances array every time, which granted, maybe that's sufficient?