Animated a graphing algorithm that searches for words in a nxn grid of randomized letters
Modified a DFS algorithm to efficiently search for words within a graph of letters.
Used a Trie to efficiently check for word validity.
Built with Python, OpenCV Image Processing tools
(Note: Animation speed does not reflect algorithm speed, user can input any 4x4 grid for visualization in the form of a 16 letter string)

