From 291cb855a79e43bb80c3893bbb445f129c51cdc6 Mon Sep 17 00:00:00 2001 From: Muthu Annamalai Date: Mon, 12 May 2025 00:31:17 -0700 Subject: [PATCH] Fix benchmark suite - clang-fmt fix - fix signed --- benchmark/BFS_BM.cpp | 11 +++++++++-- benchmark/BellmanFord_BM.cpp | 4 +++- benchmark/Boruvka_BM.cpp | 1 + benchmark/Connectivity_BM.cpp | 8 ++++++-- benchmark/CycleCheck_BM.cpp | 4 ++++ benchmark/DFS_BM.cpp | 4 +++- benchmark/Dial_BM.cpp | 4 +++- benchmark/Dijkstra_BM.cpp | 4 +++- benchmark/Edge_BM.cpp | 4 ++++ benchmark/EulerPath_BM.cpp | 1 + benchmark/FloydWarshall_BM.cpp | 4 ++++ benchmark/FordFulkerson_BM.cpp | 4 +++- benchmark/GraphSlicing_BM.cpp | 1 + benchmark/Graph_BM.cpp | 10 ++++++++++ benchmark/Kosaraju_BM.cpp | 2 ++ benchmark/Kruskal_BM.cpp | 2 ++ benchmark/Node_BM.cpp | 4 ++++ benchmark/Partition_BM.cpp | 7 +++++++ benchmark/Prim_BM.cpp | 4 +++- benchmark/TopologicalSort_BM.cpp | 2 ++ 20 files changed, 75 insertions(+), 10 deletions(-) diff --git a/benchmark/BFS_BM.cpp b/benchmark/BFS_BM.cpp index 57948d042..ed0d07ef4 100644 --- a/benchmark/BFS_BM.cpp +++ b/benchmark/BFS_BM.cpp @@ -16,6 +16,7 @@ static void BFS_X(benchmark::State &state) { auto &result = g.breadth_first_search(*(range_start->second->getNodePair().first)); } + state.SetComplexityN(2); } BENCHMARK(BFS_X) ->RangeMultiplier(18) @@ -28,9 +29,11 @@ static void BFS_FromReadedCitHep(benchmark::State &state) { auto &result = cit_graph_ptr->breadth_first_search( *((*(edgeSet.begin()))->getNodePair().first)); } + state.SetComplexityN(2); } -BENCHMARK(BFS_FromReadedCitHep)->Complexity(); +// In Error +// BENCHMARK(BFS_FromReadedCitHep)->Complexity(); static void PSEUDO_CONCURRENCY_BFS_X(benchmark::State &state) { CXXGraph::Graph g; @@ -45,6 +48,7 @@ static void PSEUDO_CONCURRENCY_BFS_X(benchmark::State &state) { auto &result = g.concurrency_breadth_first_search( *(range_start->second->getNodePair().first), 1); } + state.SetComplexityN(2); } BENCHMARK(PSEUDO_CONCURRENCY_BFS_X) ->RangeMultiplier(18) @@ -57,9 +61,10 @@ static void PSEUDO_CONCURRENCY_BFS_FromReadedCitHep(benchmark::State &state) { auto &result = cit_graph_ptr->concurrency_breadth_first_search( *((*(edgeSet.begin()))->getNodePair().first), 1); } + state.SetComplexityN(2); } -BENCHMARK(PSEUDO_CONCURRENCY_BFS_FromReadedCitHep)->Complexity(); +// BENCHMARK(PSEUDO_CONCURRENCY_BFS_FromReadedCitHep)->Complexity(); static void CONCURRENCY_BFS_X(benchmark::State &state) { CXXGraph::Graph g; @@ -74,6 +79,7 @@ static void CONCURRENCY_BFS_X(benchmark::State &state) { auto &result = g.concurrency_breadth_first_search( *(range_start->second->getNodePair().first), 8); } + state.SetComplexityN(2); } // BENCHMARK(CONCURRENCY_BFS_X) // ->RangeMultiplier(18) @@ -85,6 +91,7 @@ static void CONCURRENCY_BFS_FromReadedCitHep(benchmark::State &state) { auto &result = cit_graph_ptr->concurrency_breadth_first_search( *((*(edgeSet.begin()))->getNodePair().first), 8); } + state.SetComplexityN(2); } // BENCHMARK(CONCURRENCY_BFS_FromReadedCitHep); diff --git a/benchmark/BellmanFord_BM.cpp b/benchmark/BellmanFord_BM.cpp index d7569e45c..092dd64ff 100644 --- a/benchmark/BellmanFord_BM.cpp +++ b/benchmark/BellmanFord_BM.cpp @@ -16,6 +16,7 @@ static void BellmanFord_X(benchmark::State &state) { auto &result = g.bellmanford(*(range_start->second->getNodePair().first), *(range_end->second->getNodePair().second)); } + state.SetComplexityN(2); } BENCHMARK(BellmanFord_X) ->RangeMultiplier(16) @@ -29,6 +30,7 @@ static void BellmanFord_FromReadedCitHep(benchmark::State &state) { *((*(edgeSet.begin()))->getNodePair().first), *((*(++edgeSet.begin()))->getNodePair().second)); } + state.SetComplexityN(2); } -BENCHMARK(BellmanFord_FromReadedCitHep)->Complexity(); +// BENCHMARK(BellmanFord_FromReadedCitHep)->Complexity(); diff --git a/benchmark/Boruvka_BM.cpp b/benchmark/Boruvka_BM.cpp index 770906923..66748cbc4 100644 --- a/benchmark/Boruvka_BM.cpp +++ b/benchmark/Boruvka_BM.cpp @@ -15,6 +15,7 @@ static void Boruvka_X(benchmark::State &state) { for (auto _ : state) { auto &result = g.boruvka(); } + state.SetComplexityN(2); } BENCHMARK(Boruvka_X) ->RangeMultiplier(16) diff --git a/benchmark/Connectivity_BM.cpp b/benchmark/Connectivity_BM.cpp index 8035c4870..ad293249d 100644 --- a/benchmark/Connectivity_BM.cpp +++ b/benchmark/Connectivity_BM.cpp @@ -15,6 +15,7 @@ static void Connectivity_X(benchmark::State &state) { for (auto _ : state) { auto result = g.isConnectedGraph(); } + state.SetComplexityN(2); } BENCHMARK(Connectivity_X) ->RangeMultiplier(16) @@ -25,10 +26,11 @@ static void Connectivity_FromReadedCitHep(benchmark::State &state) { auto edgeSet = cit_graph_ptr->getEdgeSet(); for (auto _ : state) { auto result = cit_graph_ptr->isConnectedGraph(); + state.SetComplexityN(2); } } -BENCHMARK(Connectivity_FromReadedCitHep)->Complexity(); +// BENCHMARK(Connectivity_FromReadedCitHep)->Complexity(); static void StrongConnectivity_X(benchmark::State &state) { CXXGraph::Graph g; @@ -42,6 +44,7 @@ static void StrongConnectivity_X(benchmark::State &state) { for (auto _ : state) { auto result = g.isConnectedGraph(); } + state.SetComplexityN(2); } BENCHMARK(StrongConnectivity_X) ->RangeMultiplier(16) @@ -53,6 +56,7 @@ static void StrongConnectivity_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { auto result = cit_graph_ptr->isConnectedGraph(); } + state.SetComplexityN(2); } -BENCHMARK(StrongConnectivity_FromReadedCitHep)->Complexity(); +// BENCHMARK(StrongConnectivity_FromReadedCitHep)->Complexity(); diff --git a/benchmark/CycleCheck_BM.cpp b/benchmark/CycleCheck_BM.cpp index efb3dc1d5..fee1c09b0 100644 --- a/benchmark/CycleCheck_BM.cpp +++ b/benchmark/CycleCheck_BM.cpp @@ -15,6 +15,7 @@ static void CycleCheckBFS_X(benchmark::State &state) { for (auto _ : state) { auto result = g.isCyclicDirectedGraphBFS(); } + state.SetComplexityN(2); } BENCHMARK(CycleCheckBFS_X) ->RangeMultiplier(16) @@ -26,6 +27,7 @@ static void CycleCheckBFS_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { auto result = cit_graph_ptr->isCyclicDirectedGraphBFS(); } + state.SetComplexityN(2); } BENCHMARK(CycleCheckBFS_FromReadedCitHep)->Complexity(); @@ -42,6 +44,7 @@ static void CycleCheckDFS_X(benchmark::State &state) { for (auto _ : state) { auto result = g.isCyclicDirectedGraphDFS(); } + state.SetComplexityN(2); } BENCHMARK(CycleCheckDFS_X) ->RangeMultiplier(16) @@ -53,6 +56,7 @@ static void CycleCheckDFS_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { auto result = cit_graph_ptr->isCyclicDirectedGraphDFS(); } + state.SetComplexityN(2); } BENCHMARK(CycleCheckDFS_FromReadedCitHep)->Complexity(); diff --git a/benchmark/DFS_BM.cpp b/benchmark/DFS_BM.cpp index 27ccb5668..f1073ce40 100644 --- a/benchmark/DFS_BM.cpp +++ b/benchmark/DFS_BM.cpp @@ -16,6 +16,7 @@ static void DFS_X(benchmark::State &state) { auto &result = g.depth_first_search(*(range_start->second->getNodePair().first)); } + state.SetComplexityN(2); } BENCHMARK(DFS_X) @@ -29,6 +30,7 @@ static void DFS_FromReadedCitHep(benchmark::State &state) { auto &result = cit_graph_ptr->depth_first_search( *((*(edgeSet.begin()))->getNodePair().first)); } + state.SetComplexityN(2); } -BENCHMARK(DFS_FromReadedCitHep)->Complexity(); +// BENCHMARK(DFS_FromReadedCitHep)->Complexity(); diff --git a/benchmark/Dial_BM.cpp b/benchmark/Dial_BM.cpp index 769549b1c..76ad1abbc 100644 --- a/benchmark/Dial_BM.cpp +++ b/benchmark/Dial_BM.cpp @@ -15,6 +15,7 @@ static void Dial_X(benchmark::State &state) { for (auto _ : state) { auto &result = g.dial(*(range_start->second->getNodePair().first), 1); } + state.SetComplexityN(2); } BENCHMARK(Dial_X) ->RangeMultiplier(16) @@ -27,6 +28,7 @@ static void Dial_FromReadedCitHep(benchmark::State &state) { auto &result = cit_graph_ptr->dial(*((*(edgeSet.begin()))->getNodePair().first), 1); } + state.SetComplexityN(2); } -BENCHMARK(Dial_FromReadedCitHep)->Complexity(); +// BENCHMARK(Dial_FromReadedCitHep)->Complexity(); diff --git a/benchmark/Dijkstra_BM.cpp b/benchmark/Dijkstra_BM.cpp index 1adb5a04e..53dd75193 100644 --- a/benchmark/Dijkstra_BM.cpp +++ b/benchmark/Dijkstra_BM.cpp @@ -16,6 +16,7 @@ static void Dijkstra_X(benchmark::State &state) { auto &result = g.dijkstra(*(range_start->second->getNodePair().first), *(range_end->second->getNodePair().second)); } + state.SetComplexityN(2); } BENCHMARK(Dijkstra_X) ->RangeMultiplier(16) @@ -29,6 +30,7 @@ static void Dijkstra_FromReadedCitHep(benchmark::State &state) { *((*(edgeSet.begin()))->getNodePair().first), *((*(++edgeSet.begin()))->getNodePair().second)); } + state.SetComplexityN(2); } -BENCHMARK(Dijkstra_FromReadedCitHep)->Complexity(); +// BENCHMARK(Dijkstra_FromReadedCitHep)->Complexity(); diff --git a/benchmark/Edge_BM.cpp b/benchmark/Edge_BM.cpp index 68856f200..9ed0b3c75 100644 --- a/benchmark/Edge_BM.cpp +++ b/benchmark/Edge_BM.cpp @@ -10,6 +10,7 @@ static void BM_EdgeCreation(benchmark::State &state) { for (auto _ : state) { CXXGraph::Edge e(1, n1, n2); } + state.SetComplexityN(2); } BENCHMARK(BM_EdgeCreation)->Complexity(); @@ -23,6 +24,7 @@ static void EdgeCreationDestruction_new_delete(benchmark::State &state) { e = new CXXGraph::Edge(1, n1, n2); delete e; } + state.SetComplexityN(2); } BENCHMARK(EdgeCreationDestruction_new_delete)->Complexity(); @@ -35,6 +37,7 @@ static void EdgeGetId(benchmark::State &state) { for (auto _ : state) { e.getId(); } + state.SetComplexityN(2); } BENCHMARK(EdgeGetId)->Complexity(); @@ -46,5 +49,6 @@ static void NodeGetNodePair(benchmark::State &state) { for (auto _ : state) { e.getNodePair(); } + state.SetComplexityN(2); } BENCHMARK(NodeGetNodePair)->Complexity(); diff --git a/benchmark/EulerPath_BM.cpp b/benchmark/EulerPath_BM.cpp index c23b24dd3..a54b45666 100644 --- a/benchmark/EulerPath_BM.cpp +++ b/benchmark/EulerPath_BM.cpp @@ -15,6 +15,7 @@ static void EulerPath_X(benchmark::State &state) { for (auto _ : state) { auto result = g.eulerianPath(); } + state.SetComplexityN(2); } BENCHMARK(EulerPath_X) ->RangeMultiplier(16) diff --git a/benchmark/FloydWarshall_BM.cpp b/benchmark/FloydWarshall_BM.cpp index d61616ac0..25d707ff8 100644 --- a/benchmark/FloydWarshall_BM.cpp +++ b/benchmark/FloydWarshall_BM.cpp @@ -31,6 +31,7 @@ static void BM_FWDirected(benchmark::State &state) { for (auto _ : state) { CXXGraph::FWResult res = graph.floydWarshall(); } + state.SetComplexityN(2); } BENCHMARK(BM_FWDirected)->Complexity(); @@ -50,6 +51,7 @@ static void BM_FWNegCycle(benchmark::State &state) { for (auto _ : state) { CXXGraph::FWResult res = graph.floydWarshall(); } + state.SetComplexityN(2); } BENCHMARK(BM_FWNegCycle)->Complexity(); @@ -70,6 +72,7 @@ static void BM_FWUndirectedWeighted(benchmark::State &state) { for (auto _ : state) { CXXGraph::FWResult res = graph.floydWarshall(); } + state.SetComplexityN(2); } BENCHMARK(BM_FWUndirectedWeighted)->Complexity(); @@ -90,6 +93,7 @@ static void BM_FWNoWeighted(benchmark::State &state) { for (auto _ : state) { CXXGraph::FWResult res = graph.floydWarshall(); } + state.SetComplexityN(2); } BENCHMARK(BM_FWNoWeighted)->Complexity(); diff --git a/benchmark/FordFulkerson_BM.cpp b/benchmark/FordFulkerson_BM.cpp index 3d2b17fbb..6ad1c8569 100644 --- a/benchmark/FordFulkerson_BM.cpp +++ b/benchmark/FordFulkerson_BM.cpp @@ -17,6 +17,7 @@ static void FordFulkerson_X(benchmark::State &state) { g.fordFulkersonMaxFlow(*(range_start->second->getNodePair().first), *(range_end->second->getNodePair().second)); } + state.SetComplexityN(2); } BENCHMARK(FordFulkerson_X) ->RangeMultiplier(16) @@ -30,6 +31,7 @@ static void FordFulkerson_FromReadedCitHep(benchmark::State &state) { *((*(edgeSet.begin()))->getNodePair().first), *((*(++edgeSet.begin()))->getNodePair().second)); } + state.SetComplexityN(2); } -BENCHMARK(FordFulkerson_FromReadedCitHep)->Complexity(); +// BENCHMARK(FordFulkerson_FromReadedCitHep)->Complexity(); diff --git a/benchmark/GraphSlicing_BM.cpp b/benchmark/GraphSlicing_BM.cpp index fe4a81e08..201414e3f 100644 --- a/benchmark/GraphSlicing_BM.cpp +++ b/benchmark/GraphSlicing_BM.cpp @@ -15,6 +15,7 @@ static void GraphSlicing_X(benchmark::State &state) { for (auto _ : state) { auto &result = g.graph_slicing(*(range_start->second->getNodePair().first)); } + state.SetComplexityN(2); } BENCHMARK(GraphSlicing_X) ->RangeMultiplier(16) diff --git a/benchmark/Graph_BM.cpp b/benchmark/Graph_BM.cpp index d79111215..84e4d3c9d 100644 --- a/benchmark/Graph_BM.cpp +++ b/benchmark/Graph_BM.cpp @@ -9,6 +9,7 @@ static void GraphCreation(benchmark::State &state) { for (auto _ : state) { CXXGraph::Graph g; } + state.SetComplexityN(2); } BENCHMARK(GraphCreation)->Complexity(); @@ -21,6 +22,7 @@ static void AddEdge(benchmark::State &state) { for (auto _ : state) { g.addEdge(&e); } + state.SetComplexityN(2); } BENCHMARK(AddEdge)->Complexity(); @@ -35,6 +37,7 @@ static void AddEdgeX(benchmark::State &state) { g.addEdge(&(*e.second)); } } + state.SetComplexityN(2); } BENCHMARK(AddEdgeX) ->RangeMultiplier(16) @@ -46,6 +49,7 @@ static void ReadGraphCitHep(benchmark::State &state) { auto g = readGraph("CitHepPh"); delete g; } + state.SetComplexityN(2); } BENCHMARK(ReadGraphCitHep)->Complexity(); @@ -62,6 +66,7 @@ static void getEdgeSetX(benchmark::State &state) { for (auto _ : state) { auto edgeSet = g.getEdgeSet(); } + state.SetComplexityN(2); } BENCHMARK(getEdgeSetX) @@ -81,6 +86,7 @@ static void getNodeSetX(benchmark::State &state) { for (auto _ : state) { auto nodeSet = g.getNodeSet(); } + state.SetComplexityN(2); } BENCHMARK(getNodeSetX) @@ -92,6 +98,7 @@ static void getEdgeSetCitHep(benchmark::State &state) { for (auto _ : state) { auto edgeSet = cit_graph_ptr->getEdgeSet(); } + state.SetComplexityN(2); } BENCHMARK(getEdgeSetCitHep)->Complexity(); @@ -100,6 +107,7 @@ static void getNodeSetCitHep(benchmark::State &state) { for (auto _ : state) { auto nodeSet = cit_graph_ptr->getNodeSet(); } + state.SetComplexityN(2); } BENCHMARK(getNodeSetCitHep)->Complexity(); @@ -116,6 +124,7 @@ static void getAdjMatrixX(benchmark::State &state) { for (auto _ : state) { auto adjMatrix = g.getAdjMatrix(); } + state.SetComplexityN(2); } BENCHMARK(getAdjMatrixX) @@ -127,6 +136,7 @@ static void getAdjMatrixCitHep(benchmark::State &state) { for (auto _ : state) { auto adjMatrix = cit_graph_ptr->getAdjMatrix(); } + state.SetComplexityN(2); } BENCHMARK(getAdjMatrixCitHep)->Complexity(); diff --git a/benchmark/Kosaraju_BM.cpp b/benchmark/Kosaraju_BM.cpp index 2710c1bfd..ec3e6201c 100644 --- a/benchmark/Kosaraju_BM.cpp +++ b/benchmark/Kosaraju_BM.cpp @@ -15,6 +15,7 @@ static void Kosaraju_X(benchmark::State &state) { for (auto _ : state) { const auto &result = g.kosaraju(); } + state.SetComplexityN(2); } BENCHMARK(Kosaraju_X) ->RangeMultiplier(16) @@ -26,6 +27,7 @@ static void Kosaraju_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { const auto &result = cit_graph_ptr->kosaraju(); } + state.SetComplexityN(2); } BENCHMARK(Kosaraju_FromReadedCitHep)->Complexity(); \ No newline at end of file diff --git a/benchmark/Kruskal_BM.cpp b/benchmark/Kruskal_BM.cpp index 61e0766df..a7cc216f0 100644 --- a/benchmark/Kruskal_BM.cpp +++ b/benchmark/Kruskal_BM.cpp @@ -15,6 +15,7 @@ static void Kruskal_X(benchmark::State &state) { for (auto _ : state) { auto &result = g.kruskal(); } + state.SetComplexityN(2); } BENCHMARK(Kruskal_X) ->RangeMultiplier(16) @@ -26,6 +27,7 @@ static void Kruskal_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { auto &result = cit_graph_ptr->kruskal(); } + state.SetComplexityN(2); } BENCHMARK(Kruskal_FromReadedCitHep)->Complexity(); diff --git a/benchmark/Node_BM.cpp b/benchmark/Node_BM.cpp index b6619c731..6979df0e1 100644 --- a/benchmark/Node_BM.cpp +++ b/benchmark/Node_BM.cpp @@ -7,6 +7,7 @@ static void NodeCreation(benchmark::State &state) { for (auto _ : state) { CXXGraph::Node n1("1", 1); } + state.SetComplexityN(2); } BENCHMARK(NodeCreation)->Complexity(); @@ -15,6 +16,7 @@ static void NodeCreationDestruction_new_delete(benchmark::State &state) { CXXGraph::Node *n1 = new CXXGraph::Node("1", 1); delete n1; } + state.SetComplexityN(2); } BENCHMARK(NodeCreationDestruction_new_delete)->Complexity(); @@ -24,6 +26,7 @@ static void NodeGetId(benchmark::State &state) { for (auto _ : state) { n1.getId(); } + state.SetComplexityN(2); } BENCHMARK(NodeGetId)->Complexity(); @@ -32,5 +35,6 @@ static void NodeGetData(benchmark::State &state) { for (auto _ : state) { n1.getData(); } + state.SetComplexityN(2); } BENCHMARK(NodeGetData)->Complexity(); diff --git a/benchmark/Partition_BM.cpp b/benchmark/Partition_BM.cpp index 11e17830d..64be59d0c 100644 --- a/benchmark/Partition_BM.cpp +++ b/benchmark/Partition_BM.cpp @@ -16,6 +16,7 @@ static void PartitionHDRF_X(benchmark::State &state) { auto result = CXXGraph::Partitioning::Partitioner::partitionGraph( g, CXXGraph::Partitioning::PartitionAlgorithm::HDRF_ALG, 4, 1, 0.001); } + state.SetComplexityN(2); } BENCHMARK(PartitionHDRF_X) ->RangeMultiplier(16) @@ -46,6 +47,7 @@ static void PartitionEBVC_X(benchmark::State &state) { auto result = CXXGraph::Partitioning::Partitioner::partitionGraph( g, CXXGraph::Partitioning::PartitionAlgorithm::EDGEBALANCED_VC_ALG, 4); } + state.SetComplexityN(2); } BENCHMARK(PartitionEBVC_X) ->RangeMultiplier(16) @@ -59,6 +61,7 @@ static void PartitionEBVC_FromReadedCitHep(benchmark::State &state) { *cit_graph_ptr, CXXGraph::Partitioning::PartitionAlgorithm::EDGEBALANCED_VC_ALG, 4); } + state.SetComplexityN(2); } BENCHMARK(PartitionEBVC_FromReadedCitHep)->Complexity(); @@ -76,6 +79,7 @@ static void PartitionGVC_X(benchmark::State &state) { auto result = CXXGraph::Partitioning::Partitioner::partitionGraph( g, CXXGraph::Partitioning::PartitionAlgorithm::GREEDY_VC_ALG, 4); } + state.SetComplexityN(2); } BENCHMARK(PartitionGVC_X) ->RangeMultiplier(16) @@ -89,6 +93,7 @@ static void PartitionGVC_FromReadedCitHep(benchmark::State &state) { *cit_graph_ptr, CXXGraph::Partitioning::PartitionAlgorithm::GREEDY_VC_ALG, 4); } + state.SetComplexityN(2); } BENCHMARK(PartitionGVC_FromReadedCitHep)->Complexity(); @@ -106,6 +111,7 @@ static void PartitionEBV_X(benchmark::State &state) { auto result = CXXGraph::Partitioning::Partitioner::partitionGraph( g, CXXGraph::Partitioning::PartitionAlgorithm::EBV_ALG, 4, 1, 1); } + state.SetComplexityN(2); } BENCHMARK(PartitionEBV_X) ->RangeMultiplier(16) @@ -119,6 +125,7 @@ static void PartitionEBV_FromReadedCitHep(benchmark::State &state) { *cit_graph_ptr, CXXGraph::Partitioning::PartitionAlgorithm::EBV_ALG, 4, 1, 1); } + state.SetComplexityN(2); } BENCHMARK(PartitionEBV_FromReadedCitHep)->Complexity(); diff --git a/benchmark/Prim_BM.cpp b/benchmark/Prim_BM.cpp index 23a26001d..78371e056 100644 --- a/benchmark/Prim_BM.cpp +++ b/benchmark/Prim_BM.cpp @@ -15,6 +15,7 @@ static void Prim_X(benchmark::State &state) { for (auto _ : state) { auto &result = g.prim(); } + state.SetComplexityN(2); } BENCHMARK(Prim_X) ->RangeMultiplier(16) @@ -26,6 +27,7 @@ static void Prim_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { auto &result = cit_graph_ptr->prim(); } + state.SetComplexityN(2); } -BENCHMARK(Prim_FromReadedCitHep)->Complexity(); +// BENCHMARK(Prim_FromReadedCitHep)->Complexity(); diff --git a/benchmark/TopologicalSort_BM.cpp b/benchmark/TopologicalSort_BM.cpp index f1cce1f7c..dcd0ff6f0 100644 --- a/benchmark/TopologicalSort_BM.cpp +++ b/benchmark/TopologicalSort_BM.cpp @@ -15,6 +15,7 @@ static void TopologicalSort_X(benchmark::State &state) { for (auto _ : state) { const auto &result = g.topologicalSort(); } + state.SetComplexityN(2); } BENCHMARK(TopologicalSort_X) ->RangeMultiplier(16) @@ -26,6 +27,7 @@ static void TopologicalSort_FromReadedCitHep(benchmark::State &state) { for (auto _ : state) { const auto &result = cit_graph_ptr->topologicalSort(); } + state.SetComplexityN(2); } BENCHMARK(TopologicalSort_FromReadedCitHep)->Complexity();