Using Python program an implementation of Dijkstra’s algorithm to find the shortest driving distance between two cities using the data provided.
Limitations of Dijkstra’s Algorithm
A lack of heuristics
Internal Routing with Shortest Path
https://courses.cs.washington.edu/courses/cse373/13au/midterm2Unsolved.pdf (page 9 negative costs question)