PRODUCTS

DOWNLOAD

BUY

LEARN

SUPPORT

COMPANY

Cart

[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Word Ladders as an example of a "Find shortest pat Play the video Subject: Re: Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem From: Michael Kay <mike@xxxxxxxxxxxx> Date: Thu, 06 Dec 2012 18:40:27 +0000 On 06/12/2012 18:01, Hermann Stamm-Wilbrandt wrote: constant time array access XSLT doesn't define how sequences are implemented. Generally in Saxon, array access is constant-time - to the detriment of other things, of course. But a smart optimizer will choose between array-based and list-based implementations of sequences based on the usage. Michael Kay Saxonica Current Thread Re: Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem, (continued) Dimitre Novatchev - 7 Dec 2012 12:57:25 -0000 Andrew Welch - 7 Dec 2012 13:49:04 -0000 Dimitre Novatchev - 7 Dec 2012 14:00:52 -0000 Wolfgang Laun - 7 Dec 2012 16:04:28 -0000 Michael Kay - 6 Dec 2012 18:40:38 -0000 <= Wolfgang Laun - 7 Dec 2012 08:21:52 -0000 Hermann Stamm-Wilbrandt - 7 Dec 2012 09:23:08 -0000 Wolfgang Laun - 7 Dec 2012 11:54:32 -0000 Hermann Stamm-Wilbrandt - 7 Dec 2012 13:52:02 -0000 <- Previous Index Next -> Re: Word Ladders as an exampl, Wolfgang Laun Thread Re: Word Ladders as an exampl, Wolfgang Laun Re: Word Ladders as an exampl, Hermann Stamm-Wilbra Date Re: Word Ladders as an exampl, Chris Maloney Month

PURCHASE STYLUS STUDIO ONLINE TODAY! Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE! Accelerate XML development with our award-winning XML IDE - Download a free trial today! Don't miss another message! Subscribe to this list today. Email First Name Last Name Company Subscribe in XML format RSS 2.0 Atom 0.3

Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.