Create a program that will calculate the shortest path from a node $($San Antonio$)$

in the graph to all other cities in the graph $($New York, Dallas, Las Vegas, and

Boston$)$ using Dijkstra$$s algorithm.

Within Eclipse, create a project called Assignment$14.$ Call this program

DSPTester $($this will contain the main method$).$ Create another class called DSP

$($there will be no main method within this class$)$