def test_add_child(self):
p = GraphNode()
a = GraphNode()
p.add_child(a)
assert p.children == [a]
assert p.parent is None
assert a.parent is p
assert a.children == []
def test_add_child(self):
p = GraphNode()
a = GraphNode()
p.add_child(a)
assert p.children == [a]
assert p.parent is None
assert a.parent is p
assert a.children == []
def test_multiple_child(self):
p = GraphNode()
a = GraphNode()
b = GraphNode()
c = GraphNode()
p.add_child(a)
p.add_child(b)
p.add_child(c)
assert p.children == [a, b, c]
assert p.parent is None
assert a.parent is p
assert b.parent is p
assert c.parent is p
assert a.children == []
assert b.children == []
assert c.children == []
def test_multiple_child(self):
p = GraphNode()
a = GraphNode()
b = GraphNode()
c = GraphNode()
p.add_child(a)
p.add_child(b)
p.add_child(c)
assert p.children == [a, b, c]
assert p.parent is None
assert a.parent is p
assert b.parent is p
assert c.parent is p
assert a.children == []
assert b.children == []
assert c.children == []
def test_new(self):
n = GraphNode()
assert len(n.children) == 0
assert n.parent is None
def graph(a, b, c):
p = GraphNode()
p.add_child(a)
a.add_child(b)
p.add_child(c)
return p
def graph(a, b, c):
p = GraphNode()
p.add_child(a)
a.add_child(b)
p.add_child(c)
return p