pgRouting · cvvergara · Jun 24, 2025 · Jun 22, 2025 · Jun 22, 2025 · Jun 22, 2025
diff --git a/NEWS.md b/NEWS.md
diff --git a/doc/categories/KSP-category.rst b/doc/categories/KSP-category.rst
@@ -17,19 +17,9 @@ K shortest paths - Category
 .. official-start
 
 * :doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra
-
-.. official-end
-
-.. include:: proposed.rst
-   :start-after: warning-begin
-   :end-before: end-warning
-
-.. proposed-start
-
 * :doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints
 
-.. proposed-end
-
+.. official-end
 
 .. rubric:: Indices and tables
 

diff --git a/doc/categories/cost-category.rst b/doc/categories/cost-category.rst
@@ -22,7 +22,7 @@ Cost - Category
 * :doc:`pgr_bdAstarCost`
 * :doc:`pgr_dijkstraCost`
 * :doc:`pgr_bdDijkstraCost`
-* :doc:`pgr_dijkstraNearCost`
+* :doc:`pgr_withPointsCost`
 
 .. official-end
 
@@ -32,7 +32,7 @@ Cost - Category
 
 .. proposed-start
 
-* :doc:`pgr_withPointsCost`
+* :doc:`pgr_dijkstraNearCost`
 
 .. proposed-end
 

diff --git a/doc/categories/costMatrix-category.rst b/doc/categories/costMatrix-category.rst
@@ -20,19 +20,9 @@ Cost Matrix - Category
 * :doc:`pgr_dijkstraCostMatrix`
 * :doc:`pgr_bdAstarCostMatrix`
 * :doc:`pgr_bdDijkstraCostMatrix`
-
-.. official-end
-
-
-.. include:: proposed.rst
-    :start-after: warning-begin
-    :end-before: end-warning
-
-.. proposed-start
-
 * :doc:`pgr_withPointsCostMatrix`
 
-.. proposed-end
+.. official-end
 
 General Information
 -------------------------------------------------------------------------------

diff --git a/doc/categories/drivingDistance-category.rst b/doc/categories/drivingDistance-category.rst
@@ -19,18 +19,9 @@ Driving Distance - Category
 * :doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm
 * :doc:`pgr_primDD` - Driving Distance based on Prim's algorithm
 * :doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm
-
-.. official-end
-
-.. include:: proposed.rst
-   :start-after: warning-begin
-   :end-before: end-warning
-
-.. proposed-start
-
 * :doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints
 
-.. proposed-end
+.. official-end
 
 Calculate nodes that are within a distance.
 

diff --git a/doc/categories/via-category.rst b/doc/categories/via-category.rst
@@ -14,18 +14,23 @@
 Via - Category
 ===============================================================================
 
+.. official-start
+
+* :doc:`pgr_withPointsVia`
+* :doc:`pgr_trspVia`
+* :doc:`pgr_trspVia_withPoints`
+
+.. official-end
+
 .. include:: proposed.rst
     :start-after: warning-begin
     :end-before: end-warning
 
-.. proposed start
+.. proposed-start
 
 * :doc:`pgr_dijkstraVia`
-* :doc:`pgr_withPointsVia`
-* :doc:`pgr_trspVia`
-* :doc:`pgr_trspVia_withPoints`
 
-.. proposed end
+.. proposed-end
 
 General Information
 -------------------------------------------------------------------------------
@@ -84,28 +89,32 @@ Where:
 
 .. list-table::
    :width: 81
-   :widths: 14 20 7 40
+   :widths: auto
    :header-rows: 1
 
    * - Parameter
      - Type
-     - Default
      - Description
    * - `Edges SQL`_
      - ``TEXT``
-     -
      - SQL query as described.
    * - `Points SQL`_
      - ``TEXT``
-     -
      - SQL query as described.
    * - **via vertices**
      - ``ARRAY`` [ **ANY-INTEGER** ]
-     -
      - Array of ordered vertices identifiers that are going to be visited.
 
        * When positive it is considered a vertex identifier
        * When negative it is considered a point identifier
+   * - **driving side**
+     - ``CHAR``
+     - Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:
+
+       - [``r``, ``R``] for right driving side (for directed graph only)
+       - [``l``, ``L``] for left driving side (for directed graph only)
+       - [``b``, ``B``] for both (only for undirected graph)
+
 
 Where:
 

diff --git a/doc/categories/withPoints-category.rst b/doc/categories/withPoints-category.rst
@@ -16,19 +16,15 @@ withPoints - Category
 
 When points are added to the graph.
 
-.. include:: proposed.rst
-   :start-after: warning-begin
-   :end-before: end-warning
-
-.. proposed start
+.. official-start
 
 - :doc:`withPoints-family` - Functions based on Dijkstra algorithm.
 - From the :doc:`TRSP-family`:
 
   - :doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions.
   - :doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions.
 
-.. proposed end
+.. official-end
 
 Introduction
 -------------------------------------------------------------------------------
@@ -126,6 +122,13 @@ Parameters
      - ``ARRAY[BIGINT]``
      - Array of identifiers of ending vertices. Negative values are for point’s
        identifiers.
