WordLadder

This program implements a shortest path finder that takes two words of the same length and returns the shortest path, which uses Dijkstra's algorithm. An example: To get from APE to MAN, the following path is the shortest: APE APT OPT OAT MAT MAN