C++ (Cpp) SuffixTree::findLCS Examples

Example #1

File: lcs.cpp Project: 2012ankitkmr/My-works

int main()
{
    alphabet = "abcdefghijklmnopqrstuvwxyz1234567890-#";
    alphabetSize = alphabet.length();
    string s1,s2;
    //cout<<"Finding longest common substring using suffix trees\n";
    //cout<<"Enter 1st String: ";
    cin>>s1; 
   // cout<<"Enter 2nd String: ";
    cin>>s2;
    SuffixTree st;
    st.findLCS(s1, s2);         
    return 0;
}