+   * - **driving side**
+     - ``CHAR``
+     - Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:
+
+       - [``r``, ``R``] for right driving side (for directed graph only)
+       - [``l``, ``L``] for left driving side (for directed graph only)
+       - [``b``, ``B``] for both (only for undirected graph)
 
 .. withPoints_parameters_end
 
@@ -143,18 +146,12 @@ Optional parameters
      - Type
      - Default
      - Description
-   * - ``driving_side``
-     - ``CHAR``
-     - ``r``
-     - Value in [``r``, ``l``] indicating if the driving side is:
-
-       - ``r`` for right driving side
-       - ``l`` for left driving side
-       - Any other value will be considered as ``r``
    * - ``details``
      - ``BOOLEAN``
      - ``false``
-     - - When ``true`` the results will include the points that are in the path.
+     - For showing points stops.
+
+       - When ``true`` the results will include the points that are in the path.
        - When ``false`` the results will not include the points that are in the
          path.
 

diff --git a/doc/contraction/pgr_contraction.rst b/doc/contraction/pgr_contraction.rst
@@ -22,6 +22,12 @@ vertices and edges.
 
 .. rubric:: Availability
 
+.. rubric:: Version 4.0.0
+
+* Breaking change, signatures no longer available:
+
+  * pgr_contraction(text,bigint[],integer,bigint[],boolean)
+
 .. rubric:: Version 3.8.0
 
 * New signature:

diff --git a/doc/max_flow/pgr_maxCardinalityMatch.rst b/doc/max_flow/pgr_maxCardinalityMatch.rst
@@ -19,35 +19,43 @@
 ``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a
 graph.
 
-.. Rubric:: Availability
+.. rubric:: Availability
 
-* Version 3.4.0
+.. rubric:: Version 4.0.0
 
-  * Use ``cost`` and ``reverse_cost`` on the inner query
-  * Results are ordered
-  * Works for undirected graphs.
-  * New signature
+.. Breaking change
 
-    * pgr_maxCardinalityMatch(text) returns only ``edge`` column.
+* Breaking change, signatures no longer available:
 
-  * Deprecated signature
+  * pgr_maxCardinalityMatch(text,boolean)
 
-    * pgr_maxCardinalityMatch(text,boolean)
+.. rubric:: Version 3.4.0
 
-      * directed => ``false`` when used.
+* Use ``cost`` and ``reverse_cost`` on the inner query
+* Results are ordered
+* Works for undirected graphs.
+* New signature
 
-* Version 3.0.0
+  * pgr_maxCardinalityMatch(text) returns only ``edge`` column.
 
-  * Function promoted to official.
+* Deprecated signature
 
-* Version 2.5.0
+  * pgr_maxCardinalityMatch(text,boolean)
 
-  * Renamed from ``pgr_maximumCardinalityMatching``
-  * Function promoted to proposed.
+    * directed => ``false`` when used.
 
-* Version 2.3.0
+.. rubric:: Version 3.0.0
 
-  * New experimental function.
+* Function promoted to official.
+
+.. rubric:: Version 2.5.0
+
+* Renamed from ``pgr_maximumCardinalityMatching``
+* Function promoted to proposed.
+
+.. rubric:: Version 2.3.0
+
+* New experimental function.
 
 
 Description

diff --git a/doc/src/proposed.rst b/doc/src/proposed.rst
@@ -39,12 +39,6 @@ Proposed Functions
    :start-after: proposed-start
    :end-before: proposed-end
 
-:doc:`withPoints-family`
-
-.. include:: withPoints-family.rst
-   :start-after: proposed-start
-   :end-before: proposed-end
-
 :doc:`transformation-family`
 
 .. include:: transformation-family.rst
@@ -66,14 +60,8 @@ Proposed Functions
 :doc:`traversal-family`
 
 .. include:: traversal-family.rst
-   :start-after: official-start
-   :end-before: official-end
-
-.. toctree::
-   :hidden:
-
-   traversal-family
-   coloring-family
+   :start-after: proposed-start
+   :end-before: proposed-end
 
 .. rubric:: categories
 
@@ -83,43 +71,11 @@ Proposed Functions
    :start-after: proposed-start
    :end-before: proposed-end
 
-:doc:`costMatrix-category`
-
-.. include:: costMatrix-category.rst
-   :start-after: proposed-start
-   :end-before: proposed-end
-
-:doc:`drivingDistance-category`
-
-.. include:: drivingDistance-category.rst
-   :start-after: proposed-start
-   :end-before: proposed-end
-
-:doc:`KSP-category`
-
-.. include:: KSP-category.rst
-   :start-after: proposed-start
-   :end-before: proposed-end
-
 :doc:`via-category`
 
 .. include:: via-category.rst
-   :start-after: proposed start
-   :end-before: proposed end
-
-:doc:`withPoints-category`
-
-.. include:: withPoints-category.rst
-   :start-after: proposed start
-   :end-before: proposed end
-
-.. toctree::
-    :hidden:
-
-    withPoints-family
-    KSP-category
-    via-category
-    withPoints-category
+   :start-after: proposed-start
+   :end-before: proposed-end
 
 See Also
 -------------------------------------------------------------------------------