@@ -59,27 +59,26 @@ struct renumber_meta_t<vertex_t, edge_t, multi_gpu, std::enable_if_t<!multi_gpu>
5959 * or multi-GPU (true).
6060 * @param handle RAFT handle object to encapsulate resources (e.g. CUDA stream, communicator, and
6161 * handles to various CUDA libraries) to run graph algorithms.
62- * @param local_vertex_span If valid, part of the entire set of vertices in the graph to be
63- * renumbered. The first tuple element is the pointer to the array and the second tuple element is
64- * the size of the array. This parameter can be used to include isolated vertices. Applying the
62+ * @param local_vertices If valid, part of the entire set of vertices in the graph to be renumbered.
63+ * This parameter can be used to include isolated vertices. Applying the
6564 * compute_gpu_id_from_vertex_t to every vertex should return the local GPU ID for this function to
6665 * work (vertices should be pre-shuffled).
67- * @param edgelist_major_vertices Pointers (one pointer per local graph adjacency matrix partition
68- * assigned to this process) to edge source vertex IDs (if the graph adjacency matrix is stored as
69- * is) or edge destination vertex IDs (if the transposed graph adjacency matrix is stored). Vertex
70- * IDs are updated in-place ([INOUT] parameter). Edges should be pre-shuffled to their final target
71- * process & matrix partition; i.e. applying the compute_gpu_id_from_edge_t functor to every (major,
72- * minor) pair should return the GPU ID of this process and applying the
73- * compute_partition_id_from_edge_t fuctor to every (major, minor) pair for a local matrix partition
74- * should return the partition ID of the corresponding matrix partition.
75- * @param edgelist_minor_vertices Pointers (one pointer per local graph adjacency matrix partition
76- * assigned to this process) to edge destination vertex IDs (if the graph adjacency matrix is stored
77- * as is) or edge source vertex IDs (if the transposed graph adjacency matrix is stored). Vertex IDs
78- * are updated in-place ([INOUT] parameter). Edges should be pre-shuffled to their final target
79- * process & matrix partition; i.e. applying the compute_gpu_id_from_edge_t functor to every (major,
80- * minor) pair should return the GPU ID of this process and applying the
81- * compute_partition_id_from_edge_t fuctor to every (major, minor) pair for a local matrix partition
82- * should return the partition ID of the corresponding matrix partition.
66+ * @param edgelist_majors Pointers (one pointer per local graph adjacency matrix partition assigned
67+ * to this process) to edge source vertex IDs (if the graph adjacency matrix is stored as is) or
68+ * edge destination vertex IDs (if the transposed graph adjacency matrix is stored). Vertex IDs are
69+ * updated in-place ([INOUT] parameter). Edges should be pre-shuffled to their final target process
70+ * & matrix partition; i.e. applying the compute_gpu_id_from_edge_t functor to every (major, minor)
71+ * pair should return the GPU ID of this process and applying the compute_partition_id_from_edge_t
72+ * fuctor to every (major, minor) pair for a local matrix partition should return the partition ID
73+ * of the corresponding matrix partition.
74+ * @param edgelist_minors Pointers (one pointer per local graph adjacency matrix partition assigned
75+ * to this process) to edge destination vertex IDs (if the graph adjacency matrix is stored as is)
76+ * or edge source vertex IDs (if the transposed graph adjacency matrix is stored). Vertex IDs are
77+ * updated in-place ([INOUT] parameter). Edges should be pre-shuffled to their final target process
78+ * & matrix partition; i.e. applying the compute_gpu_id_from_edge_t functor to every (major, minor)
79+ * pair should return the GPU ID of this process and applying the compute_partition_id_from_edge_t
80+ * fuctor to every (major, minor) pair for a local matrix partition should return the partition ID
81+ * of the corresponding matrix partition.
8382 * @param edgelist_edge_counts Edge counts (one count per local graph adjacency matrix partition
8483 * assigned to this process).
8584 * @param edgelist_intra_partition_segment_offsets If valid, store segment offsets within a local
@@ -101,9 +100,9 @@ std::enable_if_t<
101100 std::tuple<rmm::device_uvector<vertex_t >, renumber_meta_t <vertex_t , edge_t , multi_gpu>>>
102101renumber_edgelist (
103102 raft::handle_t const & handle,
104- std::optional<std::tuple <vertex_t const *, vertex_t >> local_vertex_span ,
105- std::vector<vertex_t *> const & edgelist_major_vertices /* [INOUT] */
106- std::vector<vertex_t *> const & edgelist_minor_vertices /* [INOUT] */
103+ std::optional<rmm::device_uvector <vertex_t >>&& local_vertices ,
104+ std::vector<vertex_t *> const & edgelist_majors /* [INOUT] */
105+ std::vector<vertex_t *> const & edgelist_minors /* [INOUT] */
107106 std::vector<edge_t > const & edgelist_edge_counts,
108107 std::optional<std::vector<std::vector<edge_t >>> const & edgelist_intra_partition_segment_offsets,
109108 bool do_expensive_check = false );
@@ -117,17 +116,14 @@ renumber_edgelist(
117116 * or multi-GPU (true).
118117 * @param handle RAFT handle object to encapsulate resources (e.g. CUDA stream, communicator, and
119118 * handles to various CUDA libraries) to run graph algorithms.
120- * @param vertex_span If valid, vertices in the graph to be renumbered. The first tuple element is
121- * the pointer to the array and the second tuple element is the size of the array. This parameter
122- * can be used to include isolated vertices.
123- * @param vertices The entire set of vertices in the graph to be renumbered.
124- * @param num_vertices Number of vertices.
125- * @param edgelist_major_vertices Edge source vertex IDs (if the graph adjacency matrix is stored as
126- * is) or edge destination vertex IDs (if the transposed graph adjacency matrix is stored). Vertex
127- * IDs are updated in-place ([INOUT] parameter).
128- * @param edgelist_minor_vertices Edge destination vertex IDs (if the graph adjacency matrix is
129- * stored as is) or edge source vertex IDs (if the transposed graph adjacency matrix is stored).
130- * Vertex IDs are updated in-place ([INOUT] parameter).
119+ * @param vertices If valid, vertices in the graph to be renumbered. This parameter can be used to
120+ * include isolated vertices.
121+ * @param edgelist_majors Edge source vertex IDs (if the graph adjacency matrix is stored as is) or
122+ * edge destination vertex IDs (if the transposed graph adjacency matrix is stored). Vertex IDs are
123+ * updated in-place ([INOUT] parameter).
124+ * @param edgelist_minors Edge destination vertex IDs (if the graph adjacency matrix is stored as
125+ * is) or edge source vertex IDs (if the transposed graph adjacency matrix is stored). Vertex IDs
126+ * are updated in-place ([INOUT] parameter).
131127 * @param num_edgelist_edges Number of edges in the edgelist.
132128 * @param do_expensive_check A flag to run expensive checks for input arguments (if set to `true`).
133129 * @return std::tuple<rmm::device_uvector<vertex_t>, renumber_meta_t<vertex_t, edge_t, multi_gpu>>
@@ -141,9 +137,9 @@ std::enable_if_t<
141137 !multi_gpu,
142138 std::tuple<rmm::device_uvector<vertex_t >, renumber_meta_t <vertex_t , edge_t , multi_gpu>>>
143139renumber_edgelist (raft::handle_t const & handle,
144- std::optional<std::tuple <vertex_t const *, vertex_t >> vertex_span ,
145- vertex_t * edgelist_major_vertices /* [INOUT] */
146- vertex_t * edgelist_minor_vertices /* [INOUT] */
140+ std::optional<rmm::device_uvector <vertex_t >>&& vertices ,
141+ vertex_t * edgelist_majors /* [INOUT] */
142+ vertex_t * edgelist_minors /* [INOUT] */
147143 edge_t num_edgelist_edges,
148144 bool do_expensive_check = false );
149145
@@ -462,7 +458,7 @@ extract_induced_subgraphs(
462458 * or multi-GPU (true).
463459 * @param handle RAFT handle object to encapsulate resources (e.g. CUDA stream, communicator, and
464460 * handles to various CUDA libraries) to run graph algorithms.
465- * @param vertex_span If valid, part of the entire set of vertices in the graph to be renumbered.
461+ * @param vertices If valid, part of the entire set of vertices in the graph to be renumbered.
466462 * This parameter can be used to include isolated vertices. If multi-GPU, applying the
467463 * compute_gpu_id_from_vertex_t to every vertex should return the local GPU ID for this function to
468464 * work (vertices should be pre-shuffled).
@@ -487,7 +483,7 @@ template <typename vertex_t,
487483std::tuple<cugraph::graph_t <vertex_t , edge_t , weight_t , store_transposed, multi_gpu>,
488484 std::optional<rmm::device_uvector<vertex_t >>>
489485create_graph_from_edgelist (raft::handle_t const & handle,
490- std::optional<rmm::device_uvector<vertex_t >>&& vertex_span ,
486+ std::optional<rmm::device_uvector<vertex_t >>&& vertices ,
491487 rmm::device_uvector<vertex_t >&& edgelist_rows,
492488 rmm::device_uvector<vertex_t >&& edgelist_cols,
493489 std::optional<rmm::device_uvector<weight_t >>&& edgelist_weights,
0 commit comments