Talk:Suffix tree: Difference between revisions
→definition?
Line 31:
::: Eh, either an oracle, or a hash table maybe? If you have a single node with n edges going out, but each edge begins with a unique letter, then map these letters to the edges. During a string match, just see what next letter is, and do an O(1) lookup to get the corresponding edge. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 15:27, 25 May 2013 (UTC)
:::: If by "each edge begins with a unique letter" you mean "each edge begins with a uniquely different letter" then I agree. However, the example I proposed had each edge begin with a letter which is the same as every other edge (except for the final edge). This letter is in a sense unique (it's the only letter in the example before we decorate it with the final character) but it's probably better to say that we cannot be guaranteed that each edge begins with a different unique letter. Or, more concisely: did you read what I wrote? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 15:33, 25 May 2013 (UTC)
| |||