add esa: http://code.google.com/p/esaxx/ It first build a suffix array, and then compute the inversed suffix array, and finally obtain the height array. By using a height array, internal nodes in a suffix tree are enumerated in post-order.
add esa:
http://code.google.com/p/esaxx/
It first build a suffix array, and then compute the inversed suffix
array, and finally obtain the height array. By using a height array,
internal nodes in a suffix tree are enumerated in post-order.

izenecloud/izenelib,pombredanne/izenelib,izenecloud/izenelib,izenecloud/izenelib,pombredanne/izenelib,pombredanne/izenelib,izenecloud/izenelib,pombredanne/izenelib