def test_merge_subdag(self):
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
node4 = Node("four", 5)
node1_ = Node("one", 2)
node2_ = Node("two", 3)
node3_ = Node("three_", 44)
node4_ = Node("four_", 55)
graph = DAG([node1], [node2])
graph.add(node3_)
_graph = DAG([node1], [node2])
_graph.add(node3_)
graph.add_multiple([node3, node4])
for i in range(1, 100):
j = i + 20
n1 = Node(str(i), i)
n2 = Node(str(j), j)
graph.add_multiple([n1, n2])
graph.draw_graph("1.png")
_graph.draw_graph("2.png")
start = time.time()
self.assertTrue(graph.is_sub_dag(node3_.hash))
end = time.time()
print(end - start)
start = time.time()
self.assertTrue(graph.augmented_is_sub_dag(node3_.hash, _graph.height))
end = time.time()
print(end - start)
def test_find_hash(self):
node1 = Node("one", 1)
node2 = Node("two", 2)
graph = DAG([node1], [node2])
x = hash(node2.payload + node1.hash)
self.assertEqual(graph.get_node(x), node2)
x = hash(node1.payload)
self.assertEqual(graph.get_node(x), node1)
def test_multiple_roots(self):
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
node4 = Node("four", 5)
graph = DAG([node1], [node2])
graph.add_multiple([node3, node4])
self.assertEqual(graph.root, [node3, node4])
def test_multi_level_dag(self):
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
graph = DAG([node1], [node2])
graph.add(node3)
self.assertEqual(len(graph.root), 1)
self.assertEqual(graph.root[0].id, "three")
def test_find_node_large_dag(self):
node1 = Node("one", 1)
node2 = Node("two", 2)
graph = DAG([node1], [node2])
temp1 = None
temp2 = None
for i in range(1, 15):
j = i + 20
n1 = Node(str(i), i)
n2 = Node(str(j), j)
graph.add_multiple([n1, n2])
if i == 13:
temp1 = n1.hash
temp2 = n1
self.assertEqual(graph.get_node(100), None)
self.assertEqual(graph.get_node(temp1), temp2)
def test_merge(self):
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
node4 = Node("four", 5)
node1_ = Node("one_", 22)
node2_ = Node("two_", 33)
node3_ = Node("three_", 44)
node4_ = Node("four_", 55)
graph = DAG([node1], [node2])
_graph = DAG([node3], [node4])
graph.add_multiple([node1_, node2_])
_graph.add_multiple([node3_, node4_])
new_graph = graph.merge(_graph)
new_graph.draw_graph("test.png")
self.assertEqual(new_graph.height, 3)
def draw_branch(self, base, parent):
for r in base:
#node = pydot.Node(r.id,style ="filled",fillcolor="yellow")
self.nodes.add(r.hash)
print("Node " + str(r.id) + " added")
#self.image.add_node(node)
self.edges.add((parent, r.hash))
# edge = pydot.Edge(parent,r.id)
# self.image.add_edge(edge)
if r.node.is_leaf():
continue
for a in r.node.links:
print(r.id + "....")
print(a.id)
new_roots = r.node.links
self.draw_branch(new_roots, r.hash)
if __name__ == '__main__':
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
node4 = Node("four", 5)
graph = DAG([node1], [node2])
graph.add_multiple([node3, node4], [node1.hash])
print("graph completed, now drawing")
view = graph_drawer(graph)
view.draw()
def test_missing_node(self):
node1 = Node("one", 1)
node2 = Node("two", 2)
graph = DAG([node1], [node2])
self.assertEqual(graph.get_node(100), None)
def test_only_construct_from_leaf(self):
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
graph = DAG([node1], [node2])
self.assertRaises(Exception, DAG, [node2], [node3])
def test_dag_constructor(self):
node1 = Node("one", 2)
node2 = Node("two", 3)
node3 = Node("three", 4)
node4 = Node("parent", 5)
graph = DAG([node1, node2, node3], [node4])
self.assertFalse(node4.is_leaf())
self.assertTrue(node2.is_leaf())
self.assertTrue(node3.is_leaf())
self.assertTrue(node1.is_leaf())
self.assertEqual(graph.root, [node4])
self.assertEqual(graph.root[0].id, "parent")
x = hash(node4.payload + node1.hash + node2.hash + node3.hash)
self.assertEqual(graph.root[0].hash, x)
def test_node_constructor(self):
node = Node("test", 2)
self.assertEqual(node.children, [None])
self.assertEqual(node.hash, hash(2))
self.assertEqual(node.id, "test")
self.assertTrue(node.is_leaf())