Skip to content

Commit c5a635e

Browse files
committed
Reducing to 278 warnings
1 parent a5e17e7 commit c5a635e

File tree

1 file changed

+11
-11
lines changed

1 file changed

+11
-11
lines changed

locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -2932,13 +2932,13 @@ msgstr "没有传入边缘,但至少有一个传出边缘。"
29322932
msgid ""
29332933
"When the conditions are true then the `Operation: Dead End Contraction`_ can "
29342934
"be done."
2935-
msgstr "当条件成立时,可以进行当条件成立时,可以进行`操作: 死端收缩`_ 。"
2935+
msgstr "当条件成立时,可以进行当条件成立时,可以进行 `操作: 死端收缩`_ 。"
29362936

29372937
msgid "Dead end vertex on undirected graph"
29382938
msgstr "无向图上的死端顶点"
29392939

29402940
msgid "The green nodes are `dead end`_ nodes"
2941-
msgstr "绿色节点是`死端`_ 节点"
2941+
msgstr "绿色节点是 `死端`_ 节点"
29422942

29432943
msgid "The blue nodes have an unlimited number of edges."
29442944
msgstr "蓝色节点具有无限数量的边。"
@@ -3056,7 +3056,7 @@ msgid "Linear vertex on undirected graph"
30563056
msgstr "无向图上的线性顶点"
30573057

30583058
msgid "The green nodes are `linear`_ nodes"
3059-
msgstr "绿色节点是`线性`_ 节点"
3059+
msgstr "绿色节点是 `线性`_ 节点"
30603060

30613061
msgid "The blue nodes have an unlimited number of incoming and outgoing edges."
30623062
msgstr "蓝色节点具有无限数量的传入和传出边缘。"
@@ -3144,7 +3144,7 @@ msgstr "插入一条新边 :math:`u \\rightarrow z`,以红色表示。"
31443144
msgid ""
31453145
"Edge :math:`u \\rightarrow z` has the information of nodes that were "
31463146
"contracted."
3147-
msgstr "边 :math:`u \\rightarrow z`有收缩点的信息。"
3147+
msgstr "边 :math:`u \\rightarrow z` 有收缩点的信息。"
31483148

31493149
msgid "The cycle"
31503150
msgstr "循环"
@@ -3202,7 +3202,7 @@ msgstr "结果不代表收缩图。 它们表示应用收缩算法后对图所
32023202
msgid ""
32033203
"Observe that vertices, for example, :math:`6` do not appear in the results "
32043204
"because it was not affected by the contraction algorithm."
3205-
msgstr "例如,观察到顶点 :math:`6`没有出现在结果中,因为它不受收缩算法的影响。"
3205+
msgstr "例如,观察到顶点 :math:`6` 没有出现在结果中,因为它不受收缩算法的影响。"
32063206

32073207
msgid "After doing the dead end contraction operation:"
32083208
msgstr "进行死端收缩操作后:"
@@ -3262,7 +3262,7 @@ msgid "Store contraction information"
32623262
msgstr "存储收缩信息"
32633263

32643264
msgid "Store the `contraction results`_ in a table"
3265-
msgstr "将`收缩结果`_ 存储在表中"
3265+
msgstr "将 `收缩结果`_ 存储在表中"
32663266

32673267
msgid "The vertex table update"
32683268
msgstr "顶点表更新"
@@ -3322,7 +3322,7 @@ msgstr "情况 3:源和/或目标属于一个顶点。"
33223322

33233323
msgid ""
33243324
"Using the `Edges that belong to the contracted graph.`_ on lines 11 to 20."
3325-
msgstr "使用`属于收缩图的边。`_ 第 11 至 20 行。"
3325+
msgstr "使用 `属于收缩图的边。`_ 第 11 至 20 行。"
33263326

33273327
msgid "Case 1"
33283328
msgstr "情况1"
@@ -3354,7 +3354,7 @@ msgid ""
33543354
"In this case, the contracted graph do not have an edge connecting with node :"
33553355
"math:`7` and of node :math:`4` of the second case."
33563356
msgstr ""
3357-
"在这种情况下,收缩图没有与第二种情况的节点 :math:`7` 和节点 :math:`4`连接的边。"
3357+
"在这种情况下,收缩图没有与第二种情况的节点 :math:`7` 和节点 :math:`4` 连接的边。"
33583358

33593359
msgid "Refining the above function to include nodes that belong to an edge."
33603360
msgstr "改进上述函数以包含属于边的节点。"
@@ -3395,7 +3395,7 @@ msgid "When source and/or target belong to a vertex, now, a path is found."
33953395
msgstr "当源和/或目标属于一个顶点时,现在就找到了一条路径。"
33963396

33973397
msgid "Now, the routing graph has an edge connecting with node :math:`7`."
3398-
msgstr "现在,路由图有一条与节点 :math:`7`连接的边。"
3398+
msgstr "现在,路由图有一条与节点 :math:`7` 连接的边。"
33993399

34003400
msgid ":doc:`sampledata`"
34013401
msgstr ":doc:`sampledata`"
@@ -10464,7 +10464,7 @@ msgid "Array of contracted vertex identifiers."
1046410464
msgstr "收缩顶点标识符数组。"
1046510465

1046610466
msgid "When ``type`` = **'v'**: :math:`-1`"
10467-
msgstr "当 ``type`` = **'v'**: :math:`-1`时"
10467+
msgstr "当 ``type`` = **'v'**: :math:`-1` 时"
1046810468

1046910469
msgid ""
1047010470
"When ``type`` = **'e'**: Identifier of the source vertex of the current edge "
@@ -15708,7 +15708,7 @@ msgid ""
1570815708
"Which path (if any) passes in front of point :math:`6` or vertex :math:`11` "
1570915709
"with right side driving topology."
1571015710
msgstr ""
15711-
"哪条路径(如果有)通过右侧驱动拓扑的点 :math:`6`或顶点 :math:`11`前面。"
15711+
"哪条路径(如果有)通过右侧驱动拓扑的点 :math:`6` 或顶点 :math:`11` 前面。"
1571215712

1571315713
msgid "Show details on undirected graph."
1571415714
msgstr "显示无向图的详细信息。"

0 commit comments

Comments
 (0)