Skip to content

Commit 91d6e20

Browse files
github-actions[bot]github-actions[bot]
committed
Update locale: commit 51c219e 
1 parent 51c219e commit 91d6e20

File tree

2 files changed

+73
-23
lines changed

2 files changed

+73
-23
lines changed

‎locale/en/LC_MESSAGES/pgrouting_doc_strings.po‎

Lines changed: 63 additions & 13 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-09-15 00:42+0000\n"
11+
"POT-Creation-Date: 2025-09-17 02:07+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 <[email protected]>\n"
@@ -3968,21 +3968,21 @@ msgstr ""
39683968
msgid "Documentation build"
39693969
msgstr ""
39703970

3971-
msgid "The doxygen documentation is build by default"
3971+
msgid "The doxygen documentation is built by default"
39723972
msgstr ""
39733973

3974-
msgid "The HTML documentation is build by default"
3974+
msgid "The HTML documentation is built by default"
39753975
msgstr ""
39763976

39773977
msgid ""
3978-
"The translated languages (en, es, sv, zh_Hans) HTML documentation is "
3979-
"build by default"
3978+
"The translated languages (en, es, sv, zh_Hans) HTML documentation are "
3979+
"built by default"
39803980
msgstr ""
39813981

39823982
msgid "`WITH-DOC` is not used anymore"
39833983
msgstr ""
39843984

3985-
msgid "User's Documentation is not build when"
3985+
msgid "User Documentation is not built when"
39863986
msgstr ""
39873987

39883988
msgid "Sphinx is not found"
@@ -4006,7 +4006,7 @@ msgstr ""
40064006
msgid "For example: for HTML output is on `build/doc/_build/html` directory"
40074007
msgstr ""
40084008

4009-
msgid "Developers's Documentation is not build when"
4009+
msgid "Developers' Documentation is not built when"
40104010
msgstr ""
40114011

40124012
msgid "Doxygen is not found"
@@ -4475,7 +4475,7 @@ msgstr ""
44754475

44764476
msgid ""
44774477
"`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: "
4478-
"pgr_DAGshortestPath"
4478+
"pgr_dagShortestPath"
44794479
msgstr ""
44804480

44814481
msgid "Standardized to |matrix-result|"
@@ -4501,7 +4501,7 @@ msgstr ""
45014501

45024502
msgid ""
45034503
"`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: "
4504-
"pgr_turnRestrictedPaths"
4504+
"pgr_turnRestrictedPath"
45054505
msgstr ""
45064506

45074507
msgid "Standardized to |result_edge_color|"
@@ -9385,7 +9385,7 @@ msgid ""
93859385
":doc:`pgr_bdAstar`."
93869386
msgstr ""
93879387

9388-
msgid "Internally uses the :doc:`pgr_bdAstar` algorithm"
9388+
msgid "Internally uses the :doc:`pgr_bdAstar` algorithm."
93899389
msgstr ""
93909390

93919391
msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
@@ -9779,9 +9779,9 @@ msgid ""
97799779
"in an unweighted graph, i.e. the distance is the minimal number of edges "
97809780
"that you need to traverse from the source to another vertex. We can "
97819781
"interpret such a graph also as a weighted graph, where every edge has the"
9782-
" weight :math:`1`. If not all edges in graph have the same weight, that "
9783-
"we need a more general algorithm, like Dijkstra's Algorithm which runs in"
9784-
" :math:`O(|E|log|V|)` time."
9782+
" weight :math:`1`. If not all edges in graph have the same weight, then "
9783+
"we a more general algorithm is needed, like Dijkstra's Algorithm which "
9784+
"runs in :math:`O(|E|log|V|)` time."
97859785
msgstr ""
97869786

97879787
#, python-brace-format
@@ -19929,3 +19929,53 @@ msgstr ""
1992919929
#~ msgid "--q4"
1993019930
#~ msgstr ""
1993119931

