A C++ implementation of Ukkonen's algorithm for linear-time suffix tree construction.
To build everything simply run make.
Tests are written with bats:
bats test/tests.bats
The compiled program suffixtree takes a single string parameter and outputs
a DOT language (Graphviz) representation of the tree to STDOUT. With
ImageMagick and Graphviz installed you should see a .jpg like the above:
./suffixtree xabxa$ | dot -Tjpg | display
MIT