fixing style errors

rapidsai · Mar 11, 2024 · 118fbec · 118fbec
1 parent 9621e05
commit 118fbec
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 9 deletions.
diff --git a/docs/cugraph/source/basics/nx_transition.rst b/docs/cugraph/source/basics/nx_transition.rst
@@ -1,5 +1,5 @@
 **************************************
-NetworkX by calling cuGraph Algorithms 
+NetworkX by calling cuGraph Algorithms
 **************************************
 
 
@@ -24,7 +24,7 @@ Rather than updating all of your existing code, simply update the calls to
 graph algorithms by replacing the module name.  This allows all the complicated
 ETL code to be unchanged while still seeing significate performance
 improvements. Again this will be deprecated since networkX dispatching to nx_cugraph
-has many advantages. 
+has many advantages.
 
 improvements.
 
@@ -155,8 +155,8 @@ Graph Building
 ##############
 
 The biggest difference between NetworkX and cuGraph is with how Graph objects
-are built.  NetworkX, for the most part, stores graph data in a dictionary.
-That structure allows easy insertion of new records.    Consider the following
+are built. NetworkX, for the most part, stores graph data in a dictionary.
+That structure allows easy insertion of new records. Consider the following
 code for building a NetworkX Graph::
 
     # Read the node data

diff --git a/docs/cugraph/source/nx_cugraph/nx_cugraph.md b/docs/cugraph/source/nx_cugraph/nx_cugraph.md
@@ -28,7 +28,7 @@ Each chart has three measurements.
 
 
 The following algorithms are supported and automatically dispatched to nx-cuGraph for acceleration.
- 
+
 #### Algorithms
 ```
 bipartite
@@ -164,7 +164,4 @@ social
 convert_matrix
  ├─ from_pandas_edgelist
  └─ from_scipy_sparse_array
-```
-
-
-
+```