cugraph/cpp/tests/components/wcc_graphs.cu at 7caf3414dc0e83daf38c47c773f8c544c5481567 · seunghwak/cugraph · GitHub

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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/*
 * Copyright (c) 2021, NVIDIA CORPORATION.  All rights reserved.
 *
 * NVIDIA CORPORATION and its licensors retain all intellectual property
 * and proprietary rights in and to this software, related documentation
 * and any modifications thereto.  Any use, reproduction, disclosure or
 * distribution of this software and related documentation without an express
 * license agreement from NVIDIA CORPORATION is strictly prohibited.
 *
 */

#include <components/wcc_graphs.hpp>
#include <utilities/test_utilities.hpp>

#include <cugraph/detail/utility_wrappers.hpp>
#include <cugraph/graph_functions.hpp>

#include <rmm/exec_policy.hpp>

#include <thrust/sort.h>

namespace cugraph {
namespace test {

template <typename vertex_t,
          typename edge_t,
          typename weight_t,
          bool store_transposed,
          bool multi_gpu>
std::tuple<cugraph::graph_t<vertex_t, edge_t, weight_t, store_transposed, multi_gpu>,
           std::optional<rmm::device_uvector<vertex_t>>>
LineGraph_Usecase::construct_graph(raft::handle_t const& handle,
                                   bool test_weighted,
                                   bool renumber) const
{
  uint64_t seed{0};

  edge_t num_edges = 2 * (num_vertices_ - 1);

  rmm::device_uvector<vertex_t> vertices_v(num_vertices_, handle.get_stream());
  rmm::device_uvector<vertex_t> src_v(num_edges, handle.get_stream());
  rmm::device_uvector<vertex_t> dst_v(num_edges, handle.get_stream());
  rmm::device_uvector<double> order_v(num_vertices_, handle.get_stream());

  thrust::sequence(
    rmm::exec_policy(handle.get_stream()), vertices_v.begin(), vertices_v.end(), vertex_t{0});

  cugraph::detail::uniform_random_fill(
    handle.get_stream_view(), order_v.data(), num_vertices_, double{0.0}, double{1.0}, seed);

  thrust::sort_by_key(
    rmm::exec_policy(handle.get_stream()), order_v.begin(), order_v.end(), vertices_v.begin());

  raft::copy(src_v.begin(), vertices_v.begin(), (num_vertices_ - 1), handle.get_stream());
  raft::copy(dst_v.begin(), vertices_v.begin() + 1, (num_vertices_ - 1), handle.get_stream());

  raft::copy(src_v.begin() + (num_vertices_ - 1),
             vertices_v.begin() + 1,
             (num_vertices_ - 1),
             handle.get_stream());
  raft::copy(dst_v.begin() + (num_vertices_ - 1),
             vertices_v.begin(),
             (num_vertices_ - 1),
             handle.get_stream());

  thrust::sequence(
    rmm::exec_policy(handle.get_stream()), vertices_v.begin(), vertices_v.end(), vertex_t{0});

  handle.get_stream_view().synchronize();

  return cugraph::
    create_graph_from_edgelist<vertex_t, edge_t, weight_t, store_transposed, multi_gpu>(
      handle,
      std::move(vertices_v),
      std::move(src_v),
      std::move(dst_v),
      std::nullopt,
      cugraph::graph_properties_t{true, false},
      false);
}

template std::tuple<cugraph::graph_t<int32_t, int32_t, float, false, false>,
                    std::optional<rmm::device_uvector<int32_t>>>
LineGraph_Usecase::construct_graph(raft::handle_t const&, bool, bool) const;

}  // namespace test
}  // namespace cugraph