Simple Word Trie
0
$begingroup$
The start of a simple scrabble solver
What I have so far:
- Add a word to the trie
- Return a sorted list with the all possible combinations, based on the letters input
- Some basic tests
Just wondering if my Trie seems correct before continuing
from queue import Queue
import unittest
class Node():
def __init__(self, char):
self.char = char
self.children = set()
self.finished = False
class Trie():
def __init__(self):
self.root = Node('')
self.char_score = {
'a' : 1, 'b' : 3, 'c' : 5, 'd' : 2, 'e' : 1, 'f' : 4,
'g' : 3, 'h' : 4, 'i' : 1, 'j' : 4, 'k' : 3, 'l' : 3,
'm' : 3, 'n' : 1, 'o' : 1, 'p' : 3, 'q' : 10, 'r' : 2,
's' : 2, 't' : 2, 'u' : 4, 'v' : 4, 'w' : 5, 'x' : 8,
'y' : 8, 'z' : 4
}
def add(self, word):
"""Adds a word to the trie"""
node = self.root
for char in word:
for child in node.children:
if child.char == char:
node = child
break
else:
new_node = Node(char)
node.children.add(new_node)
node = new_node
node.finished = True
def _get_possible_words(self, letters):
"""Generates all possible words that can be made in the trie"""
que = Queue()
que.put((self.root, self.root.char, letters))
while que.qsize() > 0:
node, word, letters_left = que.get()
for child in node.children:
if letters_left and child.char in letters_left:
new_word = word + child.char
new_bag = letters_left[:]
new_bag.remove(child.char)
que.put((child, new_word, new_bag))
if child.finished:
yield new_word
def get_best_words(self, letters):
"""Returns a sorted list based on the score"""
return sorted(
(w for w in self._get_possible_words(letters)),
key=lambda w: -sum(self.char_score[c] for c in w)
)
class TrieTest(unittest.TestCase):
def setUp(self):
self.trie = Trie()
self.words = ('tekst', 'test', 'tokens', 'tekens', 'tek', 'tekst')
for word in self.words:
self.trie.add(word)
def test_get_best(self):
self.assertEqual(
['tekst', 'test', 'tek'],
self.trie.get_best_words(['t', 'k', 'e', 's', 't'])
)
if __name__ == '__main__':
unittest.main()
python python-3.x trie
asked 37 mins ago
LudisposedLudisposed
7,46421959
$endgroup$
add a comment |
0
$begingroup$
The start of a simple scrabble solver
What I have so far:
- Add a word to the trie
- Return a sorted list with the all possible combinations, based on the letters input
- Some basic tests
Just wondering if my Trie seems correct before continuing
from queue import Queue
import unittest
class Node():
def __init__(self, char):
self.char = char
self.children = set()
self.finished = False
class Trie():
def __init__(self):
self.root = Node('')
self.char_score = {
'a' : 1, 'b' : 3, 'c' : 5, 'd' : 2, 'e' : 1, 'f' : 4,
'g' : 3, 'h' : 4, 'i' : 1, 'j' : 4, 'k' : 3, 'l' : 3,
'm' : 3, 'n' : 1, 'o' : 1, 'p' : 3, 'q' : 10, 'r' : 2,
's' : 2, 't' : 2, 'u' : 4, 'v' : 4, 'w' : 5, 'x' : 8,
'y' : 8, 'z' : 4
}
def add(self, word):
"""Adds a word to the trie"""
node = self.root
for char in word:
for child in node.children:
if child.char == char:
node = child
break
else:
new_node = Node(char)
node.children.add(new_node)
node = new_node
node.finished = True
def _get_possible_words(self, letters):
"""Generates all possible words that can be made in the trie"""
que = Queue()
que.put((self.root, self.root.char, letters))
while que.qsize() > 0:
node, word, letters_left = que.get()
for child in node.children:
if letters_left and child.char in letters_left:
new_word = word + child.char
new_bag = letters_left[:]
new_bag.remove(child.char)
que.put((child, new_word, new_bag))
if child.finished:
yield new_word
def get_best_words(self, letters):
"""Returns a sorted list based on the score"""
return sorted(
(w for w in self._get_possible_words(letters)),
key=lambda w: -sum(self.char_score[c] for c in w)
)
class TrieTest(unittest.TestCase):
def setUp(self):
self.trie = Trie()
self.words = ('tekst', 'test', 'tokens', 'tekens', 'tek', 'tekst')
for word in self.words:
self.trie.add(word)
def test_get_best(self):
self.assertEqual(
['tekst', 'test', 'tek'],
self.trie.get_best_words(['t', 'k', 'e', 's', 't'])
)
if __name__ == '__main__':
unittest.main()
python python-3.x trie
asked 37 mins ago
LudisposedLudisposed
7,46421959
$endgroup$
add a comment |
0
0
0
$begingroup$
The start of a simple scrabble solver
What I have so far:
- Add a word to the trie
- Return a sorted list with the all possible combinations, based on the letters input
- Some basic tests
Just wondering if my Trie seems correct before continuing
from queue import Queue
import unittest
class Node():
def __init__(self, char):
self.char = char
self.children = set()
self.finished = False
class Trie():
def __init__(self):
self.root = Node('')
self.char_score = {
'a' : 1, 'b' : 3, 'c' : 5, 'd' : 2, 'e' : 1, 'f' : 4,
'g' : 3, 'h' : 4, 'i' : 1, 'j' : 4, 'k' : 3, 'l' : 3,
'm' : 3, 'n' : 1, 'o' : 1, 'p' : 3, 'q' : 10, 'r' : 2,
's' : 2, 't' : 2, 'u' : 4, 'v' : 4, 'w' : 5, 'x' : 8,
'y' : 8, 'z' : 4
}
def add(self, word):
"""Adds a word to the trie"""
node = self.root
for char in word:
for child in node.children:
if child.char == char:
node = child
break
else:
new_node = Node(char)
node.children.add(new_node)
node = new_node
node.finished = True
def _get_possible_words(self, letters):
"""Generates all possible words that can be made in the trie"""
que = Queue()
que.put((self.root, self.root.char, letters))
while que.qsize() > 0:
node, word, letters_left = que.get()
for child in node.children:
if letters_left and child.char in letters_left:
new_word = word + child.char
new_bag = letters_left[:]
new_bag.remove(child.char)
que.put((child, new_word, new_bag))
if child.finished:
yield new_word
def get_best_words(self, letters):
"""Returns a sorted list based on the score"""
return sorted(
(w for w in self._get_possible_words(letters)),
key=lambda w: -sum(self.char_score[c] for c in w)
)
class TrieTest(unittest.TestCase):
def setUp(self):
self.trie = Trie()
self.words = ('tekst', 'test', 'tokens', 'tekens', 'tek', 'tekst')
for word in self.words:
self.trie.add(word)
def test_get_best(self):
self.assertEqual(
['tekst', 'test', 'tek'],
self.trie.get_best_words(['t', 'k', 'e', 's', 't'])
)
if __name__ == '__main__':
unittest.main()
python python-3.x trie
asked 37 mins ago
LudisposedLudisposed
7,46421959
$endgroup$
The start of a simple scrabble solver
What I have so far:
- Add a word to the trie
- Return a sorted list with the all possible combinations, based on the letters input
- Some basic tests
Just wondering if my Trie seems correct before continuing
from queue import Queue
import unittest
class Node():
def __init__(self, char):
self.char = char
self.children = set()
self.finished = False
class Trie():
def __init__(self):
self.root = Node('')
self.char_score = {
'a' : 1, 'b' : 3, 'c' : 5, 'd' : 2, 'e' : 1, 'f' : 4,
'g' : 3, 'h' : 4, 'i' : 1, 'j' : 4, 'k' : 3, 'l' : 3,
'm' : 3, 'n' : 1, 'o' : 1, 'p' : 3, 'q' : 10, 'r' : 2,
's' : 2, 't' : 2, 'u' : 4, 'v' : 4, 'w' : 5, 'x' : 8,
'y' : 8, 'z' : 4
}
def add(self, word):
"""Adds a word to the trie"""
node = self.root
for char in word:
for child in node.children:
if child.char == char:
node = child
break
else:
new_node = Node(char)
node.children.add(new_node)
node = new_node
node.finished = True
def _get_possible_words(self, letters):
"""Generates all possible words that can be made in the trie"""
que = Queue()
que.put((self.root, self.root.char, letters))
while que.qsize() > 0:
node, word, letters_left = que.get()
for child in node.children:
if letters_left and child.char in letters_left:
new_word = word + child.char
new_bag = letters_left[:]
new_bag.remove(child.char)
que.put((child, new_word, new_bag))
if child.finished:
yield new_word
def get_best_words(self, letters):
"""Returns a sorted list based on the score"""
return sorted(
(w for w in self._get_possible_words(letters)),
key=lambda w: -sum(self.char_score[c] for c in w)
)
class TrieTest(unittest.TestCase):
def setUp(self):
self.trie = Trie()
self.words = ('tekst', 'test', 'tokens', 'tekens', 'tek', 'tekst')
for word in self.words:
self.trie.add(word)
def test_get_best(self):
self.assertEqual(
['tekst', 'test', 'tek'],
self.trie.get_best_words(['t', 'k', 'e', 's', 't'])
)
if __name__ == '__main__':
unittest.main()
python python-3.x trie
python python-3.x trie
asked 37 mins ago
LudisposedLudisposed
7,46421959
asked 37 mins ago
LudisposedLudisposed
7,46421959
asked 37 mins ago
LudisposedLudisposed
7,46421959
asked 37 mins ago
LudisposedLudisposed
7,46421959
asked 37 mins ago
LudisposedLudisposed
7,46421959
7,46421959
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f212003%2fsimple-word-trie%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f212003%2fsimple-word-trie%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
