Not difficult to do, could probably write that in 20 lines of code.
Many people have also implemented Dijkstra's algorithm in excel also, you could possibly find a spreadsheet for it online.
“Travelling Salesman Problem” (TSP) is not a trivial problem. In computer science it is termed “
NP-Hard”. For example, the
Dantzig49 variant of TSP requires a tour be constructed of 48 cities, one each in every continental US state plus Washington, DC. There are (n-1!)/2 possible tours to a TSP, so Dantzig49 has 6,206,957,796,268,036,335,431,144,523,686,687,519,260,743,17 7,338,880,000,000,000 possible tours (~6.2 novemdecillion). We'll wait here for the 20 lines (
AFAIK, Dijsktra doesn't necessarily solve the problem).