def setUp(self):
"""
Setup a graph with the following dependencies
a -> d, b
b -> c, e
c -> d, e
d ->
e ->
"""
self.graph = Graph()
self.graph.add_node("a")
self.graph.add_node("b")
self.graph.add_node("c")
self.graph.add_node("d")
self.graph.add_node("e")
self.graph.add_dependency("a", "d")
self.graph.add_dependency("a", "b")
self.graph.add_dependency("b", "c")
self.graph.add_dependency("b", "e")
self.graph.add_dependency("c", "d")
self.graph.add_dependency("c", "e")
def setUp(self):
"""
Setup a graph with the following dependencies
a -> d, b
b -> c, e
c -> d, e
d ->
e ->
"""
self.graph = Graph()
self.graph.add_node('a')
self.graph.add_node('b')
self.graph.add_node('c')
self.graph.add_node('d')
self.graph.add_node('e')
self.graph.add_dependency('a', 'd')
self.graph.add_dependency('a', 'b')
self.graph.add_dependency('b', 'c')
self.graph.add_dependency('b', 'e')
self.graph.add_dependency('c', 'd')
self.graph.add_dependency('c', 'e')
def setUp(self):
"""
Setup a graph with the following dependencies
a -> d, b
b -> c, e
c -> d, e
d ->
e ->
"""
self.graph = Graph()
self.graph.add_node('a')
self.graph.add_node('b')
self.graph.add_node('c')
self.graph.add_node('d')
self.graph.add_node('e')
self.graph.add_dependency('a', 'd')
self.graph.add_dependency('a', 'b')
self.graph.add_dependency('b', 'c')
self.graph.add_dependency('b', 'e')
self.graph.add_dependency('c', 'd')
self.graph.add_dependency('c', 'e')
def init_graph(self):
"""
Initialize graph
Load all nodes and set dependencies.
To avoid errors about missing nodes all nodes get loaded first before
setting the dependencies.
"""
self._graph = Graph()
# First add all nodes
for key in self.loader.disk_fixtures.keys():
self.graph.add_node(key)
# Then set dependencies
for key, fixture in self.loader.disk_fixtures.items():
for dependency in fixture.dependencies:
self.graph.add_dependency(key, dependency)
class GraphTestCase(TestCase):
def setUp(self):
"""
Setup a graph with the following dependencies
a -> d, b
b -> c, e
c -> d, e
d ->
e ->
"""
self.graph = Graph()
self.graph.add_node("a")
self.graph.add_node("b")
self.graph.add_node("c")
self.graph.add_node("d")
self.graph.add_node("e")
self.graph.add_dependency("a", "d")
self.graph.add_dependency("a", "b")
self.graph.add_dependency("b", "c")
self.graph.add_dependency("b", "e")
self.graph.add_dependency("c", "d")
self.graph.add_dependency("c", "e")
def test_resolve_node(self):
"""
Case: a node get resolved
Expected: The dependencies of that node get returned first
"""
flat_list = self.graph.resolve_node("c")
self.assertListEqual(flat_list, ["d", "e", "c"])
def test_resolve_node_without_start(self):
"""
Case: Call resolve_node without parameters
Expected: All dependencies should be returned in correct order.
"""
flat_list = self.graph.resolve_node()
self.assertListEqual(flat_list, ["d", "e", "c", "b", "a"])
def test_iterator(self):
"""
Case: Iterate through the graph
Expected: the dependent nodes get returned first
"""
flat_list = [item for item in self.graph]
self.assertListEqual(flat_list, ["d", "e", "c", "b", "a"])
def test_circular_dependency(self):
"""
Case: a circular dependency is configured
Expected: An error get raised
"""
self.graph.add_dependency("c", "a")
with self.assertRaises(Exception) as e:
self.graph.resolve_node()
self.assertEqual(e.exception.args[0] % e.exception.args[1:],
"Circular dependency c > a")
def test_subset(self):
"""
Case: A sub-set of the nodes get resolved
Expected: Only the given nodes and their dependencies get returned
"""
flat_list = self.graph.resolve_nodes(["b", "c"])
self.assertEqual(flat_list, ["d", "e", "c", "b"])
def test_error_missing_dependency(self):
"""
Case: A dependency is required which is not available
Expected: A proper error is returned
"""
with self.assertRaises(KeyError) as e:
self.graph.add_dependency("c", "x")
self.assertEqual(
e.exception.args[0] % e.exception.args[1:],
'Dependency "x" required for "c" but is not set.',
)
class GraphTestCase(TestCase):
def setUp(self):
"""
Setup a graph with the following dependencies
a -> d, b
b -> c, e
c -> d, e
d ->
e ->
"""
self.graph = Graph()
self.graph.add_node('a')
self.graph.add_node('b')
self.graph.add_node('c')
self.graph.add_node('d')
self.graph.add_node('e')
self.graph.add_dependency('a', 'd')
self.graph.add_dependency('a', 'b')
self.graph.add_dependency('b', 'c')
self.graph.add_dependency('b', 'e')
self.graph.add_dependency('c', 'd')
self.graph.add_dependency('c', 'e')
def test_resolve_node(self):
"""
Case: a node get resolved
Expected: The dependencies of that node get returned first
"""
flat_list = self.graph.resolve_node('c')
self.assertListEqual(flat_list, ['d', 'e', 'c'])
def test_resolve_node_without_start(self):
"""
Case: Call resolve_node without parameters
Expected: All dependencies should be returned in correct order.
"""
flat_list = self.graph.resolve_node()
self.assertListEqual(flat_list, ['d', 'e', 'c', 'b', 'a'])
def test_iterator(self):
"""
Case: Iterate through the graph
Expected: the dependent nodes get returned first
"""
flat_list = [item for item in self.graph]
self.assertListEqual(flat_list, ['d', 'e', 'c', 'b', 'a'])
def test_circular_dependency(self):
"""
Case: a circular dependency is configured
Expected: An error get raised
"""
self.graph.add_dependency('c', 'a')
with self.assertRaises(Exception) as e:
self.graph.resolve_node()
self.assertEqual(e.exception.args[0] % e.exception.args[1:],
'Circular dependency c > a')
def test_subset(self):
"""
Case: A sub-set of the nodes get resolved
Expected: Only the given nodes and their dependencies get returned
"""
flat_list = self.graph.resolve_nodes(['b', 'c'])
self.assertEqual(flat_list, ['d', 'e', 'c', 'b'])
def test_error_missing_dependency(self):
"""
Case: A dependency is required which is not available
Expected: A proper error is returned
"""
with self.assertRaises(KeyError) as e:
self.graph.add_dependency('c', 'x')
self.assertEqual(e.exception.args[0] % e.exception.args[1:],
'Dependency "x" required for "c" but is not set.')