From acb3add62e67d8357649352e81e3179416ee81ff Mon Sep 17 00:00:00 2001
From: Rick Ratzel <3039903+rlratzel@users.noreply.github.com>
Date: Thu, 1 Feb 2024 18:46:22 -0600
Subject: [PATCH 1/2] Removes the `networkx_algorithm` decorator to all SCC
 functions to disable dispatching to them (#4120)

The current cugraph `strongly_connected_components` is a legacy implementation with known issues, and in most cases should not be used until the cugraph team can provide an update.

This PR removes the `networkx_algorithm` decorator from all SCC functions to disable dispatching.  Users can still run the SCC functions here by accessing them directly from `nx_cugraph`:

```python
>>> import nx_cugraph as nxcg
>>> nxcg.strongly_connected_components(...)
```

Tested by running the `nx_cugraph` tests (`pytest nx_cugraph/tests`) and the NetworkX tests (`run_nx_tests.sh`)

_Note: using the "non-breaking" label since this API was only present in nightlies and never released._

Authors:
  - Rick Ratzel (https://github.com/rlratzel)
  - Brad Rees (https://github.com/BradReesWork)

Approvers:
  - Erik Welch (https://github.com/eriknw)

URL: https://github.com/rapidsai/cugraph/pull/4120
---
 python/nx-cugraph/_nx_cugraph/__init__.py     |  9 +++----
 .../components/strongly_connected.py          | 24 ++++++++++++-------
 python/nx-cugraph/nx_cugraph/interface.py     | 12 ++++++----
 3 files changed, 28 insertions(+), 17 deletions(-)

diff --git a/python/nx-cugraph/_nx_cugraph/__init__.py b/python/nx-cugraph/_nx_cugraph/__init__.py
index 2f283aa153c..8b5c87a63f9 100644
--- a/python/nx-cugraph/_nx_cugraph/__init__.py
+++ b/python/nx-cugraph/_nx_cugraph/__init__.py
@@ -12,7 +12,11 @@
 # limitations under the License.
 """Tell NetworkX about the cugraph backend. This file can update itself:
 
-$ make plugin-info  # Recommended method for development
+$ make plugin-info
+
+or
+
+$ make all  # Recommended - runs 'plugin-info' followed by 'lint'
 
 or
 
@@ -78,7 +82,6 @@
         "is_connected",
         "is_forest",
         "is_isolate",
-        "is_strongly_connected",
         "is_tree",
         "is_weakly_connected",
         "isolates",
@@ -96,7 +99,6 @@
         "number_connected_components",
         "number_of_isolates",
         "number_of_selfloops",
-        "number_strongly_connected_components",
         "number_weakly_connected_components",
         "octahedral_graph",
         "out_degree_centrality",
@@ -111,7 +113,6 @@
         "single_source_shortest_path_length",
         "single_target_shortest_path_length",
         "star_graph",
-        "strongly_connected_components",
         "tadpole_graph",
         "tetrahedral_graph",
         "transitivity",
diff --git a/python/nx-cugraph/nx_cugraph/algorithms/components/strongly_connected.py b/python/nx-cugraph/nx_cugraph/algorithms/components/strongly_connected.py
index d1713129703..a63b3237dfc 100644
--- a/python/nx-cugraph/nx_cugraph/algorithms/components/strongly_connected.py
+++ b/python/nx-cugraph/nx_cugraph/algorithms/components/strongly_connected.py
@@ -15,12 +15,7 @@
 import pylibcugraph as plc
 
 from nx_cugraph.convert import _to_directed_graph
-from nx_cugraph.utils import (
-    _groupby,
-    index_dtype,
-    networkx_algorithm,
-    not_implemented_for,
-)
+from nx_cugraph.utils import _groupby, index_dtype, not_implemented_for
 
 __all__ = [
     "number_strongly_connected_components",
@@ -50,8 +45,19 @@ def _strongly_connected_components(G):
     return labels
 
 
+# The networkx_algorithm decorator is (temporarily) removed to disable
+# dispatching for this function. The current cugraph
+# strongly_connected_components is a legacy implementation with known issues,
+# and in most cases should not be used until the cugraph team can provide an
+# update.
+#
+# Users can still call this via the nx_cugraph module directly:
+# >>> import nx_cugraph as nxcg
+# >>> nxcg.strongly_connected_components(...)
+
+
 @not_implemented_for("undirected")
-@networkx_algorithm(version_added="24.02", _plc="strongly_connected_components")
+# @networkx_algorithm(version_added="24.02", _plc="strongly_connected_components")
 def strongly_connected_components(G):
     G = _to_directed_graph(G)
     if G.src_indices.size == 0:
@@ -62,7 +68,7 @@ def strongly_connected_components(G):
 
 
 @not_implemented_for("undirected")
-@networkx_algorithm(version_added="24.02", _plc="strongly_connected_components")
+# @networkx_algorithm(version_added="24.02", _plc="strongly_connected_components")
 def number_strongly_connected_components(G):
     G = _to_directed_graph(G)
     if G.src_indices.size == 0:
@@ -72,7 +78,7 @@ def number_strongly_connected_components(G):
 
 
 @not_implemented_for("undirected")
-@networkx_algorithm(version_added="24.02", _plc="strongly_connected_components")
+# @networkx_algorithm(version_added="24.02", _plc="strongly_connected_components")
 def is_strongly_connected(G):
     G = _to_directed_graph(G)
     if len(G) == 0:
diff --git a/python/nx-cugraph/nx_cugraph/interface.py b/python/nx-cugraph/nx_cugraph/interface.py
index a57074aabb0..46ea5831b0b 100644
--- a/python/nx-cugraph/nx_cugraph/interface.py
+++ b/python/nx-cugraph/nx_cugraph/interface.py
@@ -69,10 +69,14 @@ def key(testpath):
         no_string_dtype = "string edge values not currently supported"
 
         xfail = {
-            key(
-                "test_strongly_connected.py:"
-                "TestStronglyConnected.test_condensation_mapping_and_members"
-            ): "Strongly connected groups in different iteration order",
+            # This is removed while strongly_connected_components() is not
+            # dispatchable. See algorithms/components/strongly_connected.py for
+            # details.
+            #
+            # key(
+            #     "test_strongly_connected.py:"
+            #     "TestStronglyConnected.test_condensation_mapping_and_members"
+            # ): "Strongly connected groups in different iteration order",
         }
 
         from packaging.version import parse

From 581d3562496c5c9c0b094f3cfd6f5631154e3739 Mon Sep 17 00:00:00 2001
From: Don Acosta <97529984+acostadon@users.noreply.github.com>
Date: Thu, 1 Feb 2024 19:58:16 -0500
Subject: [PATCH 2/2] corrected links in C API and added groups for support
 functions (#4131)

Fixes broken links in C API docs in Traversal, Sampling and Community algorithm sections

resolves issue #4116

Authors:
  - Don Acosta (https://github.com/acostadon)
  - Brad Rees (https://github.com/BradReesWork)

Approvers:
  - Brad Rees (https://github.com/BradReesWork)

URL: https://github.com/rapidsai/cugraph/pull/4131
---
 cpp/include/cugraph_c/community_algorithms.h  | 14 ++++---
 cpp/include/cugraph_c/sampling_algorithms.h   | 37 ++++++++++++++++---
 cpp/include/cugraph_c/traversal_algorithms.h  | 13 ++++---
 .../source/api_docs/cugraph_c/community.rst   | 10 +----
 .../source/api_docs/cugraph_c/labeling.rst    |  4 +-
 .../source/api_docs/cugraph_c/sampling.rst    | 13 +++----
 .../source/api_docs/cugraph_c/similarity.rst  |  4 +-
 .../source/api_docs/cugraph_c/traversal.rst   |  4 +-
 8 files changed, 59 insertions(+), 40 deletions(-)

diff --git a/cpp/include/cugraph_c/community_algorithms.h b/cpp/include/cugraph_c/community_algorithms.h
index feab15c7eeb..e8a71a40162 100644
--- a/cpp/include/cugraph_c/community_algorithms.h
+++ b/cpp/include/cugraph_c/community_algorithms.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022-2023, NVIDIA CORPORATION.
+ * Copyright (c) 2022-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.
@@ -23,7 +23,6 @@
 #include <cugraph_c/resource_handle.h>
 
 /** @defgroup community Community algorithms
- *  @{
  */
 
 #ifdef __cplusplus
@@ -60,18 +59,21 @@ cugraph_error_code_t cugraph_triangle_count(const cugraph_resource_handle_t* han
                                             cugraph_error_t** error);
 
 /**
+ * @ingroup community
  * @brief     Get triangle counting vertices
  */
 cugraph_type_erased_device_array_view_t* cugraph_triangle_count_result_get_vertices(
   cugraph_triangle_count_result_t* result);
 
 /**
+ * @ingroup community
  * @brief     Get triangle counting counts
  */
 cugraph_type_erased_device_array_view_t* cugraph_triangle_count_result_get_counts(
   cugraph_triangle_count_result_t* result);
 
 /**
+ * @ingroup community
  * @brief     Free a triangle count result
  *
  * @param [in] result     The result from a sampling algorithm
@@ -147,24 +149,28 @@ cugraph_error_code_t cugraph_leiden(const cugraph_resource_handle_t* handle,
                                     cugraph_error_t** error);
 
 /**
+ * @ingroup community
  * @brief     Get hierarchical clustering vertices
  */
 cugraph_type_erased_device_array_view_t* cugraph_hierarchical_clustering_result_get_vertices(
   cugraph_hierarchical_clustering_result_t* result);
 
 /**
+ * @ingroup community
  * @brief     Get hierarchical clustering clusters
  */
 cugraph_type_erased_device_array_view_t* cugraph_hierarchical_clustering_result_get_clusters(
   cugraph_hierarchical_clustering_result_t* result);
 
 /**
+ * @ingroup community
  * @brief     Get modularity
  */
 double cugraph_hierarchical_clustering_result_get_modularity(
   cugraph_hierarchical_clustering_result_t* result);
 
 /**
+ * @ingroup community
  * @brief     Free a hierarchical clustering result
  *
  * @param [in] result     The result from a sampling algorithm
@@ -423,7 +429,3 @@ void cugraph_clustering_result_free(cugraph_clustering_result_t* result);
 #ifdef __cplusplus
 }
 #endif
-
-/**
- *  @}
- */
diff --git a/cpp/include/cugraph_c/sampling_algorithms.h b/cpp/include/cugraph_c/sampling_algorithms.h
index 782bb5a3790..5760d2098aa 100644
--- a/cpp/include/cugraph_c/sampling_algorithms.h
+++ b/cpp/include/cugraph_c/sampling_algorithms.h
@@ -1,5 +1,5 @@
 /*
- * 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.
@@ -22,7 +22,6 @@
 #include <cugraph_c/resource_handle.h>
 
 /** @defgroup samplingC Sampling algorithms
- *  @{
  */
 
 #ifdef __cplusplus
@@ -134,6 +133,7 @@ cugraph_error_code_t cugraph_node2vec(const cugraph_resource_handle_t* handle,
                                       cugraph_error_t** error);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the max path length from random walk result
  *
  * @param [in]   result   The result from random walks
@@ -145,6 +145,7 @@ size_t cugraph_random_walk_result_get_max_path_length(cugraph_random_walk_result
 //         difference at the moment is that RW results contain weights
 //         and extract_paths results don't.  But that's probably wrong.
 /**
+ * @ingroup samplingC
  * @brief     Get the matrix (row major order) of vertices in the paths
  *
  * @param [in]   result   The result from a random walk algorithm
@@ -154,6 +155,7 @@ cugraph_type_erased_device_array_view_t* cugraph_random_walk_result_get_paths(
   cugraph_random_walk_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the matrix (row major order) of edge weights in the paths
  *
  * @param [in]   result   The result from a random walk algorithm
@@ -163,6 +165,7 @@ cugraph_type_erased_device_array_view_t* cugraph_random_walk_result_get_weights(
   cugraph_random_walk_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     If the random walk result is compressed, get the path sizes
  * @deprecated This call will no longer be relevant once the new node2vec are called
  *
@@ -173,6 +176,7 @@ cugraph_type_erased_device_array_view_t* cugraph_random_walk_result_get_path_siz
   cugraph_random_walk_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Free random walks result
  *
  * @param [in]   result   The result from random walks
@@ -220,6 +224,7 @@ typedef enum cugraph_compression_type_t {
 } cugraph_compression_type_t;
 
 /**
+ * @ingroup samplingC
  * @brief   Create sampling options object
  *
  * All sampling options set to FALSE
@@ -232,6 +237,7 @@ cugraph_error_code_t cugraph_sampling_options_create(cugraph_sampling_options_t*
                                                      cugraph_error_t** error);
 
 /**
+ * @ingroup samplingC
  * @brief   Set flag to renumber results
  *
  * @param options - opaque pointer to the sampling options
@@ -240,6 +246,7 @@ cugraph_error_code_t cugraph_sampling_options_create(cugraph_sampling_options_t*
 void cugraph_sampling_set_renumber_results(cugraph_sampling_options_t* options, bool_t value);
 
 /**
+ * @ingroup samplingC
  * @brief   Set whether to compress per-hop (True) or globally (False)
  *
  * @param options - opaque pointer to the sampling options
@@ -248,6 +255,7 @@ void cugraph_sampling_set_renumber_results(cugraph_sampling_options_t* options,
 void cugraph_sampling_set_compress_per_hop(cugraph_sampling_options_t* options, bool_t value);
 
 /**
+ * @ingroup samplingC
  * @brief   Set flag to sample with_replacement
  *
  * @param options - opaque pointer to the sampling options
@@ -256,6 +264,7 @@ void cugraph_sampling_set_compress_per_hop(cugraph_sampling_options_t* options,
 void cugraph_sampling_set_with_replacement(cugraph_sampling_options_t* options, bool_t value);
 
 /**
+ * @ingroup samplingC
  * @brief   Set flag to sample return_hops
  *
  * @param options - opaque pointer to the sampling options
@@ -264,6 +273,7 @@ void cugraph_sampling_set_with_replacement(cugraph_sampling_options_t* options,
 void cugraph_sampling_set_return_hops(cugraph_sampling_options_t* options, bool_t value);
 
 /**
+ * @ingroup samplingC
  * @brief   Set compression type
  *
  * @param options - opaque pointer to the sampling options
@@ -273,6 +283,7 @@ void cugraph_sampling_set_compression_type(cugraph_sampling_options_t* options,
                                            cugraph_compression_type_t value);
 
 /**
+ * @ingroup samplingC
  * @brief   Set prior sources behavior
  *
  * @param options - opaque pointer to the sampling options
@@ -282,6 +293,7 @@ void cugraph_sampling_set_prior_sources_behavior(cugraph_sampling_options_t* opt
                                                  cugraph_prior_sources_behavior_t value);
 
 /**
+ * @ingroup samplingC
  * @brief   Set flag to sample dedupe_sources prior to sampling
  *
  * @param options - opaque pointer to the sampling options
@@ -290,6 +302,7 @@ void cugraph_sampling_set_prior_sources_behavior(cugraph_sampling_options_t* opt
 void cugraph_sampling_set_dedupe_sources(cugraph_sampling_options_t* options, bool_t value);
 
 /**
+ * @ingroup samplingC
  * @brief     Free sampling options object
  *
  * @param [in]   options   Opaque pointer to sampling object
@@ -369,6 +382,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_destinations(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the major vertices from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -378,6 +392,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_majors(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the minor vertices from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -387,6 +402,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_minors(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the major offsets from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -396,6 +412,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_major_offsets
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the start labels from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -405,6 +422,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_start_labels(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the edge_id from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -414,6 +432,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_edge_id(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the edge_type from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -423,6 +442,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_edge_type(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the edge_weight from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -432,6 +452,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_edge_weight(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the hop from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -441,6 +462,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_hop(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the label-hop offsets from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -450,6 +472,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_label_hop_off
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the index from the sampling algorithm result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -469,6 +492,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_offsets(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the renumber map
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -478,6 +502,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_renumber_map(
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Get the renumber map offsets
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -487,6 +512,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_renumber_map_
   const cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Free a sampling result
  *
  * @param [in]   result   The result from a sampling algorithm
@@ -494,6 +520,7 @@ cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_renumber_map_
 void cugraph_sample_result_free(cugraph_sample_result_t* result);
 
 /**
+ * @ingroup samplingC
  * @brief     Create a sampling result (testing API)
  *
  * @param [in]   handle         Handle for accessing resources
@@ -524,6 +551,7 @@ cugraph_error_code_t cugraph_test_sample_result_create(
   cugraph_error_t** error);
 
 /**
+ * @ingroup samplingC
  * @brief     Create a sampling result (testing API)
  *
  * @param [in]   handle         Handle for accessing resources
@@ -554,6 +582,7 @@ cugraph_error_code_t cugraph_test_uniform_neighborhood_sample_result_create(
   cugraph_error_t** error);
 
 /**
+ * @ingroup samplingC
  * @brief Select random vertices from the graph
  *
  * @param [in]      handle        Handle for accessing resources
@@ -576,7 +605,3 @@ cugraph_error_code_t cugraph_select_random_vertices(const cugraph_resource_handl
 #ifdef __cplusplus
 }
 #endif
-
-/**
- *  @}
- */
diff --git a/cpp/include/cugraph_c/traversal_algorithms.h b/cpp/include/cugraph_c/traversal_algorithms.h
index 8959366ac17..e25fa167e43 100644
--- a/cpp/include/cugraph_c/traversal_algorithms.h
+++ b/cpp/include/cugraph_c/traversal_algorithms.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021-2022, 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.
@@ -22,7 +22,6 @@
 
 /** @defgroup traversal Traversal Algorithms
  *  @ingroup c_api
- *  @{
  */
 
 #ifdef __cplusplus
@@ -40,6 +39,7 @@ typedef struct {
 } cugraph_paths_result_t;
 
 /**
+ * @ingroup traversal
  * @brief     Get the vertex ids from the paths result
  *
  * @param [in]   result   The result from bfs or sssp
@@ -49,6 +49,7 @@ cugraph_type_erased_device_array_view_t* cugraph_paths_result_get_vertices(
   cugraph_paths_result_t* result);
 
 /**
+ * @ingroup traversal
  * @brief     Get the distances from the paths result
  *
  * @param [in]   result   The result from bfs or sssp
@@ -58,6 +59,7 @@ cugraph_type_erased_device_array_view_t* cugraph_paths_result_get_distances(
   cugraph_paths_result_t* result);
 
 /**
+ * @ingroup traversal
  * @brief     Get the predecessors from the paths result
  *
  * @param [in]   result   The result from bfs or sssp
@@ -69,6 +71,7 @@ cugraph_type_erased_device_array_view_t* cugraph_paths_result_get_predecessors(
   cugraph_paths_result_t* result);
 
 /**
+ * @ingroup traversal
  * @brief     Free paths result
  *
  * @param [in]   result   The result from bfs or sssp
@@ -188,6 +191,7 @@ cugraph_error_code_t cugraph_extract_paths(
 size_t cugraph_extract_paths_result_get_max_path_length(cugraph_extract_paths_result_t* result);
 
 /**
+ * @ingroup traversal
  * @brief     Get the matrix (row major order) of paths
  *
  * @param [in]   result   The result from extract_paths
@@ -197,6 +201,7 @@ cugraph_type_erased_device_array_view_t* cugraph_extract_paths_result_get_paths(
   cugraph_extract_paths_result_t* result);
 
 /**
+ * @ingroup traversal
  * @brief     Free extract_paths result
  *
  * @param [in]   result   The result from extract_paths
@@ -206,7 +211,3 @@ void cugraph_extract_paths_result_free(cugraph_extract_paths_result_t* result);
 #ifdef __cplusplus
 }
 #endif
-
-/**
- *  @}
- */
diff --git a/docs/cugraph/source/api_docs/cugraph_c/community.rst b/docs/cugraph/source/api_docs/cugraph_c/community.rst
index 0bbfe365c4d..d55325720c4 100644
--- a/docs/cugraph/source/api_docs/cugraph_c/community.rst
+++ b/docs/cugraph/source/api_docs/cugraph_c/community.rst
@@ -1,12 +1,6 @@
 Community
 =========
 
-.. role:: py(code)
-   :language: c
-   :class: highlight
-
-``#include <cugraph_c/community_algorithms.h>``
-
 Triangle Counting
 -----------------
 .. doxygenfunction:: cugraph_triangle_count
@@ -45,8 +39,8 @@ Spectral Clustering - Modularity Maximization
 .. doxygenfunction:: cugraph_analyze_clustering_modularity
     :project: libcugraph
 
-Spectral Clusteriong - Edge Cut
--------------------------------
+Spectral Clustering - Edge Cut
+------------------------------
 .. doxygenfunction:: cugraph_analyze_clustering_edge_cut
     :project: libcugraph
 
diff --git a/docs/cugraph/source/api_docs/cugraph_c/labeling.rst b/docs/cugraph/source/api_docs/cugraph_c/labeling.rst
index af105ee8fc9..4ca598c0a06 100644
--- a/docs/cugraph/source/api_docs/cugraph_c/labeling.rst
+++ b/docs/cugraph/source/api_docs/cugraph_c/labeling.rst
@@ -12,8 +12,8 @@ Strongly Connected Components
 .. doxygenfunction:: cugraph_strongly_connected_components
     :project: libcugraph
 
-Support
--------
+Labeling Support Functions
+--------------------------
  .. doxygengroup:: labeling
      :project: libcugraph
      :members:
diff --git a/docs/cugraph/source/api_docs/cugraph_c/sampling.rst b/docs/cugraph/source/api_docs/cugraph_c/sampling.rst
index 21b837daf93..3d5af713c33 100644
--- a/docs/cugraph/source/api_docs/cugraph_c/sampling.rst
+++ b/docs/cugraph/source/api_docs/cugraph_c/sampling.rst
@@ -7,7 +7,7 @@ Uniform Random Walks
     :project: libcugraph
 
 Biased Random Walks
---------------------
+-------------------
 .. doxygenfunction:: cugraph_biased_random_walks
     :project: libcugraph
 
@@ -21,16 +21,13 @@ Node2Vec
 .. doxygenfunction:: cugraph_node2vec
     :project: libcugraph
 
-Uniform Neighborhood Sampling
------------------------------
-.. doxygenfunction:: cugraph_uniform_neighbor_sample_with_edge_properties
-    :project: libcugraph
-
+Uniform Neighbor Sampling
+-------------------------
 .. doxygenfunction:: cugraph_uniform_neighbor_sample
     :project: libcugraph
 
-Support
--------
+Sampling Support Functions
+--------------------------
 .. doxygengroup:: samplingC
      :project: libcugraph
      :members:
diff --git a/docs/cugraph/source/api_docs/cugraph_c/similarity.rst b/docs/cugraph/source/api_docs/cugraph_c/similarity.rst
index fba07ad206c..200ba695781 100644
--- a/docs/cugraph/source/api_docs/cugraph_c/similarity.rst
+++ b/docs/cugraph/source/api_docs/cugraph_c/similarity.rst
@@ -17,8 +17,8 @@ Overlap
 .. doxygenfunction:: cugraph_overlap_coefficients
     :project: libcugraph
 
-Support
--------
+Similarty Support Functions
+---------------------------
 .. doxygengroup:: similarity
      :project: libcugraph
      :members:
diff --git a/docs/cugraph/source/api_docs/cugraph_c/traversal.rst b/docs/cugraph/source/api_docs/cugraph_c/traversal.rst
index c90760e9e79..1578951e05f 100644
--- a/docs/cugraph/source/api_docs/cugraph_c/traversal.rst
+++ b/docs/cugraph/source/api_docs/cugraph_c/traversal.rst
@@ -22,8 +22,8 @@ Extract Max Path Length
 .. doxygenfunction:: cugraph_extract_paths_result_get_max_path_length
     :project: libcugraph
 
-Support
--------
+Traversal Support Functions
+---------------------------
 .. doxygengroup:: traversal
      :project: libcugraph
      :members: