xsl-list
[Top] [All Lists]

Re: [xsl] Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem

2012-12-07 13:24:09
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(_at_)saxonica(_dot_)com> 
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(_at_)saxonica(_dot_)com <mailto:oneil(_at_)saxonica(_dot_)com>
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/


--~------------------------------------------------------------------
XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: 
<mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--


--~------------------------------------------------------------------
XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--

<Prev in Thread] Current Thread [Next in Thread>