Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- SuffixTreeBuilderTest.TestSlideTree : Passed
- Adding String: bbabbaabÿ
- k = 1: bb
- i = 1
- Traversed to b
- k = 2: bba
- i = 1
- Added leaf a to new branch: Node #2 ([0 .. 0] b)
- Moved to Root
- i = 2
- Added leaf a to existing branch: <Root>
- Added link from Node #2 ([0 .. 0] b) to <Root>
- k = 3: bbab
- i = 3
- Traversed to b
- k = 4: bbabb
- i = 3
- Traversed to b
- k = 5: bbabba
- i = 3
- Traversed to a
- k = 6: bbabbaa
- i = 3
- Added leaf a to new branch: Node #5 ([1 .. 2] ba)
- Moved to Root
- Moved to Node #2 ([0 .. 0] b) -> Node #3 ([2 .. -1] abbaa) (+1)
- i = 4
- Added leaf a to new branch: Node #7 ([2 .. 2] a)
- Added link from Node #5 ([1 .. 2] ba) to Node #7 ([2 .. 2] a)
- Moved to Root
- Moved to <Root> -> Node #4 ([2 .. -1] abbaa) (+1)
- i = 5
- Added leaf a to new branch: Node #9 ([2 .. 2] a)
- Added link from Node #7 ([2 .. 2] a) to Node #9 ([2 .. 2] a)
- Moved to Root
- i = 6
- Traversed to a
- Added link from Node #9 ([2 .. 2] a) to <Root>
- k = 7: bbabbaab
- i = 6
- Traversed to b
- k = 8: bbabbaabÿ
- i = 6
- Added leaf ÿ to new branch: Node #11 ([3 .. 3] b)
- Moved to Root
- Moved to Node #2 ([0 .. 0] b) -> Node #2 ([0 .. 0] b) (+0)
- i = 7
- Added leaf ÿ to existing branch: Node #2 ([0 .. 0] b)
- Added link from Node #11 ([3 .. 3] b) to Node #2 ([0 .. 0] b)
- Moved along link to: <Root>
- i = 8
- Added leaf ÿ to existing branch: <Root>
Advertisement
Add Comment
Please, Sign In to add comment