Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Travelling problem

by sundialsvc4 (Abbot)
on Dec 20, 2013 at 22:43 UTC ( #1067997=note: print w/replies, xml ) Need Help??

in reply to Travelling problem

I know of no practical way to solve the TS problem that doesn’t involve recursion.   It could actually be fairly simple, and wouldn’t necessarily occupy too much CPU time, since all adjacent edges which lead to an already-visited city would be immediately disqualified.   If the recursion successfully reached a depth equal to the number of cities, you know that the problem has been solved.   (It is the “shortest path” bugaboo, not present here, that makes TS computationally intractable.)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1067997]
[Lady_Aleena]: Having to rewrite some parts of my site for mobile devices is such a pain in the butt.
[shmem]: Lady_Aleena: what editor are you using, on what platform?
[Lady_Aleena]: shmem, geany on Debian jessie.
[shmem]: some experience with vim?
[Lady_Aleena]: None
[shmem]: I don't know geany, and don't know whether it has support for ctags.

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (7)
As of 2017-04-27 12:03 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (505 votes). Check out past polls.