Skip to content

Commit e3097cd

Browse files
Update locale: commit 87f94df
1 parent 87f94df commit e3097cd

File tree

2 files changed

+141
-40
lines changed

2 files changed

+141
-40
lines changed

locale/en/LC_MESSAGES/pgrouting_doc_strings.po

Lines changed: 81 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ msgid ""
88
msgstr ""
99
"Project-Id-Version: pgRouting v3.8\n"
1010
"Report-Msgid-Bugs-To: \n"
11-
"POT-Creation-Date: 2025-08-20 17:25+0000\n"
11+
"POT-Creation-Date: 2025-08-23 02:38+0000\n"
1212
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
1313
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
1414
"Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3401,6 +3401,11 @@ msgid ""
34013401
" acyclic graph."
34023402
msgstr ""
34033403

3404+
msgid ""
3405+
":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected "
3406+
"graphs acyclic graph."
3407+
msgstr ""
3408+
34043409
msgid ":doc:`metrics-family`"
34053410
msgstr ""
34063411

@@ -4081,6 +4086,21 @@ msgstr ""
40814086
msgid "pgr_edwardMoore"
40824087
msgstr ""
40834088

4089+
msgid "Version 3.2.0"
4090+
msgstr ""
4091+
4092+
msgid "New experimental signature:"
4093+
msgstr ""
4094+
4095+
msgid "pgr_edwardMoore(Combinations)"
4096+
msgstr ""
4097+
4098+
msgid "Version 3.0.0"
4099+
msgstr ""
4100+
4101+
msgid "pgr_kingOrdering"
4102+
msgstr ""
4103+
40844104
msgid "pgr_KSP"
40854105
msgstr ""
40864106

@@ -4370,6 +4390,14 @@ msgid ""
43704390
"pgr_bandwidth"
43714391
msgstr ""
43724392

4393+
msgid "Ordering"
4394+
msgstr ""
4395+
4396+
msgid ""
4397+
"`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: "
4398+
"pgr_kingOrdering"
4399+
msgstr ""
4400+
43734401
msgid "SQL signatures and output standardization"
43744402
msgstr ""
43754403

@@ -8246,7 +8274,7 @@ msgstr ""
82468274
msgid "Individuals in this release v4.0.0 (in alphabetical order)"
82478275
msgstr ""
82488276

8249-
msgid "Regina Obe, Saloni kumari, Vicky Vergara"
8277+
msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara"
82508278
msgstr ""
82518279

82528280
msgid ""
@@ -8295,11 +8323,11 @@ msgid ""
82958323
"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, "
82968324
"Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, "
82978325
"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, "
8298-
"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic "
8299-
"Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, "
8300-
"Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko "
8301-
"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, "
8302-
"Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, "
8326+
"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, "
8327+
"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu"
8328+
" Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, "
8329+
"Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan,"
8330+
" Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, "
83038331
"Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, "
83048332
"Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen "
83058333
"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit "
@@ -8801,9 +8829,6 @@ msgid ""
88018829
"<https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
88028830
msgstr ""
88038831

8804-
msgid "Version 3.0.0"
8805-
msgstr ""
8806-
88078832
msgid "Name change from pgr_eucledianTSP"
88088833
msgstr ""
88098834

@@ -8905,9 +8930,6 @@ msgstr ""
89058930
msgid "pgr_aStar(Many to One) added ``start_vid`` column."
89068931
msgstr ""
89078932

8908-
msgid "Version 3.2.0"
8909-
msgstr ""
8910-
89118933
msgid "New proposed signature:"
89128934
msgstr ""
89138935

@@ -9447,9 +9469,6 @@ msgstr ""
94479469
msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm."
94489470
msgstr ""
94499471

9450-
msgid "New experimental signature:"
9451-
msgstr ""
9452-
94539472
msgid "pgr_bellmanFord(Combinations)"
94549473
msgstr ""
94559474

@@ -12553,9 +12572,6 @@ msgid ""
1255312572
"algorithm."
1255412573
msgstr ""
1255512574

