Description
- Implement a route finder program using A* algorithm with Jupyter Notebook.
- Find txt and distances.txt.
- txt stores actual distances between connected cities.
- txt stores straight-line distances between cities and Bucharest. iv. The program should be able to take a departing city as an input.
- The program should output a best route (based on A* algorithm) from the departing city to Bucharest. vi. An expected output.
From city: Arad
To city: Bucharest
Best route: Arad – Sibiu – RimnicuVilcea – Pitesti – Bucharest
Total distance: 418 vii.
