DFS_BM.cpp

#include <benchmark/benchmark.h>

#include <unordered_map>

#include "CXXGraph/CXXGraph.hpp"
#include "Utilities.hpp"

static void DFS_X(benchmark::State &state) {
  CXXGraph::Graph<int> g;
  auto range_start = edges.begin();
  auto range_end = edges.find(state.range(0));
  std::unordered_map<unsigned long, CXXGraph::Edge<int> *> edgesX;
  edgesX.insert(range_start, range_end);
  for (auto e : edgesX) {
    g.addEdge(&(*e.second));
  }
  for (auto _ : state) {
    auto &result =
        g.depth_first_search(*(range_start->second->getNodePair().first));
  }
  state.SetComplexityN(state.range(0));
}

BENCHMARK(DFS_X)
    ->RangeMultiplier(2)
    ->Range((unsigned long)1, (unsigned long)1 << 18)
    ->Complexity();

static void DFS_FromReadedCitHep(benchmark::State &state) {
  auto edgeSet = cit_graph_ptr->getEdgeSet();
  for (auto _ : state) {
    auto &result = cit_graph_ptr->depth_first_search(
        *((*(edgeSet.begin()))->getNodePair().first));
  }
}

// BENCHMARK(DFS_FromReadedCitHep);