could you solve this with generic algorithym and nearest neighbor algorithym, provide all code for each method and compare this two method please

$1.$Traveling Salesman Problem $\{$TSP$)$:

Given a list of cities $(20+$cities$)$and the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the original city.