def test_transitive_closure_of_a_node_on_a_graph_with_loops_should_still_terminate(
self):
dep_graph = DepGraph()
# A -> B, B -> C, C -> D, D -> A
A = _a_mock_definition()
B = _a_mock_definition()
C = _a_mock_definition()
D = _a_mock_definition()
uses = [
(A, B),
(B, C),
(C, D),
(D, A),
]
for use in uses:
dep_graph.add_edge(*use)
result = dep_graph.transitive_closure(C)
result_nodes = set(result.nodes)
result_edges = set(result.edges)
self.assertSetEqual(result_nodes, {A, B, C, D})
self.assertSetEqual(result_edges, {(A, B), (B, C), (C, D), (D, A)})
def test_transitive_closure_includes_beginning_node_with_memoized_content(
self):
dep_graph = DepGraph()
# A -> B
# B -> C
# C -> D
A = _a_mock_definition()
B = _a_mock_definition()
C = _a_mock_definition()
D = _a_mock_definition()
uses = [(A, B), (B, C), (C, D)]
for use in uses:
dep_graph.add_edge(*use)
closure_0 = dep_graph.transitive_closure(C)
self.assertNotIn(D, closure_0)
closure_1 = dep_graph.transitive_closure(D)
self.assertIn(D, closure_1)
self.assertTrue(closure_1.has_edge(A, B))
self.assertTrue(closure_1.has_edge(B, C))
self.assertTrue(closure_1.has_edge(C, D))
def test_transitive_closure_of_a_node_should_copy_labels_from_original_graph():
dep_graph = DepGraph()
# A -> B
A = _a_mock_definition()
B = _a_mock_definition()
uses = [(A, B)]
for use in uses:
dep_graph.add_edge(*use, label='some data')
result = dep_graph.transitive_closure(B).get_edge_data(A, B)['label']
nose.tools.assert_equals(result, 'some data')
def test_transitive_closure_of_a_node(self):
dep_graph = DepGraph()
# A -> B, B -> D, C -> D
A = _a_mock_definition()
B = _a_mock_definition()
C = _a_mock_definition()
D = _a_mock_definition()
uses = [
(A, B),
(B, D),
(C, D),
]
for use in uses:
dep_graph.add_edge(*use)
result = dep_graph.transitive_closure(D)
result_nodes = set(result.nodes)
result_edges = set(result.edges)
self.assertSetEqual(result_nodes, {D, B, C, A})
self.assertSetEqual(result_edges, {(B, D), (C, D), (A, B)})
