Update locale: commit 8582944

locale/en/LC_MESSAGES/pgrouting_doc_strings.po

@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v3.6.0-dev\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-05-07 21:31+0000\n"
+"POT-Creation-Date: 2024-05-13 17:23+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <[email protected]>\n"
@@ -3889,11 +3889,6 @@ msgstr ""
 msgid ":doc:`transformation-family`"
 msgstr ""
 
-msgid ""
-":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line "
-"Graph."
-msgstr ""
-
 msgid ""
 ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line"
 " Graph out of each vertex in the input graph."
@@ -4429,6 +4424,24 @@ msgstr ""
 msgid "Added ``pred`` result columns."
 msgstr ""
 
+msgid "Experimental promoted to proposed."
+msgstr ""
+
+msgid ""
+"`#2635 <https://github.com/pgRouting/pgrouting/pull/2635>`__ "
+"pgr_LineGraph ignores directed flag and use negative values for "
+"identifiers."
+msgstr ""
+
+msgid "``pgr_lineGraph``"
+msgstr ""
+
+msgid "Promoted to **proposed** signature."
+msgstr ""
+
+msgid "Works for directed and undirected graphs."
+msgstr ""
+
 msgid "Code enhancement"
 msgstr ""
 
@@ -12518,26 +12531,42 @@ msgid ""
 "<https://en.wikipedia.org/wiki/Dominator_(graph_theory)>`__"
 msgstr ""
 
-msgid "``pgr_lineGraph`` - Experimental"
+msgid "pgr_lineGraph - Proposed"
 msgstr ""
 
 msgid ""
 "``pgr_lineGraph`` — Transforms the given graph into its corresponding "
 "edge-based graph."
 msgstr ""
 
-msgid "Given a graph G, its line graph L(G) is a graph such that:"
+msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:"
+msgstr ""
+
+msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`."
 msgstr ""
 
-msgid "Each vertex of L(G) represents an edge of G"
+msgid ""
+"Two vertices of :math:`L(G)` are adjacent if and only if their "
+"corresponding edges share a common endpoint in :math:`G`"
 msgstr ""
 
 msgid ""
-"Two vertices of L(G) are adjacent if and only if their corresponding "
-"edges share a common endpoint in G."
+"The ``cost`` and ``reverse_cost`` columns of the result represent "
+"existence of the edge."
+msgstr ""
+
+msgid "When the graph is directed the result is directed."
 msgstr ""
 
-msgid "Currently works for undirected graph."
+msgid ""
+"To get the complete Line Graph use unique identifiers on the double way "
+"edges (See `Additional Examples`_)."
+msgstr ""
+
+msgid "When the graph is undirected the result is undirected."
+msgstr ""
+
+msgid "The ``reverse_cost`` is always :math:`-1`."
 msgstr ""
 
 msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])"
@@ -12546,7 +12575,7 @@ msgstr ""
 msgid "Returns set of |result-lineg|"
 msgstr ""
 
-msgid "For an **undirected** graph"
+msgid "For an undirected graph with edges :math:'{2,4,5,8}'"
 msgstr ""
 
 msgid "Gives a local identifier for the edge"
@@ -12580,7 +12609,134 @@ msgid ""
 "it’s not part of the graph."
 msgstr ""
 
-msgid "https://en.wikipedia.org/wiki/Line_graph"
+msgid "Given the following directed graph"
+msgstr ""
+
+msgid ""
+":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2"
+" \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 "
+"\\rightarrow 3\\})`"
+msgstr ""
+
+msgid "Representation as directed with shared edge identifiers"
+msgstr ""
+
+msgid ""
+"For the simplicity, the design of the edges table on the database, has "
+"the edge's identifiers are represented with 3 digits:"
+msgstr ""
+
+msgid "hundreds"
+msgstr ""
+
+msgid "the source vertex"
+msgstr ""
+
+msgid "tens"
+msgstr ""
+
+msgid "always 0, acts as a separator"
+msgstr ""
+
+msgid "units"
+msgstr ""
+
+msgid "the target vertex"
+msgstr ""
+
+msgid "In this image,"
+msgstr ""
+
+msgid "Single or double head arrows represent one edge (row) on the edges table."
+msgstr ""
+
+msgid "The numbers in the yellow shadow are the edge identifiers."
+msgstr ""
+
+msgid ""
+"Two pair of edges share the same identifier when the ``reverse_cost`` "
+"column is used."
+msgstr ""
+
+msgid ""
+"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with "
+"one edge row with :math:`id=203`."
+msgstr ""
+
+msgid ""
+"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with "
+"one edge row with :math:`id=304`."
+msgstr ""
+
+msgid "The graph can be created as follows:"
+msgstr ""
+
+msgid "Line Graph of a directed graph represented with shared edges"
+msgstr ""
+
+msgid "The result is a directed graph."
+msgstr ""
+
+msgid ""
+"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two "
+"edges"
+msgstr ""
+
+msgid "For all the other values of ``seq`` represent one edge."
+msgstr ""
+
+msgid ""
+"The ``cost`` and ``reverse_cost`` values represent the existence of the "
+"edge."
+msgstr ""
+
+msgid "When positive: the edge exists."
+msgstr ""
+
+msgid "When negative: the edge does not exist."
+msgstr ""
+
+msgid "Representation as directed with unique edge identifiers"
+msgstr ""
+
+msgid "Single head arrows represent one edge (row) on the edges table."
+msgstr ""
+
+msgid "There are no double head arrows"
+msgstr ""
+
+msgid ""
+"Two pair of edges share the same ending nodes and the ``reverse_cost`` "
+"column is not used."
+msgstr ""
+
+msgid ""
+"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with "
+"two edges :math:`id=203` and :math:`id=302` respectively."
+msgstr ""
+
+msgid ""
+"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with "
+"two edges :math:`id=304` and :math:`id=403` respectively."
+msgstr ""
+
+msgid "Line Graph of a directed graph represented with unique edges"
+msgstr ""
+
+msgid ""
+"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two "
+"edges."
+msgstr ""
+
+msgid ""
+"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two "
+"edges."
+msgstr ""
+
+msgid "wikipedia: `Line Graph <https://en.wikipedia.org/wiki/Line_graph>`__"
+msgstr ""
+
+msgid "mathworld: `Line Graph <https://mathworld.wolfram.com/LineGraph.html>`__"
 msgstr ""
 
 msgid "``pgr_lineGraphFull`` - Experimental"
@@ -12829,6 +12985,9 @@ msgstr ""
 msgid "Routing from :math:`5` to :math:`1`"
 msgstr ""
 
+msgid "https://en.wikipedia.org/wiki/Line_graph"
+msgstr ""
+
 msgid "https://en.wikipedia.org/wiki/Complete_graph"
 msgstr ""
 
@@ -15284,6 +15443,11 @@ msgid ""
 "edge table information."
 msgstr ""
 
+msgid ""
+":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line "
+"Graph."
+msgstr ""
+
 msgid ":doc:`pgr_withPointsVia`"
 msgstr ""
 
@@ -18169,7 +18333,7 @@ msgstr ""
 msgid "Additional functions to analyze a graph:"
 msgstr ""
 
-msgid "Transformation - Family of functions (Experimental)"
+msgid "Transformation - Family of functions"
 msgstr ""
 
 msgid ""