Questions
I am trying to code a program that can find the shortest possible route for a trip.
It's like i want to visit spot A, B, C, D, E, F, G and those are all scrambled in the map. (start from point A and i want to return A at the end)
What i have is a brute force that test every route and come up with a route. However, it is very inefficient as the variables grow larger the compiler will stop running (it was around 60). Is there anyone out there that has a better idea other than brute force?
It's like i want to visit spot A, B, C, D, E, F, G and those are all scrambled in the map. (start from point A and i want to return A at the end)
What i have is a brute force that test every route and come up with a route. However, it is very inefficient as the variables grow larger the compiler will stop running (it was around 60). Is there anyone out there that has a better idea other than brute force?
closed account (S6k9GNh0)
The compiler will stop running???
The easiest equation I can think of in any case uses basic math but I'd need to know how you're determining whether a route is closer to your destination than another. What variables are you using for instance...?
The easiest equation I can think of in any case uses basic math but I'd need to know how you're determining whether a route is closer to your destination than another. What variables are you using for instance...?
Last edited on
Topic archived. No new replies allowed.