A Java implementation of Ukkonen's suffix tree creation algorithm capable of creating a generalized suffix tree.
You will need to be familiar with Ukkonen's algorithm and suffix trees in general. Most of this library is based on this Stack Overflow answer
This implementation is generic which allows the user to supply a custom character and word type.
The tree should perform linearly with regard to the length of the string / strings being added to it.
- Holds the root
- Holds the master
- Most of the state of the whole tree.
SuffixTree.toString return a .dot file with the tree structure represented within it. To view these files use Graph Viz