Internal Node
Leaf Node
Active Point
Suffix Link
Input String
Construction State
Enter a string above
Active Point: (root, ε, 0)
Controls
Statistics
0
Phase
1
Nodes
0
Extensions
0
Remainder
Operation Log
About Ukkonen's Algorithm
- Online: builds tree incrementally
- O(n) time complexity
- Uses active point (node, edge, length)
- Suffix links enable fast traversal
- Implicit end for leaf edges