Subject: Re: [xsl] Ordering of Blocks based on Input/Output From: Dan Diebolt <dandiebolt@xxxxxxxxx> Date: Thu, 10 May 2001 19:54:42 -0700 (PDT) |
>I'm not sure if you're aware that you're asking for >what's known as a "topological sort" ... > efficient solution has linear complexity: O(m+n) Precisely. For my purposes, I would go so far as to suggest <hint>some of these graph algorithms should be available as some type of extension function</hint>. Here is a fairly comprehensive list of algorithms one might draw from: http://hissa.nist.gov/dads/ Regards, Dan __________________________________________________ Do You Yahoo!? Yahoo! Auctions - buy the things you want at great prices http://auctions.yahoo.com/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Ordering of Blocks based , Francis Norton | Thread | [xsl] XSQL/NAMESPACE, Kevin_Gutch |
Re: [xsl] Looping over characters i, Dan Diebolt | Date | Re: [xsl] Reformatting, Dan Diebolt |
Month |