[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: Word Ladders as an example of a "Find shortest pat

Subject: Re: 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
Re:  Word Ladders as an example of a "Find shortest pat
> 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

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.