def setUp(self):
self.tree = TopicTree()
self.tree.add_nodes_from(['a', 'b', 'cc', 'c', 'd', 'e', 'f',
'g', 'h', 'ii', 'i', 'j', 'k'])
self.tree.add_path(['a', 'b', 'e', 'f', 'g'])
self.tree.add_path(['a', 'cc', 'c', 'h'])
self.tree.add_path(['a', 'cc', 'ii', 'i'])
self.tree.add_path(['a', 'd', 'j'])
self.tree.add_path(['a', 'd', 'k'])
self.tree.node['g']['is_leaf'] = True
self.tree.node['h']['is_leaf'] = True
self.tree.node['i']['is_leaf'] = True
self.tree.node['j']['is_leaf'] = True
self.tree.node['k']['is_leaf'] = True
def get_topic_tree(self, hypernyms):
"""Generates and returns a `bacalhau.topic_tree.TopicTree` for
the given hypernyms.
:param hypernyms: dictionary of hypernyms.
:type hypernyms: `dict`
:rtype: `bacalhau.topic_tree.TopicTree`
"""
tree = TopicTree()
for text, data in hypernyms.iteritems():
for term, hypernym in data.iteritems():
tree.add_nodes_from(hypernym)
tree.node[hypernym[len(hypernym) - 1]]["is_leaf"] = True
tree.node[hypernym[0]]["is_root"] = True
tree.add_path(hypernym)
return tree
class TestTopicTree(unittest.TestCase):
def setUp(self):
self.tree = TopicTree()
self.tree.add_nodes_from(['a', 'b', 'cc', 'c', 'd', 'e', 'f',
'g', 'h', 'ii', 'i', 'j', 'k'])
self.tree.add_path(['a', 'b', 'e', 'f', 'g'])
self.tree.add_path(['a', 'cc', 'c', 'h'])
self.tree.add_path(['a', 'cc', 'ii', 'i'])
self.tree.add_path(['a', 'd', 'j'])
self.tree.add_path(['a', 'd', 'k'])
self.tree.node['g']['is_leaf'] = True
self.tree.node['h']['is_leaf'] = True
self.tree.node['i']['is_leaf'] = True
self.tree.node['j']['is_leaf'] = True
self.tree.node['k']['is_leaf'] = True
def test_compress(self):
number_of_nodes = self.tree.number_of_nodes()
self.tree.compress()
compressed_number_of_nodes = self.tree.number_of_nodes()
self.assertLess(compressed_number_of_nodes, number_of_nodes)
def test__eliminate_parents(self):
number_of_nodes = self.tree.number_of_nodes()
self.tree._eliminate_parents('g', min_children=1)
n = self.tree.number_of_nodes()
self.assertEqual(n, number_of_nodes)
self.tree._eliminate_parents('g', min_children=2)
n = self.tree.number_of_nodes()
self.assertLess(n, number_of_nodes)
def test__eliminate_child_with_parent_name(self):
number_of_nodes = self.tree.number_of_nodes()
self.tree._eliminate_child_with_parent_name('c')
n = self.tree.number_of_nodes()
self.assertLess(n, number_of_nodes)
self.assertFalse(self.tree.has_node('c'))
def test_prune(self):
number_of_nodes = self.tree.number_of_nodes()
self.tree.prune(['a'])
pruned_number_of_nodes = self.tree.number_of_nodes()
self.assertLess(pruned_number_of_nodes, number_of_nodes)
self.assertFalse(self.tree.has_node('a'))
def test_render(self):
filename = 'test.svg'
self.addCleanup(os.remove, filename)
self.tree.render(filename)
try:
open(filename, 'r')
except IOError:
self.fail()
def test_to_json(self):
filename = 'test.js'
self.addCleanup(os.remove, filename)
self.tree.to_json(filename)
try:
open(filename, 'r')
except IOError:
self.fail()
