Skip to content

Commit

Permalink
Update locale: commit 0b78b07
Browse files Browse the repository at this point in the history
  • Loading branch information
@github-actions
github-actions[bot] committed Sep 23, 2024
1 parent 0b78b07 commit e24ef9d
Show file tree
Hide file tree
Showing 2 changed files with 62 additions and 86 deletions.
81 changes: 33 additions & 48 deletions locale/en/LC_MESSAGES/pgrouting_doc_strings.po
View file
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ msgid ""
msgstr ""
"Project-Id-Version: pgRouting v3.6.0-dev\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2024-08-26 11:20+0000\n"
"POT-Creation-Date: 2024-09-23 01:17+0000\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: LANGUAGE <[email protected]>\n"
Expand Down Expand Up @@ -2757,11 +2757,6 @@ msgid ""
"<https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"
msgstr ""

msgid ""
"`Wikipedia: Graph Coloring "
"<https://en.wikipedia.org/wiki/Graph_coloring>`__"
msgstr ""

msgid "Components - Family of functions"
msgstr ""

Expand Down Expand Up @@ -4015,10 +4010,10 @@ msgid ""
"returned."
msgstr ""

msgid "There is no flow when a **source** is the same as a **target**."
msgid "There is no flow when source has the same vaule as target."
msgstr ""

msgid "Any duplicated value in the source(s) or target(s) are ignored."
msgid "Any duplicated values in source or target are ignored."
msgstr ""

msgid "Calculates the flow/residual capacity for each edge. In the output"
Expand All @@ -4027,9 +4022,13 @@ msgstr ""
msgid "Edges with zero flow are omitted."
msgstr ""

msgid ""
"Creates a **super source** and edges to all the source(s), and a **super "
"target** and the edges from all the targets(s)."
msgid "Creates"
msgstr ""

msgid "a **super source** and edges from it to all the sources,"
msgstr ""

msgid "a **super target** and edges from it to all the targetss."
msgstr ""

msgid ""
Expand Down Expand Up @@ -6555,7 +6554,7 @@ msgstr ""
msgid ""
"There are several kinds of valid inner queries and also the columns "
"returned are depending of the function. Which kind of inner query will "
"depend on the function(s) requirements. To simplify variety of types, "
"depend on the function's requirements. To simplify the variety of types, "
"**ANY-INTEGER** and **ANY-NUMERICAL** is used."
msgstr ""

Expand Down Expand Up @@ -6983,9 +6982,6 @@ msgid ""
"https://github.com/pgRouting/pgrouting/releases/latest"
msgstr ""

msgid "wget"
msgstr ""

msgid "To download this release:"
msgstr ""

Expand Down Expand Up @@ -8099,7 +8095,7 @@ msgid "pgr_aStarCost"
msgstr ""

msgid ""
"``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* "
"``pgr_aStarCost`` - Total cost of the shortest path using the A* "
"algorithm."
msgstr ""

Expand All @@ -8110,8 +8106,8 @@ msgid "New **proposed** function"
msgstr ""

msgid ""
"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest "
"path(s) using the A* algorithm."
"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path"
" using the A* algorithm."
msgstr ""

msgid ""
Expand Down Expand Up @@ -8826,7 +8822,7 @@ msgid "pgr_bdAstarCost"
msgstr ""

msgid ""
"``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the "
"``pgr_bdAstarCost`` - Total cost of the shortest path using the "
"bidirectional A* algorithm."
msgstr ""

Expand All @@ -8835,7 +8831,7 @@ msgstr ""

msgid ""
"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest "
"path(s) using the bidirectional A* algorithm."
"path using the bidirectional A* algorithm."
msgstr ""

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
Expand Down Expand Up @@ -8871,7 +8867,7 @@ msgid "``pgr_bdDijkstra``"
msgstr ""

msgid ""
"``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional "
"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional "
"Dijkstra algorithm."
msgstr ""

Expand Down Expand Up @@ -8908,7 +8904,7 @@ msgstr ""
msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr ""

msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])"
msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr ""

msgid "Returns set of |old-generic-result|"
Expand Down Expand Up @@ -8941,9 +8937,6 @@ msgid ""
"**undirected** graph"
msgstr ""

msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr ""

msgid "Using a combinations table on an **undirected** graph"
msgstr ""

Expand All @@ -8958,7 +8951,7 @@ msgid "``pgr_bdDijkstraCost``"
msgstr ""

msgid ""
"``pgr_bdDijkstraCost`` — Returns the shortest path(s)'s cost using "
"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using "
"Bidirectional Dijkstra algorithm."
msgstr ""

Expand Down Expand Up @@ -9023,7 +9016,7 @@ msgstr ""
msgid "``pgr_bellmanFord - Experimental``"
msgstr ""

msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm."
msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm."
msgstr ""

msgid "New **experimental** signature:"
Expand Down Expand Up @@ -9196,9 +9189,6 @@ msgstr ""
msgid "``vid``"
msgstr ""

msgid "Identifier of the vertex"
msgstr ""

msgid "``centrality``"
msgstr ""

Expand Down Expand Up @@ -9280,8 +9270,8 @@ msgid "``pgr_binaryBreadthFirstSearch`` - Experimental"
msgstr ""

msgid ""
"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a "
"binary graph."
"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary "
"graph."
msgstr ""

msgid ""
Expand Down Expand Up @@ -10320,9 +10310,9 @@ msgid "pgr_dagShortestPath - Experimental"
msgstr ""

msgid ""
"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted "
"directed acyclic graphs(DAG). In particular, the DAG shortest paths "
"algorithm implemented by Boost.Graph."
"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed"
" acyclic graphs(DAG). In particular, the DAG shortest paths algorithm "
"implemented by Boost.Graph."
msgstr ""

msgid "pgr_dagShortestPath(Combinations)"
Expand Down Expand Up @@ -10593,7 +10583,7 @@ msgstr ""
msgid "``pgr_dijkstra``"
msgstr ""

msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm."
msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm."
msgstr ""

msgid "Version 3.5.0"
Expand Down Expand Up @@ -10831,7 +10821,7 @@ msgid "``pgr_dijkstraCost``"
msgstr ""

msgid ""
"``pgr_dijkstraCost`` - Total cost of the shortest path(s) using Dijkstra "
"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra "
"algorithm."
msgstr ""

Expand All @@ -10840,7 +10830,7 @@ msgstr ""

msgid ""
"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest "
"path(s) using Dijkstra Algorithm."
"path using Dijkstra Algorithm."
msgstr ""

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
Expand Down Expand Up @@ -11233,7 +11223,7 @@ msgstr ""

msgid ""
"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that "
"order on an **directed** graph."
"order on an directed graph."
msgstr ""

msgid "Via optional parameters"
Expand Down Expand Up @@ -13226,7 +13216,7 @@ msgstr ""
msgid "New **Proposed** function"
msgstr ""

msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`."
msgid "Calculates the maximum flow from the sources to the targets."
msgstr ""

msgid ""
Expand Down Expand Up @@ -14383,11 +14373,6 @@ msgid ""
"[**options**])"
msgstr ""

msgid ""
"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that "
"order on an directed graph."
msgstr ""

msgid ""
"All this examples are about the route that visits the vertices "
":math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph."
Expand Down Expand Up @@ -14637,7 +14622,7 @@ msgstr ""

msgid ""
"Modify the graph to include points defined by points_sql. Using Dijkstra "
"algorithm, find the shortest path(s)"
"algorithm, find the shortest path"
msgstr ""

msgid "Characteristics:"
Expand Down Expand Up @@ -14981,7 +14966,7 @@ msgstr ""

msgid ""
"``pgr_withPointsCost`` - Calculates the shortest path and returns only "
"the aggregate cost of the shortest path(s) found, for the combination of "
"the aggregate cost of the shortest path found, for the combination of "
"points given."
msgstr ""

Expand All @@ -14990,7 +14975,7 @@ msgstr ""

msgid ""
"Modify the graph to include points defined by points_sql. Using Dijkstra "
"algorithm, return only the aggregate cost of the shortest path(s) found."
"algorithm, return only the aggregate cost of the shortest path found."
msgstr ""

msgid ""
Expand Down
Loading

0 comments on commit e24ef9d

Please sign in to comment.