Subject: Re: [xsl] Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem From: Andrew Welch <andrew.j.welch@xxxxxxxxx> Date: Fri, 7 Dec 2012 13:48:53 +0000 |
> All this taken into account and if one finds XSLT as the more > convenient languge compared to C++, and if a split millisecond doesn't > matter, then I don't see anything wrong in writing such > implementations in a higher language such as XSLT and not in C++. Isn't the whole point to solve the problem using XSLT... this reminds me of the Sudoku challenge we did, I had numerous emails from people telling me about their 'better' non-XSLT solutions - completely missing the point. -- Andrew Welch http://andrewjwelch.com
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Word Ladders as an exampl, Dimitre Novatchev | Thread | Re: [xsl] Word Ladders as an exampl, Dimitre Novatchev |
Re: [xsl] serialized form of XML us, Andrew Welch | Date | Re: [xsl] Word Ladders as an exampl, Hermann Stamm-Wilbra |
Month |