Graph Theory Problem

Dave Smith dave at thesmithfam.org
Fri Dec 12 23:07:30 MST 2008


Matthew Walker wrote:
> On Fri, December 12, 2008 10:04 pm, Levi Pearson wrote:
>   
>> The nodes that have the most descendants, I think you mean.  Looks
>> like an interesting problem!
>>     

I did indeed mean the most number of descendants. Thanks for the 
clarification.

> Interestingly, as presented on his blog, A and B have an infinite number of descendants, unless you impose an 'only traverse once' rule for nodes. :)
>   

That is true, if you assume that a node can be a descendant of itself. :)

--Dave



More information about the PLUG mailing list