Skip to content

Commit

Permalink
Translated using Weblate (Chinese (Simplified))
Browse files Browse the repository at this point in the history 
Currently translated at 98.1% (5176 of 5275 strings)

Translation: pgRouting/pgRouting
Translate-URL: https://weblate.osgeo.org/projects/pgrouting/pgrouting-develop/zh_Hans/
  • Loading branch information
@cvvergara
cvvergara committed May 28, 2024
1 parent bd6a655 commit b571548
Showing 1 changed file with 35 additions and 35 deletions.
70 changes: 35 additions & 35 deletions locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
View file
Original file line number Diff line number Diff line change
Expand Up @@ -12,8 +12,8 @@ msgstr ""
"Project-Id-Version: pgRouting v3.6.0-dev\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2024-05-13 17:23+0000\n"
"PO-Revision-Date: 2024-05-28 15:48+0000\n"
"Last-Translator: DeepL <[email protected]>\n"
"PO-Revision-Date: 2024-05-28 16:17+0000\n"
"Last-Translator: Celia Virginia Vergara Castillo <[email protected]>\n"
"Language-Team: Chinese (Simplified) <https://weblate.osgeo.org/projects/"
"pgrouting/pgrouting-develop/zh_Hans/>\n"
"Language: zh_Hans\n"
Expand Down Expand Up @@ -211,13 +211,13 @@ msgid "``seq``"
msgstr "``seq``"

msgid "Sequential value starting from :math:`1`."
msgstr "从:math:`1`开始的顺序值。"
msgstr "从 :math:`1` 开始的顺序值。"

msgid "``depth``"
msgstr "``depth``"

msgid "Depth of the ``node``."
msgstr "``node``的深度。"
msgstr "``node`` 的深度。"

msgid ":math:`0` when ``node`` = ``start_vid``."
msgstr ":math:`0` 当``node`` = ``start_vid``。"
Expand Down Expand Up @@ -3495,9 +3495,8 @@ msgstr ":doc:`pgr_withPointsCostMatrix`"
msgid ""
":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, "
"v)` must value :math:`\\infty`."
msgstr ""
":doc:`TSP-family`需要一个对称成本矩阵作为输入，并且没有边 `(u, v)`必须值为:"
"math:`\\infty` 。"
msgstr ":doc:`TSP-family` 需要一个对称成本矩阵作为输入，并且没有边 `(u, v)` 必须值为 "
":math:`\\infty`。"

msgid ""
"This collection of functions will return a cost matrix in form of a table."
Expand Down Expand Up @@ -3697,7 +3696,7 @@ msgid "`Combinations SQL`_"
msgstr "`Combinations SQL`_"

msgid "`Combinations SQL`_ as described below"
msgstr "`Combinations SQL`_如下所述"
msgstr "`Combinations SQL`_ 如下所述"

msgid "**start vid**"
msgstr "**start vid**"
Expand Down Expand Up @@ -5715,13 +5714,13 @@ msgid ""
msgstr "并将途经以下途经点： :math:`4\\rightarrow3\\rightarrow6`"

msgid ":doc:`pgr_withPointsVia` when there are no restrictions,"
msgstr ":doc:`pgr_withPointsVia`当没有限制时，"
msgstr ":doc:`pgr_withPointsVia` 当没有限制时，"

msgid ":doc:`pgr_trspVia_withPoints` when there are restrictions."
msgstr ":doc:`pgr_trspVia_withPoints`当有限制时。"

msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_withPointsVia``"
msgstr "使用``pgr_withPointsVia``迁移``pgr_trspViaEdges``"
msgstr "使用 ``pgr_withPointsVia`` 迁移 ``pgr_trspViaEdges``"

msgid "Use :doc:`pgr_withPointsVia` instead."
msgstr "请使用 :doc:`pgr_withPointsVia`。"
Expand Down Expand Up @@ -6025,7 +6024,7 @@ msgstr ""
"的示例问题 ："

