In [1]:

    

import TrieNode
import SufTreeNode
import trie

%load_ext autoreload
%autoreload 2


    

In [2]:

    

words = ['box$', 'boxing$', 'baby$', 'base$', 'dance$', 'dad$', 'dady$']
mTrieNode = TrieNode.buildTrie(words)
#print(mTrieNode.val)


    

In [3]:

    

buf = trie.allWords(mTrieNode,plot=True)
print('buf = %s' % buf)


    

    













    




buf = ['base$', 'baby$', 'box$', 'boxing$', 'dance$', 'dad$', 'dady$']

In [4]:

    

buf = trie.autocomplete(mTrieNode,'dad')
print('buf = %s' % buf)


    

    




buf = ['dad$', 'dady$']

In [5]:

    

words = ['ababc$'] # 'BANANA$' 'ababc$' 'abaab'
mSufTree = SufTreeNode.buildSufTree(words)


    

    




suf = ababc$
head = 
suf = babc$
head = 
suf = abc$
head = ab
suf = bc$
head = b
suf = c$
head = 

In [6]:

    

buf = trie.allWords(mSufTree,plot=True)
print('buf = %s' % buf)


    

    













    




buf = ['abc$', 'ababc$', 'bc$', 'babc$', 'c$']

In [ ]: