An implementation of a Trie Tree (Prefix Tree) that finds in a matrix of letters, the words that can be formed that are contained in a dictionary.
It is a quickly implemented proof of concept and below are the important details of this sample application:
- Needs Java 7
- The dictionary is a txt file that is under resources folder that can be modified.
- The main class "Main.java" has a static matrix that represents the puzzle that is explored. You can try changing it but remember is a proof of concept done in a couple of hours.
- It shows how to use Futures to implement the search of the words in parallel.
Hope someone finds it useful.