def test_LCAFastV(self):
g = hg.get_4_adjacency_graph((2, 2))
t = hg.Tree((4, 4, 5, 5, 6, 6, 6))
lca = hg.LCAFast(t)
ref = (4, 6, 6, 5)
res = lca.lca(g)
self.assertTrue(np.all(ref == res))
def make_lca_fast(tree):
"""
Create an object of type :class:`~higra.LCAFast` for the given tree
:param tree: input tree
:return: a LCAFast object
"""
return hg.LCAFast(tree)
def test_pickle(self):
import pickle
tree = hg.Tree((4, 4, 5, 5, 6, 6, 6))
lca = hg.LCAFast(tree)
hg.set_attribute(lca, "test", (1, 2, 3))
hg.add_tag(lca, "foo")
data = pickle.dumps(lca)
lca2 = pickle.loads(data)
res = lca2.lca((0, 0, 1, 3), (0, 3, 0, 0))
self.assertTrue(np.all(res == (0, 6, 4, 6)))
self.assertTrue(
hg.get_attribute(lca, "test") == hg.get_attribute(lca2, "test"))
self.assertTrue(lca.test == lca2.test)
self.assertTrue(hg.has_tag(lca2, "foo"))
def test_LCAFast(self):
t = TestLCAFast.getTree()
lca = hg.LCAFast(t)
self.assertTrue(lca.lca(0, 0) == 0)
self.assertTrue(lca.lca(3, 3) == 3)
self.assertTrue(lca.lca(5, 5) == 5)
self.assertTrue(lca.lca(7, 7) == 7)
self.assertTrue(lca.lca(0, 1) == 5)
self.assertTrue(lca.lca(1, 0) == 5)
self.assertTrue(lca.lca(2, 3) == 6)
self.assertTrue(lca.lca(2, 4) == 6)
self.assertTrue(lca.lca(3, 4) == 6)
self.assertTrue(lca.lca(5, 6) == 7)
self.assertTrue(lca.lca(0, 2) == 7)
self.assertTrue(lca.lca(1, 4) == 7)
self.assertTrue(lca.lca(2, 6) == 6)
def __lowest_common_ancestor_preprocess(self):
"""
Preprocess the tree to obtain a fast constant time :math:`\\mathcal{O}(1)` lowest common ancestor query.
Once this function has been called on a given tree instance, every following calls to the function
:func:`~higra.Tree.lowest_common_ancestor` will use this preprocessing.
:Complexity:
The preprocessing runs in linearithmic time :math:`\\mathcal{O}(n\log(n))` with :math:`n` the number of vertices in the tree.
:return: An object of type :class:`~higra.LCAFast`
"""
lca_fast = hg.get_attribute(self, "lca_fast")
if lca_fast is None:
lca_fast = hg.LCAFast(self)
hg.set_attribute(self, "lca_fast", lca_fast)
return lca_fast
def test_dynamic_attributes(self):
t = hg.Tree((4, 4, 5, 5, 6, 6, 6))
lca = hg.LCAFast(t)
lca.new_attribute = 42
self.assertTrue(lca.new_attribute == 42)
def test_LCAFastVertices(self):
t = hg.Tree((4, 4, 5, 5, 6, 6, 6))
lca = hg.LCAFast(t)
res = lca.lca((0, 0, 1, 3), (0, 3, 0, 0))
self.assertTrue(np.all(res == (0, 6, 4, 6)))