Use assertEqual instead of unecessary loop

Author: meatballs

axelrod/tests/unit/test_graph.py

@@ -94,8 +94,7 @@ def test_out_dict(self):
             2: {1: None, 3: None},
             3: {2: None}
         }
-        for key in expected_out_mapping:
-            self.assertEqual(g.out_mapping[key], expected_out_mapping[key])
+        self.assertEqual(g.out_mapping, expected_out_mapping)
 
         # Undirected graph with vertices and weighted edges
         g = graph.Graph(edges=[[1, 2, 10], [2, 3, 5]])
@@ -104,17 +103,15 @@ def test_out_dict(self):
             2: {1: 10, 3: 5},
             3: {2: 5}
         }
-        for key in expected_out_mapping:
-            self.assertEqual(g.out_mapping[key], expected_out_mapping[key])
+        self.assertEqual(g.out_mapping, expected_out_mapping)
 
         # Directed graph with vertices and weighted edges
         g = graph.Graph(edges=[[1, 2, 10], [2, 3, 5]], directed=True)
         expected_out_mapping = {
             1: {2: 10},
             2: {3: 5},
         }
-        for key in expected_out_mapping:
-            self.assertEqual(g.out_mapping[key], expected_out_mapping[key])
+        self.assertEqual(g.out_mapping, expected_out_mapping)
 
     def test_in_dict(self):
         # Undirected graph with vertices and unweighted edges
@@ -124,8 +121,7 @@ def test_in_dict(self):
             2: {1: None, 3: None},
             3: {2: None}
         }
-        for key in expected_in_mapping:
-            self.assertEqual(g.in_mapping[key], expected_in_mapping[key])
+        self.assertEqual(g.in_mapping, expected_in_mapping)
 
         # Undirected graph with vertices and weighted edges
         g = graph.Graph(edges=[[1, 2, 10], [2, 3, 5]])
@@ -134,17 +130,15 @@ def test_in_dict(self):
             2: {1: 10, 3: 5},
             3: {2: 5}
         }
-        for key in expected_in_mapping:
-            self.assertEqual(g.in_mapping[key], expected_in_mapping[key])
+        self.assertEqual(g.in_mapping, expected_in_mapping)
 
         # Directed graph with vertices and weighted edges
         g = graph.Graph(edges=[[1, 2, 10], [2, 3, 5]], directed=True)
         expected_in_mapping = {
             2: {1: 10},
             3: {2: 5}
         }
-        for key in expected_in_mapping:
-            self.assertEqual(g.in_mapping[key], expected_in_mapping[key])
+        self.assertEqual(g.in_mapping, expected_in_mapping)
 
     def test_repr(self):
         # Undirected graph with no vertices