fixed header problems

CSRT-NTUA · Mar 28, 2024 · ce4ecef · ce4ecef
1 parent b8bcea6
commit ce4ecef
Show file tree

Hide file tree

Showing 3 changed files with 2 additions and 3 deletions.
diff --git a/src/machine_learning/search_algorithms/best_first/best_first.h b/src/machine_learning/search_algorithms/best_first/best_first.h
@@ -95,7 +95,6 @@ template <typename T> class best_first{
       int64_t size = q.size();
       for(int64_t i = 0; i<size; i++){
         std::pair<T, double> current = q.top();
-        std::cout << current.first << " " << current.second << '\n';
         if(current.first == end){
           return true;
         }

diff --git a/tests/machine_learning/search_algorithms/best_first.cc b/tests/machine_learning/search_algorithms/best_first.cc
@@ -2,7 +2,7 @@
 #include "../../../src/machine_learning/search_algorithms/best_first/best_first.h"
 #include <string>
 
-TEST_CASE("testing search function"){
+TEST_CASE("testing search function for best_first class"){
   best_first<char> h;
   h.insert_node('s', INT_MAX);
   h.insert_node('A', 10.4);

diff --git a/tests/machine_learning/search_algorithms/hill_climbing.cc b/tests/machine_learning/search_algorithms/hill_climbing.cc
@@ -13,7 +13,7 @@ TEST_CASE("testing edges with insertion"){
   REQUIRE(h.has_edge(0, 3) == false);
 }
 
-TEST_CASE("testing search function"){
+TEST_CASE("testing search function for hill climbing class"){
   hill_climbing<char> h;
   h.insert_node('s', INT_MAX);
   h.insert_node('A', 10.4);