airports.txt:

ATL BOS 250 DFW 250 MOB 59 AUS DFW 59 HOU 59 SAT 59 BOS ATL 250 DFW 250 DFW ATL 250 AUS 59 BOS 250 HOU 128 LAX 1000 LIT 59 MSY 128 OKC 59 SHV 59 SFO 1200 HOU AUS 59 DFW 128 SAT 59 LAX DFW 1000 SFO 100 LIT DFW 59 MOB ATL 59 MSY DFW 128 OKC DFW 59 SAT AUS 59 HOU 59 SFO DFW 1200 LAX 100 SHV DFW 59 

Slides:

Objective Use Dijkstra algorithm to find route information between two airports chosen by the user. The user will be shown a route that results in the lowest price Specifics: create a class called Dijkstra The structure of this class in terms of inner classes and methods will be up to you Points will be reduced if your program is not well organized and commented. Basic requirements are: A) Input a file airports .txt that contains the graph in adjacency list form. B) Performs the Dijkstra algorithm on the graph to create shortest path information C) Prints the shortest path information between two airports chosen by the user D) Repeat until the user chooses to exit. Notice that in this case "shortest" means "cheapest" You are expected use Dijkstra algorithm following the pseudocode found in both the slides. You may not use code for Dijkstra. s algorithm found from other sources. Your output should match the sample output below: Sample output: Enter departure airport: DFW Enter arrival airport SFO Price: 1100 Connections: 1 Route DFW LAX SFO Check another route (Y/N) Objective Use Dijkstra algorithm to find route information between two airports chosen by the user. The user will be shown a route that results in the lowest price Specifics: create a class called Dijkstra The structure of this class in terms of inner classes and methods will be up to you Points will be reduced if your program is not well organized and commented. Basic requirements are: A) Input a file airports .txt that contains the graph in adjacency list form. B) Performs the Dijkstra algorithm on the graph to create shortest path information C) Prints the shortest path information between two airports chosen by the user D) Repeat until the user chooses to exit. Notice that in this case "shortest" means "cheapest" You are expected use Dijkstra algorithm following the pseudocode found in both the slides. You may not use code for Dijkstra. s algorithm found from other sources. Your output should match the sample output below: Sample output: Enter departure airport: DFW Enter arrival airport SFO Price: 1100 Connections: 1 Route DFW LAX SFO Check another route (Y/N)