directed acyclic word graph

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

directed acyclic word graph (plural directed acyclic word graphs)

Wikipedia

  1. (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).

Synonyms[edit]