[XSL-LIST Mailing List Archive Home] [By Thread] [By Date]

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


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 06:00:22 -0800

> 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.j.welch@xxxxxxxxx> 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


Current Thread
Keywords