Bd dijkstra using the shortest path process and driver

NEWS.md

@@ -15,6 +15,8 @@ To see all issues & pull requests closed by this release see the
 **Code enhancements**
 
 * [#3049](https://github.com/pgRouting/pgrouting/issues/3049): Use enumeration on drivers and process.
+* [#3054](https://github.com/pgRouting/pgrouting/issues/3054): Change error message when edges_sql is empty
+* [#3055](https://github.com/pgRouting/pgrouting/issues/3055): bdDijkstra: use the shortest_path process and driver
 
 ## pgRouting 4.0
 

doc/src/release_notes.rst

@@ -40,6 +40,8 @@ To see all issues & pull requests closed by this release see the
 .. rubric:: Code enhancements
 
 * :issue:`3049`: Use enumeration on drivers and process.
+* :issue:`3054`: Change error message when edges_sql is empty
+* :issue:`3055`: bdDijkstra: use the shortest_path process and driver
 
 pgRouting 4.0
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

include/bdDijkstra/bdDijkstra.hpp

@@ -35,6 +35,9 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #include <vector>
 #include <limits>
 #include <functional>
+#include <set>
+#include <map>
+#include <deque>
 
 
 #include "cpp_common/bidirectional.hpp"
@@ -141,6 +144,35 @@ class Pgr_bdDijkstra : public Pgr_bidirectional<G> {
 };
 
 }  // namespace bidirectional
+
+namespace algorithms {
+
+template <class G>
+std::deque<pgrouting::Path>
+bdDijkstra(
+        G &graph,
+        const std::map<int64_t, std::set<int64_t>> &combinations,
+        bool only_cost) {
+    using pgrouting::Path;
+
+    pgrouting::bidirectional::Pgr_bdDijkstra<G> fn_bdDijkstra(graph);
+    std::deque<Path> paths;
+
+    for (const auto &comb : combinations) {
+        auto source = comb.first;
+        if (!graph.has_vertex(source)) continue;
+
+        for (const auto &target : comb.second) {
+            if (!graph.has_vertex(target)) continue;
+            fn_bdDijkstra.clear();
+
+            paths.push_back(fn_bdDijkstra.pgr_bdDijkstra(graph.get_V(source), graph.get_V(target), only_cost));
+        }
+    }
+    return paths;
+}
+
+}  // namespace algorithms
 }  // namespace pgrouting
 
 #endif  // INCLUDE_BDDIJKSTRA_BDDIJKSTRA_HPP_

include/c_common/enums.h

@@ -31,7 +31,7 @@ enum Which {
     /** directed graph + results: vertex id  */
     TOPOSORT = 11,
     /** shortest_paths */
-    DIJKSTRA = 21, WITHPOINTS, OLD_WITHPOINTS,
+    DIJKSTRA = 21, WITHPOINTS, OLD_WITHPOINTS, BDDIJKSTRA,
     /** allpairs **/
     FLOYD = 31, JOHNSON,
     /** metrics **/

locale/en/LC_MESSAGES/pgrouting_doc_strings.po

@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v4.1\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2026-02-01 00:30+0000\n"
+"POT-Creation-Date: 2026-02-05 18:16+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3931,6 +3931,16 @@ msgid ""
 "enumeration on drivers and process."
 msgstr ""
 
+msgid ""
+"`#3054 <https://github.com/pgRouting/pgrouting/issues/3054>`__: Change error "
+"message when edges_sql is empty"
+msgstr ""
+
+msgid ""
+"`#3055 <https://github.com/pgRouting/pgrouting/issues/3055>`__: bdDijkstra: "
+"use the shortest_path process and driver"
+msgstr ""
+
 msgid "All releases"
 msgstr ""
 

locale/pot/pgrouting_doc_strings.pot

@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v4.1\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2026-02-01 00:30+0000\n"
+"POT-Creation-Date: 2026-02-05 18:16+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3532,6 +3532,12 @@ msgstr ""
 msgid "`#3049 <https://github.com/pgRouting/pgrouting/issues/3049>`__: Use enumeration on drivers and process."
 msgstr ""
 
+msgid "`#3054 <https://github.com/pgRouting/pgrouting/issues/3054>`__: Change error message when edges_sql is empty"
+msgstr ""
+
+msgid "`#3055 <https://github.com/pgRouting/pgrouting/issues/3055>`__: bdDijkstra: use the shortest_path process and driver"
+msgstr ""
+
 msgid "All releases"
 msgstr ""
 

pgtap/allpairs/floydWarshall/no_crash_test.pg

@@ -6,7 +6,7 @@
 BEGIN;
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT plan(5);
+SELECT plan(6);
 
 PREPARE edges AS
 SELECT id, source, target, cost, reverse_cost  FROM edges;
@@ -32,6 +32,7 @@ LANGUAGE plpgsql VOLATILE;
 
 
 SELECT * FROM test_function();
+SELECT throw_on_empty_edges_sql('pgr_floydWarshall', '');
 
 SELECT finish();
 ROLLBACK;

pgtap/allpairs/johnson/no_crash_test.pg

@@ -6,7 +6,7 @@
 BEGIN;
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT plan(5);
+SELECT plan(6);
 
 PREPARE edges AS
 SELECT id, source, target, cost, reverse_cost  FROM edges;
@@ -33,6 +33,7 @@ LANGUAGE plpgsql VOLATILE;
 
 
 SELECT * FROM test_function();
+SELECT throw_on_empty_edges_sql('pgr_johnson', '');
 
 SELECT finish();
 ROLLBACK;

pgtap/bdDijkstra/bdDijkstra/no_crash_test.pg

@@ -7,9 +7,11 @@ BEGIN;
 
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT CASE WHEN min_version('3.2.0') THEN plan(97) ELSE plan(84) END;
+SELECT CASE WHEN min_version('3.2.0') THEN plan(98) ELSE plan(85) END;
 
 
 SELECT general_no_crash('pgr_bdDijkstra');
+SELECT throw_on_empty_edges_sql('pgr_bdDijkstra', ',1,2');
+
 SELECT finish();
 ROLLBACK;

pgtap/bdDijkstra/bdDijkstraCost/no_crash_test.pg

@@ -7,10 +7,12 @@ BEGIN;
 
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT CASE WHEN min_version('3.2.0') THEN plan(97) ELSE plan(84) END;
+SELECT CASE WHEN min_version('3.2.0') THEN plan(98) ELSE plan(85) END;
 
 
 SELECT general_no_crash('pgr_bdDijkstraCost');
+SELECT throw_on_empty_edges_sql('pgr_bdDijkstraCost', ',1,2');
+
 SELECT finish();
 ROLLBACK;
 

pgtap/bdDijkstra/bdDijkstraCostMatrix/no_crash_test.pg

@@ -6,7 +6,7 @@
 BEGIN;
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT plan(14);
+SELECT plan(15);
 
 PREPARE edges AS
 SELECT id, source, target, cost, reverse_cost  FROM edges;
@@ -45,6 +45,7 @@ LANGUAGE plpgsql VOLATILE;
 
 
 SELECT * FROM test_function();
+SELECT throw_on_empty_edges_sql('pgr_bdDijkstraCostMatrix', ',ARRAY[1,2]');
 
 SELECT finish();
 ROLLBACK;

pgtap/dijkstra/dijkstra/no_crash_test.pg

@@ -7,9 +7,11 @@ BEGIN;
 
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT CASE WHEN min_version('3.1.0') THEN plan(81) ELSE plan(68) END;
+SELECT CASE WHEN min_version('3.1.0') THEN plan(82) ELSE plan(69) END;
 
 SELECT no_crash_dijkstra('pgr_dijkstra');
+SELECT throw_on_empty_edges_sql('pgr_dijkstra', ',1,2');
+
 SELECT finish();
 
 ROLLBACK;

pgtap/dijkstra/dijkstraCost/no_crash_test.pg

@@ -7,9 +7,10 @@ BEGIN;
 
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT CASE WHEN min_version('3.1.0') THEN plan(81) ELSE plan(68) END;
+SELECT CASE WHEN min_version('3.1.0') THEN plan(82) ELSE plan(69) END;
 
 SELECT no_crash_dijkstra('pgr_dijkstraCost');
-SELECT finish();
+SELECT throw_on_empty_edges_sql('pgr_dijkstraCost', ',1,2');
 
+SELECT finish();
 ROLLBACK;

pgtap/dijkstra/dijkstraCostMatrix/no_crash_test.pg

@@ -6,7 +6,7 @@
 BEGIN;
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT plan(14);
+SELECT plan(15);
 
 PREPARE edges AS
 SELECT id, source, target, cost, reverse_cost  FROM edges;
@@ -45,6 +45,7 @@ LANGUAGE plpgsql VOLATILE;
 
 
 SELECT * FROM test_function();
+SELECT throw_on_empty_edges_sql('pgr_dijkstraCostMatrix', ',ARRAY[1,2]');
 
 SELECT finish();
 ROLLBACK;

pgtap/dijkstra/dijkstraNear/no_crash_test.pg

@@ -5,7 +5,7 @@
 
 BEGIN;
 
-SELECT CASE WHEN NOT min_version('3.2.0') THEN plan(1) ELSE plan(126) END;
+SELECT CASE WHEN min_version('3.2.0') THEN plan(127) ELSE plan(1) END;
 SET client_min_messages TO WARNING;
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
 
@@ -136,6 +136,7 @@ BEGIN
   RETURN query SELECT * FROM no_crash_test('pgr_dijkstraNear', params1, subs2);
   RETURN query SELECT * FROM no_crash_test('pgr_dijkstranear', params2, subs1);
   RETURN query SELECT * FROM no_crash_test('pgr_dijkstraNear', params2, subs2);
+  RETURN query SELECT throw_on_empty_edges_sql('pgr_dijkstranear', ',1,ARRAY[5,6]');
 END
 $BODY$
 LANGUAGE plpgsql VOLATILE;

pgtap/dijkstra/dijkstraNearCost/no_crash_test.pg

@@ -5,7 +5,7 @@
 
 BEGIN;
 
-SELECT CASE WHEN NOT min_version('3.2.0') THEN plan(1) ELSE plan(126) END;
+SELECT CASE WHEN min_version('3.2.0') THEN plan(127) ELSE plan(1) END;
 SET client_min_messages TO WARNING;
 
 UPDATE edges SET cost = sign(cost) + 0.001 * id * id, reverse_cost = sign(reverse_cost) + 0.001 * id * id;
@@ -142,11 +142,13 @@ SELECT is_empty('null_comb', 'Should be empty to tests be meaningful');
     RETURN query SELECT * FROM no_crash_test('pgr_dijkstranearcost', params1, subs2);
     RETURN query SELECT * FROM no_crash_test('pgr_dijkstranearcost', params2, subs1);
     RETURN query SELECT * FROM no_crash_test('pgr_dijkstranearcost', params2, subs2);
+    RETURN query SELECT throw_on_empty_edges_sql('pgr_dijkstranearcost', ',1,ARRAY[5,6]');
 END
 $BODY$
 LANGUAGE plpgsql VOLATILE;
 
 
 SELECT * FROM no_crash();
+
 SELECT finish();
 ROLLBACK;

pgtap/metrics/bandwidth/no_crash_test.pg

@@ -6,7 +6,7 @@
 BEGIN;
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT CASE WHEN min_version('4.0.0') THEN plan(4) ELSE plan(1) END;
+SELECT CASE WHEN min_version('4.0.0') THEN plan(5) ELSE plan(1) END;
 
 PREPARE edges_q AS
 SELECT id, source, target, cost, reverse_cost  FROM edges;
@@ -38,6 +38,7 @@ BEGIN
     ]::TEXT[];
 
     RETURN query SELECT * FROM no_crash_test('pgr_bandwidth', params, subs);
+    RETURN query SELECT throw_on_empty_edges_sql('pgr_bandwidth', '');
 
 END
 $BODY$

pgtap/ordering/cuthillMckeeOrdering/no_crash_test.pg

@@ -6,7 +6,7 @@
 BEGIN;
 
 UPDATE edges SET cost = sign(cost), reverse_cost = sign(reverse_cost);
-SELECT CASE WHEN NOT min_version('3.4.0') THEN plan(1) ELSE plan(7) END;
+SELECT CASE WHEN min_version('3.4.0') THEN plan(8) ELSE plan(1) END;
 
 PREPARE edges AS
 SELECT id, source, target, cost, reverse_cost  FROM edges;
@@ -48,6 +48,7 @@ BEGIN
     ]::TEXT[];
 
     RETURN query SELECT * FROM no_crash_test('pgr_cuthillMckeeOrdering', params, subs);
+    RETURN query SELECT throw_on_empty_edges_sql('pgr_cuthillMckeeOrdering', '');
 
 END
 $BODY$