pgRouting · cvvergara · Feb 7, 2026 · Feb 5, 2026 · Feb 5, 2026 · Feb 5, 2026
diff --git a/NEWS.md b/NEWS.md
@@ -17,6 +17,7 @@ To see all issues & pull requests closed by this release see the
 * [#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
+* [#3056](https://github.com/pgRouting/pgrouting/issues/3056): edwardMoore: use the shortest_path process and driver
 
 ## pgRouting 4.0
 

diff --git a/doc/src/release_notes.rst b/doc/src/release_notes.rst
@@ -42,6 +42,7 @@ To see all issues & pull requests closed by this release see the
 * :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
+* :issue:`3056`: edwardMoore: use the shortest_path process and driver
 
 pgRouting 4.0
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

diff --git a/include/bellman_ford/edwardMoore.hpp b/include/bellman_ford/edwardMoore.hpp
@@ -191,6 +191,19 @@ class Pgr_edwardMoore {
     }
 };
 }  // namespace functions
+
+namespace algorithms {
+
+template <class G>
+std::deque<pgrouting::Path>
+edwardMoore(
+        G &graph,
+        const std::map<int64_t, std::set<int64_t>> &combinations) {
+    pgrouting::functions::Pgr_edwardMoore<G> fn_edwardMoore;
+    return fn_edwardMoore.edwardMoore(graph, combinations);
+}
+
+}  // namespace algorithms
 }  // namespace pgrouting
 
 #endif  // INCLUDE_BELLMAN_FORD_EDWARDMOORE_HPP_
diff --git a/include/c_common/enums.h b/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, BDDIJKSTRA,
+    DIJKSTRA = 21, WITHPOINTS, OLD_WITHPOINTS, BDDIJKSTRA, EDWARDMOORE,
     /** allpairs **/
     FLOYD = 31, JOHNSON,
     /** metrics **/

diff --git a/include/drivers/bellman_ford/edwardMoore_driver.h b/include/drivers/bellman_ford/edwardMoore_driver.h
diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/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-05 18:16+0000\n"
+"POT-Creation-Date: 2026-02-06 17:38+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"
@@ -3941,6 +3941,11 @@ msgid ""
 "use the shortest_path process and driver"
 msgstr ""
 
+msgid ""
+"`#3056 <https://github.com/pgRouting/pgrouting/issues/3056>`__: edwardMoore: "
+"use the shortest_path process and driver"
+msgstr ""
+
 msgid "All releases"
 msgstr ""
 

diff --git a/locale/pot/pgrouting_doc_strings.pot b/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-05 18:16+0000\n"
+"POT-Creation-Date: 2026-02-06 17:38+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"
@@ -3538,6 +3538,9 @@ msgstr ""
 msgid "`#3055 <https://github.com/pgRouting/pgrouting/issues/3055>`__: bdDijkstra: use the shortest_path process and driver"
 msgstr ""
 
+msgid "`#3056 <https://github.com/pgRouting/pgrouting/issues/3056>`__: edwardMoore: use the shortest_path process and driver"
+msgstr ""
+
 msgid "All releases"
 msgstr ""
 

diff --git a/pgtap/bellman_ford/edwardMoore/no_crash_test.pg b/pgtap/bellman_ford/edwardMoore/no_crash_test.pg
@@ -7,10 +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_edwardMoore');
+SELECT throw_on_empty_edges_sql('pgr_edwardMoore', ',1,2');
 SELECT finish();
 
 ROLLBACK;

diff --git a/src/allpairs/floydWarshall.c b/src/allpairs/floydWarshall.c
@@ -28,12 +28,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 #include <stdbool.h>
 #include "c_common/postgres_connection.h"
-
 #include "c_types/iid_t_rt.h"
-#include "c_common/debug_macro.h"
-#include "c_common/e_report.h"
-#include "c_common/time_msg.h"
-
 #include "process/allpairs_process.h"
 
 PGDLLEXPORT Datum _pgr_floydwarshall(PG_FUNCTION_ARGS);

diff --git a/src/allpairs/johnson.c b/src/allpairs/johnson.c
@@ -29,12 +29,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 #include <stdbool.h>
 #include "c_common/postgres_connection.h"
-
 #include "c_types/iid_t_rt.h"
-#include "c_common/debug_macro.h"
-#include "c_common/e_report.h"
-#include "c_common/time_msg.h"
-
 #include "process/allpairs_process.h"
 
 PGDLLEXPORT Datum _pgr_johnson(PG_FUNCTION_ARGS);

diff --git a/src/bdDijkstra/bdDijkstra.c b/src/bdDijkstra/bdDijkstra.c
@@ -30,11 +30,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 #include <stdbool.h>
 #include "c_common/postgres_connection.h"
-
 #include "c_types/path_rt.h"
-#include "c_common/debug_macro.h"
-#include "c_common/e_report.h"
-#include "c_common/time_msg.h"
 #include "process/shortestPath_process.h"
 
 PGDLLEXPORT Datum _pgr_bddijkstra(PG_FUNCTION_ARGS);

diff --git a/src/bellman_ford/CMakeLists.txt b/src/bellman_ford/CMakeLists.txt
@@ -1,11 +1,11 @@
 # This file is part of the pgRouting project.
 # Copyright (c) 2018-2026 pgRouting developers
 # License: GPL-2 See https://github.com/pgRouting/pgrouting/blob/main/LICENSE
+
 ADD_LIBRARY(bellman_ford OBJECT
     bellman_ford.c
     bellman_ford_driver.cpp
     #bellman_ford_neg.c
     #bellman_ford_neg_driver.cpp
     edwardMoore.c
-    edwardMoore_driver.cpp
-    )
+)