MatijaEskicWork/TSP-problem-DP-Solution

Solving Traveling Salesman problem with dynamic programming and bitmasking for 20 cities. It could work for 23,24 cities also.