Update locale: commit e39c96b

Author: github-actions[bot]

locale/en/LC_MESSAGES/pgrouting_doc_strings.po

@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v3.8\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2025-08-23 02:38+0000\n"
+"POT-Creation-Date: 2025-08-26 09:58+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3403,7 +3403,17 @@ msgstr ""
 
 msgid ""
 ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected "
-"graphs acyclic graph."
+"graph."
+msgstr ""
+
+msgid ""
+":doc:`pgr_minDegreeOrdering` - Returns the Minimum Degree ordering of an "
+"undirected graph."
+msgstr ""
+
+msgid ""
+":doc:`pgr_sloanOrdering` - Returns the Sloan ordering of an undirected "
+"graph."
 msgstr ""
 
 msgid ":doc:`metrics-family`"
@@ -4110,9 +4120,15 @@ msgstr ""
 msgid "pgr_maxFlow"
 msgstr ""
 
+msgid "pgr_minDegreeOrdering"
+msgstr ""
+
 msgid "pgr_pushRelabel"
 msgstr ""
 
+msgid "pgr_sloanOrdering"
+msgstr ""
+
 msgid "pgr_sequentialVertexColoring"
 msgstr ""
 
@@ -4398,6 +4414,11 @@ msgid ""
 "pgr_kingOrdering"
 msgstr ""
 
+msgid ""
+"`#2955 <https://github.com/pgRouting/pgrouting/issues/2955>`__: "
+"pgr_sloanOrdering"
+msgstr ""
+
 msgid "SQL signatures and output standardization"
 msgstr ""
 
@@ -8274,7 +8295,9 @@ msgstr ""
 msgid "Individuals in this release v4.0.0 (in alphabetical order)"
 msgstr ""
 
-msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara"
+msgid ""
+"Aurélie Bousquet, Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, "
+"Vicky Vergara"
 msgstr ""
 
 msgid ""
@@ -8321,17 +8344,17 @@ msgstr ""
 msgid ""
 "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio "
 "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, "
-"Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, "
-"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, "
-"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, "
-"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu"
-" Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, "
-"Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan,"
-" Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, "
-"Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, "
-"Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen "
-"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit "
-"Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
+"Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano "
+"Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, "
+"David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian"
+" Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang "
+"Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, "
+"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, "
+"Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed "
+"Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina "
+"Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, "
+"Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, "
+"Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
 msgstr ""
 
 msgid "Corporate Sponsors (in alphabetical order)"
@@ -14248,6 +14271,51 @@ msgstr ""
 msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)"
 msgstr ""
 
+msgid "``pgr_minDegreeOrdering`` - Experimental"
+msgstr ""
+
+msgid ""
+"``pgr_minDegreeOrdering`` — Returns the minimum degree ordering of an "
+"undirected graphs"
+msgstr ""
+
+msgid ""
+"In numerical linear algebra, the MinDegree ordering is a heuristic used "
+"to reduce the amount of fill-in during sparse matrix factorization, such "
+"as Cholesky decomposition for symmetric matrices."
+msgstr ""
+
+msgid ""
+"When eliminating variables in a sparse system, new nonzero entries—called"
+" fill-ins—can appear in positions that were originally zero, increasing "
+"storage and computation costs. The minimum degree approach attempts to "
+"reorder the vertices (or equivalently, the rows and columns of the "
+"matrix) so that, at each elimination step, the vertex with the smallest "
+"degree is removed first, thereby reducing potential fill-in."
+msgstr ""
+
+msgid "The implementation works on undirected graphs."
+msgstr ""
+
+msgid ""
+"The algorithm is a heuristic; finding the true optimal ordering is NP-"
+"complete."
+msgstr ""
+
+msgid "The time complexity is: :math:`O(|V| \\log |V| + |E|)`"
+msgstr ""
+
+msgid ":math:`|E|` is the number of edges."
+msgstr ""
+
+msgid "pgr_minDegreeOrdering(`Edges SQL`_)"
+msgstr ""
+
+msgid ""
+"`Boost: King Ordering "
+"<https://www.boost.org/libs/graph/doc/minimum_degree_ordering.html>`__"
+msgstr ""
+
 msgid "``pgr_pickDeliver`` - Experimental"
 msgstr ""
 
@@ -14673,6 +14741,94 @@ msgid ""
 "<https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__"
 msgstr ""
 
+msgid "``pgr_sloanOrdering`` - Experimental"
+msgstr ""
+
+msgid "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph"
+msgstr ""
+
+msgid ""
+"The Sloan ordering algorithm reorders the vertices of a graph to reduce "
+"bandwidth, profile, and wavefront properties, which is particularly "
+"useful for sparse matrix computations and finite element analysis."
+msgstr ""
+
+msgid "Finds a pseudoperipheral vertex pair to determine good starting points"
+msgstr ""
+
+msgid ""
+"Uses a priority-based algorithm that balances vertex degree and distance "
+"from the start vertex."
+msgstr ""
+
+msgid ""
+"Aims to mininimize bandwidth (maximum difference between connected vertex"
+" indices."
+msgstr ""
+
+msgid "Typically produces better orderings than simple breadth-first approaches."
+msgstr ""
+
+msgid "Run time is 0.115846 seconds."
+msgstr ""
+
+msgid "|Boost| Boost Graph inside"
+msgstr ""
+
+msgid "..rubric::Summary"
+msgstr ""
+
+msgid "pgr_sloanOrdering(`Edges SQL`_)"
+msgstr ""
+
+msgid ":Example : Sloan ordering without specifying start vertex"
+msgstr ""
+
+msgid "New sloan ordering order."
+msgstr ""
+
+msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)."
+msgstr ""
+
+msgid "..graphviz::"
+msgstr ""
+
+msgid ""
+"graph G{ node[shape=circle, style=filled, fillcolor=lightblue, "
+"color=black, fontcolor=black, fontsize=12]; edge[color=black, "
+"penwidth=1.5];"
+msgstr ""
+
+msgid ""
+"0 -- 3; 0 -- 5; 1 -- 2; 1 -- 4; 1 -- 6; 1 -- 9; 2 -- 3; 2 -- 4; 3 -- 5; 3"
+" -- 8; 4 -- 6; 5 -- 6; 5 -- 7; 6 -- 7;"
+msgstr ""
+
+msgid ""
+"{rank=same; 0; 8;} {rank=same; 3; 5; 7;} {rank=same; 2; 4; 6;} "
+"{rank=same; 1; 9;}"
+msgstr ""
+
+msgid "}"
+msgstr ""
+
+msgid "..literalinclude::sloanOrdering.queries"
+msgstr ""
+
+msgid "start-after"
+msgstr ""
+
+msgid "--q3"
+msgstr ""
+
+msgid "--q4"
+msgstr ""
+
+msgid ""
+"`Boost: Sloan Ordering "
+"<https://www.boost.org/libs/graph/doc/sloan_ordering.html>`__"
+msgstr ""
+
 msgid "``pgr_stoerWagner`` - Experimental"
 msgstr ""