def test_should_resort_after_additions(self): nodes = ['a', 'b', 'c', 'd', 'e', 'f'] dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f')] graph = DependencyGraph() self._add_nodes_and_dependencies(graph, nodes, dependencies) graph.toposort() dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f'), ('b', 'g')] graph.add_node('g') graph.add_dependency('b', 'g') result = graph.toposort() self._check_result(result, dependencies)
def test_should_resort_after_additions(self): nodes = ["a", "b", "c", "d", "e", "f"] dependencies = [("a", "b"), ("a", "c"), ("b", "d"), ("e", "f")] graph = DependencyGraph() self._add_nodes_and_dependencies(graph, nodes, dependencies) graph.toposort() dependencies = [("a", "b"), ("a", "c"), ("b", "d"), ("e", "f"), ("b", "g")] graph.add_node("g") graph.add_dependency("b", "g") result = graph.toposort() self._check_result(result, dependencies)
def test_should_resort_after_additions(self): nodes = ["a", "b", "c", "d", "e", "f"] dependencies = [("a", "b"), ("a", "c"), ("b", "d"), ("e", "f")] graph = DependencyGraph() self._add_nodes_and_dependencies(graph, nodes, dependencies) graph.toposort() dependencies = [("a", "b"), ("a", "c"), ("b", "d"), ("e", "f"), ("b", "g")] graph.add_node("g") graph.add_dependency("b", "g") result = graph.toposort() self._check_result(result, dependencies)
def test_should_resort_after_additions(self): nodes = ['a', 'b', 'c', 'd', 'e', 'f'] dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f')] graph = DependencyGraph() self._add_nodes_and_dependencies(graph, nodes, dependencies) graph.toposort() dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f'), ('b', 'g')] graph.add_node('g') graph.add_dependency('b', 'g') result = graph.toposort() self._check_result(result, dependencies)
def test_should_resort_after_additions(self): nodes = ['a', 'b', 'c', 'd', 'e', 'f'] dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f')] g = DependencyGraph() self._add_nodes_and_dependencies(g, nodes, dependencies) g.toposort() dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f'), ('b', 'g')] g.add_node('g') g.add_dependency('b', 'g') result = g.toposort() for d in dependencies: self.assertTrue(result.index(d[0]) < result.index(d[1]), "%s is not before %s" % d)
def test_should_resort_after_additions(self): nodes = ['a', 'b', 'c', 'd', 'e', 'f'] dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f')] g = DependencyGraph() self._add_nodes_and_dependencies(g, nodes, dependencies) g.toposort() dependencies = [('a', 'b'), ('a', 'c'), ('b', 'd'), ('e', 'f'), ('b', 'g')] g.add_node('g') g.add_dependency('b', 'g') result = g.toposort() for d in dependencies: self.assertTrue( result.index(d[0]) < result.index(d[1]), "%s is not before %s" % d)