Skip to content

Commit 105513c

Browse files
Update locale: commit 2219bdb
1 parent 2219bdb commit 105513c

File tree

2 files changed

+5
-8
lines changed

2 files changed

+5
-8
lines changed

locale/en/LC_MESSAGES/pgrouting_doc_strings.po

Lines changed: 4 additions & 4 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-17 02:07+0000\n"
11+
"POT-Creation-Date: 2025-09-17 02:15+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"
@@ -11284,9 +11284,6 @@ msgstr ""
1128411284
msgid "pgr_dagShortestPath(Combinations)"
1128511285
msgstr ""
1128611286

11287-
msgid "..rubric:: Version 3.0.0"
11288-
msgstr ""
11289-
1129011287
msgid ""
1129111288
"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm"
1129211289
" that solves the shortest path problem for weighted directed acyclic "
@@ -19979,3 +19976,6 @@ msgstr ""
1997919976
#~ " :math:`O(|E|log|V|)` time."
1998019977
#~ msgstr ""
1998119978

19979+
#~ msgid "..rubric:: Version 3.0.0"
19980+
#~ msgstr ""
19981+

locale/pot/pgrouting_doc_strings.pot

Lines changed: 1 addition & 4 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-17 02:07+0000\n"
11+
"POT-Creation-Date: 2025-09-17 02:15+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"
@@ -9529,9 +9529,6 @@ msgstr ""
95299529
msgid "pgr_dagShortestPath(Combinations)"
95309530
msgstr ""
95319531

9532-
msgid "..rubric:: Version 3.0.0"
9533-
msgstr ""
9534-
95359532
msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)."
95369533
msgstr ""
95379534

0 commit comments

Comments
 (0)