12556-
msgid "pgr_edwardMoore(Combinations)"
12557-
msgstr ""
12558-
1255912575
msgid ""
1256012576
"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm."
1256112577
" It can compute the shortest paths from a single source vertex to all "
@@ -13279,6 +13295,52 @@ msgid ""
1327913295
"<https://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html>`_"
1328013296
msgstr ""
1328113297

13298+
msgid "``pgr_kingOrdering`` - Experimental"
13299+
msgstr ""
13300+
13301+
msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs"
13302+
msgstr ""
13303+
13304+
msgid ""
13305+
"In numerical linear algebra and graph theory, the King ordering algorithm"
13306+
" is a heuristic designed to reorder the vertices of a graph so as to "
13307+
"reduce its bandwidth."
13308+
msgstr ""
13309+
13310+
msgid ""
13311+
"The method follows a breadth-first search (BFS) traversal,but with a "
13312+
"refinement: at each step, the unvisited neighbors of the current vertex "
13313+
"are inserted into the queue in ascending order of their pseudo-degree, "
13314+
"where the pseudo-degree of a vertex is the number of edges connecting it "
13315+
"to yet-unvisited vertices. This prioritization often yields a smaller "
13316+
"bandwidth compared to simpler BFS orderings."
13317+
msgstr ""
13318+
13319+
msgid "The implementation targets undirected graphs."
13320+
msgstr ""
13321+
13322+
msgid ""
13323+
"Bandwidth minimization is an NP-complete problem; King ordering provides "
13324+
"a practical local minimization approach."
13325+
msgstr ""
13326+
13327+
msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`"
13328+
msgstr ""
13329+
13330+
msgid "where :math:`|E|` is the number of edges,"
13331+
msgstr ""
13332+
13333+
msgid ":math:`m` is the maximum degree among all vertices."
13334+
msgstr ""
13335+
13336+
msgid "pgr_kingOrdering(`Edges SQL`_)"
13337+
msgstr ""
13338+
13339+
msgid ""
13340+
"`Boost: King Ordering "
13341+
"<https://www.boost.org/libs/graph/doc/king_ordering.html>`__"
13342+
msgstr ""
13343+
1328213344
msgid "``pgr_kruskal``"
1328313345
msgstr ""
1328413346

@@ -16663,9 +16725,6 @@ msgstr ""
1666316725
msgid "pgr_findCloseEdges(Many points)"
1666416726
msgstr ""
1666516727

16666-
msgid "Ordering"
16667-
msgstr ""
16668-
1666916728
msgid "pgr_cuthillMckeeOrdering"
1667016729
msgstr ""
1667116730

locale/pot/pgrouting_doc_strings.pot

Lines changed: 60 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ msgid ""
88
msgstr ""
99
"Project-Id-Version: pgRouting v4.0\n"
1010
"Report-Msgid-Bugs-To: \n"
11-
"POT-Creation-Date: 2025-08-20 17:25+0000\n"
11+
"POT-Creation-Date: 2025-08-23 02:38+0000\n"
1212
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
1313
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
1414
"Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3076,6 +3076,9 @@ msgstr ""
30763076
msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph."
30773077
msgstr ""
30783078

3079+
msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph."
3080+
msgstr ""
3081+
30793082
msgid ":doc:`metrics-family`"
30803083
msgstr ""
30813084

@@ -3676,6 +3679,21 @@ msgstr ""
36763679
msgid "pgr_edwardMoore"
36773680
msgstr ""
36783681

3682+
msgid "Version 3.2.0"
3683+
msgstr ""
3684+
3685+
msgid "New experimental signature:"
3686+
msgstr ""
3687+
3688+
msgid "pgr_edwardMoore(Combinations)"
3689+
msgstr ""
3690+
3691+
msgid "Version 3.0.0"
3692+
msgstr ""
3693+
3694+
msgid "pgr_kingOrdering"
3695+
msgstr ""
3696+
36793697
msgid "pgr_KSP"
36803698
msgstr ""
36813699

@@ -3913,6 +3931,12 @@ msgstr ""
39133931
msgid "`#2951 <https://github.com/pgRouting/pgrouting/issues/2951>`__: pgr_bandwidth"
39143932
msgstr ""
39153933

