Given an acyclic graph of nodes, where a node has a method C,
returning a list of all the nodes it points to, is it the case that
the following code:
sub descent($src, $dst) {
when $src == $dst { return $dst }
when !$src.kids{ die }
otherwise {
return ( $src, descent(any(
On Wed, Oct 30, 2002 at 02:25:02PM +, Piers Cawley wrote:
> Given an acyclic graph of nodes, where a node has a method C,
> returning a list of all the nodes it points to, is it the case that
> the following code:
>
> sub descent($src, $dst) {
> when $src == $dst { return $dst }
> w
Jonathan Scott Duff <[EMAIL PROTECTED]> writes:
> On Wed, Oct 30, 2002 at 02:25:02PM +, Piers Cawley wrote:
>> Given an acyclic graph of nodes, where a node has a method C,
>> returning a list of all the nodes it points to, is it the case that
>> the following code:
>>
>> sub descent($src,
On Wed, Oct 30, 2002 at 04:03:55PM +, Piers Cawley wrote:
> Jonathan Scott Duff <[EMAIL PROTECTED]> writes:
> > Hey, that's neat. Although it looks like it returns the $src when there
> > isn't a path. You probably want it to return undef or something.
>
> Nah, it'll die when there isn't a pat
Way outside the stuff I "get", Larry mentioned something about a
"transactional model" for flexen.
I keep wanting that to play somewhere in there, but I can't get my
brain around how it should work. Essentially, I keep degenerating into
Prolog. Since I *REALLY* don't wish to change all my perl scr
Jonathan Scott Duff <[EMAIL PROTECTED]> writes:
> On Wed, Oct 30, 2002 at 04:03:55PM +, Piers Cawley wrote:
>> Jonathan Scott Duff <[EMAIL PROTECTED]> writes:
>> > Hey, that's neat. Although it looks like it returns the $src when there
>> > isn't a path. You probably want it to return undef or
