solve this in java Part $1$: Mapping our solution

Organize Data:

Utilize a Map to represent station connections.

Each station's name serves as the key, with a List of neighboring stations and their distances as the value.

Example:

Given the station distribution in Figure $1,$ create a Map structured as follows:

scss

Copy code

Stations $($Map$)$

Key $($Station$)$ Value $($Neighbors$)$

Westside $\{($Bugapest$,55),($Mosbull$,92),($Dubay$,100)\}$

Bugapest $\{($Westside$,55)\}$

Dubay $\{($Westside$,100),($Berlint$,44)\}$

Berlint $\{($Dubay$,44),($Mosbull$,64)\}$

Mosbull $\{($Westside$,92),($Berlint$,64)\}$

Accessing Neighbors:

To retrieve the stations accessible from Dubay, call stations.get$("$Dubay$").$

The returned List reveals that Dubay connects directly to Westside and Berlint, $100$ and $44$ kilometers away respectively.

Part $2$: Shortcuts to Victory

Shortest Path Search:

Implement Dijkstra$$s algorithm to discover the shortest paths from the starting position $($Westside$)$ to all other stations.

The algorithm dynamically updates distances as it explores station connections.

Algorithm Steps:

Create a map holding current shortest distances.

Initialize an empty stack for visited stations.

Maintain a set of already visited stations.

Start with Westside on the stack, marking its distance as $0.$

While the stack isn't empty:

Pop the current station.

Add it to the visited set.

Iterate over its neighbors:

Calculate distances and update if shorter.

Add unvisited neighbors to the stack.

Algorithm Completion:

Upon completion, the resulting map will contain the shortest routes from Westside to every other station. Classes:

Station.java:

Represents a train station.

Attributes:

City Name $($String$)$: Name where the station is located.

Distance $($Integer$)$: Distance assigned to that station.

Constructor:

Receives city name and distance as input.

Getters and Setters:

For accessing and modifying station attributes.

TrainStationManager.java:

Manages the main logic of the project.

Attributes:

Stations $($Map$>)$: Maps stations to their neighboring stations.

Shortest Routes $($Map$)$: Stores shortest routes from Westside to each station.

Methods to Implement:

public TrainStationManager$($String station$\_$file$)$: Reads station data from a file and populates the Stations map.

private void findShortestDistance$()$: Calculates shortest routes from Westside to all other stations using Dijkstra's algorithm.

public void sortStack$($Station station, Stack stackToSort$)$: Sorts a stack of stations by distance.

public Map getTravelTimes$()$: Computes travel times to each station based on shortest routes.

Bonus $($Optional$)$:

public String traceRoute$($String stationName$)$: Returns the route taken to reach a specific station.

GUI implementation for bonus points.