This project based on the below question, Turkey cities used.
[start -> must visit -> return to start]
put all cities to graph
then calculate dijkstra
then filter which includes given cities
then return whichever one of them has the smallest value
-
find all combinations of certain cities
-
find the shortest path with Dijkstra between pair nodes
-
find all permutations of route
-
calculate each possible solution distance
-
make calculated distances ordered