Re^4: 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 Look at all the nodes adjacent to where we're starting. Weed out any we've already visited. Call find_path for each of those nodes and gather up the results Return the list made by prepending this node onto each of those paths Caution: Contents may have been coded under pressure.	[reply]
Re^6: find all paths of length n in a graph by karden (Novice) on Sep 21, 2007 at 12:12 UTC
Yeah, much clearer now. Especially after figuring out what "map" does :) Thank you indeed!	[reply]