Merge pull request #2986 from pgRouting/develop

Version 4.0.0-beta1 of pgRouting

Author: cvvergara

.github/scripts/update_locale.sh

@@ -39,7 +39,7 @@ perl -ne '/\/en\// && print' build/doc/locale_changes_po.txt | \
 
 # Remove obsolete entries #~ from .po files
 find locale -type f -name '*.po' -exec sh -c '
-    msgattrib --no-obsolete -o "$f" "$f"
+    msgattrib --no-obsolete -o "$1" "$1"
   ' sh {} \;
 
 while read -r f; do git add "$f"; done < build/doc/locale_changes_po_pot.txt

.github/workflows/check-queries.yml

@@ -111,9 +111,8 @@ jobs:
         run: |
           sudo -u postgres createdb -p ${PGPORT}  pgr_test__db__test
           # queries that might change
-          # version: will catch the current version
           # mincut: results change depending on boost
-          TESTDIRS="version mincut"
+          TESTDIRS="mincut"
           for d in ${TESTDIRS}
           do
             ./tools/testers/doc_queries_generator.pl -pgver "${PGVER}" -pguser runner -documentation -alg "docqueries/${d}"

.github/workflows/update-locale.yml

@@ -66,6 +66,7 @@ jobs:
             python3-sphinx \
             python3-sphinx-bootstrap-theme \
             sphinx-intl \
+            gettext \
             postgresql-${PGVER} \
             postgresql-server-dev-${PGVER} \
             graphviz

CMakeLists.txt

@@ -32,7 +32,7 @@ include(pgr/BuildType)
 
 project(PGROUTING VERSION 4.0.0
     LANGUAGES C CXX )
-set(PROJECT_VERSION_DEV "-alpha1")
+set(PROJECT_VERSION_DEV "-beta1")
 string(TOLOWER "${PROJECT_NAME}" PROJECT_NAME_LOWER)
 
 include(pgr/GitInfo)

NEWS.md

@@ -131,13 +131,26 @@ Summary of changes by function
 
   * Combinations signature promoted to official.
 
+* pgr_dijkstraNear
+
+  * Function promoted to official.
+
+* pgr_dijkstraNearCost
+
+  * Function promoted to official.
+
+* pgr_dijkstraVia
+
+  * Function promoted to official.
+
 * pgr_edgeColoring
 
   * Output columns standardized to ``(edge, color)``
 
 * pgr_edgeDisjointPaths
 
   * Output columns standardized to ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
+  * Combinations signature promoted to official.
 
 * pgr_edmondsKarp
 
@@ -160,6 +173,12 @@ Summary of changes by function
 
   * All signatures promoted to official.
 
+* pgr_maxCardinalityMatch
+
+  .. Breaking change
+  * Breaking change, signatures no longer available:
+    * pgr_maxCardinalityMatch(text,boolean)
+
 * pgr_maxFlow
 
   * Combinations signature promoted to official.
@@ -168,14 +187,14 @@ Summary of changes by function
 
   * Combinations signature promoted to official.
 
-* pgr_sloanOrdering
-
-  * New experimental function.
-
 * pgr_sequentialVertexColoring
 
   * Output columns standardized to ``(node, color)``
 
+* pgr_sloanOrdering
+
+  * New experimental function.
+
 * pgr_topologicalSort
 
   * Standardize output to ``(seq, node)``
@@ -220,6 +239,23 @@ Summary of changes by function
     * pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)
     * pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)
 
+* pgr_TSP
+
+  * Results change depending on input order
+  * Only for undirected graphs
+  .. Breaking change
+  * Breaking change, signatures no longer available:
+    * pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double
+      precision,double precision,double precision,boolean)
+
+* pgr_TSPeuclidean
+
+  * Results change depending on input order
+  .. Breaking change
+  * Breaking change, signatures no longer available:
+    * pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,
+      integer,double precision,double precision,double precision,boolean)
+
 * pgr_turnRestrictedPath
 
   * Output columns standardized to ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
@@ -286,6 +322,7 @@ Summary of changes by function
 
 Functions promoted to official
 
+* [#2701](https://github.com/pgRouting/pgrouting/issues/2701): pgr_trsp
 * [#2701](https://github.com/pgRouting/pgrouting/issues/2701): pgr_trsp
 * [#2701](https://github.com/pgRouting/pgrouting/issues/2701): pgr_trspVia
 * [#2701](https://github.com/pgRouting/pgrouting/issues/2701): pgr_trspVia_withPoints
@@ -296,6 +333,9 @@ Functions promoted to official
 * [#2700](https://github.com/pgRouting/pgrouting/issues/2700): pgr_withPointsDD
 * [#2700](https://github.com/pgRouting/pgrouting/issues/2700): pgr_withPointsKSP
 * [#2700](https://github.com/pgRouting/pgrouting/issues/2700): pgr_withPointsVia
+* [#2983](https://github.com/pgRouting/pgrouting/issues/2983): pgr_dijkstraNear
+* [#2983](https://github.com/pgRouting/pgrouting/issues/2983): pgr_dijkstraNearCost
+* [#2983](https://github.com/pgRouting/pgrouting/issues/2983): pgr_dijkstraVia
 
 Signatures promoted to official
 

doc/bdAstar/bdAstar-family.rst

@@ -53,7 +53,7 @@ The main Characteristics are:
 * For large graphs where there is a path between the starting vertex and ending
   vertex:
 
-  * It is expected to terminate faster than doc:`pgr_aStar`
+  * It is expected to terminate faster than :doc:`pgr_aStar`
 
 See :ref:`heuristics <astar_heuristics>` available and :ref:`factor
 <astar_factor>` handling.

doc/bdDijkstra/bdDijkstra-family.rst

@@ -77,7 +77,7 @@ The main Characteristics are:
 - For large graphs where there is a path bewtween the starting vertex and ending
   vertex:
 
-  - It is expected to terminate faster than pgr_dijkstra
+  - It is expected to terminate faster than :doc:`pgr_dijkstra`
 
 .. description end
 

doc/categories/cost-category.rst

@@ -21,22 +21,12 @@ Cost - Category
 * :doc:`pgr_aStarCost`
 * :doc:`pgr_bdAstarCost`
 * :doc:`pgr_dijkstraCost`
+* :doc:`pgr_dijkstraNearCost`
 * :doc:`pgr_bdDijkstraCost`
 * :doc:`pgr_withPointsCost`
 
 .. official-end
 
-.. include:: proposed.rst
-    :start-after: warning-begin
-    :end-before: end-warning
-
-.. proposed-start
-
-* :doc:`pgr_dijkstraNearCost`
-
-.. proposed-end
-
-
 General Information
 -------------------------------------------------------------------------------
 

doc/chinese/chinesePostmanProblem-family.rst

@@ -9,26 +9,26 @@
 
 |
 
-Chinese Postman Problem - Family of functions (Experimental)
+Chinese Postman Problem - Family of functions
 ===============================================================================
 
-.. official-start
+.. include:: experimental.rst
+   :start-after: warning-begin
+   :end-before: end-warning
+
+.. experimental-start
 
 * :doc:`pgr_chinesePostman`
 * :doc:`pgr_chinesePostmanCost`
 
-.. official-end
+.. experimental-end
 
 .. toctree::
   :hidden:
 
   pgr_chinesePostman
   pgr_chinesePostmanCost
 
-.. include:: experimental.rst
-   :start-after: warning-begin
-   :end-before: end-warning
-
 Description
 -------------------------------------------------------------------------------
 

doc/coloring/coloring-family.rst

@@ -29,13 +29,13 @@ Coloring - Family of functions
    :start-after: warning-begin
    :end-before: end-warning
 
-.. official-start
+.. experimental-start
 
 * :doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring
   approach.
 * :doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem.
 
-.. official-end
+.. experimental-end
 
 
 .. toctree::