pgRouting · cvvergara · Mar 6, 2025 · Feb 26, 2025
diff --git a/NEWS.md b/NEWS.md
@@ -26,6 +26,7 @@
 * pgr_degree
 
   * Error messages adjustment.
+  * New signature with only Edges SQL.
 
 ## pgRouting 3.7
 

diff --git a/doc/metrics/pgr_degree.rst b/doc/metrics/pgr_degree.rst
@@ -16,7 +16,8 @@
 ``pgr_degree`` -- Proposed
 ===============================================================================
 
-``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex.
+``pgr_degree`` — For each vertex in an undirected graph, return the count of
+edges incident to the vertex.
 
 
 .. include:: proposed.rst
@@ -28,6 +29,7 @@
 .. rubric:: Version 3.8.0
 
 * Error messages adjustment.
+* New signature with only Edges SQL.
 
 .. rubric:: Version 3.4.0
 
@@ -37,32 +39,85 @@
 Description
 -------------------------------------------------------------------------------
 
-Calculates the degree of the vertices of an **undirected** graph
+Calculates the degree of the vertices of an undirected graph
 
+The degree (or valency) of a vertex of a graph is the number of edges that are
+incident to the vertex.
 
-|Boost| Boost Graph Inside
+- Works for **undirected** graphs.
+- A loop contributes 2 to a vertex's degree.
+- A vertex with degree 0 is called an isolated vertex.
+
+  - Isolated vertex is not part of the result
+
+- Vertex not participating on the subgraph is considered and isolated vertex.
+- There can be a ``dryrun`` execution and the code used to get the answer will
+  be shown in a PostgreSQL ``NOTICE``.
+
+  - The code can be used as base code for the particular application
+    requirements.
+
+- No ordering is performed.
 
 Signatures
 -------------------------------------------------------------------------------
 
 .. admonition:: \ \
    :class: signatures
 
+   | pgr_degree(`Edges SQL`_ , [``dryrun``])
    | pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])
 
    | RETURNS SETOF |result-degree|
    | OR EMPTY SET
 
-:Example: Extracting the vertex information
+.. index::
+    single: degree - Proposed ; Edges and Vertices - Proposed on v3.4
+
+Edges
+...............................................................................
+
+.. admonition:: \ \
+   :class: signatures
 
-pgr_degree can utilize output from `pgr_extractVertices` or can have `pgr_extractVertices` embedded in the call.
-For decent size networks, it is best to prep your vertices table before hand and use that vertices table
-for pgr_degree calls.
+   | pgr_degree(`Edges SQL`_ , [``dryrun``])
+
+   | RETURNS SETOF |result-degree|
+   | OR EMPTY SET
+
+:example: Get the degree of the vertices defined on the edges table
 
 .. literalinclude:: degree.queries
    :start-after: -- q1
    :end-before: -- q2
 
+Edges and Vertices
+...............................................................................
+
+.. admonition:: \ \
+   :class: signatures
+
+   | pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])
+
+   | RETURNS SETOF |result-degree|
+   | OR EMPTY SET
+
+:Example: Extracting the vertex information
+
+``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call.
+
+For decent size networks, it is best to prepare your vertices table before hand
+and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)
+
+Calculate the degree of the nodes:
+
+.. literalinclude:: degree.queries
+   :start-after: -- q2
+   :end-before: -- q3
+
+.. index::
+    single: degree- Proposed ; Edges - Proposed on v3.4
+
 
 Parameters
 -------------------------------------------------------------------------------
@@ -77,8 +132,6 @@ Parameter      Type      Description
 Optional parameters
 -------------------------------------------------------------------------------
 
-.. TODO move to pgRouting concepts
-
 =========== =============  ========== =======================================
 Parameter    Type          Default    Description
 =========== =============  ========== =======================================
@@ -95,18 +148,44 @@ Inner Queries
 Edges SQL
 ...............................................................................
 
-.. TODO move to pgRouting concepts
+.. rubric:: For the `Edges and Vertices`_ signature:
+
+.. list-table::
+   :width: 81
+   :widths: auto
+   :header-rows: 1
+
+   * - Column
+     - Type
+     - Description
+   * - ``id``
+     - ``BIGINT``
+     - Identifier of the edge.
+
+For the `Edges`_ signature:
+
+.. list-table::
+   :width: 81
+   :widths: auto
+   :header-rows: 1
 
-================= =================== ===================================
-Column            Type                Description
-================= =================== ===================================
-``id``            ``BIGINT``          Identifier of the edge.
-================= =================== ===================================
+   * - Column
+     - Type
+     - Description
+   * - ``id``
+     - ``BIGINT``
+     - Identifier of the edge.
+   * - ``source``
+     - ``BIGINT``
+     - Identifier of the first end point vertex of the edge.
+   * - ``target``
+     - ``BIGINT``
+     - Identifier of the second end point vertex of the edge.
 
 Vertex SQL
 ...............................................................................
 
