A new efficient implementation of Ukkonen's algorithm in C++

I  implemented a suffix tree library. There is a Wikipedia article on suffix trees here:

en.wikipedia.org/wiki/Suffix_tree

The new library is really neat! It can also generate nice images from real inputs. Here are some images of suffix trees generated by the library:

The image on the left is a great classic: the suffix tree of the word "cacao".

 Another great classic: the suffix tree of the word "bananas".

And finally something more challenging: the "word" obtained by randomly typing "asdf":

asdfasfasdfasdfasdfassdfasdsfasdsdfassfasdfasdsdfassdfas