Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)

Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)

From: Neo <neo55592_at_hotmail.com>
Date: 17 May 2004 23:08:50 -0700
Message-ID: <4b45d3ad.0405172208.660e3336@posting.google.com> 





> There's one difference in the output: the "things" fido and

> laptop1 have two common ancestors at the same distance (john and mary),

> but Xdb1 is only able to find john. I consider this to be a bug in Xdb1's

> output, since john is definitely NOT a "nearer" common ancestor that mary.




XDb1's code is designed to print any one of the nearest common
ancestor. If your method prints all the nearest common ancestor, that
is fine, if not better.
Received on Tue May 18 2004 - 01:08:50 CDT












Original text of this message













  HOME |
  ASK QUESTION |
  ADD INFO |
  SEARCH |
  E-MAIL US