Ukkonen’s suffix tree construction: Difference between revisions
m
→{{header|Go}}: Added a note in the preamble about the C code on which this entry is based not compiling as it stands.
(Added Go) |
m (→{{header|Go}}: Added a note in the preamble about the C code on which this entry is based not compiling as it stands.) |
||
Line 15:
=={{header|Go}}==
This is a translation of the C code [https://www.geeksforgeeks.org/suffix-tree-application-3-longest-repeated-substring/ here] which is an extended form of the code in Part 6 of the task description for finding the longest repeated substring of a given string. In the interests of brevity, the extensive comments in the C version have been largely omitted. The C code doesn't compile as it stands but I have added a fix in the Talk Page.
For convenience I have included the code from the [[Arithmetic-geometric_mean/Calculate_Pi#Go]] task in the same package.
| |||