Travel Map Assignment
1. Travel Map
As shown in Figure 1, we have an undirected graph with nodes and distance. The distance is integers between nodes. For example, the shortest distance of node A and node B is 5
.png)
2. Algorithms
Graduates are expected to write Java program to implement the tasks below. For details, see the Table-1. In program codes, students only choose Array, LinkedList, Priority Queue, or recursive functions to write codes. Students SHOULD NOT choose hash table, dictionary, or other structures. If you violate the rules, your team will earn 0% points.
.png)
.png)
