Merge ee3b4a3 into 08ab284

cpp/CMakeLists.txt

@@ -358,6 +358,7 @@ add_library(cugraph_c SHARED
         src/c_api/sssp.cpp
         src/c_api/extract_paths.cpp
         src/c_api/random_walks.cpp
+        src/c_api/uniform_neighbor_sampling.cpp
         )
 add_library(cugraph::cugraph_c ALIAS cugraph_c)
 

cpp/include/cugraph_c/algorithms.h

@@ -314,7 +314,7 @@ cugraph_type_erased_device_array_view_t* cugraph_extract_paths_result_get_paths(
 void cugraph_extract_paths_result_free(cugraph_extract_paths_result_t* result);
 
 /**
- * @brief     Opaque extract_paths result type
+ * @brief     Opaque random walk result type
  */
 typedef struct {
   int32_t align_;
@@ -392,6 +392,93 @@ cugraph_type_erased_device_array_view_t* cugraph_random_walk_result_get_path_siz
  */
 void cugraph_random_walk_result_free(cugraph_random_walk_result_t* result);
 
+/**
+ * @brief     Opaque neighborhood sampling result type
+ */
+typedef struct {
+  int32_t align_;
+} cugraph_sample_result_t;
+
+/**
+ * @brief     Uniform Neighborhood Sampling
+ *
+ * @param [in]  handle       Handle for accessing resources
+ * @param [in]  graph        Pointer to graph.  NOTE: Graph might be modified if the storage
+ *                           needs to be transposed
+ * @param [in]  start        Device array of start vertices for the sampling
+ * @param [in]  start_label  Device array of start labels.  These labels will propagate to the
+ * results so that the result can be properly organized when the input needs to be sent back to
+ * different callers (different processes or different gpus).
+ * @param [in]  fanout       Host array defining the fan out at each step in the sampling algorithm
+ * @param [in]  without_replacement
+ *                           Boolean value.  If true selection of edges is done without
+ *                           replacement.  If false selection is done with replacement.
+ * @param [in]  result       Output from the uniform_nbr_sample call
+ * @param [out] error        Pointer to an error object storing details of any error.  Will
+ *                           be populated if error code is not CUGRAPH_SUCCESS
+ * @return error code
+ */
+cugraph_error_code_t uniform_nbr_sample(const cugraph_resource_handle_t* handle,
+                                        cugraph_graph_t* graph,
+                                        const cugraph_type_erased_device_array_view_t* start,
+                                        const cugraph_type_erased_device_array_view_t* start_label,
+                                        const cugraph_type_erased_host_array_view_t* fan_out,
+                                        bool_t without_replacement,
+                                        cugraph_sample_result_t** result,
+                                        cugraph_error_t** error);
+
+/**
+ * @brief     Get the source vertices from the sampling algorithm result
+ *
+ * @param [in]   result   The result from a sampling algorithm
+ * @return type erased array pointing to the source vertices in device memory
+ */
+cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_sources(
+  const cugraph_sample_result_t* result);
+
+/**
+ * @brief     Get the destination vertices from the sampling algorithm result
+ *
+ * @param [in]   result   The result from a sampling algorithm
+ * @return type erased array pointing to the destination vertices in device memory
+ */
+cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_destinations(
+  const cugraph_sample_result_t* result);
+
+/**
+ * @brief     Get the start labels from the sampling algorithm result
+ *
+ * @param [in]   result   The result from a sampling algorithm
+ * @return type erased array pointing to the start labels
+ */
+cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_start_labels(
+  const cugraph_sample_result_t* result);
+
+/**
+ * @brief     Get the index from the sampling algorithm result
+ *
+ * @param [in]   result   The result from a sampling algorithm
+ * @return type erased array pointing to the index
+ */
+cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_index(
+  const cugraph_sample_result_t* result);
+
+/**
+ * @brief     Get the transaction counts from the sampling algorithm result
+ *
+ * @param [in]   result   The result from a sampling algorithm
+ * @return type erased host array pointing to the counts
+ */
+cugraph_type_erased_host_array_view_t* cugraph_sample_result_get_counts(
+  const cugraph_sample_result_t* result);
+
+/**
+ * @brief     Free a sampling result
+ *
+ * @param [in]   result   The result from a sampling algorithm
+ */
+void cugraph_sample_result_free(cugraph_sample_result_t* result);
+
 #ifdef __cplusplus
 }
 #endif

cpp/src/c_api/uniform_neighbor_sampling.cpp

@@ -0,0 +1,219 @@
+/*
+ * Copyright (c) 2022, 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
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include <cugraph_c/algorithms.h>
+
+#include <c_api/abstract_functor.hpp>
+#include <c_api/graph.hpp>
+#include <c_api/utils.hpp>
+
+#include <cugraph/algorithms.hpp>
+#include <cugraph/detail/utility_wrappers.hpp>
+#include <cugraph/graph_functions.hpp>
+#include <cugraph/visitors/generic_cascaded_dispatch.hpp>
+
+#include <raft/handle.hpp>
+
+namespace cugraph {
+namespace c_api {
+
+struct cugraph_sample_result_t {
+  cugraph_type_erased_device_array_t* src_{nullptr};
+  cugraph_type_erased_device_array_t* dst_{nullptr};
+  cugraph_type_erased_device_array_t* label_{nullptr};
+  cugraph_type_erased_device_array_t* index_{nullptr};
+  cugraph_type_erased_host_array_t* count_{nullptr};
+};
+
+}  // namespace c_api
+}  // namespace cugraph
+
+namespace {
+
+#if 0
+// FIXME: ifdef this out for now.  Can't be implemented until PR 2073 is merged
+
+  struct uniform_neighbor_sampling_functor : public cugraph::c_api::abstract_functor {
+  raft::handle_t const& handle_;
+  cugraph_graph_t* graph_{nullptr};
+  cugraph_type_erased_device_array_view_t const* start_{nullptr};
+  cugraph_type_erased_device_array_view_t const* start_label_{nullptr};
+  cugraph_type_erased_host_array_view_t const* fan_out_{nullptr};
+  bool with_replacement_{false};
+  cugraph_sample_result_t* result_{nullptr};
+
+  uniform_neighbor_sampling_functor(::cugraph_resource_handle_t const* handle,
+                                    ::cugraph_graph_t* graph,
+                                    ::cugraph_type_erased_device_array_view_t const* start,
+                                    ::cugraph_type_erased_device_array_view_t const* start_label,
+                                    ::cugraph_type_erased_host_array_view_t const* fan_out,
+                                    bool without_replacement)
+    : abstract_functor(),
+      handle_(*reinterpret_cast<cugraph::c_api::cugraph_resource_handle_t const*>(handle)->handle_),
+      graph_(reinterpret_cast<cugraph::c_api::cugraph_graph_t*>(graph)),
+      start_(
+        reinterpret_cast<cugraph::c_api::cugraph_type_erased_device_array_view_t const*>(start)),
+      start_label_(reinterpret_cast<cugraph::c_api::cugraph_type_erased_device_array_view_t const*>(
+        start_label)),
+      fan_out_(reinterpret_cast<cugraph::c_api::cugraph_type_erased_host_array_view_t const*>(
+                                                                                              fan_out)),
+      without_replacement_(without_replacement)
+  {
+  }
+
+  template <typename vertex_t,
+            typename edge_t,
+            typename weight_t,
+            bool store_transposed,
+            bool multi_gpu>
+  void operator()()
+  {
+    // FIXME: Think about how to handle SG vice MG
+    if constexpr (!cugraph::is_candidate<vertex_t, edge_t, weight_t>::value) {
+      unsupported();
+    } else {
+      // uniform_nbr_sample expects store_transposed == false
+      if constexpr (store_transposed) {
+        error_code_ = cugraph::c_api::
+          transpose_storage<vertex_t, edge_t, weight_t, store_transposed, multi_gpu>(
+            handle_, graph_, error_.get());
+        if (error_code_ != CUGRAPH_SUCCESS) return;
+      }
+
+      auto graph =
+        reinterpret_cast<cugraph::graph_t<vertex_t, edge_t, weight_t, false, multi_gpu>*>(
+          graph_->graph_);
+
+      auto graph_view = graph->view();
+
+      auto number_map = reinterpret_cast<rmm::device_uvector<vertex_t>*>(graph_->number_map_);
+
+      rmm::device_uvector<vertex_t> start(start_->size_, handle_.get_stream());
+      raft::copy(start.data(), start_->as_type<vertex_t>(), start.size(), handle_.get_stream());
+
+      //
+      // Need to renumber sources
+      //
+      renumber_ext_vertices<vertex_t, multi_gpu>(handle_,
+                                                 start.data(),
+                                                 start.size(),
+                                                 number_map->data(),
+                                                 graph_view.get_local_vertex_first(),
+                                                 graph_view.get_local_vertex_last(),
+                                                 false);
+
+      // TODO:  How can I do this?
+      auto [(srcs, dsts, labels, indices), counts] = cugraph::uniform_nbr_sample(
+        handle_,
+        graph_view,
+        start.data(),
+        start_label_.as_type<label_t>(),
+        start.size(),
+        fanout_,
+        with_replacement_);
+
+      result_ = new cugraph_sample_result_t{
+        new cugraph_type_erased_device_array_t(srcs, graph_->vertex_type_),
+        new cugraph_type_erased_device_array_t(dsts, graph_->weight_type_),
+        new cugraph_type_erased_device_array_t(labels,  label_type),
+        new cugraph_type_erased_device_array_t(indices, graph_->edge_type_),
+        new cugraph_type_erased_host_array_t(counts, graph_->vertex_type_)};
+    }
+  }
+};
+#else
+
+struct uniform_neighbor_sampling_functor : public cugraph::c_api::abstract_functor {
+  cugraph::c_api::cugraph_sample_result_t* result_{nullptr};
+
+  uniform_neighbor_sampling_functor() : abstract_functor() {}
+
+  template <typename vertex_t,
+            typename edge_t,
+            typename weight_t,
+            bool store_transposed,
+            bool multi_gpu>
+  void operator()()
+  {
+    unsupported();
+  }
+};
+#endif
+
+}  // namespace
+
+extern "C" cugraph_error_code_t uniform_nbr_sample(
+  const cugraph_resource_handle_t* handle,
+  cugraph_graph_t* graph,
+  const cugraph_type_erased_device_array_view_t* start,
+  const cugraph_type_erased_device_array_view_t* start_labels,
+  const cugraph_type_erased_host_array_view_t* fan_out,
+  bool_t without_replacement,
+  cugraph_sample_result_t** result,
+  cugraph_error_t** error)
+{
+  uniform_neighbor_sampling_functor functor;
+
+  return cugraph::c_api::run_algorithm(graph, functor, result, error);
+}
+
+extern "C" cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_sources(
+  const cugraph_sample_result_t* result)
+{
+  auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_sample_result_t const*>(result);
+  return reinterpret_cast<cugraph_type_erased_device_array_view_t*>(internal_pointer->src_->view());
+}
+
+extern "C" cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_destinations(
+  const cugraph_sample_result_t* result)
+{
+  auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_sample_result_t const*>(result);
+  return reinterpret_cast<cugraph_type_erased_device_array_view_t*>(internal_pointer->dst_->view());
+}
+
+extern "C" cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_start_labels(
+  const cugraph_sample_result_t* result)
+{
+  auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_sample_result_t const*>(result);
+  return reinterpret_cast<cugraph_type_erased_device_array_view_t*>(
+    internal_pointer->label_->view());
+}
+
+extern "C" cugraph_type_erased_device_array_view_t* cugraph_sample_result_get_index(
+  const cugraph_sample_result_t* result)
+{
+  auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_sample_result_t const*>(result);
+  return reinterpret_cast<cugraph_type_erased_device_array_view_t*>(
+    internal_pointer->index_->view());
+}
+
+extern "C" cugraph_type_erased_host_array_view_t* cugraph_sample_result_get_counts(
+  const cugraph_sample_result_t* result)
+{
+  auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_sample_result_t const*>(result);
+  return reinterpret_cast<cugraph_type_erased_host_array_view_t*>(internal_pointer->count_->view());
+}
+
+extern "C" void cugraph_sample_result_free(cugraph_sample_result_t* result)
+{
+  auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_sample_result_t*>(result);
+  delete internal_pointer->src_;
+  delete internal_pointer->dst_;
+  delete internal_pointer->label_;
+  delete internal_pointer->index_;
+  delete internal_pointer->count_;
+  delete internal_pointer;
+}