fix style

jnke2016 · Oct 2, 2024 · ec7da8d · ec7da8d
1 parent 97472cd
commit ec7da8d
Show file tree

Hide file tree

Showing 3 changed files with 8 additions and 8 deletions.
diff --git a/python/cugraph/cugraph/structure/graph_implementation/simpleGraph.py b/python/cugraph/cugraph/structure/graph_implementation/simpleGraph.py
@@ -1352,12 +1352,14 @@ def has_edge(self, u, v):
                 simpleGraphImpl.srcCol,
                 simpleGraphImpl.dstCol,
                 simpleGraphImpl.edgeWeightCol,
-                symmetrize=not self.properties.directed
+                symmetrize=not self.properties.directed,
             )
         else:
             source_col, dest_col = symmetrize_df(
-                df, simpleGraphImpl.srcCol, simpleGraphImpl.dstCol,
-                symmetrize=not self.properties.directed
+                df,
+                simpleGraphImpl.srcCol,
+                simpleGraphImpl.dstCol,
+                symmetrize=not self.properties.directed,
             )
             value_col = None
 

diff --git a/python/cugraph/cugraph/tests/sampling/test_random_walks_mg.py b/python/cugraph/cugraph/tests/sampling/test_random_walks_mg.py
@@ -210,8 +210,7 @@ def test_dask_mg_random_walks(dask_client, input_graph):
 
     # FIXME: leverages the deprecated symmetrize call
     source_col, dest_col, value_col = symmetrize(
-        df_G, "src", "dst", "value",
-        symmetrize=not input_graph.is_directed()
+        df_G, "src", "dst", "value", symmetrize=not input_graph.is_directed()
     )
 
     df = cudf.DataFrame()

diff --git a/python/cugraph/cugraph/tests/sampling/test_uniform_neighbor_sample.py b/python/cugraph/cugraph/tests/sampling/test_uniform_neighbor_sample.py
@@ -247,8 +247,7 @@ def test_uniform_neighbor_sample_tree(directed):
 
     # FIXME: Uses the deprecated implementation of symmetrize.
     source_col, dest_col, value_col = symmetrize(
-        G.edgelist.edgelist_df, "src", "dst", "weights",
-        symmetrize=not G.is_directed()
+        G.edgelist.edgelist_df, "src", "dst", "weights", symmetrize=not G.is_directed()
     )
 
     input_df = cudf.DataFrame()
@@ -269,7 +268,7 @@ def test_uniform_neighbor_sample_tree(directed):
     # Retrieve the input dataframe.
     # input_df != df if 'directed = False' because df will be symmetrized
     # internally.
-    #input_df = G.edgelist.edgelist_df
+    # input_df = G.edgelist.edgelist_df
 
     # TODO: Incomplete, include more testing for tree graph as well as
     # for larger graphs