|
|
Definition of Directed acyclic word graph
1. Noun. (computing 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). ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Directed Acyclic Word Graph
Other Resources:
