Function RandomSampleNeighborTEST

src/tools/graph/dist_graph_client_main.cc:71–97

}

void RandomSampleNeighborTEST(const GraphClient* graph_client,
                              int test_number) {
  int count = 3;
  vec_int_t nodes = {0, 9};
  std::vector<vec_int_t> neighbor_nodes_list;

  vec_int_t candidates_0 = {12, 11, 10};
  vec_int_t candidates_9 = {8, 7, 6};

  for (int i = 0; i < test_number; ++i) {
    DXCHECK(
        graph_client->RandomSampleNeighbor(count, nodes, &neighbor_nodes_list));
    DXCHECK(nodes.size() == neighbor_nodes_list.size());

    DXCHECK(candidates_0.size() == neighbor_nodes_list[0].size());
    for (auto node : neighbor_nodes_list[0]) {
      DXCHECK(std::find(candidates_0.begin(), candidates_0.end(), node) !=
              candidates_0.end());
    }

    DXCHECK(candidates_9.size() == neighbor_nodes_list[1].size());
    for (auto node : neighbor_nodes_list[1]) {
      DXCHECK(std::find(candidates_9.begin(), candidates_9.end(), node) !=
              candidates_9.end());
    }
  }
}

void StaticTraverseTEST(const GraphClient* graph_client, int test_number) {
  vec_int_t cur_nodes = {0, 9};