Ejemplo n.º 1
0
    def test_minimal_graph_construction_root_children(self):
        root_node = simple_graph.build_graph({'a': ['b'], 'b': ['c']}, 'a')

        children_values = []
        for child in root_node.children():
            children_values.append(child.get_data())

        self.assertEqual(children_values, ['b'])
Ejemplo n.º 2
0
    def test_graph_construction_root_data(self):
        root_node = simple_graph.build_graph(
            {
                'a': ['b', 'c'],
                'b': ['d', 'e', 'f'],
                'c': ['g'],
                'g': ['h']
            }, 'a')

        self.assertEqual(root_node.get_data(), "a")
Ejemplo n.º 3
0
    def test_look_deep_for_nonexistent_node(self):

        root_node = simple_graph.build_graph(
            {
                'a': ['b', 'c'],
                'b': ['d', 'e', 'f'],
                'c': ['g'],
                'g': ['h']
            }, 'a')

        self.assertIsNone(simple_graph.look_deep_for(root_node, 'z'))
Ejemplo n.º 4
0
    def test_look_deep_for_existing_node(self):
        d = HoldenCaulfield()
        g = HoldenCaulfield()

        self.assertIsNot(d, g)

        root_node = simple_graph.build_graph(
            {
                'a': ['b', 'c'],
                'b': [d, 'e', 'f'],
                'c': [g],
                'g': ['h']
            }, 'a')

        target_node = simple_graph.look_deep_for(root_node, HoldenCaulfield())

        self.assertIs(target_node.get_data(), d)
Ejemplo n.º 5
0
 def test_None_data(self):
     with self.assertRaises(ValueError):
         simple_graph.build_graph({'a': ['b'], 'b': [None]}, 'a')
Ejemplo n.º 6
0
    def test_minimal_graph_construction_root_data(self):
        root_node = simple_graph.build_graph({'a': ['b'], 'b': ['c']}, 'a')

        self.assertEqual(root_node.get_data(), "a")