directed acyclic word graph

directed acyclic word graph
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).
Syn: DAWG

Wikipedia foundation.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Directed acyclic word graph — For the US Department of Defense review panel, see Deputy’s Advisory Working Group. The strings tap , taps , top , and tops stored in a Trie (left) and a DAWG (right), EOW stands for End of word. In computer science, a directed acyclic word graph …   Wikipedia

  • Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • DAWG — Directed Acyclic Word Graph …   Acronyms

  • DAWG — Directed Acyclic Word Graph …   Acronyms von A bis Z

  • Направленный ациклический граф — или ориентированный ациклический граф (англ. directed acyclic graph, сокращённо англ.  …   Википедия

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

  • Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

  • Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”