Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: (Golf) Shortest Graph Distance

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


in reply to (Golf) Shortest Graph Distance

Best I could do so far, strict and warning clean, at 158 chars:
sub path { my($g,$s,$e,@p,$q)=@_;@_=[0,$s];{my($l,@r)=@{+shift};if(!@p||$q>$l){ +@p=@r,$q=$l if$r[-1]eq$e;my$o=$$g{$r[-1]};push@_,map[$l+$$o{$_},@r,$_ +],keys%$o}@_&&redo}@p }
   MeowChow                                   
               s aamecha.s a..a\u$&owag.print