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 08:01:03
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.


Exactly.

Cheers,
Dimitre

On Fri, Dec 7, 2012 at 5:48 AM, Andrew Welch 
<andrew(_dot_)j(_dot_)welch(_at_)gmail(_dot_)com> wrote:
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

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