PLEASE NOTE: in order to run this, put index.txt in the args. Thanks :)
Receives file as list of cities and distance between these cities. Creates an Adjacency List, graph, then creates a Binomial Queue and uses Dijkstra's Algorithm to continually remove shortest distance between cities.
To create your own Binomial Queue and see visualizations in action: http://www.cs.usfca.edu/~galles/visualization/BinomialQueue.html
Images of adding element "31" to Binomial Queue and removing smallest element "2"
Image of Adjacency List Graph