This project combines the power of LLMs with location data and everyone's favourite computational problem: The Travelling Salesman problem!
- Enter the city you want to visit and you will get 10 must-visits in the city of choice!
- Pick the locations you want to visit
- Generate the shortest path between these locations