def test_transitive_closure_disjoint(self):
"transitive closure of a disjoint set is a subset"
g = Graph(set(['a', 'b', 'c']), set())
self.assertEqual(g.transitive_closure(set(['a', 'c'])),
Graph(set(['a', 'c']), set()))
def test_transitive_closure_empty(self):
"transitive closure of an empty set is an empty graph"
g = Graph(set(['a', 'b', 'c']), {('a', 'b', 'L'), ('a', 'c', 'L')})
self.assertEqual(g.transitive_closure(set()), Graph(set(), set()))
def test_transitive_closure_disjoint(self):
"transitive closure of a disjoint set is a subset"
g = Graph(set(['a', 'b', 'c']), set())
self.assertEqual(g.transitive_closure(set(['a', 'c'])),
Graph(set(['a', 'c']), set()))
def test_transitive_closure_empty(self):
"transitive closure of an empty set is an empty graph"
g = Graph(set(["a", "b", "c"]), {("a", "b", "L"), ("a", "c", "L")})
self.assertEqual(g.transitive_closure(set()), Graph(set(), set()))
def test_transitive_closure_empty(self):
"transitive closure of an empty set is an empty graph"
g = Graph(set(['a', 'b', 'c']), {('a', 'b', 'L'), ('a', 'c', 'L')})
self.assertEqual(g.transitive_closure(set()),
Graph(set(), set()))
