From 1b4c5805b9a17f8a0b96df4b5c170b6e565c932d Mon Sep 17 00:00:00 2001 From: jnke2016 Date: Fri, 1 Mar 2024 07:08:23 -0800 Subject: [PATCH] reorder cases --- cpp/src/community/k_truss_impl.cuh | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/cpp/src/community/k_truss_impl.cuh b/cpp/src/community/k_truss_impl.cuh index c9d5489b6ce..cfbec72351c 100644 --- a/cpp/src/community/k_truss_impl.cuh +++ b/cpp/src/community/k_truss_impl.cuh @@ -633,11 +633,9 @@ std::tuple, rmm::device_uvector> k_truss edgelist_dsts.resize(num_valid_edges, handle.get_stream()); num_triangles.resize(num_valid_edges, handle.get_stream()); - // case 2: unroll (q, r) - // FIXME: Update the num_edges when removing edges + // case 1: unroll (q, r) // For each (q, r) edges to unroll, find the incoming edges to 'r' let's say from 'p' and // create the pair (p, q) - cugraph::find_unroll_p_r_and_q_r_edges, rmm::device_uvector> k_truss edge_first, edge_triangle_count_pair_first); + // case 2: unroll (p, r) cugraph::find_unroll_p_r_and_q_r_edges, rmm::device_uvector> k_truss cur_graph_view.attach_edge_mask(edge_mask.view()); - // case 1. For the (p, q), find intersection 'r' to create (p, r, -1) and (q, r, -1) + // case 3. For the (p, q), find intersection 'r' to create (p, r, -1) and (q, r, -1) // FIXME: check if 'invalid_edge_first' is necessery as I operate on 'vertex_pair_buffer' // which contains the ordering with the number of triangles. // FIXME: debug this stage. There are edges that have been removed that are still found in nbr