msgid "Problem is to find the shortest path from :math:`1` to :math:`5`."
msgstr "问题是找到从 :math:`1`到:math:`5` 的最短路径。"
msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。"

msgid "Is an undirected graph."
msgstr "是一个无向图。"
Expand Down Expand Up @@ -6090,7 +6089,7 @@ msgid ""
"To go from :math:`1` to :math:`5` the path goes thru the following "
"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`"
msgstr ""
"从 :math:`1` 到 :math:`5`的路径要经过以下顶点： :math:`1 \\rightarrow 3 "
"从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 "
"\\rightarrow 6 \\rightarrow 5`"

msgid "Vertex information"
Expand Down Expand Up @@ -6324,7 +6323,7 @@ msgid ""
msgstr "假设样本数据中的 ``cost`` 和``reverse_cost``列表示："

msgid ":math:`1` when the edge exists in the graph"
msgstr "当边存在于图中时为:math:`1`"
msgstr "当边存在于图中时为 :math:`1`"

msgid ":math:`-1` when the edge does not exist in the graph"
msgstr "当图中不存在边时为:math:`-1`"
Expand Down Expand Up @@ -6567,8 +6566,8 @@ msgid ""
"vertex :math:`4`. And the closest edge to vertex :math:`4` is edge :math:"
"`14`."
msgstr ""
"使用 :doc:`pgr_findCloseEdges` 距离组件 :math:`1` 最近的顶点是顶点 :math:"
"`4` 。 距离顶点:math:`4`最近的边是 边 :math:`14`。"
"使用 :doc:`pgr_findCloseEdges` 距离组件 :math:`1` 最近的顶点是顶点 "
":math:`4`。 距离顶点 :math:`4` 最近的边是 边 :math:`14`。"

msgid ""
"The ``edge`` can be used to connect the components, using the ``fraction`` "
Expand Down Expand Up @@ -6869,7 +6868,7 @@ msgid "Users can define the combinations as desired."
msgstr "用户可以根据需要定义组合。"

msgid "Needs a `Combinations SQL`_"
msgstr "需要`Combinations SQL`_"
msgstr "需要 `Combinations SQL`_"

msgid ""
"There are several kinds of valid inner queries and also the columns returned "
Expand Down Expand Up @@ -8236,7 +8235,7 @@ msgid "``0`` for the first row in the tour sequence."
msgstr "``0``表示游览序列中的第一行。"

msgid "Start from vertex :math:`1`"
msgstr "从顶点 :math:`1`开始"
msgstr "从顶点 :math:`1` 开始"

msgid "**Line 6** ``start_vid => 1``"
msgstr "**Line 6** ``start_vid => 1``"
Expand Down Expand Up @@ -9745,11 +9744,12 @@ msgid ""
"general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|"
"V|)` time."
msgstr ""
"众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:"
"`O(|E|)`内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点"
"到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权"
"重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，"
"比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。"
"众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 "
":math:`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指"
"从源点到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，"
"其中每条边的权重为 "
":math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，比如 "
"Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。"

msgid ""
"However if the weights are more constrained, we can use a faster algorithm. "
Expand Down Expand Up @@ -9813,8 +9813,7 @@ msgstr ""
msgid ""
"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :"
"math:`1``)"
msgstr ""
"**注意:** 使用 :doc:`示例数据`网络，因为所有权重都相同（即为 :math:`1``）"
msgstr "**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同（即为 :math:`1`）"

msgid "https://cp-algorithms.com/graph/01_bfs.html"
msgstr "https://cp-algorithms.com/graph/01_bfs.html"
Expand Down Expand Up @@ -11200,7 +11199,7 @@ msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"

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

msgid "Breaking change on 3.5.0"
msgstr "3.5.0 上的重大变更"
Expand Down Expand Up @@ -11414,7 +11413,7 @@ msgstr ""
"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"

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

