Implementation of the traveling salesman problem in C++
Tell me which way to think: the program reads a text file in which the map is drawn with numbers (0-road, 1-building, 2-store, 3-warehouse). You need to draw a map and build the shortest route from the warehouse to each store, and after all the stores go back to the warehouse. I think to draw a map in SFML, how do you suggest to build and calculate the route?
0