A common word puzzle found in many newspapers and magazines is the word
transformation. By taking a starting word and successively altering a single letter to
make a new word, one can build a sequence of words which changes the original word to a given
end word. For instance, the word “
Given a dictionary of words from which to make transformations, plus a list of starting and ending words, your team is to write a program to determine the number of steps in the shortest possible transformation.
The first line of the input is an integer N, indicating the number of test sets that
your correct program should test, followed by a blank line. Each test set will have two
sections. The first section will be the dictionary of available words with one word per line,
terminated by a line containing an asterisk (
Following the dictionary are pairs of words, one pair per line, with the words in the pair separated by a single space. These pairs represent the starting and ending words in a transformation. All pairs are guaranteed to have a transformation using the dictionary given. The starting and ending words will appear in the dictionary.
Two consecutive input sets will be separated by a blank line.
The output should contain one line per word pair for each test set and must include the starting word, the ending word, and the number of steps in the shortest possible transformation, separated by single spaces. Two consecutive output sets should be separated by a blank line.
Output for Sample Input
|University of Debrecen; Faculty of Informatics; v. 03/01/2019|