[SOLVED] CECS451 Assignment 2

1.  Implement a route finder program using A* algorithm with Jupyter Notebook.
2. Find txt and distances.txt.
3. 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.

1. 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. Submit a-star.ipynb file.