3934+
msgid "Ordering"
3935+
msgstr ""
3936+
3937+
msgid "`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: pgr_kingOrdering"
3938+
msgstr ""
3939+
39163940
msgid "SQL signatures and output standardization"
39173941
msgstr ""
39183942

@@ -7054,7 +7078,7 @@ msgstr ""
70547078
msgid "Individuals in this release v4.0.0 (in alphabetical order)"
70557079
msgstr ""
70567080

7057-
msgid "Regina Obe, Saloni kumari, Vicky Vergara"
7081+
msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara"
70587082
msgstr ""
70597083

70607084
msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop."
@@ -7093,7 +7117,7 @@ msgstr ""
70937117
msgid "Individuals (in alphabetical order)"
70947118
msgstr ""
70957119

7096-
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, 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"
7120+
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"
70977121
msgstr ""
70987122

70997123
msgid "Corporate Sponsors (in alphabetical order)"
@@ -7519,9 +7543,6 @@ msgstr ""
75197543
msgid "Using `Boost: metric TSP approx <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
75207544
msgstr ""
75217545

7522-
msgid "Version 3.0.0"
7523-
msgstr ""
7524-
75257546
msgid "Name change from pgr_eucledianTSP"
75267547
msgstr ""
75277548

@@ -7609,9 +7630,6 @@ msgstr ""
76097630
msgid "pgr_aStar(Many to One) added ``start_vid`` column."
76107631
msgstr ""
76117632

7612-
msgid "Version 3.2.0"
7613-
msgstr ""
7614-
76157633
msgid "New proposed signature:"
76167634
msgstr ""
76177635

@@ -8071,9 +8089,6 @@ msgstr ""
80718089
msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm."
80728090
msgstr ""
80738091

8074-
msgid "New experimental signature:"
8075-
msgstr ""
8076-
80778092
msgid "pgr_bellmanFord(Combinations)"
80788093
msgstr ""
80798094

@@ -10576,9 +10591,6 @@ msgstr ""
1057610591
msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm."
1057710592
msgstr ""
1057810593

10579-
msgid "pgr_edwardMoore(Combinations)"
10580-
msgstr ""
10581-
1058210594
msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time."
1058310595
msgstr ""
1058410596

@@ -11188,6 +11200,39 @@ msgstr ""
1118811200
msgid "Boost `Johnson <https://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html>`_"
1118911201
msgstr ""
1119011202

11203+
msgid "``pgr_kingOrdering`` - Experimental"
11204+
msgstr ""
11205+
11206+
msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs"
11207+
msgstr ""
11208+
11209+
msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth."
11210+
msgstr ""
11211+
11212+
msgid "The method follows a breadth-first search (BFS) traversal,but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings."
11213+
msgstr ""
11214+
11215+
msgid "The implementation targets undirected graphs."
11216+
msgstr ""
11217+
11218+
msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach."
11219+
msgstr ""
11220+
11221+
msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`"
11222+
msgstr ""
11223+
11224+
msgid "where :math:`|E|` is the number of edges,"
11225+
msgstr ""
11226+
11227+
msgid ":math:`m` is the maximum degree among all vertices."
11228+
msgstr ""
11229+
11230+
msgid "pgr_kingOrdering(`Edges SQL`_)"
11231+
msgstr ""
11232+
11233+
msgid "`Boost: King Ordering <https://www.boost.org/libs/graph/doc/king_ordering.html>`__"
11234+
msgstr ""
11235+
1119111236
msgid "``pgr_kruskal``"
1119211237
msgstr ""
1119311238

@@ -13840,9 +13885,6 @@ msgstr ""
1384013885
msgid "pgr_findCloseEdges(Many points)"
1384113886
msgstr ""
1384213887

13843-
msgid "Ordering"
13844-
msgstr ""
13845-
1384613888
msgid "pgr_cuthillMckeeOrdering"
1384713889
msgstr ""
1384813890

0 commit comments

Comments
 (0)