Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Ktruss implementation #4058

Closed
wants to merge 3 commits into from
Closed

Ktruss implementation #4058

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
fad7a83
define ktruss and add it to the cmake list
jnke2016 Dec 13, 2023
6afb913
ktruss implementation
jnke2016 Dec 13, 2023
b68381f
add tests
jnke2016 Dec 13, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions cpp/CMakeLists.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -225,6 +225,7 @@ set(CUGRAPH_SOURCES
src/community/legacy/ecg.cu
src/community/egonet_sg.cu
src/community/egonet_mg.cu
src/community/ktruss_sg.cu
src/sampling/random_walks.cu
src/sampling/random_walks_sg.cu
src/sampling/detail/prepare_next_frontier_sg.cu
Expand Down
20 changes: 20 additions & 0 deletions cpp/include/cugraph/algorithms.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1978,6 +1978,26 @@ void triangle_count(raft::handle_t const& handle,
raft::device_span<edge_t> counts,
bool do_expensive_check = false);

/*
* @brief Compute ktruss.
*
* Extract the ktruss subgraph of a graph
*
* @tparam vertex_t Type of vertex identifiers. Needs to be an integral type.
* @tparam edge_t Type of edge identifiers. Needs to be an integral type.
* @tparam multi_gpu Flag indicating whether template instantiation should target single-GPU (false)
* @param handle RAFT handle object to encapsulate resources (e.g. CUDA stream, communicator, and
* handles to various CUDA libraries) to run graph algorithms.
* @param graph_view Graph view object.
* @param k The desired k to be used for extracting the k-truss subgraph
* @param do_expensive_check A flag to run expensive checks for input arguments (if set to `true`).
*/
template <typename vertex_t, typename edge_t, bool multi_gpu>
void ktruss(raft::handle_t const& handle,
graph_view_t<vertex_t, edge_t, false, multi_gpu> const& graph_view,
vertex_t k,
bool do_expensive_check = false);

/**
* @brief Compute Jaccard similarity coefficient
*
Expand Down
Loading
Loading