C++

Have the code read file with lists of words then use the following method to transition, word to word, first from the Beginning word to the Ending word..

Method:

1) Start with a Beginning word, Replace ONE(1) letter in the beginning word, that will result in another word found in your dictionary/list of words.

2) Repeat UNTIL the one letter at a time change reaches/matches the LAST word, or you find there is not ladder..

Is it possible to construct a word ladder that for that word ?

If so, then print the word sequence that transactions from the beginning word to the matching end word.

Example: LOVE --- HATE ( Word pair.. Beginning and ending words )

Word ladder solution 1 LOVE HOVE HAVE HATE

Word ladder Solution 2 LOVE LIVE LIKE LAKE LATE HATE