msgid "``pgr_dijkstraCostMatrix``"
msgstr "``pgr_dijkstraCostMatrix``"
Expand Down Expand Up @@ -11656,8 +11655,7 @@ msgstr ""
msgid ""
"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` "
"(lines: `11` and `12`)"
msgstr ""
"最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1`（行：`11`和`12`）"
msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` （行：`11`和`12`）"

msgid ""
"making a connection from the second subway line :math:`\\{15, 16\\}` to the "
Expand Down Expand Up @@ -13362,6 +13360,7 @@ msgid ""
"Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:"
msgstr "给定一个图 G，它的线图 L(G) 是这样的图："

#, fuzzy
msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`."
msgstr ":math:`L(G)` 的每个顶点代表 :math:`G` 的一条边。"

Expand Down Expand Up @@ -15420,7 +15419,7 @@ msgid "Status of \"passes in front\" or \"visits\" of the nodes and points."
msgstr "节点、点的\"通过\"或\"访问\"状态。"

msgid "The algorithm performs a :doc:`pgr_withPointsVia`"
msgstr "该算法执行:doc:`pgr_withPointsVia`"
msgstr "该算法执行 :doc:`pgr_withPointsVia`"

msgid ""
"Detects which of the paths pass through a restriction in this case is for "
Expand Down Expand Up @@ -15449,8 +15448,8 @@ msgid ""
"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and "
"5) is restricted and the result is using it."
msgstr ""
"第一步，执行 :doc:`pgr_withPointsVia` 不考虑在同一条边上进行掉头。但是路径 :"
"math:`9 \\rightarrow 16`（第4行和第5行）受到限制，结果中使用了它。"
"第一步，执行 :doc:`pgr_withPointsVia` 不考虑在同一条边上进行掉头。但是路径 "
":math:`9 \\rightarrow 16` （第4行和第5行）受到限制，结果中使用了它。"

msgid ""
"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting "
Expand Down Expand Up @@ -16411,15 +16410,15 @@ msgstr ""
"用堆路径（heap paths）并包含详细信息。"

msgid "``pgr_withPointsVia`` - Proposed"
msgstr "``pgr_withPointsVia`` -拟议"
msgstr "``pgr_withPointsVia`` - 拟议"

msgid ""
"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or "
"points."
msgstr "``pgr_withPointsVia`` - 经过一系列顶点和/或点的路线。"

msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)"
msgstr "新 **拟议**的函数 ``pgr_withPointsVia`` (`One Via`_)"
msgstr "新 **拟议** 的函数 ``pgr_withPointsVia`` (`One Via`_)"

msgid ""
"Given a graph, a set of points on the graphs edges and a list of vertices, "
Expand Down Expand Up @@ -16521,7 +16520,7 @@ msgid ":doc:`pgr_withPointsDD` - Driving distance."
msgstr ":doc:`pgr_withPointsDD` -行驶距离。"

msgid ":doc:`pgr_withPointsVia` - Via routing"
msgstr ":doc:`pgr_withPointsVia` -通过路由"
msgstr ":doc:`pgr_withPointsVia` - 通过路由"

msgid "These proposed functions do not modify the database."
msgstr "这些拟议的功能不会修改数据库。"
Expand Down Expand Up @@ -20077,8 +20076,9 @@ msgstr "pgr_withPointsKSP 是**带有点**的 pgr_ksp"
msgid "pgr_withPointsDD is pgr_drivingDistance **with points**"
msgstr "pgr_withPointsDD 是**带有点**的 pgr_drivenDistance"

#, fuzzy
msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**"
msgstr "pgr_withPointsvia 是**带有点**的 pgr_dijkstraVia"
msgstr "pgr_withPointsvia 是 **带有点** 的"

#~ msgid "``pgr_lineGraph`` - Experimental"
#~ msgstr "``pgr_lineGraph`` - 实验"
Expand Down

0 comments on commit b571548

Please sign in to comment.