Subject: Re: [xsl] Spotting "cousin marriages" in a tree From: Phil Endecott <spam_from_xslt_list@xxxxxxxxxxxx> Date: Thu, 29 Jul 2004 12:43:37 +0100 |
You may be hoping for too much. Graph algorithms such as looking for cycles often have complexity of O(n^2) or worse, whatever language they are implemented in.
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Spotting "cousin marriage, Jeni Tennison | Thread | Re: [xsl] Spotting "cousin marriage, David Carlisle |
Re: [xsl] Failed to load java error, Ranjan K. Baisak | Date | Re: [xsl] Spotting "cousin marriage, David Carlisle |
Month |