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

[Michel Hendriksen <michel.hendriksen@xxxxx>]

Very nice! Where did you get your dictionary? Would be interesting to
play around with this.

Michel

On Tue, Nov 27, 2012 at 6:08 AM, Dimitre Novatchev <dnovatchev@xxxxxxxxx> wrote:
> Dear XSLT professionals,
>
> In case you are interested in solving the Word Ladders problem first
> formulated by Lewis Carroll, or just in an XSLT solution of the "Find
> shortest path in graph" problem, you might be interested to have a
> look at the implementation in my latest blog post:
>
> http://dnovatchev.wordpress.com/2012/11/26/word-ladders-or-how-to-go-from-angry-to-happy-in-20-steps/
>
> Any feedback about this implementation and suggestions for further
> optimization are welcome.
>
> --
> Cheers,
> Dimitre Novatchev
> ---------------------------------------
> Truly great madness cannot be achieved without significant intelligence.
> ---------------------------------------
> To invent, you need a good imagination and a pile of junk
> -------------------------------------
> Never fight an inanimate object
> -------------------------------------
> To avoid situations in which you might make mistakes may be the
> biggest mistake of all
> ------------------------------------
> Quality means doing it right when no one is looking.
> -------------------------------------
> You've achieved success in your field when you don't know whether what
> you're doing is work or play
> -------------------------------------
> Facts do not cease to exist because they are ignored.
> -------------------------------------
> Typing monkeys will write all Shakespeare's works in 200yrs.Will they
> write all patents, too? :)
> -------------------------------------
> I finally figured out the only reason to be alive is to enjoy it.