Style fix

rapidsai · Jun 4, 2024 · 206232c · 206232c
1 parent 4a44f2f
commit 206232c
Show file tree

Hide file tree

Showing 5 changed files with 9 additions and 7 deletions.
diff --git a/python/cugraph/cugraph/dask/structure/mg_property_graph.py b/python/cugraph/cugraph/dask/structure/mg_property_graph.py
@@ -1,4 +1,4 @@
-# Copyright (c) 2021-2023, NVIDIA CORPORATION.
+# Copyright (c) 2021-2024, NVIDIA CORPORATION.
 # Licensed under the Apache License, Version 2.0 (the "License");
 # you may not use this file except in compliance with the License.
 # You may obtain a copy of the License at
@@ -1123,7 +1123,9 @@ def fillna_edges(self, val=0):
             Series is passed, the index or keys are the columns to fill
             and the values are the fill value for the corresponding column.
         """
-        self.__edge_prop_dataframe['val'] = self.__edge_prop_dataframe['val'].fillna(val).persist()
+        self.__edge_prop_dataframe["val"] = (
+            self.__edge_prop_dataframe["val"].fillna(val).persist()
+        )
 
     def select_vertices(self, expr, from_previous_selection=None):
         raise NotImplementedError

diff --git a/python/cugraph/cugraph/tests/core/test_core_number_mg.py b/python/cugraph/cugraph/tests/core/test_core_number_mg.py
@@ -70,7 +70,7 @@ def test_sg_core_number(dask_client, dataset, degree_type, benchmark):
 @pytest.mark.parametrize("dataset", DATASETS)
 @pytest.mark.parametrize("degree_type", DEGREE_TYPE)
 def test_core_number(dask_client, dataset, degree_type, benchmark):
-    dataset.get_dask_edgelist(download=True) # reload with MG edgelist
+    dataset.get_dask_edgelist(download=True)  # reload with MG edgelist
     dg = dataset.get_dask_graph(create_using=cugraph.Graph(directed=False))
 
     result_core_number = benchmark(dcg.core_number, dg, degree_type)

diff --git a/python/cugraph/cugraph/tests/core/test_k_core_mg.py b/python/cugraph/cugraph/tests/core/test_k_core_mg.py
@@ -106,7 +106,7 @@ def test_dask_mg_k_core(dask_client, dataset, core_number, degree_type, benchmar
     expected_k_core_results, core_number = get_sg_results(
         dataset, core_number, degree_type
     )
-    dataset.get_dask_edgelist() # reload with MG edgelist
+    dataset.get_dask_edgelist()  # reload with MG edgelist
     dg = dataset.get_dask_graph(create_using=cugraph.Graph(directed=False))
     k_core_results = benchmark(dcg.k_core, dg, core_number=core_number)
     k_core_results = (
@@ -124,7 +124,7 @@ def test_dask_mg_k_core(dask_client, dataset, core_number, degree_type, benchmar
 @pytest.mark.mg
 def test_dask_mg_k_core_invalid_input(dask_client):
     dataset = DATASETS[0]
-    dataset.get_dask_edgelist(download=True) # reload with MG edgelist
+    dataset.get_dask_edgelist(download=True)  # reload with MG edgelist
     dg = dataset.get_dask_graph(create_using=cugraph.Graph(directed=True))
 
     with pytest.raises(ValueError):

diff --git a/python/cugraph/cugraph/tests/data_store/test_property_graph_mg.py b/python/cugraph/cugraph/tests/data_store/test_property_graph_mg.py
@@ -1042,7 +1042,7 @@ def test_add_data_noncontiguous(dask_client, set_index):
     for edge_type in ["cat", "dog", "pig"]:
         cur_df = df[df.edge_type == edge_type]
         if set_index:
-            cur_df['ind_vertex'] = cur_df['vertex']
+            cur_df["ind_vertex"] = cur_df["vertex"]
             cur_df = cur_df.set_index("ind_vertex")
         pG.add_vertex_data(cur_df, vertex_col_name="vertex", type_name=edge_type)
     for edge_type in ["cat", "dog", "pig"]:

diff --git a/python/cugraph/cugraph/tests/utils/test_replication_mg.py b/python/cugraph/cugraph/tests/utils/test_replication_mg.py
@@ -1,4 +1,4 @@
-# Copyright (c) 2020-2023, NVIDIA CORPORATION.
+# Copyright (c) 2020-2024, NVIDIA CORPORATION.
 # Licensed under the Apache License, Version 2.0 (the "License");
 # you may not use this file except in compliance with the License.
 # You may obtain a copy of the License at