19932+
#~ msgid "The doxygen documentation is build by default"
19933+
#~ msgstr ""
19934+
19935+
#~ msgid "The HTML documentation is build by default"
19936+
#~ msgstr ""
19937+
19938+
#~ msgid ""
19939+
#~ "The translated languages (en, es, sv,"
19940+
#~ " zh_Hans) HTML documentation is build "
19941+
#~ "by default"
19942+
#~ msgstr ""
19943+
19944+
#~ msgid "User's Documentation is not build when"
19945+
#~ msgstr ""
19946+
19947+
#~ msgid "Developers's Documentation is not build when"
19948+
#~ msgstr ""
19949+
19950+
#~ msgid ""
19951+
#~ "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__:"
19952+
#~ " pgr_DAGshortestPath"
19953+
#~ msgstr ""
19954+
19955+
#~ msgid ""
19956+
#~ "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__:"
19957+
#~ " pgr_turnRestrictedPaths"
19958+
#~ msgstr ""
19959+
19960+
#~ msgid "Internally uses the :doc:`pgr_bdAstar` algorithm"
19961+
#~ msgstr ""
19962+
19963+
#~ msgid ""
19964+
#~ "It is well-known that the shortest"
19965+
#~ " paths between a single source and"
19966+
#~ " all other vertices can be found "
19967+
#~ "using Breadth First Search in "
19968+
#~ ":math:`O(|E|)` in an unweighted graph, "
19969+
#~ "i.e. the distance is the minimal "
19970+
#~ "number of edges that you need to"
19971+
#~ " traverse from the source to another"
19972+
#~ " vertex. We can interpret such a "
19973+
#~ "graph also as a weighted graph, "
19974+
#~ "where every edge has the weight "
19975+
#~ ":math:`1`. If not all edges in "
19976+
#~ "graph have the same weight, that "
19977+
#~ "we need a more general algorithm, "
19978+
#~ "like Dijkstra's Algorithm which runs in"
19979+
#~ " :math:`O(|E|log|V|)` time."
19980+
#~ msgstr ""
19981+

‎locale/pot/pgrouting_doc_strings.pot‎

Lines changed: 10 additions & 10 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-09-15 00:42+0000\n"
11+
"POT-Creation-Date: 2025-09-17 02:07+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 <[email protected]>\n"
@@ -3559,19 +3559,19 @@ msgstr ""
35593559
msgid "Documentation build"
35603560
msgstr ""
35613561

3562-
msgid "The doxygen documentation is build by default"
3562+
msgid "The doxygen documentation is built by default"
35633563
msgstr ""
35643564

3565-
msgid "The HTML documentation is build by default"
3565+
msgid "The HTML documentation is built by default"
35663566
msgstr ""
35673567

3568-
msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation is build by default"
3568+
msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default"
35693569
msgstr ""
35703570

35713571
msgid "`WITH-DOC` is not used anymore"
35723572
msgstr ""
35733573

3574-
msgid "User's Documentation is not build when"
3574+
msgid "User Documentation is not built when"
35753575
msgstr ""
35763576

35773577
msgid "Sphinx is not found"
@@ -3595,7 +3595,7 @@ msgstr ""
35953595
msgid "For example: for HTML output is on `build/doc/_build/html` directory"
35963596
msgstr ""
35973597

3598-
msgid "Developers's Documentation is not build when"
3598+
msgid "Developers' Documentation is not built when"
35993599
msgstr ""
36003600

36013601
msgid "Doxygen is not found"
@@ -3994,7 +3994,7 @@ msgstr ""
39943994
msgid "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__: pgr_edwardMoore"
39953995
msgstr ""
39963996

3997-
msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_DAGshortestPath"
3997+
msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_dagShortestPath"
39983998
msgstr ""
39993999

40004000
msgid "Standardized to |matrix-result|"
@@ -4012,7 +4012,7 @@ msgstr ""
40124012
msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_edgeDisjointPaths"
40134013
msgstr ""
40144014

4015-
msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPaths"
4015+
msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPath"
40164016
msgstr ""
40174017

40184018
msgid "Standardized to |result_edge_color|"
@@ -8029,7 +8029,7 @@ msgstr ""
80298029
msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`."
80308030
msgstr ""
80318031

8032-
msgid "Internally uses the :doc:`pgr_bdAstar` algorithm"
8032+
msgid "Internally uses the :doc:`pgr_bdAstar` algorithm."
80338033
msgstr ""
80348034

80358035
msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
@@ -8329,7 +8329,7 @@ msgstr ""
83298329
msgid "pgr_binaryBreadthFirstSearch(Combinations)"
83308330
msgstr ""
83318331

8332-
msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, that we need a more general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time."
8332+
msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time."
83338333
msgstr ""
83348334

83358335
msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer."

0 commit comments

Comments
 (0)