- #1

JorgeM

- 30

- 6

- TL;DR Summary
- Hello there, I need to identify the best path for the minimun distance over a set of points randomly distributed over an X-Y plane.

The only restrictions are:

-There are N points randomly distributed over an X-Y plane and it is necesary to pass every point at least 1 time, in order to get the path of the minimun distance throught all of them.

-If does not matter how many times you pass any of this points.

-You have to pass every point at least one time.

-The only known point is (0,0) as the first.

How may I solve this algorithm? I have been reading and I found something about Djikstra's algorithm But I am afraid it is only for getting the best path from the point A to the point B over a set of points without taking care of passing by all the points, or Am I wrong?

If you know any algorithm that could solve this problem, I would thank you for telling me its name.

Thanks for your advise.

Jorge M

-There are N points randomly distributed over an X-Y plane and it is necesary to pass every point at least 1 time, in order to get the path of the minimun distance throught all of them.

-If does not matter how many times you pass any of this points.

-You have to pass every point at least one time.

-The only known point is (0,0) as the first.

How may I solve this algorithm? I have been reading and I found something about Djikstra's algorithm But I am afraid it is only for getting the best path from the point A to the point B over a set of points without taking care of passing by all the points, or Am I wrong?

If you know any algorithm that could solve this problem, I would thank you for telling me its name.

Thanks for your advise.

Jorge M