def test_triangle_1(self):
h = Hierarchy()
g1 = nx.DiGraph()
g1.add_nodes_from(["1", "2"])
g2 = nx.DiGraph()
g2.add_nodes_from(["1a", "1b", "2a", "2b"])
g3 = nx.DiGraph()
g3.add_nodes_from(["1x", "1y", "2x", "2y"])
h.add_graph("g1", g1)
h.add_graph("g2", g2)
h.add_graph("g3", g3)
h.add_typing("g2", "g1", {"1a": "1", "1b": "1", "2a": "2", "2b": "2"})
h.add_typing("g3", "g1", {"1x": "1", "1y": "1", "2x": "2", "2y": "2"})
h.add_typing("g2", "g3", {
"1a": "1x",
"1b": "1y",
"2a": "2y",
"2b": "2x"
})
pattern = nx.DiGraph()
pattern.add_nodes_from([1, 2])
rule = Rule.from_transform(pattern)
rule.inject_remove_node(1)
rule.inject_clone_node(2)
instances = h.find_matching("g1", pattern)
new_h, _ = h.rewrite("g1", rule, instances[0], inplace=False)
def test_triangle_1(self):
h = Hierarchy()
g1 = nx.DiGraph()
g1.add_nodes_from([
"1", "2"
])
g2 = nx.DiGraph()
g2.add_nodes_from([
"1a", "1b", "2a", "2b"
])
g3 = nx.DiGraph()
g3.add_nodes_from([
"1x", "1y", "2x", "2y"
])
h.add_graph("g1", g1)
h.add_graph("g2", g2)
h.add_graph("g3", g3)
h.add_typing(
"g2", "g1",
{
"1a": "1",
"1b": "1",
"2a": "2",
"2b": "2"
},
total=True
)
h.add_typing(
"g3", "g1",
{
"1x": "1",
"1y": "1",
"2x": "2",
"2y": "2"
},
total=True
)
h.add_typing(
"g2", "g3",
{
"1a": "1x",
"1b": "1y",
"2a": "2y",
"2b": "2x"
},
total=True
)
pattern = nx.DiGraph()
pattern.add_nodes_from([
1, 2
])
rule = Rule.from_transform(pattern)
rule.remove_node(1)
rule.clone_node(2)
instances = h.find_matching("g1", pattern)
new_h, _ = h.rewrite("g1", rule, instances[0], inplace=False)
class TestHierarchy(object):
def __init__(self):
self.hierarchy = Hierarchy(directed=True)
g0 = nx.DiGraph()
prim.add_node(g0, "circle", {"a": {1, 2, 3}})
prim.add_node(g0, "square", {"a": {1, 2, 3, 5}})
prim.add_node(g0, "triangle", {"new_attrs": {1}})
prim.add_edges_from(
g0,
[
("circle", "circle"), # , {"b": {1, 2, 3, 4}}),
("circle", "square"),
("square", "circle", {
"new_attrs": {2}
}),
("square", "triangle", {
"new_attrs": {3, 4}
})
])
self.hierarchy.add_graph("g0", g0, {"name": "Shapes"})
g00 = nx.DiGraph()
prim.add_node(g00, 'black', {"a": {1, 2, 3}, "new_attrs": {1}})
prim.add_node(g00, 'white', {"a": {1, 2, 3, 5}})
prim.add_edges_from(g00, [('white', 'white', {
"new_attrs": 2
}), ('white', 'black', {
"new_attrs": {4, 3}
}), ('black', 'black'), ('black', 'white')])
self.hierarchy.add_graph("g00", g00, {"name": "Colors"})
g1 = nx.DiGraph()
prim.add_nodes_from(g1, [("black_circle", {
"a": {1, 2, 3}
}), "white_circle", "black_square", ("white_square", {
"a": {1, 2}
}), "black_triangle", "white_triangle"])
prim.add_edges_from(
g1,
[
("black_circle", "black_circle"), # {"b": {1, 2, 3, 4}}),
("black_circle", "white_circle"),
("black_circle", "black_square"),
("white_circle", "black_circle"),
("white_circle", "white_square"),
("black_square", "black_circle"),
("black_square", "black_triangle"),
("black_square", "white_triangle"),
("white_square", "white_circle"),
("white_square", "black_triangle"),
("white_square", "white_triangle")
])
self.hierarchy.add_graph("g1", g1)
self.hierarchy.add_typing(
"g1", "g0", {
"black_circle": "circle",
"white_circle": "circle",
"black_square": "square",
"white_square": "square",
"black_triangle": "triangle",
"white_triangle": "triangle"
})
self.hierarchy.add_typing(
"g1", "g00", {
"black_square": "black",
"black_circle": "black",
"black_triangle": "black",
"white_square": "white",
"white_circle": "white",
"white_triangle": "white"
})
g2 = nx.DiGraph()
prim.add_nodes_from(g2, [
(1, {
"a": {1, 2}
}),
2,
3,
4,
(5, {
"a": {1}
}),
6,
7,
])
prim.add_edges_from(
g2,
[
(1, 2), # {"b": {1, 2, 3}}),
(2, 3),
(3, 6),
(3, 7),
(4, 2),
(4, 5),
(5, 7)
])
self.hierarchy.add_graph("g2", g2)
self.hierarchy.add_typing(
"g2", "g1", {
1: "black_circle",
2: "black_circle",
3: "black_square",
4: "white_circle",
5: "white_square",
6: "white_triangle",
7: "black_triangle"
})
g3 = nx.DiGraph()
prim.add_nodes_from(
g3,
[
(1), # {"a": {1, 2}}),
2,
3,
5,
(4), # {"a": {1}}),
6,
7,
])
prim.add_edges_from(
g3,
[
(1, 1), # , {"b": {1, 2, 3}}),
(1, 2),
(1, 3),
(1, 5),
(2, 1),
(3, 4),
(4, 7),
(4, 6),
(5, 6),
(5, 7)
])
self.hierarchy.add_graph("g3", g3)
self.hierarchy.add_typing(
"g3", "g1", {
1: "black_circle",
2: "white_circle",
3: "white_circle",
5: "black_square",
4: "white_square",
6: "white_triangle",
7: "black_triangle"
})
g4 = nx.DiGraph()
prim.add_nodes_from(g4, [1, 2, 3])
prim.add_edges_from(g4, [(1, 2), (2, 3)])
self.hierarchy.add_graph("g4", g4)
self.hierarchy.add_typing("g4", "g2", {1: 2, 2: 3, 3: 6})
self.hierarchy.add_typing("g4", "g3", {1: 1, 2: 5, 3: 6})
g5 = nx.DiGraph()
prim.add_nodes_from(
g5,
[
("black_circle"), # {"a": {255}}),
("black_square"), # {"a": {256}}),
("white_triangle"), # {"a": {257}}),
("star") # , {"a": {258}})
])
prim.add_edges_from(
g5,
[
("black_circle", "black_square"),
("black_square", "white_triangle"), # , {"b": {11}}),
("star", "black_square"),
("star", "white_triangle")
])
self.hierarchy.add_graph("g5", g5)
def test_add_graph(self):
# add nice assertions here!
return
@raises(HierarchyError)
def test_add_typing_cycle(self):
self.hierarchy.add_typing(
"g0", "g1", {
"circle": "black_circle",
"square": "white_square",
"triangle": "black_triangle"
})
def test_remove_graph(self):
h = copy.deepcopy(self.hierarchy)
h.remove_node("g1", reconnect=True)
# print(h)
# print(self.hierarchy)
def test_find_matching(self):
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [1, (2, {"a": 1}), 3])
prim.add_edges_from(pattern, [(1, 2), (2, 3)])
pattern_typing = {1: "circle", 2: "square", 3: "triangle"}
instances = self.hierarchy.find_matching(graph_id="g1",
pattern=pattern,
pattern_typing={
"g0": pattern_typing,
"g00": {
1: "white",
2: "white",
3: "black"
}
})
assert (len(instances) == 1)
def test_rewrite(self):
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [1, (2, {"a": {1, 2}}), 3])
prim.add_edges_from(pattern, [(1, 2), (2, 3)])
lhs_typing = {
"g0": {
1: "circle",
2: "square",
3: "triangle"
},
"g00": {
1: "white",
2: "white",
3: "black"
}
}
p = nx.DiGraph()
p.add_nodes_from([1, 2, 3])
p.add_edges_from([(2, 3)])
rhs = nx.DiGraph()
prim.add_nodes_from(
rhs, [1, (2, {
"a": {3, 5}
}), (3, {
"new_attrs": {1}
}), 4])
prim.add_edges_from(rhs, [(2, 1, {
"new_attrs": {2}
}), (2, 4, {
"new_attrs": {3}
}), (2, 3, {
"new_attrs": {4}
})])
p_lhs = {1: 1, 2: 2, 3: 3}
p_rhs = {1: 1, 2: 2, 3: 3}
rule = Rule(p, pattern, rhs, p_lhs, p_rhs)
rhs_typing = {
"g0": {
1: "circle",
2: "square",
3: "triangle",
4: "triangle"
},
"g00": {
1: "white",
2: "white",
3: "black",
4: "black"
}
}
instances = self.hierarchy.find_matching("g1", pattern, lhs_typing)
# print(instances[0])
self.hierarchy.rewrite("g1", rule, instances[0], lhs_typing,
rhs_typing)
# add nice assertions here
def test_node_type(self):
# print(self.hierarchy.node_type("g1", "white_circle"))
assert (self.hierarchy.node_type("g1", "white_circle") == {
"g00": "white",
"g0": "circle"
})
# print(self.hierarchy.node_type("g1", "black_square"))
assert (self.hierarchy.node_type("g1", "black_square") == {
"g00": "black",
"g0": "square"
})
# def test_add_partial_typing(self):
# self.hierarchy.add_typing(
# "g5",
# "g1",
# {"black_circle": "black_circle",
# "black_square": "black_square",
# "white_triangle": "white_triangle"})
# return
def test_rewrite_ignore_attrs(self):
pass
def test_to_json(self):
res = self.hierarchy.to_json()
new_h = Hierarchy.from_json(res)
assert (self.hierarchy == new_h)
def test_add_rule(self):
lhs = nx.DiGraph()
prim.add_nodes_from(lhs, [1, 2, 3])
prim.add_edges_from(lhs, [(1, 2), (2, 1), (2, 3)])
p = nx.DiGraph()
prim.add_nodes_from(p, [1, 2, 3, 31])
prim.add_edges_from(p, [(1, 2), (2, 3), (2, 31)])
rhs = nx.DiGraph()
prim.add_nodes_from(rhs, [1, 2, 3, 31, 4])
prim.add_edges_from(rhs, [(1, 2), (4, 2), (2, 3), (2, 31)])
p_lhs = {1: 1, 2: 2, 3: 3, 31: 3}
p_rhs = {1: 1, 2: 2, 3: 3, 31: 3}
rule = Rule(p, lhs, rhs, p_lhs, p_rhs)
lhs_typing = {1: "black_circle", 2: "white_circle", 3: "white_square"}
rhs_typing = {
1: "black_circle",
2: "white_circle",
3: "white_square",
31: "white_square",
4: "black_circle"
}
self.hierarchy.add_rule("r1", rule, {"name": "First rule"})
self.hierarchy.add_rule_typing("r1", "g1", lhs_typing, rhs_typing)
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [1, (2, {"a": {1, 2}}), 3])
prim.add_edges_from(pattern, [(1, 2), (2, 3)])
lhs_typing = {
"g0": {
1: "circle",
2: "square",
3: "triangle"
},
"g00": {
1: 'white',
2: 'white',
3: 'black'
}
}
p = nx.DiGraph()
prim.add_nodes_from(p, [1, 11, 2, 3])
prim.add_edges_from(p, [(2, 3)])
rhs = nx.DiGraph()
prim.add_nodes_from(rhs, [
1,
11,
(2, {
"a": {3, 5}
}),
(3, {
"new_attrs": {1}
}),
])
prim.add_edges_from(rhs, [(2, 3, {"new_attrs": {4}})])
p_lhs = {1: 1, 11: 1, 2: 2, 3: 3}
p_rhs = {1: 1, 11: 11, 2: 2, 3: 3}
rule = Rule(p, pattern, rhs, p_lhs, p_rhs)
rhs_typing = {
"g0": {
1: "circle",
11: "circle",
2: "square",
3: "triangle"
},
"g00": {
1: "white",
11: "white",
2: "white",
3: "black"
}
}
instances = self.hierarchy.find_matching("g1", pattern, lhs_typing)
self.hierarchy.rewrite("g1", rule, instances[0], lhs_typing,
rhs_typing)
def test_add_rule_multiple_typing(self):
lhs = nx.DiGraph()
prim.add_nodes_from(lhs, [1, 2, 3, 4])
prim.add_edges_from(lhs, [(1, 3), (2, 3), (4, 3)])
p = nx.DiGraph()
prim.add_nodes_from(p, [1, 3, 31, 4])
prim.add_edges_from(p, [(1, 3), (1, 31), (4, 3), (4, 31)])
rhs = copy.deepcopy(p)
p_lhs = {1: 1, 3: 3, 31: 3, 4: 4}
p_rhs = {1: 1, 3: 3, 31: 31, 4: 4}
lhs_typing_g2 = {1: 1, 2: 1, 3: 2, 4: 4}
rhs_typing_g2 = {1: 1, 3: 2, 31: 2, 4: 4}
lhs_typing_g3 = {1: 1, 2: 1, 3: 1, 4: 2}
rhs_typing_g3 = {1: 1, 3: 1, 31: 1, 4: 2}
rule = Rule(p, lhs, rhs, p_lhs, p_rhs)
self.hierarchy.add_rule("r2", rule,
{"name": "Second rule: with multiple typing"})
self.hierarchy.add_rule_typing("r2", "g2", lhs_typing_g2,
rhs_typing_g2)
self.hierarchy.add_rule_typing("r2", "g3", lhs_typing_g3,
rhs_typing_g3)
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [1, 2])
prim.add_edges_from(pattern, [(2, 1)])
lhs_typing = {
"g0": {
1: "circle",
2: "circle"
},
"g00": {
1: "black",
2: "white"
}
}
p = nx.DiGraph()
prim.add_nodes_from(p, [1, 2, 21])
prim.add_edges_from(p, [(21, 1)])
rhs = copy.deepcopy(p)
p_lhs = {1: 1, 2: 2, 21: 2}
p_rhs = {1: 1, 2: 2, 21: 21}
rule = Rule(p, pattern, rhs, p_lhs, p_rhs)
rhs_typing = {
"g0": ({
1: "circle",
2: "circle",
21: "circle",
}),
"g00": ({
1: "black",
2: "white",
21: "white"
})
}
instances = self.hierarchy.find_matching("g1", pattern, lhs_typing)
self.hierarchy.rewrite("g1", rule, instances[0], lhs_typing,
rhs_typing)
def test_get_ancestors(self):
anc = self.hierarchy.get_ancestors("g2")
assert ("g1" in anc.keys())
assert ("g0" in anc.keys())
assert ("g00" in anc.keys())
@raises(HierarchyError)
def test_add_typing_advanced(self):
hierarchy = Hierarchy()
g9 = nx.DiGraph()
g9.add_nodes_from(["a", "b"])
hierarchy.add_graph(9, g9)
g8 = nx.DiGraph()
g8.add_nodes_from(["1_a", "1_b", "2_a", "2_b"])
hierarchy.add_graph(8, g8)
hierarchy.add_typing(
8,
9,
{
"1_a": "a",
"1_b": "b",
"2_a": "a",
"2_b": "b"
},
)
g7 = nx.DiGraph()
g7.add_nodes_from(["x_a", "x_b", "y_a", "y_b"])
hierarchy.add_graph(7, g7)
hierarchy.add_typing(
7,
9,
{
"x_a": "a",
"x_b": "b",
"y_a": "a",
"y_b": "b"
},
)
g2 = nx.DiGraph()
g2.add_nodes_from(["s_1_a", "t_1_a", "s_1_b", "t_2_a"])
hierarchy.add_graph(2, g2)
hierarchy.add_typing(2, 8, {
"s_1_a": "1_a",
"t_1_a": "1_a",
"s_1_b": "1_b",
"t_2_a": "2_a"
})
g3 = nx.DiGraph()
g3.add_nodes_from(["s_x_a", "t_x_a", "g_y_b"])
hierarchy.add_graph(3, g3)
hierarchy.add_typing(3, 7, {
"s_x_a": "x_a",
"t_x_a": "x_a",
"g_y_b": "y_b"
})
g4 = nx.DiGraph()
g4.add_nodes_from(["a_x_a", "t_y_b"])
hierarchy.add_graph(4, g4)
hierarchy.add_typing(4, 3, {"a_x_a": "s_x_a", "t_y_b": "g_y_b"})
hierarchy.add_typing(4, 7, {"a_x_a": "x_a", "t_y_b": "y_b"})
g6 = nx.DiGraph()
g6.add_nodes_from(["a_x_a", "b_x_a", "a_y_b", "b_y_a", "c_x_b"])
hierarchy.add_graph(6, g6)
hierarchy.add_typing(
6, 7, {
"a_x_a": "x_a",
"b_x_a": "x_a",
"a_y_b": "y_b",
"b_y_a": "y_a",
"c_x_b": "x_b"
})
g5 = nx.DiGraph()
g5.add_nodes_from(["1_a_x_a", "2_a_x_a", "1_a_y_b"])
hierarchy.add_graph(5, g5)
hierarchy.add_typing(5, 6, {
"1_a_x_a": "a_x_a",
"2_a_x_a": "a_x_a",
"1_a_y_b": "a_y_b"
})
hierarchy.add_typing(5, 4, {
"1_a_x_a": "a_x_a",
"2_a_x_a": "a_x_a",
"1_a_y_b": "t_y_b"
})
g1 = nx.DiGraph()
g1.add_nodes_from(["1_s_1_a", "2_s_1_a", "1_s_1_b"])
hierarchy.add_graph(1, g1)
hierarchy.add_typing(1, 2, {
"1_s_1_a": "s_1_a",
"2_s_1_a": "s_1_a",
"1_s_1_b": "s_1_b"
})
hierarchy.add_typing(1, 3, {
"1_s_1_a": "s_x_a",
"2_s_1_a": "t_x_a",
"1_s_1_b": "g_y_b"
})
# start testing
hierarchy.add_typing(3, 8, {
"s_x_a": "1_a",
"t_x_a": "1_a",
"g_y_b": "1_b"
})
hierarchy.add_typing(6, 9, {
"a_x_a": "a",
"b_x_a": "b",
"a_y_b": "b",
"b_y_a": "a",
"c_x_b": "b"
})
def test_triangle_1(self):
h = Hierarchy()
g1 = nx.DiGraph()
g1.add_nodes_from(["1", "2"])
g2 = nx.DiGraph()
g2.add_nodes_from(["1a", "1b", "2a", "2b"])
g3 = nx.DiGraph()
g3.add_nodes_from(["1x", "1y", "2x", "2y"])
h.add_graph("g1", g1)
h.add_graph("g2", g2)
h.add_graph("g3", g3)
h.add_typing("g2", "g1", {"1a": "1", "1b": "1", "2a": "2", "2b": "2"})
h.add_typing("g3", "g1", {"1x": "1", "1y": "1", "2x": "2", "2y": "2"})
h.add_typing("g2", "g3", {
"1a": "1x",
"1b": "1y",
"2a": "2y",
"2b": "2x"
})
pattern = nx.DiGraph()
pattern.add_nodes_from([1, 2])
rule = Rule.from_transform(pattern)
rule.inject_remove_node(1)
rule.inject_clone_node(2)
instances = h.find_matching("g1", pattern)
new_h, _ = h.rewrite("g1", rule, instances[0], inplace=False)
class TestHierarchy(object):
def __init__(self):
self.hierarchy = Hierarchy(directed=True)
g0 = nx.DiGraph()
prim.add_node(g0, "circle", {"a": {1, 2, 3}})
prim.add_node(g0, "square", {"a": {1, 2, 3, 5}})
prim.add_node(g0, "triangle", {"new_attrs": {1}})
prim.add_edges_from(g0, [
("circle", "circle"), # , {"b": {1, 2, 3, 4}}),
("circle", "square"),
("square", "circle", {"new_attrs": {2}}),
("square", "triangle", {"new_attrs": {3, 4}})
])
self.hierarchy.add_graph("g0", g0, {"name": "Shapes"})
g00 = nx.DiGraph()
prim.add_node(g00, 'black', {"a": {1, 2, 3}, "new_attrs": {1}})
prim.add_node(g00, 'white', {"a": {1, 2, 3, 5}})
prim.add_edges_from(g00, [
('white', 'white', {"new_attrs": 2}),
('white', 'black', {"new_attrs": {4, 3}}),
('black', 'black'),
('black', 'white')
])
self.hierarchy.add_graph("g00", g00, {"name": "Colors"})
g1 = nx.DiGraph()
prim.add_nodes_from(g1, [
("black_circle", {"a": {1, 2, 3}}),
"white_circle",
"black_square",
("white_square", {"a": {1, 2}}),
"black_triangle",
"white_triangle"
])
prim.add_edges_from(g1, [
("black_circle", "black_circle"), # {"b": {1, 2, 3, 4}}),
("black_circle", "white_circle"),
("black_circle", "black_square"),
("white_circle", "black_circle"),
("white_circle", "white_square"),
("black_square", "black_circle"),
("black_square", "black_triangle"),
("black_square", "white_triangle"),
("white_square", "white_circle"),
("white_square", "black_triangle"),
("white_square", "white_triangle")
])
self.hierarchy.add_graph("g1", g1)
self.hierarchy.add_typing(
"g1", "g0",
{"black_circle": "circle",
"white_circle": "circle",
"black_square": "square",
"white_square": "square",
"black_triangle": "triangle",
"white_triangle": "triangle"},
total=True
)
self.hierarchy.add_typing(
"g1", "g00",
{
"black_square": "black",
"black_circle": "black",
"black_triangle": "black",
"white_square": "white",
"white_circle": "white",
"white_triangle": "white"
},
total=True
)
g2 = nx.DiGraph()
prim.add_nodes_from(g2, [
(1, {"a": {1, 2}}),
2,
3,
4,
(5, {"a": {1}}),
6,
7,
])
prim.add_edges_from(g2, [
(1, 2), # {"b": {1, 2, 3}}),
(2, 3),
(3, 6),
(3, 7),
(4, 2),
(4, 5),
(5, 7)
])
self.hierarchy.add_graph("g2", g2)
self.hierarchy.add_typing(
"g2", "g1",
{1: "black_circle",
2: "black_circle",
3: "black_square",
4: "white_circle",
5: "white_square",
6: "white_triangle",
7: "black_triangle"},
total=True
)
g3 = nx.DiGraph()
prim.add_nodes_from(g3, [
(1), # {"a": {1, 2}}),
2,
3,
5,
(4), # {"a": {1}}),
6,
7,
])
prim.add_edges_from(g3, [
(1, 1), # , {"b": {1, 2, 3}}),
(1, 2),
(1, 3),
(1, 5),
(2, 1),
(3, 4),
(4, 7),
(4, 6),
(5, 6),
(5, 7)
])
self.hierarchy.add_graph("g3", g3)
self.hierarchy.add_typing(
"g3", "g1",
{1: "black_circle",
2: "white_circle",
3: "white_circle",
5: "black_square",
4: "white_square",
6: "white_triangle",
7: "black_triangle"},
total=True
)
g4 = nx.DiGraph()
prim.add_nodes_from(g4, [1, 2, 3])
prim.add_edges_from(g4, [
(1, 2),
(2, 3)
])
self.hierarchy.add_graph("g4", g4)
self.hierarchy.add_typing("g4", "g2", {1: 2, 2: 3, 3: 6}, total=True)
self.hierarchy.add_typing("g4", "g3", {1: 1, 2: 5, 3: 6}, total=True)
g5 = nx.DiGraph()
prim.add_nodes_from(g5, [
("black_circle"), # {"a": {255}}),
("black_square"), # {"a": {256}}),
("white_triangle"), # {"a": {257}}),
("star") # , {"a": {258}})
])
prim.add_edges_from(g5, [
("black_circle", "black_square"),
("black_square", "white_triangle"), # , {"b": {11}}),
("star", "black_square"),
("star", "white_triangle")
])
self.hierarchy.add_graph("g5", g5)
def test_add_graph(self):
# add nice assertions here!
return
@raises(HierarchyError)
def test_add_typing_cycle(self):
self.hierarchy.add_typing(
"g0", "g1",
{"circle": "black_circle",
"square": "white_square",
"triangle": "black_triangle"},
total=True)
def test_remove_graph(self):
h = copy.deepcopy(self.hierarchy)
h.remove_graph("g1", reconnect=True)
# print(h)
# print(self.hierarchy)
def test_find_matching(self):
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [
1,
(2, {"a": 1}),
3
])
prim.add_edges_from(pattern, [
(1, 2),
(2, 3)
])
pattern_typing = {1: "circle", 2: "square", 3: "triangle"}
instances = self.hierarchy.find_matching(
graph_id="g1",
pattern=pattern,
pattern_typing={
"g0": pattern_typing,
"g00": {1: "white", 2: "white", 3: "black"}
}
)
assert(len(instances) == 1)
def test_rewrite(self):
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [
1,
(2, {"a": {1, 2}}),
3
])
prim.add_edges_from(pattern, [
(1, 2),
(2, 3)
])
lhs_typing = {
"g0": {1: "circle", 2: "square", 3: "triangle"},
"g00": {1: "white", 2: "white", 3: "black"}
}
p = nx.DiGraph()
p.add_nodes_from([
1,
2,
3
])
p.add_edges_from([
(2, 3)
])
rhs = nx.DiGraph()
prim.add_nodes_from(rhs, [
1,
(2, {"a": {3, 5}}),
(3, {"new_attrs": {1}}),
4
])
prim.add_edges_from(rhs, [
(2, 1, {"new_attrs": {2}}),
(2, 4, {"new_attrs": {3}}),
(2, 3, {"new_attrs": {4}})
])
p_lhs = {1: 1, 2: 2, 3: 3}
p_rhs = {1: 1, 2: 2, 3: 3}
rule = Rule(p, pattern, rhs, p_lhs, p_rhs)
rhs_typing = {
"g0": {
1: "circle",
2: "square",
3: "triangle",
4: "triangle"
},
"g00": {
1: "white",
2: "white",
3: "black",
4: "black"
}
}
instances = self.hierarchy.find_matching(
"g1",
pattern,
lhs_typing
)
# print(instances[0])
self.hierarchy.rewrite(
"g1",
rule,
instances[0],
lhs_typing,
rhs_typing
)
# add nice assertions here
def test_node_type(self):
# print(self.hierarchy.node_type("g1", "white_circle"))
assert(
self.hierarchy.node_type("g1", "white_circle") ==
{"g00": "white", "g0": "circle"}
)
# print(self.hierarchy.node_type("g1", "black_square"))
assert(
self.hierarchy.node_type("g1", "black_square") ==
{"g00": "black", "g0": "square"}
)
def test_add_partial_typing(self):
self.hierarchy.add_typing(
"g5",
"g1",
{"black_circle": "black_circle",
"black_square": "black_square",
"white_triangle": "white_triangle"},
total=False
)
return
def test_rewrite_ignore_attrs(self):
pass
def test_to_json(self):
res = self.hierarchy.to_json()
new_h = Hierarchy.from_json(res)
assert(self.hierarchy == new_h)
def test_add_rule(self):
lhs = nx.DiGraph()
prim.add_nodes_from(lhs, [
1, 2, 3
])
prim.add_edges_from(lhs, [
(1, 2),
(2, 1),
(2, 3)
])
p = nx.DiGraph()
prim.add_nodes_from(p, [
1, 2, 3, 31
])
prim.add_edges_from(p, [
(1, 2),
(2, 3),
(2, 31)
])
rhs = nx.DiGraph()
prim.add_nodes_from(rhs, [
1, 2, 3, 31, 4
])
prim.add_edges_from(rhs, [
(1, 2),
(4, 2),
(2, 3),
(2, 31)
])
p_lhs = {1: 1, 2: 2, 3: 3, 31: 3}
p_rhs = {1: 1, 2: 2, 3: 3, 31: 3}
rule = Rule(p, lhs, rhs, p_lhs, p_rhs)
lhs_typing = {
1: "black_circle",
2: "white_circle",
3: "white_square"
}
rhs_typing = {
1: "black_circle",
2: "white_circle",
3: "white_square",
31: "white_square",
4: "black_circle"
}
self.hierarchy.add_rule("r1", rule, {"name": "First rule"})
self.hierarchy.add_rule_typing("r1", "g1", lhs_typing, rhs_typing)
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [
1,
(2, {"a": {1, 2}}),
3
])
prim.add_edges_from(pattern, [
(1, 2),
(2, 3)
])
lhs_typing = {
"g0": {1: "circle", 2: "square", 3: "triangle"},
"g00": {1: 'white', 2: 'white', 3: 'black'}
}
p = nx.DiGraph()
prim.add_nodes_from(p, [
1,
11,
2,
3
])
prim.add_edges_from(p, [
(2, 3)
])
rhs = nx.DiGraph()
prim.add_nodes_from(rhs, [
1,
11,
(2, {"a": {3, 5}}),
(3, {"new_attrs": {1}}),
])
prim.add_edges_from(rhs, [
(2, 3, {"new_attrs": {4}})
])
p_lhs = {1: 1, 11: 1, 2: 2, 3: 3}
p_rhs = {1: 1, 11: 11, 2: 2, 3: 3}
rule = Rule(p, pattern, rhs, p_lhs, p_rhs)
rhs_typing = {
"g0": {
1: "circle",
11: "circle",
2: "square",
3: "triangle"
},
"g00": {
1: "white",
11: "white",
2: "white",
3: "black"
}
}
instances = self.hierarchy.find_matching(
"g1",
pattern,
lhs_typing
)
self.hierarchy.rewrite(
"g1",
rule,
instances[0],
lhs_typing,
rhs_typing
)
def test_add_rule_multiple_typing(self):
lhs = nx.DiGraph()
prim.add_nodes_from(lhs, [1, 2, 3, 4])
prim.add_edges_from(lhs, [
(1, 3),
(2, 3),
(4, 3)
])
p = nx.DiGraph()
prim.add_nodes_from(p, [1, 3, 31, 4])
prim.add_edges_from(p, [
(1, 3),
(1, 31),
(4, 3),
(4, 31)
])
rhs = copy.deepcopy(p)
p_lhs = {1: 1, 3: 3, 31: 3, 4: 4}
p_rhs = {1: 1, 3: 3, 31: 31, 4: 4}
lhs_typing_g2 = {
1: 1,
2: 1,
3: 2,
4: 4
}
rhs_typing_g2 = {
1: 1,
3: 2,
31: 2,
4: 4
}
lhs_typing_g3 = {
1: 1,
2: 1,
3: 1,
4: 2
}
rhs_typing_g3 = {
1: 1,
3: 1,
31: 1,
4: 2
}
rule = Rule(p, lhs, rhs, p_lhs, p_rhs)
self.hierarchy.add_rule(
"r2", rule, {"name": "Second rule: with multiple typing"})
self.hierarchy.add_rule_typing(
"r2", "g2", lhs_typing_g2, rhs_typing_g2)
self.hierarchy.add_rule_typing(
"r2", "g3", lhs_typing_g3, rhs_typing_g3)
pattern = nx.DiGraph()
prim.add_nodes_from(pattern, [
1,
2
])
prim.add_edges_from(pattern, [
(2, 1)
])
lhs_typing = {
"g0": {1: "circle", 2: "circle"},
"g00": {1: "black", 2: "white"}
}
p = nx.DiGraph()
prim.add_nodes_from(p, [
1,
2,
21
])
prim.add_edges_from(p, [
(21, 1)
])
rhs = copy.deepcopy(p)
p_lhs = {1: 1, 2: 2, 21: 2}
p_rhs = {1: 1, 2: 2, 21: 21}
rule = Rule(p, pattern, rhs, p_lhs, p_rhs)
rhs_typing = {
"g0": ({
1: "circle",
2: "circle",
21: "circle",
}),
"g00": ({
1: "black",
2: "white",
21: "white"
})
}
instances = self.hierarchy.find_matching(
"g1",
pattern,
lhs_typing
)
self.hierarchy.rewrite(
"g1",
rule,
instances[0],
lhs_typing,
rhs_typing
)
def test_get_ancestors(self):
anc = self.hierarchy.get_ancestors("g2")
assert("g1" in anc.keys())
assert("g0" in anc.keys())
assert("g00" in anc.keys())
@raises(HierarchyError)
def test_add_typing_advanced(self):
hierarchy = Hierarchy()
g9 = nx.DiGraph()
g9.add_nodes_from(["a", "b"])
hierarchy.add_graph(9, g9)
g8 = nx.DiGraph()
g8.add_nodes_from(["1_a", "1_b", "2_a", "2_b"])
hierarchy.add_graph(8, g8)
hierarchy.add_typing(
8, 9,
{"1_a": "a",
"1_b": "b",
"2_a": "a",
"2_b": "b"},
total=True
)
g7 = nx.DiGraph()
g7.add_nodes_from(["x_a", "x_b", "y_a", "y_b"])
hierarchy.add_graph(7, g7)
hierarchy.add_typing(
7, 9,
{
"x_a": "a",
"x_b": "b",
"y_a": "a",
"y_b": "b"
},
total=True
)
g2 = nx.DiGraph()
g2.add_nodes_from(["s_1_a", "t_1_a", "s_1_b", "t_2_a"])
hierarchy.add_graph(2, g2)
hierarchy.add_typing(
2, 8,
{
"s_1_a": "1_a",
"t_1_a": "1_a",
"s_1_b": "1_b",
"t_2_a": "2_a"
},
total=True
)
g3 = nx.DiGraph()
g3.add_nodes_from(["s_x_a", "t_x_a", "g_y_b"])
hierarchy.add_graph(3, g3)
hierarchy.add_typing(
3, 7,
{
"s_x_a": "x_a",
"t_x_a": "x_a",
"g_y_b": "y_b"
},
total=True
)
g4 = nx.DiGraph()
g4.add_nodes_from(["a_x_a", "t_y_b"])
hierarchy.add_graph(4, g4)
hierarchy.add_typing(
4, 3,
{
"a_x_a": "s_x_a",
"t_y_b": "g_y_b"
},
total=True
)
hierarchy.add_typing(
4, 7,
{
"a_x_a": "x_a",
"t_y_b": "y_b"
},
total=True
)
g6 = nx.DiGraph()
g6.add_nodes_from(["a_x_a", "b_x_a", "a_y_b", "b_y_a", "c_x_b"])
hierarchy.add_graph(6, g6)
hierarchy.add_typing(
6, 7,
{
"a_x_a": "x_a",
"b_x_a": "x_a",
"a_y_b": "y_b",
"b_y_a": "y_a",
"c_x_b": "x_b"
},
total=True
)
g5 = nx.DiGraph()
g5.add_nodes_from(["1_a_x_a", "2_a_x_a", "1_a_y_b"])
hierarchy.add_graph(5, g5)
hierarchy.add_typing(
5, 6,
{
"1_a_x_a": "a_x_a",
"2_a_x_a": "a_x_a",
"1_a_y_b": "a_y_b"
},
total=True
)
hierarchy.add_typing(
5, 4,
{
"1_a_x_a": "a_x_a",
"2_a_x_a": "a_x_a",
"1_a_y_b": "t_y_b"
},
total=True
)
g1 = nx.DiGraph()
g1.add_nodes_from(["1_s_1_a", "2_s_1_a", "1_s_1_b"])
hierarchy.add_graph(1, g1)
hierarchy.add_typing(
1, 2,
{
"1_s_1_a": "s_1_a",
"2_s_1_a": "s_1_a",
"1_s_1_b": "s_1_b"
},
total=True
)
hierarchy.add_typing(
1, 3,
{
"1_s_1_a": "s_x_a",
"2_s_1_a": "t_x_a",
"1_s_1_b": "g_y_b"
},
total=True
)
# start testing
hierarchy.add_typing(
3, 8,
{
"s_x_a": "1_a",
"t_x_a": "1_a",
"g_y_b": "1_b"
},
total=True
)
hierarchy.add_typing(
6, 9,
{
"a_x_a": "a",
"b_x_a": "b",
"a_y_b": "b",
"b_y_a": "a",
"c_x_b": "b"
},
total=True
)
def test_triangle_1(self):
h = Hierarchy()
g1 = nx.DiGraph()
g1.add_nodes_from([
"1", "2"
])
g2 = nx.DiGraph()
g2.add_nodes_from([
"1a", "1b", "2a", "2b"
])
g3 = nx.DiGraph()
g3.add_nodes_from([
"1x", "1y", "2x", "2y"
])
h.add_graph("g1", g1)
h.add_graph("g2", g2)
h.add_graph("g3", g3)
h.add_typing(
"g2", "g1",
{
"1a": "1",
"1b": "1",
"2a": "2",
"2b": "2"
},
total=True
)
h.add_typing(
"g3", "g1",
{
"1x": "1",
"1y": "1",
"2x": "2",
"2y": "2"
},
total=True
)
h.add_typing(
"g2", "g3",
{
"1a": "1x",
"1b": "1y",
"2a": "2y",
"2b": "2x"
},
total=True
)
pattern = nx.DiGraph()
pattern.add_nodes_from([
1, 2
])
rule = Rule.from_transform(pattern)
rule.remove_node(1)
rule.clone_node(2)
instances = h.find_matching("g1", pattern)
new_h, _ = h.rewrite("g1", rule, instances[0], inplace=False)