-.. TODO move to pgRouting concepts
+.. rubric:: For the `Edges and Vertices`_ signature:
 
 .. list-table::
    :width: 81
@@ -136,8 +215,6 @@ Vertex SQL
 Result columns
 -------------------------------------------------------------------------------
 
-.. TODO move to pgRouting concepts
-
 .. list-table::
    :width: 81
    :widths: auto
@@ -159,12 +236,101 @@ Additional Examples
 .. contents::
    :local:
 
+Degree of a loop
+...............................................................................
+
+A loop contributes 2 to a vertex's degree.
+
+.. graphviz::
+
+   graph G {
+     2 [shape=circle;style=filled;color=green;fontsize=8;width=0.3;fixedsize=true];
+     2 -- 2 [label="1",fontsize=8];
+   }
+
+.. rubric:: Using the `Edges`_ signature.
+
+.. literalinclude:: degree.queries
+   :start-after: -- q3
+   :end-before: -- q4
+
+.. rubric:: Using the `Edges and Vertices`_ signature.
+
+.. literalinclude:: degree.queries
+   :start-after: -- q4
+   :end-before: -- q5
+
 Degree of a sub graph
 ...............................................................................
 
+For the following is a subgraph of the :doc:`sampledata`:
+
+- :math:`E = \{(1, 5 \leftrightarrow 6), (1, 6 \leftrightarrow 10)\}`
+- :math:`V = \{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\}`
+
+
+.. graphviz::
+
+   graph G {
+     5,6,10 [shape=circle;style=filled;color=lightgreen;fontsize=8;width=0.3;fixedsize=true];
+     1,2,3,4,7,8,9,11,12,13,14,15,16,17 [shape=circle;style=filled;color=cyan;fontsize=8;width=0.3;fixedsize=true];
+
+     5 -- 6 [label="1",fontsize=8];
+     10 -- 6 [label="2",fontsize=8];
+
+     1 [pos="0,2!"];
+     2 [pos="0.5,3.5!"];
+     3 [pos="1,2!"];
+     4 [pos="2,3.5!"];
+     5 [pos="2,0!"];
+     6 [pos="2,1!"];
+     7 [pos="2,2!"];
+     8 [pos="2,3!"];
+     9 [pos="2,4!"];
+     10 [pos="3,1!"];
+     11 [pos="3,2!"];
+     12 [pos="3,3!"];
+     13 [pos="3.5,2.3!"];
+     14 [pos="3.5,4!"];
+     15 [pos="4,1!"];
+     16 [pos="4,2!"];
+     17 [pos="4,3!"];
+   }
+
+The vertices not participating on the edge are considered isolated
+
+- their degree is 0 in the subgraph and
+- their degree is not shown in the output.
+
+.. rubric:: Using the `Edges`_ signature.
+
+.. literalinclude:: degree.queries
+   :start-after: -- q5
+   :end-before: -- q6
+
+.. rubric:: Using the `Edges and Vertices`_ signature.
+
+.. literalinclude:: degree.queries
+   :start-after: -- q6
+   :end-before: -- q7
+
+Using a vertex table
+...............................................................................
+
+For decent size networks, it is best to prepare your vertices table before hand
+and use it on ``pgr_degree`` calls.
+
+Extract the vertex information and save into a table:
+
 .. literalinclude:: degree.queries
-   :start-after: -- q2
-   :end-before: -- q3
+   :start-after: -- q8
+   :end-before: -- q9
+
+Calculate the degree of the nodes:
+
+.. literalinclude:: degree.queries
+   :start-after: -- q9
+   :end-before: -- q10
 
 Dry run execution
 ...............................................................................
@@ -176,20 +342,33 @@ The results can be used as base code to make a refinement based on the backend
 development needs.
 
 .. literalinclude:: degree.queries
-   :start-after: -- q3
-   :end-before: -- q4
+   :start-after: -- q10
+   :end-before: -- q11
 
-Degree from an existing table
+Finding dead ends
 ...............................................................................
-If you have a vertices table already built using ``pgr_extractVertices``
-and want the degree of the whole graph rather than a subset, you can forgo using pgr_degree
-and work with the ``in_edges`` and ``out_edges`` columns directly.
 
+If there is a vertices table already built using ``pgr_extractVertices``
+and want the degree of the whole graph rather than a subset, it can be forgo using
+``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns
+directly.
+
+The degree of a dead end is 1.
 
 .. include:: pgRouting-concepts.rst
    :start-after: degree_from_table_start
    :end-before: degree_from_table_end
 
+Finding linear vertices
+...............................................................................
+
+The degree of a linear vertex is 2.
+
+If there is a vertices table already built using the ``pgr_extractVertices``
+
+.. include:: pgRouting-concepts.rst
+   :start-after: linear_degree_from_table_start
+   :end-before: linear_degree_from_table_end
 
 See Also
 -------------------------------------------------------------------------------