need to visit all the nodes exactly once and without considering going back to starting point in an asymetric graph.The distance should be minimum. Like a traveller needs to visit all the cities with minimum distance/cost and don't need to go back to the starting node. and addition to that the graph is asymetric. like the distance from A->B and B->A is different. is there any way for doing this?
Asked
Active
Viewed 76 times
0
-
Your variant doesn't seam to simplify the TSP so you could use any TSP algorithm and adapt it to your variant. I'm sure it is still NP-hard. – MrSmith42 Aug 25 '22 at 08:25
-
3This is sometimes called the shortest Hamiltonian path. – trincot Aug 25 '22 at 08:32