Does anyone know a site that might have some information on algorithms/design for suffix trees for C++? I have to creat one from scratch and it's a bit tough because I don't have any idea on how to create the code or anything.
John
Does anyone know a site that might have some information on algorithms/design for suffix trees for C++? I have to creat one from scratch and it's a bit tough because I don't have any idea on how to create the code or anything.
John
http://www.google.com/search?hl=en&i...q=suffix+trees
Google is a great tool.
Code:#include <cmath> #include <complex> bool euler_flip(bool value) { return std::pow ( std::complex<float>(std::exp(1.0)), std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0) *(1 << (value + 2))) ).real() < 0; }