Word ladder: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: added A* solution) |
(Added link to canonical version of unixdict.) |
||
| Line 2: | Line 2: | ||
Yet another shortest path problem. Given two words of equal length the task is to transpose the first into the second. |
Yet another shortest path problem. Given two words of equal length the task is to transpose the first into the second. |
||
Only one letter may be changed at a time and the change must result in a word in unixdict, the minimum number of intermediate words should be used. |
Only one letter may be changed at a time and the change must result in a word in [https://github.com/quinnj/Rosetta-Julia/blob/master/unixdict.txt unixdict], the minimum number of intermediate words should be used. |
||
Demonstrate the following: |
Demonstrate the following: |
||