Use Dijkstra's Algorithm to develop a directed graph structure with a min-heap priority queue. (No array list or linked list or anything else)
1. The software builds a directed graph by reading the information from two resource files:
city.dat: This file contains information about cities, where each line has 5 attributes:
- City Number, City Code (2 letters),
Full City Name, Population, and Elevation.
road.dat: This file contains information about roads, where each line has 3 attributes:
- From City, To City, and Distance.
(Note that all roads are assumed to be one-way.)
2. Create a Java (directed graph) Digraph class to store the city and road information.
3. User menu: