WordLadderSolver

C++ project that uses a priority queue and an algorithm that is based on Dijkstra's shortest path, to find a possible path between two words. Words must be included in words.txt (including the ones in the path you want to find.)