Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a directed acyclic word graph is 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. In these respects, a DAWG is very similar to a trie, but it is much more space efficient. A DAWG is represented as a directed acyclic graph with a single source vertex, in which each edge of the graph is labeled by a letter, symbol, or special end-of-string marker, and in which each vertex has at most one outgoing edge for each possible letter or symbol. The strings represented by the DAWG are formed by the symbols on paths in the DAWG from the source vertex to any sink vertex.

Под заказ:
	OZON.ru - 3735 руб.	Перейти

Рейтинг книги: 4 из 5, 7 голос(-ов).