Week 3 bandwidth

.gitignore

@@ -12,3 +12,4 @@ notUsed
 
 .vscode
 taptest.sh
+run.sh

NEWS.md

@@ -54,6 +54,9 @@ Functions promoted to official
 
 **Signatures promoted to official**
 
+[#2718](https://github.com/pgRouting/pgrouting/issues/2918)
+  Make official the Combinations signature on the official functions
+
 * pgr_aStar(Combinations)
 * pgr_aStarCost(Combinations)
 * pgr_bdAstar(Combinations)
@@ -74,14 +77,8 @@ SQL signatures and output standardization
 [#2904](https://github.com/pgRouting/pgrouting/issues/2904)
 Standardize output columns of functions with different output columns within overloads
 
-
 **Official functions**
 
-* [#2906](https://github.com/pgRouting/pgrouting/issues/2906) pgr_bdDijkstra
-
-  * Output columns standardized to ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
-  * Combinations signature promoted to official.
-
 * [#2905](https://github.com/pgRouting/pgrouting/issues/2905) 
    pgr_withPoints
 
@@ -92,15 +89,10 @@ Standardize output columns of functions with different output columns within ove
     - Directed graph valid values: ``l`` or ``L`` and ``r``, ``R``
     - Undirected graph valid values: ``b`` or ``B``
 
-* [#2905](https://github.com/pgRouting/pgrouting/issues/2905)
-  pgr_withPointsCost
+* [#2906](https://github.com/pgRouting/pgrouting/issues/2906) pgr_bdDijkstra
 
-  * Function promoted to official.
-  * Output columns standardized to ``(start_vid, end_vid, agg_cost)``
-  * Signature change: ``driving_side`` parameter changed from named optional to
-    unnamed positional.
-    - Directed graph valid values: ``l`` or ``L`` and ``r``, ``R``
-    - Undirected graph valid values: ``b`` or ``B``
+  * Output columns standardized to ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
+  * Combinations signature promoted to official.
 
 **Experimental functions**
 
@@ -109,11 +101,21 @@ Standardize output columns of functions with different output columns within ove
 
   * Output columns standardized to ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
 
+* [#2908](https://github.com/pgRouting/pgrouting/issues/2908)
+  pgr_binaryBreadthFirstSearch
+
+  * Output columns standardized to ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
+
 * [#2910](https://github.com/pgRouting/pgrouting/issues/2910)
   pgr_edwardMoore
 
   * Output columns standardized to ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
 
+* [#2913](https://github.com/pgRouting/pgrouting/issues/2913)
+  pgr_DAGshortestPath
+
+  * Output columns standardized to ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``
+
 Removal of SQL deprecated signatures
 ...............................................................................
 
@@ -207,6 +209,10 @@ Related issues: [#2897](https://github.com/pgRouting/pgrouting/issues/2897)
 * _v4trsp(text,text,text,boolean)
 * _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)
 * _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)
+* [#2913](https://github.com/pgRouting/pgrouting/issues/2913)
+  _pgr_dagshortestpath(text,text,boolean,boolean)
+* [#2913](https://github.com/pgRouting/pgrouting/issues/2913)
+  _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)
 
 
 * [#2861](https://github.com/pgRouting/pgrouting/issues/2861):
@@ -253,5 +259,7 @@ Code enhancements
 * _v4trsp(text,text,anyarray,anyarray,boolean)
 * _v4trsp(text,text,text,boolean)
 * _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)
+* [#2913](https://github.com/pgRouting/pgrouting/issues/2913)
+  _pgr_dagshortestpath
 
 </details>

doc/dagShortestPath/pgr_dagShortestPath.rst

@@ -27,15 +27,19 @@ In particular, the DAG shortest paths algorithm implemented by Boost.Graph.
 
 .. rubric:: Availability
 
-* Version 3.2.0
+.. rubric:: Version 4.0.0
 
-  * New experimental function.
+* Output columns standardized to |short-generic-result|
 
-    * pgr_dagShortestPath(Combinations)
+.. rubric:: Version 3.2.0
 
-* Version 3.0.0
+* New experimental function.
 
-  * New experimental function.
+  * pgr_dagShortestPath(Combinations)
+
+..rubric:: Version 3.0.0
+
+* New experimental function.
 
 
 Description
@@ -93,7 +97,7 @@ Signatures
    | pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)
    | pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 
@@ -108,7 +112,7 @@ One to One
 
    | pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertex :math:`5` to vertex :math:`11` on a **directed** graph
@@ -128,7 +132,7 @@ One to Many
 
    | pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertex :math:`5` to vertices :math:`\{7, 11\}`
@@ -148,7 +152,7 @@ Many to One
 
    | pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertices :math:`\{5, 10\}` to vertex :math:`11`
@@ -168,7 +172,7 @@ Many to Many
 
    | pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertices :math:`\{5, 15\}` to vertices :math:`\{11, 17\}` on an
@@ -189,7 +193,7 @@ Combinations
 
    | pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: Using a combinations table on an **undirected** graph
@@ -234,8 +238,8 @@ Return columns
 -------------------------------------------------------------------------------
 
 .. include:: pgRouting-concepts.rst
-    :start-after: return_path_short_start
-    :end-before: return_path_short_end
+    :start-after: return_path_complete_start
+    :end-before: return_path_complete_end
 
 Additional Examples
 -------------------------------------------------------------------------------

doc/src/migration.rst

@@ -81,6 +81,10 @@ types.
      - `Migration of single path functions`_
    * - .. versionchanged:: 4.0.0 :doc:`pgr_bellmanFord` [3]_
      - `Migration of single path functions`_
+   * - .. versionchanged:: 4.0.0 :doc:`pgr_binaryBreadthFirstSearch` [3]_
+     - `Migration of single path functions`_
+   * - .. versionchanged:: 4.0.0 :doc:`pgr_dagShortestPath` [3]_
+     - `Migration of single path functions`_
    * - .. versionchanged:: 4.0.0 :doc:`pgr_edwardMoore` [3]_
      - `Migration of single path functions`_
    * - .. versionchanged:: 4.0.0 :doc:`pgr_withPoints` [2]_
@@ -313,6 +317,9 @@ application.
    * - ``pgr_bellmanFord``
      - v < 4.0
      - |old-generic-result|
+   * - ``pgr_dagShortestPath``
+     - v < 4.0
+     - |result-1-1|
    * - ``pgr_edwardMoore``
      - v < 4.0
      - |old-generic-result|
@@ -410,6 +417,24 @@ Before updating pgRouting enumerate the columns: |result-1-1|
    :start-after: --bdDijkstra-1-to-1-filter
    :end-before: --bdDijkstra-1-to-m
 
+.. rubric:: Using ``pgr_DAGshortestPath``
+
+Migrating `this v3.8
+<https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__
+example.
+
+.. literalinclude:: migration.queries
+   :start-after: --DAGshortestPath-1-to-1
+   :end-before: --DAGshortestPath-1-to-1-filter
+
+Before updating pgRouting enumerate the columns: |result-1-1|
+
+.. literalinclude:: migration.queries
+   :start-after: --DAGshortestPath-1-to-1-filter
+   :end-before: --DAGshortestPath-END
+
+.. note:: This applies to all signatures of ``pgr_DAGshortestPath``
+
 Examples for One to Many with one route result
 ...............................................................................
 

doc/src/release_notes.rst

@@ -75,6 +75,9 @@ Functions promoted to official
 
 .. rubric:: Signatures promoted to official
 
+`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__
+  Make official the Combinations signature on the official functions
+
 * pgr_aStar(Combinations)
 * pgr_aStarCost(Combinations)
 * pgr_bdAstar(Combinations)
@@ -95,26 +98,18 @@ SQL signatures and output standardization
 `#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__
 Standardize output columns of functions with different output columns within overloads
 
-
 .. rubric:: Official functions
 
-* `#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__ pgr_bdDijkstra
-
-  .. include:: pgr_bdDijkstra.rst
-     :start-after: Version 4.0.0
-     :end-before: .. rubric
-
 * `#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ 
    pgr_withPoints
 
   .. include:: pgr_withPoints.rst
      :start-after: Version 4.0.0
      :end-before: .. rubric
 
-* `#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__
-  pgr_withPointsCost
+* `#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__ pgr_bdDijkstra
 
-  .. include:: pgr_withPointsCost.rst
+  .. include:: pgr_bdDijkstra.rst
      :start-after: Version 4.0.0
      :end-before: .. rubric
 
@@ -127,13 +122,27 @@ Standardize output columns of functions with different output columns within ove
      :start-after: Version 4.0.0
      :end-before: .. rubric
 
+* `#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__
+  pgr_binaryBreadthFirstSearch
+
+  .. include:: pgr_binaryBreadthFirstSearch.rst
+     :start-after: Version 4.0.0
+     :end-before: .. rubric
+
 * `#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__
   pgr_edwardMoore
 
   .. include:: pgr_edwardMoore.rst
      :start-after: Version 4.0.0
      :end-before: .. rubric
 
+* `#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__
+  pgr_DAGshortestPath
+
+  .. include:: pgr_dagShortestPath.rst
+     :start-after: Version 4.0.0
+     :end-before: .. rubric
+
 Removal of SQL deprecated signatures
 ...............................................................................
 
@@ -227,6 +236,10 @@ Related issues: `#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__
 * _v4trsp(text,text,text,boolean)
 * _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)
 * _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)
+* `#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__
+  _pgr_dagshortestpath(text,text,boolean,boolean)
+* `#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__
+  _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)
 
 
 * `#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__:
@@ -273,6 +286,8 @@ Code enhancements
 * _v4trsp(text,text,anyarray,anyarray,boolean)
 * _v4trsp(text,text,text,boolean)
 * _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)
+* `#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__
+  _pgr_dagshortestpath
 
 pgRouting 3
 *******************************************************************************

doc/traversal/pgr_binaryBreadthFirstSearch.rst

@@ -29,15 +29,19 @@ non-negative integer, is termed as a 'binary graph'.
 
 .. rubric:: Availability
 
-* Version 3.2.0
+.. rubric:: Version 4.0.0
 
-  * New experimental signature:
+* Output columns standardized to |short-generic-result|
 
-    * pgr_binaryBreadthFirstSearch(Combinations)
+.. rubric:: Version 3.2.0
 
-* Version 3.0.0
+* New experimental signature:
 
-  * New experimental function.
+  * pgr_binaryBreadthFirstSearch(Combinations)
+
+.. rubric:: Version 3.0.0
+
+* New experimental function.
 
 Description
 -------------------------------------------------------------------------------
@@ -47,7 +51,7 @@ vertices can be found using Breadth First Search in :math:`O(|E|)` in an
 unweighted graph, i.e. the distance is the minimal number of edges that you
 need to traverse from the source to another vertex. We can interpret such a
 graph also as a weighted graph, where every edge has the weight :math:`1`.
-If not alledges in graph have the same weight, that we need a more general
+If not all edges in graph have the same weight, that we need a more general
 algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time.
 
 However if the weights are more constrained, we can use a faster algorithm.
@@ -87,7 +91,7 @@ Signatures
    | pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])
    | pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])
 
-   | Returns set of |old-generic-result|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 **Note:** Using the :doc:`sampledata` Network as all weights are same (i.e
@@ -104,7 +108,7 @@ One to One
 
    | pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])
 
-   | Returns set of |result-1-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertex :math:`6` to vertex :math:`10` on a **directed** graph
@@ -124,7 +128,7 @@ One to Many
 
    | pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])
 
-   | Returns set of |result-1-m|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertex :math:`6` to vertices :math:`\{10, 17\}` on a **directed**
@@ -145,7 +149,7 @@ Many to One
 
    | pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])
 
-   | Returns set of |result-m-1|
+   | Returns set of |short-generic-result|
    | OR EMPTY SET
 
 :Example: From vertices :math:`\{6, 1\}` to vertex :math:`17` on a **directed**