When the entered indexes of the added attractions are in descending order, the shortest path cannot be computed. The exception java.lang.IndexOutOfBoundsException: Index 0 out of bounds for length 0 shows. Step to Reproduce: Set 0 as the departure and 6 as the destination. Enter '5 2' when the program prompts 'Please choose attractions'. Actual Result: The shortest path from the attraction with index 5 to the attraction with index 2 doesn't show and the exception appears. Expected Result: All shortest paths from the attraction with index 5 to the attraction with index 2 are displayed in the screen for the user to select.
Solution: The function dijkstra is moved into the for loop inside the function routePlanning(). Because for each place in the ArrayList places, the function should be executed once to plan the route between every two sites according to the preset priority.