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

Re^4: search overlap paths

by Laurent_R (Canon)
on Jun 13, 2014 at 07:24 UTC ( #1089779=note: print w/replies, xml ) Need Help??


in reply to Re^3: search overlap paths
in thread search overlap paths

Yes, there is no 1800-2000 link, but, if I understood the OP correctly, there is an overlapping path (1000-2000) so that the 1800-2000 itinary can be done through this path.

I was first thinking of a simple (possibly recursive) tree-walking algorithm, but given the possibility of crossing the 1800-2000 gap using the 1000-2000 link, the right solution is probably quite different.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1089779]
help
Chatterbox?
LanX is a dev version
[marto]: That reminds me, I made some notes somewhere with regard W::M::C, I'll get round to a PR when I've time to flesh it out
[Corion]: erix: But that makes for fun bug hunting. "What version of Chrome are you running?" "v62". "I also run v62 and it works on my machine". :-(
[Corion]: marto: Great, looking forward to the PR!
LanX wonders, do we have a rule against systematic down voting?
[erix]: we frown :)
[marto]: Does the command line arg --product-version@ help?
[LanX]: xD
[erix]: 'systematic' is going to be hard to define I think
[marto]: Err no @

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (11)
As of 2017-12-12 20:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (335 votes). Check out past polls.

    Notices?