This project uses a tree data structures, built in Ruby, to perform a breadth-first search of words in a provided dictionary. It finds and returns the shortest path between two words, changing only one letter at a time.
benjamts/word_chains
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|