The dataset contains information about the cities in the world, such as name, latitude, longitude and country.
The program is a simple travel guide. It allows the user to choose two different cities and then displays the shortest path between them. The program also plot the path in map and shows the time it takes to travel between them. The program uses different graph algorithms to find the shortest path between the cities. The user can choose between the following algorithms:
- bidirectional path (undirected graph),
- right only path (directed graph),
- left only path (directed graph).
In case the user chooses the right or left only path, the program will also be able to shows the shortest path to go around the world and come back to the starting city.
The travel time is calculated as follows:
- distance divided by the speed (the user can choose the speed),
- + 2 hours for each change of country,
- + 2 hours if the city has more than 200,000 inhabitants.