def testCycles(self):
gr = DirectedGraph()
gr.add_nodes([1, 2, 3, 11, 12, 21, 22, 23, 31])
self.assertEqual([], gr.get_cycles())
gr.add_edge(1, 2)
gr.add_edge(2, 3)
gr.add_edge(3, 1)
self.assertEqual([1, 2, 3], gr.get_cycles())
def testCycles(self):
gr = DirectedGraph()
gr.add_nodes([1, 2, 3, 11, 12, 21, 22, 23, 31])
self.assertEqual([], gr.get_cycles())
gr.add_edge(1, 2)
gr.add_edge(2, 3)
gr.add_edge(3, 1)
self.assertEqual([1, 2, 3], gr.get_cycles())
def testLevels(self):
gr = DirectedGraph()
gr.add_nodes([1, 2, 3, 11, 12, 21, 22, 23, 31])
gr.add_edge(11, 1)
gr.add_edge(12, 2)
gr.add_edge(21, 12)
gr.add_edge(22, 11)
gr.add_edge(31, 21)
gr.add_edge(31, 22)
gr.add_edge(31, 23)
self.assertEqual(set([1, 2, 3, 23]), gr.get_levels()[0])
self.assertEqual(set([11, 12]), gr.get_levels()[1])
self.assertEqual(set([22, 21]), gr.get_levels()[2])
self.assertEqual(set([31]), gr.get_levels()[3])
# cycles no
self.assertEqual([], gr.get_cycles())
self.assertEqual(set([1, 2, 11, 12, 21, 22, 23]),
gr.compute_closure(31))
self.assertEqual(set([]), gr.compute_closure(23))
self.assertEqual(set([1, 11]), gr.compute_closure(22))
self.assertEqual(set([2, 12]), gr.compute_closure(21))
self.assertEqual(set([1]), gr.compute_closure(11))
def testLevels(self):
gr = DirectedGraph()
gr.add_nodes([1, 2, 3, 11, 12, 21, 22, 23, 31])
gr.add_edge(11, 1)
gr.add_edge(12, 2)
gr.add_edge(21, 12)
gr.add_edge(22, 11)
gr.add_edge(31, 21)
gr.add_edge(31, 22)
gr.add_edge(31, 23)
self.assertEqual(set([1, 2, 3, 23]), gr.get_levels()[0])
self.assertEqual(set([11, 12]), gr.get_levels()[1])
self.assertEqual(set([22, 21]), gr.get_levels()[2])
self.assertEqual(set([31]), gr.get_levels()[3])
# cycles no
self.assertEqual([], gr.get_cycles())
self.assertEqual(set([1, 2, 11, 12, 21, 22, 23]), gr.compute_closure(31))
self.assertEqual(set([]), gr.compute_closure(23))
self.assertEqual(set([1, 11]), gr.compute_closure(22))
self.assertEqual(set([2, 12]), gr.compute_closure(21))
self.assertEqual(set([1]), gr.compute_closure(11))
def testCycles2(self):
g = DirectedGraph()
for i in range(2):
g.add_node(BlockName("user/mod%d" % i))
g.add_edge(BlockName("user/mod0"), BlockName("user/mod1"))
g.add_edge(BlockName("user/mod1"), BlockName("user/mod0"))
self.assertEqual({BlockName("user/mod0"), BlockName("user/mod1")}, set(g.get_cycles()))
def testCycles2(self):
g = DirectedGraph()
for i in range(2):
g.add_node(BlockName("user/mod%d" % i))
g.add_edge(BlockName("user/mod0"), BlockName("user/mod1"))
g.add_edge(BlockName("user/mod1"), BlockName("user/mod0"))
self.assertEqual({BlockName("user/mod0"),
BlockName("user/mod1")}, set(g.get_cycles()))
