Dijkstra's Algorithm as a SequenceGraphs are cool. After slogging through sorting arrays in the the Coursera Algorithms I class it is nice to implement algorithms that aren’t built into the standard library. They are also much more real world. For example finding the shortest path in Eve Online from NOL-M9 to every system in Delve (visualized above using D3.js). NOTE: You can drag the systems to make sure no lines overlap if that
