Implementation of the A* graph search algorithm in Java.
- Graph traversal
- Optimized DFS
- Trie
- Pathfinding
Time: O(L) where L is the length of the key Space: O(NxL) N: # of words, L: avg word length
Unit tested with the tests included in the project as well as third party.