final version before the PR.

the commit include :
- api closing with a key press on the console.
- added (int)search_engine to inside config to determine what search engine the user want to select. (helper : getOneOrTwo).
- deleted all profiling steps inside the search engine.
- added a new search engine more lightweight to be more fast on sparse graph. (now their is search engine bidirectional / unidirectional).
- added a new perf analyzer to determine whether the graph is more optimized for bidirectional engine or unidirectional.
- separated the search engine in 3 files : 1 for the bidirectional SE (search_bidirectional.cpp) / 1 for the unidirectional SE (search_unidirectional.cpp) / 1 for for both of the engines (search.cpp).

Author: qwert1871

src/api.cpp

@@ -153,7 +153,7 @@ int launchApiGateway(const graph& gdata, search_buffers& buffers, const config&
         return 1;
     }
 
-    console("success", "server is listening on port 80.");
+    console("success", "server is listening on port 80. press any touch to close it.");
     logger("server is listening on port 80.");
 
     while (true)
@@ -324,7 +324,12 @@ int launchApiGateway(const graph& gdata, search_buffers& buffers, const config&
 
         path_result pres;
         if (success) {
-            pres = findShortestPath(gdata, buffers, conf, start_val, end_val, used_weight);
+            if(conf.search_engine == 1) {
+                pres = findShortestPathUnidirectional(gdata, buffers, conf, start_val, end_val, used_weight); 
+            }
+            else {
+                pres = findShortestPathBidirectional(gdata, buffers, conf, start_val, end_val, used_weight);
+            }
             if (pres.total_time < 0) {
                 success = false;
                 message_response = "NO PATH FOUND";

src/conf.cpp

@@ -161,6 +161,7 @@ static bool verifyConfFile(const config& conf)
     if (data.find("log") == data.end() || !isBoolString(data["log"])) return false;
     if (data.find("nb_alt") == data.end() || !isIntString(data["nb_alt"])) return false;
     if (data.find("weight") == data.end() || !isFloatString(data["weight"])) return false;
+    if (data.find("search_engine") == data.end() || !isIntString(data["search_engine"])) return false;
     return true;
 }
 
@@ -181,6 +182,7 @@ static void createConfFile(const config& conf)
     ofs << "weight=" << conf.weight << "\n";
     ofs << "personalized_weight=" << (conf.personalized_weight ? "true" : "false") << "\n";
     ofs << "log=" << (conf.log ? "true" : "false") << "\n";
+    ofs << "search_engine=" << conf.search_engine << "\n";
     ofs.close();
 }
 
@@ -204,6 +206,7 @@ static config loadConfFile(config conf)
         conf.personalized_weight = toBool(data["personalized_weight"]);
     }
     if (data.find("log") != data.end() && isBoolString(data["log"])) conf.log = toBool(data["log"]);
+    if (data.find("search_engine") != data.end() && isIntString(data["search_engine"])) conf.search_engine = toInt(data["search_engine"]);
     return conf;
 }
 
@@ -224,6 +227,7 @@ void loggerConf(config& conf)
     logger("  weight > " + std::to_string(conf.weight));
     logger("  personalized_weight > " + std::to_string(conf.personalized_weight));
     logger("  log > " + std::to_string(conf.log));
+    logger("  search_engine > " + std::to_string(conf.search_engine));
 }
 
 // ✅ function + comment verified.
@@ -329,14 +333,19 @@ config getConfiguration(config conf)
 
     optimization_flags flags = checkGraphOptimization(conf.map_path);
     console("info","is obtimized for ALT: [" + (flags.alt_optimized ? GREEN + "Yes" + RESET : RED + "No" + RESET) + "] ");
+    console("info", std::string("Search engine recommended: [ ") + (flags.search_engine_recommanded == 1 ? GREEN + "Unidirectional (avg: < 4 edges per node)" + RESET : "Unidirectional (avg: < 4 edges per node)") 
+    + " / " + (flags.search_engine_recommanded == 2 ? GREEN + "Both can be used (avg: 4-5 edges per node) " + RESET : "Both can be used (avg: 4-5 edges per node) ") 
+    + " / " + (flags.search_engine_recommanded == 3 ? GREEN + "Bidirectional (avg: > 5 edges per node)" + RESET : "Bidirectional (avg: > 5 edges per node)") + " ]");
 
     std::cout << "\n  ~ process\n" << std::flush;
 
+    conf.search_engine = getOneOrTwo("\n  > what type of search engine do you want to use? ('1' for unidirectional - '2' for bidirectional): ");
+
     bool use_alt = getYesNo("\n  > do you want to use the ALT pre-processing method (1min ~ 10min)? (y/n): ");
     if (use_alt) {
         conf.use_alt = true;
         conf.nb_alt = getInteger("\n  > how many landmarks do you want to use? (e.g., 10): ");
-        std::cout << "\n";
+        std::cout << "\n" << std::flush;
         bool backup_alt = getYesNo("  > do you want to backup this pre-process for future use? (this will consume time/storage) (y/n): ");
         conf.save_alt = backup_alt;
     }

