I have a list of cities and distances between them:
NewYork- Los Angeles 2 441 minutesNewYork- Los Angeles 1500 minutesNewYork- Dallas 100 minutesLos Angeles Washington 2456Los Angeles Dallas 2435the task is to find the shortes path to start from NYC and end in NYC and visit every city only once.I have a list, not a graph. I have so much data (200 records) so i cant make a graph out of them and solve it like Traveling Salesman Problem. How to find shortes path?