forked from rapidsai/cugraph
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathoverlap_impl.cuh
More file actions
63 lines (55 loc) · 2.08 KB
/
overlap_impl.cuh
File metadata and controls
63 lines (55 loc) · 2.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
* 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.
*/
#pragma once
#include <cugraph/algorithms.hpp>
#include <link_prediction/similarity_impl.cuh>
#include <raft/handle.hpp>
namespace cugraph {
namespace detail {
struct overlap_functor_t {
template <typename weight_t>
weight_t __device__ compute_score(weight_t cardinality_a,
weight_t cardinality_b,
weight_t cardinality_a_intersect_b) const
{
return cardinality_a_intersect_b / std::min(cardinality_a, cardinality_b);
}
};
struct weighted_overlap_functor_t {
template <typename weight_t>
weight_t __device__ compute_score(weight_t weight_a,
weight_t weight_b,
weight_t min_weight_a_intersect_b) const
{
return min_weight_a_intersect_b / std::min(weight_a, weight_b);
}
};
} // namespace detail
template <typename vertex_t, typename edge_t, typename weight_t, bool multi_gpu>
rmm::device_uvector<weight_t> overlap_coefficients(
raft::handle_t const& handle,
graph_view_t<vertex_t, edge_t, weight_t, false, multi_gpu> const& graph_view,
std::tuple<raft::device_span<vertex_t const>, raft::device_span<vertex_t const>> vertex_pairs,
bool use_weights)
{
if (use_weights)
return detail::similarity(
handle, graph_view, vertex_pairs, use_weights, detail::overlap_functor_t{});
else
return detail::similarity(
handle, graph_view, vertex_pairs, use_weights, detail::weighted_overlap_functor_t{});
}
} // namespace cugraph