Algorithms programming assignment, Summer 2015
Input: A text file that specifies adjacent vertices and edge weights of a graph.
Output: The output must be the sum of the shortest paths from vertex 0 to every other vertex.
Other requirements: Must be in Java; must use a binary heap; must not use Java's built-in PriorityQueue.