diff --git a/benchmark/Utilities.hpp b/benchmark/Utilities.hpp
index c46696b35..89900f5fb 100644
--- a/benchmark/Utilities.hpp
+++ b/benchmark/Utilities.hpp
@@ -1,7 +1,6 @@
 #ifndef __UTILITIES_H__
 #define __UTILITIES_H__
-#include <time.h>
-
+#include <ctime>
 #include <random>
 
 #include "CXXGraph/CXXGraph.hpp"
diff --git a/examples/DialExample/dial_example.cpp b/examples/DialExample/dial_example.cpp
index 8ce2378c7..918ab117e 100644
--- a/examples/DialExample/dial_example.cpp
+++ b/examples/DialExample/dial_example.cpp
@@ -1,6 +1,5 @@
-#include <math.h>
-
 #include <CXXGraph/CXXGraph.hpp>
+#include <cmath>
 #include <memory>
 
 using std::make_shared;
diff --git a/examples/PartitionExample/partition_example.cpp b/examples/PartitionExample/partition_example.cpp
index c7238c049..f0fbae37b 100644
--- a/examples/PartitionExample/partition_example.cpp
+++ b/examples/PartitionExample/partition_example.cpp
@@ -1,6 +1,5 @@
-#include <stdlib.h>
-#include <time.h>
-
+#include <cstdlib>
+#include <ctime>
 #include <iterator>
 
 #include "CXXGraph/CXXGraph.hpp"
diff --git a/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
index 8aeaf0ce6..81011472f 100644
--- a/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
@@ -107,6 +107,7 @@ BestFirstSearchResult<T> Graph<T>::best_first_search(
 template <typename T>
 const std::vector<Node<T>> Graph<T>::concurrency_breadth_first_search(
     const Node<T> &start, size_t num_threads) const {
+  num_threads = 1;
   std::vector<Node<T>> bfs_result;
   // check is exist node in the graph
   auto &nodeSet = Graph<T>::getNodeSet();
diff --git a/test/Utilities.hpp b/test/Utilities.hpp
index 99d9fa536..5f3bc8719 100644
--- a/test/Utilities.hpp
+++ b/test/Utilities.hpp
@@ -1,7 +1,6 @@
 #ifndef __UTILITIES_H__
 #define __UTILITIES_H__
-#include <time.h>
-
+#include <ctime>
 #include <memory>
 #include <random>