[Solved] Shortest path that goes through different points [closed]

Question

I think this is basically the Travelling Salesman problem. You’ve got N destinations, and each pair of destinations has a concrete length between them, and you’re trying to find out the shortest travel time to visit all destinations.

You’ve got two different directions to pursue this, that I can see. First, is to read up on the Travelling Salesman problem and the various algorithms that have been proposed for it (it’s a very famous algorithm problem) and then try to implement one in C# – though just to warn you, you should be very proficient in math, because it’s not an easy problem. Or, alternatively, you can look for someone else’s existing implementation for it and just use it without understanding the theoretical underpinnings.

Accepted Answer

I think this is basically the Travelling Salesman problem. You’ve got N destinations, and each pair of destinations has a concrete length between them, and you’re trying to find out the shortest travel time to visit all destinations.

You’ve got two different directions to pursue this, that I can see. First, is to read up on the Travelling Salesman problem and the various algorithms that have been proposed for it (it’s a very famous algorithm problem) and then try to implement one in C# – though just to warn you, you should be very proficient in math, because it’s not an easy problem. Or, alternatively, you can look for someone else’s existing implementation for it and just use it without understanding the theoretical underpinnings.