|
|
|
| There's more than one way to do things | |
| PerlMonks |
Re^5: find all paths of length n in a graphby Roy Johnson (Monsignor) |
| on Sep 19, 2007 at 15:26 UTC ( [id://639910]=note: print w/replies, xml ) | Need Help?? |
|
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
Caution: Contents may have been coded under pressure.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||