Description: Ii. Problem description
A guide map of a park is given, and visitors can know from the terminal that:
A) the shortest path from one spot to another.
B) visitors enter from the park gate and choose the best route to allow visitors to visit the scenic spots without repeating them and return to the exit.
3. Experimental requirements
1. Think of the guide map as an undirected graph with power. The vertices represent the various scenic spots of the park, while the road shows the road between each scenic spot. The weight of the edge indicates the distance and the appropriate data structure is selected.
2. Provide visitors with information about any scenic spots in the picture;
1. Provide tourists with the shortest easy path between any two scenic spots.
2. Choose the best route for tourists.
File list (Check if you may need any files):
Download