src/decl.h

@@ -14,7 +14,7 @@ inline std::string GREEN = "\033[1;32m";
 inline std::string RESET = "\033[0m";
 
 /*------------------------------------------------------------------------------------
-							weight definition.
+							structure definition.
 ------------------------------------------------------------------------------------*/
 
 /**
@@ -38,6 +38,8 @@ struct config
 
     bool log = false;
 
+    int search_engine = 1;
+
     config() = default;
 };
 
@@ -74,6 +76,7 @@ struct graph
 struct optimization_flags
 {
     bool alt_optimized = false;
+    int search_engine_recommanded = 1;
 };
 
 /**
@@ -174,9 +177,12 @@ void clear();
 int getInteger(const std::string& prompt);
 double getPercentage(const std::string& prompt);
 bool getYesNo(const std::string& prompt);
+double getOneOrTwo(const std::string& prompt);
 
 void initializeSearchBuffers(const graph& gdata, search_buffers& buffers);
 
+std::vector<int> dijkstraSingleSource(const graph& gdata, int source, size_t node_count);
+
 //  log.cpp (Logging)
 bool initLogger(const std::string& log_file_path);
 void closeLogger();
@@ -212,9 +218,8 @@ bool loadAltData(graph& gdata, config& conf);
 void storePerf(const graph& g);
 
 //  search.cpp (Pathfinding)
-path_result findShortestPath(const graph& gdata, search_buffers& buffers, const config& conf, int start_node, int end_node, double weight);
-
-std::vector<int> dijkstraSingleSource(const graph& gdata, int source, size_t node_count);
+path_result findShortestPathBidirectional(const graph& gdata, search_buffers& buffers, const config& conf, int start_node, int end_node, double weight);
+path_result findShortestPathUnidirectional(const graph& gdata, search_buffers& buffers, const config& conf, int start_node, int end_node, double weight);
 
 //  api.cpp (API management)
 int launchApiGateway(const graph& gdata, search_buffers& buffers, const config& conf);

src/helper.cpp

@@ -154,6 +154,27 @@ double getPercentage(const std::string& prompt)
     return 1.0 + (static_cast<double>(percent) / 100.0);
 }
 
+// ✅ function + comment verified.
+/**
+ * @brief Prompts the user for a 1/2 response.
+ *
+ * Continuously asks until the user enters '1' or '2'.
+ *
+ * @param prompt The message displayed to the user.
+ * @return '1' or '2'.
+ */
+double getOneOrTwo(const std::string& prompt)
+{
+    int one_or_two;
+    while (true) {
+        one_or_two = getInteger(prompt);
+        if (one_or_two != 1 || one_or_two != 2) {
+            break;
+        }
+        console("error", "invalid input. please enter 1 or 2.");
+    }
+    return one_or_two;
+}
 
 
 // ✅ function + comment verified.

src/main.cpp

@@ -1,7 +1,9 @@
 // ✅ file verified.
+/* comment in the code have been added with ChatGPT. */
 #include "incl.h"
 #include "decl.h"
 
+
 // ✅ function + comment verified.
 /**
  * @brief Prints the program's main menu with a dynamic step title.
@@ -120,7 +122,13 @@ int main()
 
     storePerf(gdata);
 
-    launchApiGateway(gdata, buffers, conf);
+    std::thread apiThread(launchApiGateway, std::ref(gdata), std::ref(buffers), std::ref(conf));
+    apiThread.detach();
+
+    std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
+    std::cin.get();
 
     closeLogger();
+
+    return 0;
 }

src/opti.cpp

@@ -100,7 +100,18 @@ optimization_flags checkGraphOptimization(const std::string& map_path, double al
         density = edge_count / max_edges;
     }
 
+    double avg_edges_per_node = (node_count > 0) ? (2.0 * edge_count / node_count) : 0.0;
+    
     optimization_flags flags;
     flags.alt_optimized = (density < alt_density_threshold);
+    if (avg_edges_per_node < 4) {
+        flags.search_engine_recommanded = 1;
+    }
+    else if (avg_edges_per_node >= 4 && avg_edges_per_node <= 5) {
+        flags.search_engine_recommanded = 2;
+    }
+    else if (avg_edges_per_node > 5) {
+        flags.search_engine_recommanded = 3;
+    }
     return flags;
 }

src/perf.cpp

@@ -20,6 +20,7 @@
  *
  * Note: This file is independent of the main codebase and serves only for debugging.
  * It can be removed at any time without affecting core functionality.
+ * Note: The differents estimations to get the System Memory and Process Memory on different platform was generated by AI.
  */
 
 #include "incl.h"