From afd629f37cff4cb12bedae9518a1c7a47e1944f8 Mon Sep 17 00:00:00 2001 From: Jake-Moss Date: Fri, 15 Dec 2023 16:58:49 +1000 Subject: [PATCH] Style --- tests/aequilibrae/paths/test_graph.py | 1 - .../paths/test_transit_graph_builder.py | 16 ++++++++++++---- 2 files changed, 12 insertions(+), 5 deletions(-) diff --git a/tests/aequilibrae/paths/test_graph.py b/tests/aequilibrae/paths/test_graph.py index 296bdb774..3077047d6 100644 --- 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 index ea82e65f5..59db26f03 100644 --- 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"]),