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
|
Cart
