def test_edge_removal(self):
graph = objectgraph.ObjectGraph()
n1 = Node("n1")
n2 = Node("n2")
n3 = Node("n3")
graph.add_node(n1)
graph.add_node(n2)
graph.add_node(n3)
graph.add_edge(n1, n2, 1)
graph.add_edge(n1, n2, 2)
graph.add_edge(n2, n3, 3)
graph.add_edge(n2, n3, 4)
self.assertRaises(KeyError, graph.remove_all_edges, n3, n1)
self.assertRaises(KeyError, graph.remove_edge, n3, n1, 1)
self.assertRaises(KeyError, graph.remove_edge, n1, n2, 4)
self.assertRaises(KeyError, graph.remove_edge, "n4", n2, 4)
self.assertRaises(KeyError, graph.remove_edge, "n1", "n4", 4)
self.assertRaises(KeyError, graph.remove_all_edges, "n4", n2)
self.assertRaises(KeyError, graph.remove_all_edges, "n1", "n4")
self.assertEqual(graph.edge_data(n1, n2), {1, 2})
graph.remove_edge(n1, n2, 1)
self.assertEqual(graph.edge_data(n1, n2), {2})
self.assertEqual(graph.edge_data(n2, n3), {3, 4})
graph.remove_all_edges(n2, n3)
self.assertRaises(KeyError, graph.edge_data, n2, n3)
def test_duplicate_node(self):
graph = objectgraph.ObjectGraph()
n1_a = Node("n1")
n1_b = Node("n1")
graph.add_node(n1_a)
self.assertRaises(ValueError, graph.add_node, n1_b)
self.assertRaises(AttributeError, graph.add_node, "n2")
def test_edges(self):
graph = objectgraph.ObjectGraph()
n1 = Node("n1")
n2 = Node("n2")
n3 = Node("n3")
n4 = Node("n4")
graph.add_node(n1)
graph.add_node(n2)
graph.add_node(n3)
graph.add_edge(n1, n2, 1)
graph.add_edge("n1", "n3", 2)
graph.add_edge("n2", n3, None)
self.assertRaises(KeyError, graph.add_edge, n1, n4, 3)
self.assertRaises(KeyError, graph.add_edge, n4, n2, 4)
self.assertRaises(KeyError, graph.add_edge, "n1", "n4", 3)
self.assertRaises(KeyError, graph.add_edge, "n4", "n3", 5)
self.assertEqual(graph.edge_data(n1, n2), {1})
self.assertEqual(graph.edge_data(n1, n3), {2})
self.assertEqual(graph.edge_data(n2, n3), {None})
self.assertEqual(graph.edge_data(n1, "n2"), {1})
self.assertEqual(graph.edge_data(n1, "n3"), {2})
self.assertEqual(graph.edge_data(n2, "n3"), {None})
self.assertEqual(graph.edge_data("n1", n2), {1})
self.assertEqual(graph.edge_data("n1", n3), {2})
self.assertEqual(graph.edge_data("n2", n3), {None})
self.assertEqual(graph.edge_data("n1", "n2"), {1})
self.assertEqual(graph.edge_data("n1", "n3"), {2})
self.assertEqual(graph.edge_data("n2", "n3"), {None})
self.assertRaises(KeyError, graph.edge_data, "n1", "n4")
self.assertRaises(KeyError, graph.edge_data, n1, n4)
self.assertRaises(KeyError, graph.edge_data, "n4", "n2")
self.assertRaises(KeyError, graph.edge_data, n4, n2)
self.assertRaises(KeyError, graph.edge_data, "n3", "n1")
self.assertRaises(KeyError, graph.edge_data, n3, n1)
self.assertEqual(list(graph.outgoing(n1)), [({1}, n2), ({2}, n3)])
self.assertEqual(list(graph.outgoing(n2)), [({None}, n3)])
self.assertEqual(list(graph.incoming(n1)), [])
self.assertEqual(list(graph.incoming(n2)), [({1}, n1)])
self.assertEqual(list(graph.incoming(n3)), [({2}, n1), ({None}, n2)])
def test_empty(self):
graph = objectgraph.ObjectGraph()
self.assertEqual(repr(graph),
"<ObjectGraph with 0 roots, 0 nodes and 0 edges>")
self.assertEqual(list(graph.roots()), [])
self.assertEqual(list(graph.nodes()), [])
self.assertEqual(list(graph.edges()), [])
self.assertEqual(list(graph.iter_graph()), [])
self.assertFalse("foo" in graph)
self.assertEqual(graph.find_node("foo"), None)
self.assertEqual(list(graph.incoming("foo")), [])
self.assertEqual(list(graph.outgoing("foo")), [])
def test_graph_iteration(self):
graph = objectgraph.ObjectGraph()
n1 = Node("n1")
n2 = Node("n2")
n3 = Node("n3")
n4 = Node("n4")
n5 = Node("n5")
n6 = Node("n6")
n7 = Node("n7")
n8 = Node("n8")
graph.add_node(n1)
graph.add_node(n2)
graph.add_node(n3)
graph.add_node(n4)
graph.add_node(n5)
graph.add_node(n6)
graph.add_node(n7)
graph.add_root(n1)
graph.add_root(n2)
graph.add_edge(n1, n3, None)
graph.add_edge(n3, n1, None)
graph.add_edge(n3, n4, None)
graph.add_edge(n3, n5, None)
graph.add_edge(n5, n4, None)
graph.add_edge(n5, n1, None)
graph.add_edge(n2, n6, None)
graph.add_edge(n6, n7, None)
graph.add_edge(n7, n6, None)
self.assertEqual(list(graph.iter_graph(node=n2)), [n2, n6, n7])
self.assertEqual(list(graph.iter_graph(node=n7)), [n7, n6])
self.assertIn(list(graph.iter_graph(node=n1)),
([n1, n3, n4, n5], [n1, n3, n5, n4]))
with self.assertRaises(KeyError):
list(graph.iter_graph(node=n8))
self.assertEqual(set(graph.iter_graph()), {n1, n2, n3, n4, n5, n6, n7})
graph.add_edge(n1, n2, None)
self.assertEqual(set(graph.iter_graph()), {n1, n2, n3, n4, n5, n6, n7})
def test_finding(self):
graph = objectgraph.ObjectGraph()
n1_a = Node("n1")
n1_b = Node("n1")
self.assertIsNot(n1_a, n1_b)
graph.add_node(n1_a)
self.assertTrue(n1_a in graph)
self.assertTrue(n1_b in graph)
v = graph.find_node("n1")
self.assertIs(v, n1_a)
v = graph.find_node(n1_a)
self.assertIs(v, n1_a)
v = graph.find_node(n1_b)
self.assertIs(v, n1_a)
def test_root_removal(self):
graph = objectgraph.ObjectGraph()
n1 = Node("n1")
n2 = Node("n2")
n3 = Node("n3")
n4 = Node("n4")
graph.add_node(n1)
graph.add_node(n2)
graph.add_node(n3)
graph.add_root(n1)
graph.add_root(n2)
graph.add_edge(n1, n2, 1)
graph.add_edge(n1, n2, 2)
graph.add_edge(n2, n3, 3)
graph.add_edge(n2, n3, 4)
self.assertIn(n1, graph.roots())
self.assertIn(n2, graph.roots())
graph.remove_root(n1)
self.assertNotIn(n1, graph.roots())
self.assertIn(n2, graph.roots())
graph.remove_root("n2")
self.assertNotIn(n1, graph.roots())
self.assertNotIn(n2, graph.roots())
self.assertIn(n1, graph.nodes())
self.assertIn(n2, graph.nodes())
self.assertRaises(KeyError, graph.remove_root, n3)
self.assertRaises(KeyError, graph.remove_root, "n3")
self.assertRaises(KeyError, graph.remove_root, n4)
self.assertRaises(KeyError, graph.remove_root, "n4")
def test_node_removal(self):
graph = objectgraph.ObjectGraph()
n1 = Node("n1")
n2 = Node("n2")
n3 = Node("n3")
n4 = Node("n4")
graph.add_node(n1)
graph.add_node(n2)
graph.add_node(n3)
graph.add_root(n1)
graph.add_root(n2)
graph.add_edge(n1, n2, 1)
graph.add_edge(n1, n2, 2)
graph.add_edge(n2, n3, 3)
graph.add_edge(n2, n3, 4)
graph.remove_node(n1)
self.assertNotIn(n1, graph.nodes())
self.assertNotIn(n1, graph.roots())
for s, d, _ in graph.edges():
self.assertIsNot(s, n1)
self.assertIsNot(d, n1)
graph.remove_node(n3)
self.assertNotIn(n3, graph.nodes())
self.assertNotIn(n3, graph.roots())
for s, d, _ in graph.edges():
self.assertIsNot(s, n3)
self.assertIsNot(d, n3)
self.assertRaises(KeyError, graph.remove_node, n4)
self.assertRaises(KeyError, graph.remove_node, "n4")
def test_simple_graph(self):
graph = objectgraph.ObjectGraph()
n1 = Node("n1")
n2 = Node("n2")
n3 = Node("n3")
n4 = Node("n4")
graph.add_node(n1)
graph.add_node(n2)
graph.add_node(n3)
self.assertEqual(set(graph.nodes()), {n1, n2, n3})
self.assertEqual(set(graph.roots()), set())
self.assertEqual(list(graph.edges()), [])
graph.add_root(n2)
self.assertEqual(set(graph.roots()), {n2})
self.assertRaises(KeyError, graph.add_root, n4)
self.assertRaises(KeyError, graph.edge_data, n1, n2)
self.assertEqual(set(graph.outgoing(n1)), set())
self.assertEqual(set(graph.incoming(n1)), set())
graph.add_edge(n1, n2, 42)
self.assertEqual(list(graph.outgoing(n1)), [({42}, n2)])
self.assertEqual(set(graph.incoming(n1)), set())
self.assertEqual(list(graph.edges()), [(n1, n2, {42})])
graph.add_edge(n1, n2, 21)
self.assertEqual(list(graph.outgoing(n1)), [({42, 21}, n2)])
self.assertEqual(set(graph.incoming(n1)), set())