Style

AequilibraE · Dec 15, 2023 · afd629f · afd629f
1 parent cb22e11
commit afd629f
Show file tree

Hide file tree

Showing 2 changed files with 12 additions and 5 deletions.
diff --git a/tests/aequilibrae/paths/test_graph.py b/tests/aequilibrae/paths/test_graph.py
@@ -139,4 +139,3 @@ def test_transit_graph_config(self):
 
     def test_transit_graph_od_node_mapping(self):
         pd.testing.assert_frame_equal(self.graph.od_node_mapping, self.transit_graph.od_node_mapping)
-
diff --git a/tests/aequilibrae/paths/test_transit_graph_builder.py b/tests/aequilibrae/paths/test_transit_graph_builder.py
@@ -82,7 +82,9 @@ def test_connector_methods(self):
         )
 
         nearest_neighbour_connector_count = len(graph.edges[graph.edges.link_type == "access_connector"])
-        self.assertEqual(nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "egress_connector"]))
+        self.assertEqual(
+            nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "egress_connector"])
+        )
         self.assertEqual(
             nearest_neighbour_connector_count,
             len(graph.vertices[graph.vertices.node_type == "stop"]),
@@ -96,7 +98,9 @@ def test_connector_methods(self):
             connector_method=connector_method,
         )
 
-        self.assertLessEqual(nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "access_connector"]))
+        self.assertLessEqual(
+            nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "access_connector"])
+        )
         self.assertEqual(
             len(graph.edges[graph.edges.link_type == "access_connector"]),
             len(graph.edges[graph.edges.link_type == "egress_connector"]),
@@ -122,7 +126,9 @@ def test_connector_method_without_missing(self):
         )
 
         nearest_neighbour_connector_count = len(graph.edges[graph.edges.link_type == "access_connector"])
-        self.assertEqual(nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "egress_connector"]))
+        self.assertEqual(
+            nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "egress_connector"])
+        )
         self.assertEqual(
             nearest_neighbour_connector_count,
             len(graph.vertices[graph.vertices.node_type == "stop"]),
@@ -136,7 +142,9 @@ def test_connector_method_without_missing(self):
             connector_method=connector_method,
         )
 
-        self.assertLessEqual(nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "access_connector"]))
+        self.assertLessEqual(
+            nearest_neighbour_connector_count, len(graph.edges[graph.edges.link_type == "access_connector"])
+        )
         self.assertEqual(
             len(graph.edges[graph.edges.link_type == "access_connector"]),
             len(graph.edges[graph.edges.link_type == "egress_connector"]),
Original file line number	Diff line number	Diff line change
Expand Up		@@ -139,4 +139,3 @@ def test_transit_graph_config(self):

		def test_transit_graph_od_node_mapping(self):
		pd.testing.assert_frame_equal(self.graph.od_node_mapping, self.transit_graph.od_node_mapping)