Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^4: find all paths of length n in a graph

by karden (Novice)
on Sep 19, 2007 at 00:54 UTC ( [id://639775]=note: print w/replies, xml ) Need Help??


in reply to Re^3: find all paths of length n in a graph
in thread find all paths of length n in a graph

Arghh stupid me!

Oh no, not a HW. In fact I am a little old for HWs *ashamed*. I am good with Java/C stuff but I am trying to get familiar with Perl for one of my projects so asking whatever comes into my mind. Perl's (incredible) shorthand expressions confuse me often and sometimes I spend needlessly long time trying to figure them out (else part in the code for instance). Though this time, I agree that, I did not consider enough. It was obviously too trivial. Sorry but thank you indeed!
  • Comment on Re^4: find all paths of length n in a graph

Replies are listed 'Best First'.
Re^5: find all paths of length n in a graph
by Roy Johnson (Monsignor) on Sep 19, 2007 at 15:26 UTC
    I wrote this in very much a LISP style, which, if you're not familiar with it, can be pretty hard to follow. The else section constructs the non-trivial solution to the problem
    1. Look at all the nodes adjacent to where we're starting. Weed out any we've already visited.
    2. Call find_path for each of those nodes and gather up the results
    3. Return the list made by prepending this node onto each of those paths

    Caution: Contents may have been coded under pressure.
      Yeah, much clearer now. Especially after figuring out what "map" does :) Thank you indeed!

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (2)
As of 2024-04-25 03:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found