This is Python

You are to implement the Word Ladder problem.

Step 1) Create an undirected graph for the Word List shown in Figure 1. You need to use a Python dictionary Figure 1. Word List

Step 2) Modify bfs() function in allow the user to enter 'startWord' and 'endWord'. The function should return 'True' if a transformation sequence exists. Return 'False' if there is no such transformation sequence. Notice that you don't need to find the number of transformations. It searches the tree using BFS algorithm to see if a transformation sequence exists.

Sample run C:\Users\test\Desktop>hw11.py enter startWord : hot enter endtWord : dog True C:\Users\test\Desktop>hw11.py enter startWord : hot enter endtWord : cog True C:\Users\test\Desktop>hw11.py enter startWord : hit enter endtWord : ddd False