Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re^15: Travelling problem (Anyone better 86850?)

by LanX (Canon)
on Dec 28, 2013 at 14:26 UTC ( #1068614=note: print w/ replies, xml ) Need Help??


in reply to Re^14: Travelling problem (Anyone better 86850?)
in thread Travelling problem

The n shortest remaining edges¹!

You don't wanna visit a node again you've already seen. So it's not 8th cause the previous ones aren't possible anymore.

- marks already excluded nodes

! marks target node

84860 [ 0 1 10 15 7 6 11 16 20 5 12 3 8 22 13 9 4 14 17 19 2 18 21 23 +] [ - [ 0, 18], - [ 3236, 2], ! [ 3419, 23], - [ 4874, 15], - [ 5593, 19], - [ 5954, 10], - [ 6102, 7], * [ 6278, 21], ... [ 6883, 14], [ 8377, 6], [ 9100, 11], [ 9181, 17], [ 9367, 1], [103 +07, 4], [10709, 9], [12822, 0], [12955, 16], [15242, 20], [15400, +13], [15447, 22], [15982, 8], [16868, 3], [17301, 5], [17968, 12] ],

So it's effectively the shortest remaining possibility.

Cheers Rolf

( addicted to the Perl Programming Language)

¹) successively take the shortest edge to a yet unvisited node


Comment on Re^15: Travelling problem (Anyone better 86850?)
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1068614]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2014-07-28 21:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (209 votes), past polls