Subject: Re: [xsl] Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem From: Dimitre Novatchev <dnovatchev@xxxxxxxxx> Date: Fri, 7 Dec 2012 11:23:33 -0800 |
Thank you, O'Neil and Dr. Kay, I feel excited that my work, beside demonstrating an XSLT solution to an attractive problem, was also able to provide the ground for a 4-times speedup in Saxon (byte-code). Cheers, Dimitre On Fri, Dec 7, 2012 at 6:48 AM, O'Neil Delpratt <oneil@xxxxxxxxxxxx> wrote: > As promised please see my blog post with some Saxon performance measures on > this Word Ladder topic: > http://dev.saxonica.com/blog/oneil/2012/12/performance-measures-of-the-word-ladders-problem-in-xslt.html > > Kind regards, > -- > O'Neil Delpratt > Software Developer, Saxonica Limited > Email: oneil@xxxxxxxxxxxx <mailto:oneil@xxxxxxxxxxxx> > Tel: +44 118 946 5894 > Web: http://www.saxonica.com > Saxonica Community Site: http://dev.saxonica.com Saxonica Bug tracking > System: https://saxonica.plan.io/
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Word Ladders as an exampl, O'Neil Delpratt | Thread | Re: [xsl] Word Ladders as an exampl, Michael Kay |
Re: [xsl] Word Ladders as an exampl, Wolfgang Laun | Date | Re: [xsl] Word Ladders as an exampl, Michael Kay |
Month |