Spanning tree new process and driver

NEWS.md

@@ -20,6 +20,7 @@ To see all issues & pull requests closed by this release see the
 * [#3056](https://github.com/pgRouting/pgrouting/issues/3056): edwardMoore: use the shortest_path process and driver
 * [#3060](https://github.com/pgRouting/pgrouting/issues/3060): dagShortestPath: use the shortest_path process and driver
 * [#3064](https://github.com/pgRouting/pgrouting/issues/3064): Astar: create and use a process and driver for Astar
+* [#3075](https://github.com/pgRouting/pgrouting/issues/3075): Spanning tree: create and use a process and driver
 
 ## pgRouting 4.0
 

doc/src/release_notes.rst

@@ -45,6 +45,7 @@ To see all issues & pull requests closed by this release see the
 * :issue:`3056`: edwardMoore: use the shortest_path process and driver
 * :issue:`3060`: dagShortestPath: use the shortest_path process and driver
 * :issue:`3064`: Astar: create and use a process and driver for Astar
+* :issue:`3075`: Spanning tree: create and use a process and driver
 
 pgRouting 4.0
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

include/breadthFirstSearch/breadthFirstSearch.hpp

@@ -43,7 +43,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 //******************************************
 
 namespace pgrouting {
-namespace functions {
+namespace algorithms {
 
 template <class G>
 class Pgr_breadthFirstSearch {
@@ -113,6 +113,22 @@ class Pgr_breadthFirstSearch {
          return results;
      }
 };
+
+}  // namespace algorithms
+
+namespace functions {
+
+template <class G>
+std::vector<MST_rt> breadthFirstSearch(
+        G &graph,
+        const std::set<int64_t> &roots,
+        bool,
+        int64_t max_depth) {
+    pgrouting::algorithms::Pgr_breadthFirstSearch<G> fn_breadthFirstSearch;
+    auto results = fn_breadthFirstSearch.breadthFirstSearch(graph, roots, max_depth);
+    return results;
+}
+
 }  // namespace functions
 }  // namespace pgrouting
 

include/c_common/enums.h

@@ -38,7 +38,13 @@ enum Which {
     /** metrics **/
     BANDWIDTH,
     /** with edges that have x y */
-    ASTAR = 400, BDASTAR
+    ASTAR = 400, BDASTAR,
+    /** For spanning tree like results */
+    KRUSKAL = 500, KRUSKALDD, KRUSKALDFS, KRUSKALBFS,
+    PRIM = 510, PRIMDD, PRIMDFS, PRIMBFS,
+    DFS = 520,
+    BFS = 530,
+    DIJKSTRADD = 540
 };
 
 #endif  // INCLUDE_C_COMMON_ENUMS_H_

include/cpp_common/to_postgres.hpp

@@ -28,6 +28,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 #include <vector>
 #include <deque>
+#include <map>
 #include <cstddef>
 
 #include "c_types/contractionHierarchies_rt.h"
@@ -61,11 +62,26 @@ size_t get_viaRoute(std::deque<pgrouting::Path>&, Routes_t**);
  */
 size_t get_tuples(const std::deque<pgrouting::Path>&, Path_rt*&);
 
+
 /*
  * @brief get tuples from a Path to a MST_rt
  */
 size_t get_tuples(const std::deque<pgrouting::Path>&, MST_rt*&);
 
+/*
+ * @brief get tuples for spanning tree driver
+ */
+size_t get_tuples(
+        const std::vector<MST_rt>&,
+        const std::deque<pgrouting::Path>&,
+        const std::vector<std::map<int64_t, int64_t>>&,
+        MST_rt*&);
+
+/*
+ * @brief get tuples from a vector of MST_rt to a MST_rt
+ */
+size_t get_tuples(const std::vector<MST_rt>&, MST_rt*&);
+
 /** @brief Vector of vertices id are saved on a C array
  *
  * @param[in] graph Created graph with the base Graph

include/cpp_common/utilities.hpp

@@ -26,9 +26,13 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #define INCLUDE_CPP_COMMON_UTILITIES_HPP_
 #pragma once
 
+#include <set>
+#include <vector>
 #include <string>
+#include <cstdint>
 
 #include "c_common/enums.h"
+#include "c_types/mst_rt.h"
 
 namespace pgrouting {
 
@@ -37,6 +41,7 @@ std::string get_name(Which, bool, bool);
 std::string get_name(Which, bool, bool, bool);
 char estimate_drivingSide(char, Which);
 void get_new_queries(const std::string&, const std::string&, std::string&, std::string&);
+std::vector<MST_rt> only_root_result(const std::set<int64_t>&);
 
 }  //  namespace pgrouting
 

include/dijkstra/drivingDist.hpp

@@ -485,7 +485,7 @@ std::deque<pgrouting::Path> drivingDistance_no_equicost(
 
 
 namespace pgrouting {
-namespace algorithm {
+namespace functions {
 
 template <typename G>
 std::deque<Path> drivingDistance(
@@ -510,7 +510,7 @@ std::deque<Path> drivingDistance(
     }
 }
 
-}  // namespace algorithm
+}  // namespace functions
 }  // namespace pgrouting