Recently i learnt Aho-Corasick Algorithm for Pattern Searching. To find all occurrences of pattern strings in text string.↵
i store all possible output links in my prefix tree(trie)<br><br>But case such as<br>↵
<b>↵
text = aaaaa <br>↵
pattern = {a, aa, aaa, aaaa, aaaaa} <br>↵
</b>↵
will give me huge number of output link!↵
↵
[my implementation](https://ideone.com/sPGOwN)↵
is there a better way to store them?↵
↵
i store all possible output links in my prefix tree(trie)<br><br>But case such as<br>↵
<b>↵
text = aaaaa <br>↵
pattern = {a, aa, aaa, aaaa, aaaaa} <br>↵
</b>↵
will give me huge number of output link!↵
↵
[my implementation](https://ideone.com/sPGOwN)↵
is there a better way to store them?↵
↵
