Uses a given list of Michigan Cities and "distances" between them, and uses a given Dijkstra's algorithm to find the best route between them.