For this assignment, you will be implementing Dijkstra’s shortest-path algorithm on a graph consisting of geographical data. Exact data-structures to use are up to you. Test your code to ensure that it is working quickly enough to be useful.
More details in attachment.