added differentiated tests for clearing directed and undirected graph

graphi_unittests/types_unittests/test_adjacency_graph.py

@@ -227,7 +227,7 @@ def test_update(self):
         self.assertIn(5, graph)
         self.assertIn(6, graph)
 
-    def test_clear(self):
+    def test_clear_undirected(self):
         graph = Undirected(self.graph_cls({
             1: {2: 1, 3: 1, 4: 1},
             2: {1: 1},
@@ -238,6 +238,17 @@ def test_clear(self):
         graph.clear()
         self.assertEquals(len(graph), 0)
 
+    def test_clear_directed(self):
+        graph = self.graph_cls({
+            1: {2: 1, 3: 1, 4: 1},
+            2: {1: 1},
+            3: {1: 1},
+            4: {1: 1}
+        })
+        self.assertEquals(len(graph), 4)
+        graph.clear()
+        self.assertEquals(len(graph), 0)
+
     def test_edge_view_undirected(self):
         graph = Undirected(self.graph_cls({1, 2, 3, 4}))
         nodes = [2, 3, 4]
@@ -260,7 +271,7 @@ def test_edge_view_undirected(self):
             None in edge_view
 
     def test_edge_view_directed(self):
-        graph = self.graph_cls({1, 2, 3, 4, 5}, undirected=False)
+        graph = self.graph_cls({1, 2, 3, 4, 5})
         nodes = [2, 3, 4]
         for node in nodes:
             graph[1:node] = 1
@@ -291,7 +302,7 @@ def test_value_view_undirected(self):
         self.assertEqual(len(nodes), len(value_view), "The number of values should be half for undirected graphs")
 
     def test_value_view_directed(self):
-        graph = self.graph_cls({1, 2, 3, 4}, undirected=False)
+        graph = self.graph_cls({1, 2, 3, 4})
         nodes = [2, 3, 4]
         for value, node in enumerate(nodes):
             graph[1:node] = value