Re: (Golf) Shortest Graph Distance

[no_slogan]

My first try. Passes -w and strict. 172 characters.

sub path {
my($g,$a,$b,$x,$y,%s)=@_;$s{$a}=[0,[$a]];for(%$g){for(keys%s){$s{$x}&&
+$s{$_}[0]+$y>$s{$x}[0]or$s{$x}=[$s{$_}[0]+$y,[@{$s{$_}[1]},$x]]while(
+$x,$y)=each%{$g->{$_}}}}$s{$b}[1]
}

Update:Oops, it returns an arrayref instead of an array. No point in fixing it, chipmunk's solution puts mine to shame anyway.