-
Notifications
You must be signed in to change notification settings - Fork 309
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
extract the edgelist from the graph (#4750)
This PR exposes the C++ function decompress_to_edgelist to the C, PLC and Python API. This will enable the extraction of the edgelist from a graph which is currently not supported. It also removes the deprecated parameter `legacy_renum_only` Authors: - Joseph Nke (https://github.com/jnke2016) Approvers: - Rick Ratzel (https://github.com/rlratzel) - Chuck Hastings (https://github.com/ChuckHastings) - Seunghwa Kang (https://github.com/seunghwak) URL: #4750
- Loading branch information
Showing
15 changed files
with
840 additions
and
95 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,137 @@ | ||
| /* | ||
| * 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. | ||
| * 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 "c_api/abstract_functor.hpp" | ||
| #include "c_api/core_result.hpp" | ||
| #include "c_api/edgelist.hpp" | ||
| #include "c_api/graph.hpp" | ||
| #include "c_api/resource_handle.hpp" | ||
| #include "c_api/utils.hpp" | ||
|
|
||
| #include <cugraph_c/algorithms.h> | ||
|
|
||
| #include <cugraph/algorithms.hpp> | ||
| #include <cugraph/detail/shuffle_wrappers.hpp> | ||
| #include <cugraph/detail/utility_wrappers.hpp> | ||
| #include <cugraph/graph_functions.hpp> | ||
|
|
||
| #include <optional> | ||
|
|
||
| namespace { | ||
|
|
||
| struct decompress_to_edgelist_functor : public cugraph::c_api::abstract_functor { | ||
| raft::handle_t const& handle_; | ||
| cugraph::c_api::cugraph_graph_t* graph_{}; | ||
|
|
||
| cugraph::c_api::cugraph_core_result_t const* core_result_{}; | ||
| bool do_expensive_check_{}; | ||
| cugraph::c_api::cugraph_edgelist_t* result_{}; | ||
|
|
||
| decompress_to_edgelist_functor(cugraph_resource_handle_t const* handle, | ||
| cugraph_graph_t* graph, | ||
| bool do_expensive_check) | ||
| : 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)), | ||
| do_expensive_check_(do_expensive_check) | ||
| { | ||
| } | ||
|
|
||
| template <typename vertex_t, | ||
| typename edge_t, | ||
| typename weight_t, | ||
| typename edge_type_type_t, | ||
| bool store_transposed, | ||
| bool multi_gpu> | ||
| void operator()() | ||
| { | ||
| if constexpr (!cugraph::is_candidate<vertex_t, edge_t, weight_t>::value) { | ||
| unsupported(); | ||
| } else { | ||
| 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, store_transposed, multi_gpu>*>( | ||
| graph_->graph_); | ||
|
|
||
| auto graph_view = graph->view(); | ||
|
|
||
| auto edge_weights = reinterpret_cast<cugraph::edge_property_t< | ||
| cugraph::graph_view_t<vertex_t, edge_t, store_transposed, multi_gpu>, | ||
| weight_t>*>(graph_->edge_weights_); | ||
|
|
||
| auto edge_ids = reinterpret_cast<cugraph::edge_property_t< | ||
| cugraph::graph_view_t<vertex_t, edge_t, store_transposed, multi_gpu>, | ||
| edge_t>*>(graph_->edge_ids_); | ||
|
|
||
| auto edge_types = reinterpret_cast<cugraph::edge_property_t< | ||
| cugraph::graph_view_t<vertex_t, edge_t, store_transposed, multi_gpu>, | ||
| edge_type_type_t>*>(graph_->edge_types_); | ||
|
|
||
| auto number_map = reinterpret_cast<rmm::device_uvector<vertex_t>*>(graph_->number_map_); | ||
|
|
||
| auto [result_src, result_dst, result_wgt, result_edge_id, result_edge_type] = | ||
| cugraph::decompress_to_edgelist<vertex_t, | ||
| edge_t, | ||
| weight_t, | ||
| edge_type_type_t, | ||
| store_transposed, | ||
| multi_gpu>( | ||
| handle_, | ||
| graph_view, | ||
| (edge_weights != nullptr) ? std::make_optional(edge_weights->view()) : std::nullopt, | ||
| (edge_ids != nullptr) ? std::make_optional(edge_ids->view()) : std::nullopt, | ||
| (edge_types != nullptr) ? std::make_optional(edge_types->view()) : std::nullopt, | ||
| (number_map != nullptr) ? std::make_optional<raft::device_span<vertex_t const>>( | ||
| number_map->data(), number_map->size()) | ||
| : std::nullopt, | ||
| do_expensive_check_); | ||
|
|
||
| result_ = new cugraph::c_api::cugraph_edgelist_t{ | ||
| new cugraph::c_api::cugraph_type_erased_device_array_t(result_src, graph_->vertex_type_), | ||
| new cugraph::c_api::cugraph_type_erased_device_array_t(result_dst, graph_->vertex_type_), | ||
| result_wgt ? new cugraph::c_api::cugraph_type_erased_device_array_t(*result_wgt, | ||
| graph_->weight_type_) | ||
| : NULL, | ||
| result_edge_id ? new cugraph::c_api::cugraph_type_erased_device_array_t(*result_edge_id, | ||
| graph_->edge_type_) | ||
| : NULL, | ||
| result_edge_type ? new cugraph::c_api::cugraph_type_erased_device_array_t( | ||
| *result_edge_type, graph_->edge_type_id_type_) | ||
| : NULL, | ||
| NULL}; | ||
| } | ||
| } | ||
| }; | ||
|
|
||
| } // namespace | ||
|
|
||
| extern "C" cugraph_error_code_t cugraph_decompress_to_edgelist( | ||
| const cugraph_resource_handle_t* handle, | ||
| cugraph_graph_t* graph, | ||
| bool_t do_expensive_check, | ||
| cugraph_edgelist_t** result, | ||
| cugraph_error_t** error) | ||
| { | ||
| decompress_to_edgelist_functor functor(handle, graph, do_expensive_check); | ||
|
|
||
| return cugraph::c_api::run_algorithm(graph, functor, result, error); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,83 @@ | ||
| /* | ||
| * 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. | ||
| * 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 "c_api/edgelist.hpp" | ||
|
|
||
| #include <cugraph_c/algorithms.h> | ||
|
|
||
| extern "C" cugraph_type_erased_device_array_view_t* cugraph_edgelist_get_sources( | ||
| cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| return reinterpret_cast<cugraph_type_erased_device_array_view_t*>(internal_pointer->src_->view()); | ||
| } | ||
|
|
||
| extern "C" cugraph_type_erased_device_array_view_t* cugraph_edgelist_get_destinations( | ||
| cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| return reinterpret_cast<cugraph_type_erased_device_array_view_t*>(internal_pointer->dst_->view()); | ||
| } | ||
|
|
||
| extern "C" cugraph_type_erased_device_array_view_t* cugraph_edgelist_get_edge_weights( | ||
| cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| return (internal_pointer->wgt_ == nullptr) | ||
| ? NULL | ||
| : reinterpret_cast<cugraph_type_erased_device_array_view_t*>( | ||
| internal_pointer->wgt_->view()); | ||
| } | ||
|
|
||
| extern "C" cugraph_type_erased_device_array_view_t* cugraph_edgelist_get_edge_ids( | ||
| cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| return (internal_pointer->edge_ids_ == nullptr) | ||
| ? NULL | ||
| : reinterpret_cast<cugraph_type_erased_device_array_view_t*>( | ||
| internal_pointer->edge_ids_->view()); | ||
| } | ||
|
|
||
| extern "C" cugraph_type_erased_device_array_view_t* cugraph_edgelist_get_edge_type_ids( | ||
| cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| return (internal_pointer->edge_type_ids_ == nullptr) | ||
| ? NULL | ||
| : reinterpret_cast<cugraph_type_erased_device_array_view_t*>( | ||
| internal_pointer->edge_type_ids_->view()); | ||
| } | ||
|
|
||
| extern "C" cugraph_type_erased_device_array_view_t* cugraph_edgelist_get_edge_offsets( | ||
| cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| return reinterpret_cast<cugraph_type_erased_device_array_view_t*>( | ||
| internal_pointer->subgraph_offsets_->view()); | ||
| } | ||
|
|
||
| extern "C" void cugraph_edgelist_free(cugraph_edgelist_t* edgelist) | ||
| { | ||
| auto internal_pointer = reinterpret_cast<cugraph::c_api::cugraph_edgelist_t*>(edgelist); | ||
| delete internal_pointer->src_; | ||
| delete internal_pointer->dst_; | ||
| delete internal_pointer->wgt_; | ||
| delete internal_pointer->edge_ids_; | ||
| delete internal_pointer->edge_type_ids_; | ||
| delete internal_pointer->subgraph_offsets_; | ||
| delete internal_pointer; | ||
| } |
Oops, something went wrong.