Objectives: using a graph representation and implementing BFS.
We will be doing the last homework from this Spring's CS112 class (courtesy of Professor Leonid Reyzin). You can find the description here. You will need to download the dictionary that you will be using. You will also need the Doublets class and the WordGraph class.
You will only need to modify the WordGraph class, which implements the list that you need for your representation of the graph, the queue that you need for BFS, and the stack that you need to return the nodes on the shortest path, but leaves you to implement the methods to build the graph and perform breadth first search. Please note that once you understand the assignment and the code given to you, filling in the rest of the code should be straightforward, so do not be discouraged if you spend a long time getting started. Still, we ecnourage you to start working EARLY so that you have time to ask questions before the assignment is due.
You will receive up to 50 points for filling in functions which build the graph, and up to 50 points for programming the breadth first search.