Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^4: search overlap paths

by Laurent_R (Prior)
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.


Comment on Re^4: search overlap paths

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (8)
As of 2015-07-08 02:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (93 votes), past polls