8000 Problem on the Aho-Corasick Algorithm Article · Issue #1450 · cp-algorithms/cp-algorithms · GitHub
[go: up one dir, main page]
Skip to content
Problem on the Aho-Corasick Algorithm Article #1450
New issue
New issue
Closed
#1451
Closed
Problem on the Aho-Corasick Algorithm Article#1450
#1451
@mrityunjai01

Description

@mrityunjai01
mrityunjai01
opened on Apr 16, 2025

This is part of the last sentence under the section on BFS-based construction, hyperlink.

I believe they talk about having $O(n \log k)$ instead of $O(m \log k)$, where $n$ is the number of vertices in the trie.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions
      0