Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
An algorithm is a sequence of well-defined steps that define an abstract solution to a problem. Use this tag when your issue is related to algorithm design.
3
votes
1
answer
2k
views
Generalized Suffix Tree implementation
.
// The result '(s,k)' of this function may then be used to resume the Ukkonen's
// algorithm. … int>::max();
}
// deploy_suffixes - Deploy suffixes
// @s[in]: The string to insert in the tree
// @sindex[in]: The index id of @s
//
// deploy_suffixes performs the Ukkonen's algorithm …