def test_enum_hops(self):
g = Graph(nodes=EnumNodes(['x', 'y', 'z']),
edges=EnumEdges(Hops.from_dict(x={'y', 'z'})))
self.assertTrue(g.has_node('y'))
self.assertFalse(g.has_node('a'))
self.assertCountEqual(g.predecessors_of('y'), ['x'])
self.assertCountEqual(g.predecessors_of('x'), [])
def test_augment(self):
g1 = AlphabetGraph()
g2 = Graph(nodes=EnumNodes(range(1, 4)),
edges=EnumEdges(
Hops.from_pairs((1, 'a'), (2, 'b'), (3, 'c'))))
g = Graph.augment(g2, g1)
self.assertTrue(g2.has_node(1))
self.assertFalse(g2.has_node('a'))
self.assertFalse(g2.find_hop(1, 'a'))
self.assertCountEqual(g2.successors_of(2), [])
self.assertCountEqual(g2.predecessors_of('c'), [])
self.assertTrue(g.has_node(1))
self.assertTrue(g.has_node('a'))
self.assertTrue(g.find_hop(1, 'a'))
self.assertCountEqual(g.successors_of(2), ['b'])
self.assertCountEqual(g.predecessors_of('b'), [2, 'a'])
def test_enum_graph(self):
g = Graph(nodes=EnumNodes(['x', 'y', 'z']), edges=EnumEdges())
self.assertTrue(g.has_node('y'))
self.assertFalse(g.has_node('a'))
self.assertCountEqual(g.predecessors_of('y'), [])
