Skip to content

Commit 402a4fb

Browse files
github-actions[bot]cvvergara
github-actions[bot]
authored and
cvvergara
committed
Update locale: commit 07304c4 
1 parent cd2bdad commit 402a4fb

File tree

2 files changed

+20
-24
lines changed

2 files changed

+20
-24
lines changed

‎locale/en/LC_MESSAGES/pgrouting_doc_strings.po‎

Lines changed: 12 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-06-14 12:05+0000\n"
11+
"POT-Creation-Date: 2025-06-16 16:56+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"
@@ -4044,6 +4044,11 @@ msgid ""
40444044
"pgr_bellmanFord"
40454045
msgstr ""
40464046

4047+
msgid ""
4048+
"`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ "
4049+
"pgr_binaryBreadthFirstSearch"
4050+
msgstr ""
4051+
40474052
msgid ""
40484053
"`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__ "
40494054
"pgr_edwardMoore"
@@ -4490,6 +4495,9 @@ msgstr ""
44904495
msgid ":doc:`pgr_bellmanFord` [3]_"
44914496
msgstr ""
44924497

4498+
msgid ":doc:`pgr_binaryBreadthFirstSearch` [3]_"
4499+
msgstr ""
4500+
44934501
msgid ":doc:`pgr_dagShortestPath` [3]_"
44944502
msgstr ""
44954503

@@ -8952,9 +8960,9 @@ msgid ""
89528960
"in an unweighted graph, i.e. the distance is the minimal number of edges "
89538961
"that you need to traverse from the source to another vertex. We can "
89548962
"interpret such a graph also as a weighted graph, where every edge has the"
8955-
" weight :math:`1`. If not alledges in graph have the same weight, that we"
8956-
" need a more general algorithm, like Dijkstra's Algorithm which runs in "
8957-
":math:`O(|E|log|V|)` time."
8963+
" weight :math:`1`. If not all edges in graph have the same weight, that "
8964+
"we need a more general algorithm, like Dijkstra's Algorithm which runs in"
8965+
" :math:`O(|E|log|V|)` time."
89588966
msgstr ""
89598967

89608968
#, python-brace-format
@@ -9007,15 +9015,6 @@ msgid ""
90079015
"(i.e :math:`1``)"
90089016
msgstr ""
90099017

9010-
msgid "Returns set of |result-1-1|"
9011-
msgstr ""
9012-
9013-
msgid "Returns set of |result-1-m|"
9014-
msgstr ""
9015-
9016-
msgid "Returns set of |result-m-1|"
9017-
msgstr ""
9018-
90199018
msgid ""
90209019
"`Boost: Breadth First Search "
90219020
"<https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"

‎locale/pot/pgrouting_doc_strings.pot‎

Lines changed: 8 additions & 11 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-06-14 12:05+0000\n"
11+
"POT-Creation-Date: 2025-06-16 16:56+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"
@@ -3628,6 +3628,9 @@ msgstr ""
36283628
msgid "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__ pgr_bellmanFord"
36293629
msgstr ""
36303630

3631+
msgid "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch"
3632+
msgstr ""
3633+
36313634
msgid "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__ pgr_edwardMoore"
36323635
msgstr ""
36333636

@@ -4003,6 +4006,9 @@ msgstr ""
40034006
msgid ":doc:`pgr_bellmanFord` [3]_"
40044007
msgstr ""
40054008

4009+
msgid ":doc:`pgr_binaryBreadthFirstSearch` [3]_"
4010+
msgstr ""
4011+
40064012
msgid ":doc:`pgr_dagShortestPath` [3]_"
40074013
msgstr ""
40084014

@@ -7744,7 +7750,7 @@ msgstr ""
77447750
msgid "pgr_binaryBreadthFirstSearch(Combinations)"
77457751
msgstr ""
77467752

7747-
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 alledges 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."
7753+
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."
77487754
msgstr ""
77497755

77507756
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."
@@ -7774,15 +7780,6 @@ msgstr ""
77747780
msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)"
77757781
msgstr ""
77767782

7777-
msgid "Returns set of |result-1-1|"
7778-
msgstr ""
7779-
7780-
msgid "Returns set of |result-1-m|"
7781-
msgstr ""
7782-
7783-
msgid "Returns set of |result-m-1|"
7784-
msgstr ""
7785-
77867783
msgid "`Boost: Breadth First Search <https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"
77877784
msgstr ""
77887785

0 commit comments

Comments
 (0)