directed acyclic word graph

English

Noun

directed acyclic word graph (plural directed acyclic word graphs)

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

Translations
Translations
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.