Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: List Connection

by artist (Parson)
on Oct 16, 2008 at 17:37 UTC ( #717536=note: print w/ replies, xml ) Need Help??


in reply to Re: List Connection
in thread List Connection

Ahh: Sorry if it looked like a homework question.( I just passed the Turing test) Certainly this is not a homework. This is for the project I am working on. I think that several CPAN modules can do the trick. Ultimately I like to find path from point A to B which can involve multiple pre-defined nodes. I also like to find out the path where given any 2 nodes to connect, the path should that should be taken have adjacent lists with maximum common elements ( rather than just one ) if possible.
Think of this as DNS routing problem. It is also close to traveling salesman problem. I like to probably learn from the other threads having similar problems.

--Artist


Comment on Re^2: List Connection
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2014-07-13 17:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (250 votes), past polls