-
Notifications
You must be signed in to change notification settings - Fork 0
/
Compact_aho_corasick.cpp
80 lines (74 loc) · 2.31 KB
/
Compact_aho_corasick.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
struct AhoCorasick {
vector<node> v{node()};
void insert(string& s, int word_index){
int id = 0;
for(auto c:s){
if(v[id].trie.find(c)==v[id].trie.end()) {
v.push_back(node(c));
v[id].trie[c] = (int)v.size() - 1;
}
id = v[id].trie[c];
}
v[id].is_end = true;
v[id].word_id = word_index;
}
void linker()
{
int id=0;
queue<int> que;
que.push(id);
while(!que.empty()) {
int start_id = que.front();
que.pop();
for(auto it:v[start_id].trie) {
create_links(start_id, it.S, it.F);
que.push(it.S);
}
}
}
void create_links(int start_id, int node_id, char c){
start_id = v[start_id].suffix_link;
while(start_id != -1 && v[start_id].trie.find(c) == v[start_id].trie.end()) {
start_id = v[start_id].suffix_link;
}
// End of suffix_link creation
if(start_id == -1)
v[node_id].suffix_link = 0;
else
v[node_id].suffix_link = v[start_id].trie[c];
// Create Output Link
if(v[v[node_id].suffix_link].is_end)
v[node_id].output_link = v[node_id].suffix_link;
else
v[node_id].output_link = v[v[node_id].suffix_link].output_link;
}
bool process(string& s) {
int id = 0;
for(auto c:s) {
// Find proper transition-----------------
int cur_id = id;
while(cur_id != -1 && v[cur_id].trie.find(c)==v[cur_id].trie.end()) {
cur_id = v[cur_id].suffix_link;
}
if(cur_id == -1)
{
id = 0;
continue;
}
// Go through all output links------------
id = cur_id;
if(v[v[id].trie[c]].is_end)
ans[v[v[id].trie[c]].word_id]++;
id = v[id].trie[c];
int prev_id = id;
if(v[id].output_link != -1)
{
while(v[id].output_link != -1){
ans[v[v[id].output_link].word_id]++;
id = v[id].output_link;
}
}
id = prev_id;
}
}
};