1) Read in a word list into an array
2) Create a 2 dim array implementation of a graph and use the word list as an adjacency matrix for it
Calculate 1 or 0 whether the column and row insertion is a 1 letter difference.
3) Run the Depth-first, or Breath first, or shortest path algorithm.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here