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.)
-
Notifications
You must be signed in to change notification settings - Fork 0
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.)
License
lucasbelvedere/WordLadderSolver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.)
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published