3 ms·
One of my favorite data structures is the Aho-Corasick Automaton, which combines Tries and the KMP algorithm in order to search for multiple strings in a text s
by quirino 3y ago
One of my favorite data structures is the Aho-Corasick Automaton, which combines Tries and the KMP algorithm in order to search for multiple strings in a text simultaneously.
It is very elegant.
- nonrandomstring 3y agoHeard about this from someone talking about finding hash collisons fast. Most interesting. https://cp-algorithms.com/string/aho_corasick.html https://cp-algorithms.com/string/aho_corasick.html