directed acyclic word graph
Jump to navigation
Jump to search
English
[edit]Noun
[edit]directed acyclic word graph (plural directed acyclic word graphs)
- (programming) A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie).
Synonyms
[edit]Translations
[edit]Translations
Further reading
[edit]
deterministic acyclic finite state automaton on Wikipedia.Wikipedia
