1. Write a program to help a traveler plan the shortest traveling path from one city to another. The program should read a file of data containing a list of cities and a list of roads connecting the cities. Each road has a distance attached to it. Allow the user to enter queries of the form “City1, City2” and have the program print the shortest sequence of roads to travel from City1 to City2.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here