I built a Graph data structure to help develop my word ladder puzzle, and I implemented a Breadth First Search algorithm in searching the graph. For example, to solve the word ladder from fool to sage my program should build a graph that looks like this: