This repository provides an implementation of the Aho-Corasick string matching algorithm using two data structures:

• Hash Table
• Transition Matrix

Both implementations are designed to efficiently find all occurrences of multiple patterns within a given text.

Navigate to the main directory and run:

make

This will generate the following executables:

1. genere-texte: Generates random texts.
2. genere-mots: Generates random words.
3. ac-hachage: Executes the Aho-Corasick algorithm using a hash table.
4. ac-matrice: Executes the Aho-Corasick algorithm using a transition matrix.

./genere-texte <text_length> <alphabet_size> > text.txt

./genere-mots <word_count> <min_length> <max_length> <alphabet_size> > words.txt

Hash Table Implementation:

./ac-hachage words.txt text.txt

Transition Matrix Implementation:

./ac-matrice words.txt text.txt

1. Generate a text of length 5,000,000 with an alphabet of size 4:

   ./genere-texte 5000000 4 > text.txt

2. Generate 100 words with lengths between 5 and 15:

   ./genere-mots 100 5 15 4 > words.txt

3. Run the Aho-Corasick algorithm:

   ./ac-hachage words.txt text.txt
   ./ac-matrice words.txt text.txt