Anatree
An anatree is a data structure designed to solve anagrams. Solving an anagram is the problem of finding a word from a given list of letters. These problems are commonly encountered in word games like Scrabble or in newspaper crossword puzzles. The problem for the wordwheel also has the condition that the central letter appear in all the words framed with the given set. Some other conditions may be introduced regarding the frequency (number of appearances) of each of the letters in the given input string. These problems are classified as Constraint satisfaction problem in computer science literature.
Link from a Wikipage to another Wikipage
primaryTopic
Anatree
An anatree is a data structure designed to solve anagrams. Solving an anagram is the problem of finding a word from a given list of letters. These problems are commonly encountered in word games like Scrabble or in newspaper crossword puzzles. The problem for the wordwheel also has the condition that the central letter appear in all the words framed with the given set. Some other conditions may be introduced regarding the frequency (number of appearances) of each of the letters in the given input string. These problems are classified as Constraint satisfaction problem in computer science literature.
has abstract
An anatree is a data structure ...... words are of the same length.
@en
Link from a Wikipage to an external page
Wikipage page ID
39,065,734
page length (characters) of wiki page
Wikipage revision ID
973,745,453
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
An anatree is a data structure ...... n computer science literature.
@en
label
Anatree
@en