WordLadder generator/finder

I had to write this application as a university project.

The task was to generate a word ladder, which starts and ends on provided words. Both words have to be in a dictionary.

Every single step in the ladder must only differ in one character from the word before. The aim of the word-ladder is to find the shortest path from start word to end word in the whole graph.

I’ll give you an example of the usage and result of this application:

Provide full path to the dictionary:
Provide first word:
Provide second word:

1. clash
2. class
3. clans
4. clank
5. clack
6. clock

Usage of BFS was obvious.

The application consists of three classes:

Source code and documentation are available here.

Leave a Reply