Resolve warnings in benchmarks

Continuation/should be part of #568.

Author: vil02

benchmark/BFS_BM.cpp

@@ -25,6 +25,7 @@ BENCHMARK(BFS_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void BFS_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {
@@ -54,6 +55,7 @@ BENCHMARK(PSEUDO_CONCURRENCY_BFS_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void PSEUDO_CONCURRENCY_BFS_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {
@@ -64,6 +66,7 @@ static void PSEUDO_CONCURRENCY_BFS_FromReadedCitHep(benchmark::State &state) {
 
 // BENCHMARK(PSEUDO_CONCURRENCY_BFS_FromReadedCitHep);
 
+[[maybe_unused]]
 static void CONCURRENCY_BFS_X(benchmark::State &state) {
   CXXGraph::Graph<int> g;
   auto range_start = edges.begin();
@@ -83,6 +86,7 @@ static void CONCURRENCY_BFS_X(benchmark::State &state) {
 //     ->RangeMultiplier(2)
 //     ->Range((unsigned long)1, (unsigned long)1 << 18);
 
+[[maybe_unused]]
 static void CONCURRENCY_BFS_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/BellmanFord_BM.cpp

@@ -25,6 +25,7 @@ BENCHMARK(BellmanFord_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void BellmanFord_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/Boruvka_BM.cpp

@@ -24,6 +24,7 @@ BENCHMARK(Boruvka_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void Boruvka_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/Connectivity_BM.cpp

@@ -24,6 +24,7 @@ BENCHMARK(Connectivity_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void Connectivity_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {
@@ -52,6 +53,7 @@ BENCHMARK(StrongConnectivity_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void StrongConnectivity_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/CycleCheck_BM.cpp

@@ -24,6 +24,7 @@ BENCHMARK(CycleCheckBFS_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void CycleCheckBFS_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {
@@ -52,6 +53,7 @@ BENCHMARK(CycleCheckDFS_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void CycleCheckDFS_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/DFS_BM.cpp

@@ -26,6 +26,7 @@ BENCHMARK(DFS_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void DFS_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/Dial_BM.cpp

@@ -24,6 +24,7 @@ BENCHMARK(Dial_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void Dial_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/Dijkstra_BM.cpp

@@ -25,6 +25,7 @@ BENCHMARK(Dijkstra_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void Dijkstra_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/FordFulkerson_BM.cpp

@@ -26,6 +26,7 @@ BENCHMARK(FordFulkerson_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void FordFulkerson_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {

benchmark/Kosaraju_BM.cpp

@@ -24,6 +24,7 @@ BENCHMARK(Kosaraju_X)
     ->Range((unsigned long)1, (unsigned long)1 << 18)
     ->Complexity();
 
+[[maybe_unused]]
 static void Kosaraju_FromReadedCitHep(benchmark::State &state) {
   auto edgeSet = cit_graph_ptr->getEdgeSet();
   for (auto _ : state) {