Re: (Golf) Shortest Graph Distance


good chemistry is complicated, and a little bit messy -LW
	PerlMonks

by MeowChow (Vicar)

on May 12, 2001 at 08:28 UTC ( [id://79911]=note: print w/replies, xml )

Need Help??

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}}
}
[download]

   MeowChow                                   
               s aamecha.s a..a\u$&owag.print

Comment on Re: (Golf) Shortest Graph Distance Download Code

In Section Meditations

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://79911]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others taking refuge in the Monastery: (3)

As of 2024-04-19 22:26 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found