Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

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]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2017-06-25 04:20 GMT
Find Nodes?
    Voting Booth?
    How many monitors do you use while coding?

    Results (564 votes). Check out past polls.