feat(cpp): add make_searcher overloads accepting the DynamicExplorationGraph facade

Author: Neiko2002

cpp/deglib/include/deglib/deglib.h

@@ -115,4 +115,25 @@ inline DynamicExplorationGraph load_mutable_graph(const char* path_graph, const
     return DynamicExplorationGraph(std::move(graph));
 }
 
+/**
+ * Create a high-performance Searcher over a DynamicExplorationGraph facade.
+ * Convenience overloads that forward to deglib::search::make_searcher using the graph's internal representation,
+ * so end users can pass the public graph type directly.
+ */
+inline std::unique_ptr<deglib::search::SearcherBase> make_searcher(const DynamicExplorationGraph& graph) {
+    return deglib::search::make_searcher(graph.internal());
+}
+
+template <typename QuantT>
+    requires deglib::quantization::Quantizer<QuantT>
+inline std::unique_ptr<deglib::search::SearcherBase> make_searcher(const DynamicExplorationGraph& graph, QuantT quantizer) {
+    return deglib::search::make_searcher(graph.internal(), std::move(quantizer));
+}
+
+template <typename QuantT, typename RefinerT>
+    requires(deglib::quantization::Quantizer<QuantT> || std::is_same_v<QuantT, deglib::search::NoQuantizer>)
+inline std::unique_ptr<deglib::search::SearcherBase> make_searcher(const DynamicExplorationGraph& graph, QuantT quantizer, RefinerT refiner) {
+    return deglib::search::make_searcher(graph.internal(), std::move(quantizer), std::move(refiner));
+}
+
 }  // namespace deglib

cpp/test/src/unit/test_searcher.cpp

@@ -1,6 +1,7 @@
 // test_searcher.cpp — Unit tests for deglib::search::Searcher (searcher.h)
 
 #include "deglib/builder.h"
+#include "deglib/deglib.h"
 #include "deglib/distances.h"
 #include "deglib/graph.h"
 #include "deglib/optimization.h"
@@ -47,6 +48,27 @@ TEST(SearcherTest, DirectFP32Search) {
     EXPECT_NEAR(span_res.distances[0], 0.0f, 1e-5f);
 }
 
+TEST(SearcherTest, MakeSearcherAcceptsFacade) {
+    const uint32_t dim = 4;
+    const uint32_t count = 20;
+
+    std::vector<float> data(count * dim);
+    for (size_t i = 0; i < data.size(); ++i) {
+        data[i] = static_cast<float>(i * 1.5f + 0.1f);
+    }
+
+    auto graph = deglib::builder::build_from_data(std::span<const float>(data), dim, {}, 8, deglib::distances::Metric::FP32_L2);
+
+    // The facade-level overload accepts a DynamicExplorationGraph directly (no .internal() bridge needed).
+    auto searcher = deglib::make_searcher(graph);
+    ASSERT_NE(searcher, nullptr);
+
+    auto res = searcher->search(std::span<const float>(data.data(), dim), 5, 0.1f, 1.0f, /*return_distances=*/true);
+    EXPECT_EQ(res.size(), 5u);
+    EXPECT_EQ(res.indices[0], 0u);
+    EXPECT_NEAR(res.distances[0], 0.0f, 1e-5f);
+}
+
 TEST(SearcherTest, QuantizedInt8WithFP16Refiner) {
     const uint32_t dim = 8;
     const uint32_t count = 50;