Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: (Golf) Shortest Graph Distance

by MeowChow (Vicar)
on May 12, 2001 at 08:28 UTC ( [id://79911] : note . print w/replies, xml ) Need Help??


in reply to (Golf) Shortest Graph Distance

Here's a recursive strict and -w compliant sub at 94 chars for the related problem of enumerating all possible paths (without cycles) from A to B:
sub p { my($g,$s,$e,%v)=@_;$s eq$e?[$e]:map{map[$s,@$_],p($g,$_,$e,%v,$s,1)} +grep!$v{$_},keys%{$$g{$s}} }
   MeowChow                                   
               s aamecha.s a..a\u$&owag.print