From 9a130ac9c8a8b13899a195c161313686d411ae10 Mon Sep 17 00:00:00 2001 From: cvvergara Date: Mon, 23 Sep 2024 18:15:54 -0600 Subject: [PATCH] Reducing to 558 warnings --- .../LC_MESSAGES/pgrouting_doc_strings.po | 780 +++++++++--------- 1 file changed, 390 insertions(+), 390 deletions(-) diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index d33ec5c1f0..4afda09b6e 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -190,7 +190,7 @@ msgstr "边(``target``, ``source``)的权重" msgid "" "When negative: edge (``target``, ``source``) does not exist, therefore it's " "not part of the graph." -msgstr "当为负时：边（``target``, ``source``）不存在，因此它不是图的一部分。" +msgstr "当为负时：边（ ``target``, ``source`` ）不存在，因此它不是图的一部分。" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -205,7 +205,7 @@ msgid "Result columns" msgstr "结果列" msgid "Returns set of ``(seq, depth, start_vid, node, edge, cost, agg_cost)``" -msgstr "返回一组``(seq, depth, start_vid, node, edge, cost, agg_cost)``" +msgstr "返回一组 ``(seq, depth, start_vid, node, edge, cost, agg_cost)``" msgid "``seq``" msgstr "``seq``" @@ -232,13 +232,13 @@ msgid "``node``" msgstr "``node``" msgid "Identifier of ``node`` reached using ``edge``." -msgstr "使用``edge``到达的``node``的标识符。" +msgstr "使用 ``edge``到达的``node`` 的标识符。" msgid "``edge``" msgstr "``edge``" msgid "Identifier of the ``edge`` used to arrive to ``node``." -msgstr "用于到达``node``的``edge``的标识符。" +msgstr "用于到达 ``node`` 的 ``edge`` 的标识符。" msgid ":math:`-1` when ``node`` = ``start_vid``." msgstr ":math:`-1` 当 ``node`` = ``start_vid``。" @@ -247,13 +247,13 @@ msgid "``FLOAT``" msgstr "``FLOAT``" msgid "Cost to traverse ``edge``." -msgstr "遍历``edge``的成本。" +msgstr "遍历 ``edge`` 的成本。" msgid "``agg_cost``" msgstr "``agg_cost``" msgid "Aggregate cost from ``start_vid`` to ``node``." -msgstr "从``start_vid``到``node``的总成本。" +msgstr "从 ``start_vid`` 到 ``node`` 的总成本。" msgid "See Also" msgstr "另请参阅" @@ -648,7 +648,7 @@ msgid "The traveling costs are symmetric:" msgstr "旅行费用是对称的：" msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " +"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v``" "to ``u``" msgstr "从 ``u`` 到 ``v`` 的旅行费用与从 ``v`` 到 ``u`` 的旅行费用相同" @@ -681,7 +681,7 @@ msgstr "" msgid "" "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" -msgstr "当 ``NOT 0`` 且 ``start_id = 0``时，它是第一个和最后一个顶点" +msgstr "当 ``NOT 0`` 且 ``start_id = 0`` 时，它是第一个和最后一个顶点" msgid "References" msgstr "参考" @@ -1063,7 +1063,7 @@ msgid "The time, relative to 0, when the ending location opens." msgstr "结束位置打开的时间（相对于 0）。" msgid "When missing: The value of ``start_open`` is used" -msgstr "缺失时：使用``start_open``的值" +msgstr "缺失时：使用 ``start_open`` 的值" msgid "[``end_close``]" msgstr "[``end_close``]" @@ -1072,7 +1072,7 @@ msgid "The time, relative to 0, when the ending location closes." msgstr "结束位置关闭的时间（相对于 0）。" msgid "When missing: The value of ``start_close`` is used" -msgstr "缺失时：使用``start_close``的值" +msgstr "缺失时：使用 ``start_close`` 的值" msgid "[``end_service``]" msgstr "[``end_service``]" @@ -1105,7 +1105,7 @@ msgid "" msgstr "结束位置的节点标识符必须与 `Matrix SQL`_ 中的顶点标识符匹配。" msgid "When missing: ``end_node_id`` is used." -msgstr "缺少时：使用``end_node_id``。" +msgstr "缺少时：使用 ``end_node_id``。" msgid "``start_x``" msgstr "``start_x``" @@ -1126,7 +1126,7 @@ msgid ":math:`x` value of the ending location" msgstr "结束位置的 :math:`x` 值" msgid "When missing: ``start_x`` is used." -msgstr "缺失时：使用``start_x``值。" +msgstr "缺失时：使用 ``start_x`` 值。" msgid "[``end_y``]" msgstr "[``end_y``]" @@ -1135,7 +1135,7 @@ msgid ":math:`y` value of the ending location" msgstr "结束位置的 :math:`y` 值" msgid "When missing: ``start_y`` is used." -msgstr "缺失时：使用``start_y``值。" +msgstr "缺失时：使用 ``start_y`` 值。" msgid "Matrix SQL" msgstr "矩阵SQL" @@ -1286,7 +1286,7 @@ msgid "Summary row has the **total service time**:" msgstr "摘要行包含 **总服务时间**：" msgid "The sum of all the ``service_time``." -msgstr "所有``service_time``的总和。" +msgstr "所有 ``service_time`` 的总和。" msgid "``departure_time``" msgstr "``departure_time``" @@ -1535,10 +1535,10 @@ msgid "When the values are already in the desired time units" msgstr "当值已处于所需时间单位时" msgid "``factor`` should be **1**" -msgstr "``因数``应为 **1**" +msgstr "``因数`` 应为 **1**" msgid "When ``factor`` > 1 the travel times are faster" -msgstr "当``因子`` > 1 时，行程时间更快" +msgstr "当 ``因子`` > 1 时，行程时间更快" msgid "When ``factor`` < 1 the travel times are slower" msgstr "当 ``因子`` < 1 时，行程时间会变慢" @@ -1582,7 +1582,7 @@ msgid "For the :doc:`pgr_pickDeliver`:" msgstr "用于:doc:`pgr_pickDeliver`:" msgid "" -"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " +"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor``" "becomes :math:`1 / v`" msgstr "给定 :math:`v = d / t` 因此 :math:`t = d / v` 并且 ``因子`` 变为 :math:`1 / v`" @@ -1915,7 +1915,7 @@ msgid "When ``true`` the graph is considered `Directed`" msgstr "当 ``true`` 时，该图被视为有`有向`" msgid "When ``false`` the graph is considered as `Undirected`." -msgstr "如果为 ``false``，则该图被视为 `无向`。" +msgstr "如果为 ``false`` ，则该图被视为 `无向`。" msgid "Performance" msgstr "表现" @@ -2783,7 +2783,7 @@ msgid "" msgstr ":doc:`pgr_edgeColoring` - 使用 Vizing 定理的边缘着色算法。" msgid "Returns set of ``(vertex_id, color_id)``" -msgstr "返回集合``(vertex_id, color_id)``" +msgstr "返回集合 ``(vertex_id, color_id)``" msgid "``vertex_id``" msgstr "``vertex_id``" @@ -3160,8 +3160,8 @@ msgstr "" msgid "" "This implementation, cycles ``max_cycles`` times through " -"``operations_order`` ." -msgstr "此实现通过``operations_order``循环 ``max_cycles`` 次。" +"``operations_order``." +msgstr "此实现通过 ``operations_order``循环 ``max_cycles`` 次。" msgid "Contracting sample data" msgstr "收缩示例数据" @@ -3217,9 +3217,9 @@ msgid "Add additional columns" msgstr "添加附加列" msgid "" -"Adding extra columns to the ``edge_table`` and ``edge_table_vertices_pgr`` " +"Adding extra columns to the ``edge_table`` and ``edge_table_vertices_pgr``" "tables, where:" -msgstr "向``edge_table`` 和``edge_table_vertices_pgr`` 表添加额外的列，其中：" +msgstr "向 ``edge_table`` 和``edge_table_vertices_pgr`` 表添加额外的列，其中：" msgid "``contracted_vertices``" msgstr "``contracted_vertices``" @@ -3269,12 +3269,12 @@ msgstr "顶点表更新" msgid "" "Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "使用 ``is_contracted``列来指示收缩的顶点。" +msgstr "使用 ``is_contracted`` 列来指示收缩的顶点。" msgid "" "Fill ``contracted_vertices`` with the information from the results tha " "belong to the vertices." -msgstr "使用属于顶点的结果中的信息填充``contracted_vertices``。" +msgstr "使用属于顶点的结果中的信息填充 ``contracted_vertices``。" msgid "The modified vertices table:" msgstr "修改后的顶点表：" @@ -3286,7 +3286,7 @@ msgid "Insert the new edges generated by pgr_contraction." msgstr "插入由 pgr_contraction 生成的新边。" msgid "The modified ``edge_table``." -msgstr "修改后的``edge_table``。" +msgstr "修改后的 ``edge_table``。" msgid "The contracted graph" msgstr "收缩图" @@ -3443,7 +3443,7 @@ msgid "" "Let be the case the values returned are stored in a table, so the unique " "index would be the pair: ``(start_vid, end_vid)``." msgstr "" -"假设返回的值存储在表中，因此唯一索引将是一对：``(start_vid, end_vid)``。" +"假设返回的值存储在表中，因此唯一索引将是一对： ``(start_vid, end_vid)``。" msgid "" "Depending on the function and its parameters, the results can be symmetric." @@ -3464,7 +3464,7 @@ msgid "``start_vid`` ascending" msgstr "``start_vid`` 升序" msgid "``end_vid`` ascending" -msgstr "``end_vid``升序" +msgstr "``end_vid`` 升序" msgid "Cost Matrix - Category" msgstr "成本矩阵 - 类别" @@ -3628,13 +3628,13 @@ msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:" msgstr "[``b``, ``r``, ``l``, ``NULL``] 中的值指示该点是否为：" msgid "In the right ``r``," -msgstr "``r``在右边，" +msgstr "``r`` 在右边，" msgid "In the left ``l``," -msgstr "``l``在左边，" +msgstr "``l`` 在左边，" msgid "In both sides ``b``, ``NULL``" -msgstr "``b``, ``NULL``在两边" +msgstr "``b``, ``NULL`` 在两边" msgid ":doc:`TSP-family`" msgstr ":doc:`TSP-family`" @@ -3757,8 +3757,8 @@ msgstr "加权有向图， :math:`G_d(V,E)` 的定义如下：" msgid "the set of vertices :math:`V`" msgstr "顶点集 :math:`V`" -msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" -msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" +msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" +msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" msgid "the set of edges :math:`E`" msgstr "边集 :math:`E`" @@ -3766,15 +3766,15 @@ msgstr "边集 :math:`E`" msgid "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " "\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " -"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " -"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " +"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " +"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " "\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " "\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " "\\neq \\varnothing \\\\ \\end{cases}`" msgstr "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ " "when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ " -"\\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, " +"\\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, " "target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup " "\\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 " "\\} & \\quad \\text{if } reverse\\_cost \\n" @@ -3786,15 +3786,15 @@ msgstr "无向图" msgid "The weighted undirected graph, :math:`G_u(V,E)`, is definied by:" msgstr "加权无向图， :math:`G_u(V,E)` 的定义如下：" -msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" +msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgstr "" -":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" +":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgid "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " +"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " +"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " +"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " "\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " "\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " "\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " @@ -3803,7 +3803,7 @@ msgid "" "\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" msgstr "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ " -"when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, " +"when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, " "cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } reverse\\_cost = " "\\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ \\text{ } \\{(" "source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ " @@ -3858,8 +3858,8 @@ msgstr ":math:`node_i \\in V`" msgid ":math:`node_1 = start_{vid}`" msgstr ":math:`node_1 = start_{vid}`" -msgid ":math:`node_{| \\pi |} = end_{vid}`" -msgstr ":math:`node_{| \\pi |} = end_{vid}`" +msgid ":math:`node_{| \\pi |} = end_{vid}`" +msgstr ":math:`node_{| \\pi |} = end_{vid}`" msgid "" ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" @@ -3867,24 +3867,24 @@ msgstr "" ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" msgid "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " -"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" +":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " +"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" "\\ \\end{cases}`" msgstr "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " -"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" +":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " +"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" "\\ \\end{cases}`" msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`" msgid "" -":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" -"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " +":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" +"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " "\\text{when } i \\neq 1 \\\\ \\end{cases}`" msgstr "" -":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" -"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " +":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" +"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " "\\text{when } i \\neq 1 \\\\ \\end{cases}`" msgid "" @@ -3985,13 +3985,13 @@ msgid "``pred``" msgstr "``pred``" msgid "Predecessor of ``node``." -msgstr "``node``的前驱。" +msgstr "``node`` 的前驱。" msgid "When ``node`` = ``start_vid`` then has the value ``node``." msgstr "当 `node` 等于 `start_vid` 时，它的值就是 `node`。" msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." -msgstr "从``pred`` 到达``node``所使用的 ``edge``的标识符。" +msgstr "从 ``pred`` 到达``node``所使用的 ``edge`` 的标识符。" msgid "Experimental Functions" msgstr "实验函数" @@ -4335,19 +4335,19 @@ msgstr "图定义" msgid "The weighted directed graph, :math:`G(V,E)`, is defined as:" msgstr "加权有向图， :math:`G(V,E)` 定义为：" -msgid "the set of vertices :math:`V`" +msgid "the set of vertices :math:`V`" msgstr "顶点集:math:`V`" msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " +":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " "target_i`" msgstr "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " +":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " "target_i`" msgid "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " +"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " "\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " "capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " "\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " @@ -4355,7 +4355,7 @@ msgid "" "\\varnothing \\\\ \\end{cases}`" msgstr "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " +"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " "\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " "capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " "\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " @@ -4606,7 +4606,7 @@ msgstr "将输出列标准化为 |result-spantree|" #, fuzzy msgid "Added ``pred`` result columns." -msgstr "添加了 ``depth``和``pred``结果列。" +msgstr "添加了 ``depth``和``pred`` 结果列。" msgid "Experimental promoted to proposed." msgstr "实验提升为拟议。" @@ -4700,7 +4700,7 @@ msgid "Migrating functions" msgstr "迁移函数" msgid "Migration of ``pgr_aStar``" -msgstr "``pgr_aStar``迁移" +msgstr "``pgr_aStar`` 迁移" msgid "" "Starting from `v3.6.0 `__" @@ -4725,9 +4725,9 @@ msgid "Output columns were |old-generic-result|" msgstr "输出列是 |old-generic-result|" msgid "" -"Depending on the overload used, the columns ``start_vid`` and ``end_vid`` " +"Depending on the overload used, the columns ``start_vid`` and ``end_vid``" "might be missing:" -msgstr "根据所使用的重载， ``start_vid`` 和``end_vid``列可能会丢失：" +msgstr "根据所使用的重载， ``start_vid`` 和``end_vid`` 列可能会丢失：" msgid "" "``pgr_aStar`` (`One to One`) does not have ``start_vid`` and ``end_vid``." @@ -4747,7 +4747,7 @@ msgid "Be aware of the existence of the additional columns." msgstr "请注意附加列的存在。" msgid "In ``pgr_aStar`` (`One to One`)" -msgstr "在``pgr_aStar`` (`一对一`)中" +msgstr "在 ``pgr_aStar`` (`一对一`)中" msgid "``start_vid`` contains the **start vid** parameter value." msgstr "``start_vid`` 包含 **起始 vid** 参数值。" @@ -4756,10 +4756,10 @@ msgid "``end_vid`` contains the **end vid** parameter value." msgstr "``end_vid`` 包含 **结束 vid** 参数值。" msgid "In ``pgr_aStar`` (`One to Many`)" -msgstr "在``pgr_aStar`` (`一对多`)中" +msgstr "在 ``pgr_aStar`` (`一对多`)中" msgid "In ``pgr_aStar`` (`Many to One`)" -msgstr "在``pgr_aStar`` (`多对一`)中" +msgstr "在 ``pgr_aStar`` (`多对一`)中" msgid "If needed filter out the added columns, for example:" msgstr "如果需要，过滤掉添加的列，例如：" @@ -4789,10 +4789,10 @@ msgid "" msgstr "" "从 `v3.5 `__开始，函数 " -"``my_dijkstra`` 返回 ``pgr_dijkstra``的新附加列。" +"``my_dijkstra`` 返回 ``pgr_dijkstra`` 的新附加列。" msgid "Migration of ``pgr_bdAstar``" -msgstr "迁移``pgr_bdAstar``" +msgstr "迁移 ``pgr_bdAstar``" msgid "``pgr_bdAstar`` (`One to One`)" msgstr "``pgr_bdAstar`` (`一对一`)" @@ -4814,16 +4814,16 @@ msgid "``pgr_bdAstar`` (`Many to One`) does not have ``end_vid``." msgstr "``pgr_bdAstar`` (`多对一`) 没有 ``end_vid``。" msgid "In ``pgr_bdAstar`` (`One to One`)" -msgstr "在``pgr_bdAstar`` (`一对一`)中" +msgstr "在 ``pgr_bdAstar`` (`一对一`)中" msgid "In ``pgr_bdAstar`` (`One to Many`)" -msgstr "在``pgr_bdAstar`` (`一对多`)中" +msgstr "在 ``pgr_bdAstar`` (`一对多`)中" msgid "In ``pgr_bdAstar`` (`Many to One`)" -msgstr "在``pgr_bdAstar`` (`多对一`)中" +msgstr "在 ``pgr_bdAstar`` (`多对一`)中" msgid "Migration of ``pgr_dijkstra``" -msgstr "迁移``pgr_dijkstra``" +msgstr "迁移 ``pgr_dijkstra``" msgid "" "Starting from `v3.5.0 `__" @@ -4850,19 +4850,19 @@ msgid "``pgr_dijkstra`` (`Many to One`) does not have ``end_vid``." msgstr "``pgr_dijkstra`` (`多对一`) 没有``end_vid``。" msgid "In ``pgr_dijkstra`` (`One to One`)" -msgstr "在``pgr_dijkstra`` (`一对一`)中" +msgstr "在 ``pgr_dijkstra`` (`一对一`)中" msgid "In ``pgr_dijkstra`` (`One to Many`)" -msgstr "在``pgr_dijkstra`` (`一对多`)中" +msgstr "在 ``pgr_dijkstra`` (`一对多`)中" msgid "In ``pgr_dijkstra`` (`Many to One`)" -msgstr "在``pgr_dijkstra`` (`多对一`)中" +msgstr "在 ``pgr_dijkstra`` (`多对一`)中" msgid "If needed add the new columns, for example:" msgstr "如果需要，过滤掉添加的列，例如：" msgid "Migration of ``pgr_drivingdistance``" -msgstr "迁移``pgr_drivingdistance``" +msgstr "迁移 ``pgr_drivingdistance``" msgid "" "Starting from `v3.6.0 `__ :" @@ -4893,13 +4893,13 @@ msgid "Output columns were |result-dij-dd|" msgstr "输出列是 |result-dij-dd|" msgid "Does not have ``start_vid`` and ``depth`` result columns." -msgstr "没有``start_vid``和 ``depth``结果列。" +msgstr "没有 ``start_vid``和 ``depth`` 结果列。" msgid "Has ``from_v`` instead of ``start_vid`` result column." -msgstr "有 ``from_v`` 而不是 ``start_vid``结果列。" +msgstr "有 ``from_v`` 而不是 ``start_vid`` 结果列。" msgid "does not have ``depth`` result column." -msgstr "没有``depth``结果列。" +msgstr "没有 ``depth`` 结果列。" #, fuzzy msgid "Be aware of the existence and name change of the result columns." @@ -4913,10 +4913,10 @@ msgstr "" "vertex>`__示例。" msgid "``depth`` contains the depth of the ``node``." -msgstr "``depth``包含``node``的深度。" +msgstr "``depth``包含``node`` 的深度。" msgid "``pred`` contains the predecessor of the ``node``." -msgstr "``pred`` 包含``node``的前驱。" +msgstr "``pred`` 包含``node`` 的前驱。" msgid "" "If needed filter out the added columns, for example, to return the original " @@ -4996,7 +4996,7 @@ msgstr "" #, fuzzy msgid "" "Now column ``pred`` exists and contains the predecessor of the ``node``." -msgstr "``pred`` 包含``node``的前驱。" +msgstr "``pred`` 包含``node`` 的前驱。" #, fuzzy msgid "Kruskal multiple vertices" @@ -5011,7 +5011,7 @@ msgstr "" "vertices>`__ 示例。" msgid "Migration of ``pgr_KSP``" -msgstr "迁移``pgr_KSP``" +msgstr "迁移 ``pgr_KSP``" #, fuzzy msgid "" @@ -5034,7 +5034,7 @@ msgid "Output columns were |ksp-result|" msgstr "输出列是 |ksp-result|" msgid "the columns ``start_vid`` and ``end_vid`` do not exist." -msgstr "``start_vid``和 ``end_vid``列不存在。" +msgstr "``start_vid``和 ``end_vid`` 列不存在。" msgid "``pgr_KSP`` (One to One) does not have ``start_vid`` and ``end_vid``." msgstr "``pgr_KSP`` (一对一) 没有 ``start_vid`` 和``end_vid``。" @@ -5057,7 +5057,7 @@ msgid "" ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " "the ``directed`` flag has been removed." msgstr "" -":doc:`pgr_maxCardinalityMatch` 仅适用于无向图，因此``有向``标志已被删除。" +":doc:`pgr_maxCardinalityMatch` 仅适用于无向图，因此 ``有向`` 标志已被删除。" msgid "" "Starting from `v3.4.0 `__" @@ -5070,7 +5070,7 @@ msgid "Migration is needed, because:" msgstr "需要迁移，因为：" msgid "Use ``cost`` and ``reverse_cost`` on the inner query" -msgstr "在内部查询上使用``cost``和 ``reverse_cost``" +msgstr "在内部查询上使用 ``cost``和 ``reverse_cost``" msgid "Results are ordered" msgstr "结果已排序" @@ -5082,10 +5082,10 @@ msgid "New signature" msgstr "新签名" msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." -msgstr "``pgr_maxCardinalityMatch(text)`` 仅仅返回``边``列." +msgstr "``pgr_maxCardinalityMatch(text)`` 仅仅返回``边`` 列." msgid "The optional flag ``directed`` is removed." -msgstr "可选的 ``directed``标志被删除。" +msgstr "可选的 ``directed`` 标志被删除。" msgid "Before migration" msgstr "迁移前" @@ -5093,7 +5093,7 @@ msgstr "迁移前" msgid "" "Columns used are ``going`` and ``coming`` to represent the existence of an " "edge." -msgstr "所使用的列是 ``going`` 和 ``coming``，用于表示边的存在。" +msgstr "所使用的列是 ``going`` 和 ``coming`` ，用于表示边的存在。" msgid "" "Flag ``directed`` was used to indicate if it was for a **directed** or " @@ -5101,7 +5101,7 @@ msgid "" msgstr "``directed`` 标志用于指示是 **有向** 图还是 **无向** 图。" msgid "The flag ``directed`` is ignored." -msgstr "``directed``标志被忽略。" +msgstr "``directed`` 标志被忽略。" msgid "" "Regardless of it's value it gives the result considering the graph as " @@ -5111,13 +5111,13 @@ msgstr "无论它的值如何，它都会给出将图视为 **无向** 的结果 msgid "" "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " "an edge." -msgstr "使用 ``cost``和 ``reverse_cost``列来表示边的存在。" +msgstr "使用 ``cost``和 ``reverse_cost`` 列来表示边的存在。" msgid "Do not use the flag ``directed``." -msgstr "不要使用``directed``标志。" +msgstr "不要使用 ``directed`` 标志。" msgid "In the query returns only ``edge`` column." -msgstr "查询中仅返回``边``列。" +msgstr "查询中仅返回 ``边`` 列。" msgid "Migration of ``pgr_primDD`` / ``pgr_primBFS`` / ``pgr_primDFS``" msgstr "" @@ -5161,7 +5161,7 @@ msgstr "" "vertices>`__ 示例。" msgid "Migration of ``pgr_withPointsDD``" -msgstr "迁移``pgr_withPointsDD``" +msgstr "迁移 ``pgr_withPointsDD``" #, fuzzy msgid "" @@ -5192,7 +5192,7 @@ msgid "Output columns were |result-1-1-no-seq|" msgstr "输出列为|result-1-1-no-seq|" msgid "Does not have ``start_vid``, ``pred`` and ``depth`` result columns." -msgstr "没有``start_vid``，``pred``和``depth``结果列。" +msgstr "没有 ``start_vid``，``pred``和``depth`` 结果列。" #, fuzzy msgid "" @@ -5206,7 +5206,7 @@ msgid "Output columns were |result-m-1-no-seq|" msgstr "输出列为|result-m-1-no-seq|" msgid "Does not have ``depth`` and ``pred`` result columns." -msgstr "没有 ``depth``和``pred``结果列。" +msgstr "没有 ``depth``和``pred`` 结果列。" msgid "Driving side was optional" msgstr "驾驶侧是可选的" @@ -5236,13 +5236,13 @@ msgid "Driving side was named optional" msgstr "驾驶侧被命名为可选" msgid "On directed graph ``b`` could be used as **driving side**" -msgstr "在有向图上 ``b``可以用作 **行驶方向**" +msgstr "在有向图上 ``b`` 可以用作 **行驶方向**" msgid "On undirected graph ``r`` could be used as **driving side**" msgstr "在无向图上 ``r`` 可以用作 **行驶方向**" msgid "Also ``l`` could be used as **driving side**" -msgstr "此外，``l`` 也可用作 **驾驶侧**" +msgstr "此外， ``l`` 也可用作 **驾驶侧**" msgid "After Migration" msgstr "迁移后" @@ -5297,10 +5297,10 @@ msgid "filter out the additional columns, for example;" msgstr "过滤掉额外的列，例如；" msgid "" -"When ``details => false`` to remove the points use ``WHERE node >= 0 OR cost " +"When ``details => false`` to remove the points use `` WHERE node >= 0 OR cost " "= 0``" msgstr "" -"当设置``details => false`` 以移除点时，请使用 ``WHERE node >= 0 OR cost = 0``" +"当设置 ``details => false`` 以移除点时，请使用 ``WHERE node >= 0 OR cost = 0``" msgid "" "Using `this `__ 作为导入工具的数据附带路由拓扑。 请参阅`workshop `__上使用``osm2pgrouting`` " +"workshop.pgrouting.org/latest/en/basic/data.html>`__上使用 ``osm2pgrouting``" "的示例。" msgid "Adjust costs" @@ -6316,7 +6316,7 @@ msgstr "调整成本" msgid "" "For this example the ``cost`` and ``reverse_cost`` values are going to be " "the double of the length of the geometry." -msgstr "对于本示例，``cost`` 和``reverse_cost``值将是几何体长度的两倍。" +msgstr "对于本示例， ``cost`` 和``reverse_cost`` 值将是几何体长度的两倍。" msgid "Update costs to length of geometry" msgstr "将成本更新为几何形状的长度" @@ -6324,7 +6324,7 @@ msgstr "将成本更新为几何形状的长度" msgid "" "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " "represent:" -msgstr "假设样本数据中的 ``cost`` 和``reverse_cost``列表示：" +msgstr "假设样本数据中的 ``cost`` 和``reverse_cost`` 列表示：" msgid ":math:`1` when the edge exists in the graph" msgstr "当边存在于图中时为 :math:`1`" @@ -6353,13 +6353,13 @@ msgid "Other datasets, can have a column with values like" msgstr "其他数据集可以有一列包含如下值" msgid "``FT`` vehicle flow on the direction of the geometry" -msgstr "``FT``几何方向上的车流" +msgstr "``FT`` 几何方向上的车流" msgid "``TF`` vehicle flow opposite of the direction of the geometry" msgstr "``TF`` 车流与几何方向相反" msgid "``B`` vehicle flow on both directions" -msgstr "``B``双向车流" +msgstr "``B`` 双向车流" msgid "Preparing a code column for the example:" msgstr "为示例准备代码列：" @@ -6574,7 +6574,7 @@ msgstr "" "`4`。 距离顶点 :math:`4` 最近的边是 边 :math:`14`。" msgid "" -"The ``edge`` can be used to connect the components, using the ``fraction`` " +"The ``edge`` can be used to connect the components, using the ``fraction``" "information about the edge :math:`14` to split the connecting edge." msgstr "" "``edge``可用于连接组件，利用边 :math:`14`的``fraction`` 信息来分割连接边。" @@ -6713,23 +6713,23 @@ msgstr "pgRouting 函数调用的一般形式是：" msgid "\\ \\" msgstr "\\ \\" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgid "pgr_(`Inner queries`_, **parameters**, [``Optional parameters``)" msgstr "" -"pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +"pgr_(`Inner queries`_, **parameters**, [``Optional parameters``)" msgid "" "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " "containing SQL queries." -msgstr "`Inner queries`_：是强制参数，是包含 SQL 查询的``TEXT``字符串。" +msgstr "`Inner queries`_：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" msgid "" "**parameters**: Additional compulsory parameters needed by the function." msgstr "**parameters**：函数需要的附加强制参数。" msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " +"``Optional parameters`` : Are non compulsory **named** parameters that have a " "default value when omitted." -msgstr "``Optional parameters``：是非强制命名参数，省略时具有默认值。" +msgstr "``Optional parameters`` ：是非强制命名参数，省略时具有默认值。" msgid "" "The compulsory parameters are positional parameters, the optional parameters " @@ -6894,7 +6894,7 @@ msgid "Some uncategorised functions" msgstr "一些未分类的函数" msgid "General without ``id``" -msgstr "一般没有``id``" +msgstr "一般没有 ``id``" msgid "General with (X,Y)" msgstr "通常带有（X,Y)" @@ -6902,7 +6902,7 @@ msgstr "通常带有（X,Y)" msgid "" "When negative: edge (``source``, ``target``) does not exist, therefore it's " "not part of the graph." -msgstr "当为负时：边（``source``, ``target``）不存在，因此它不是图的一部分。" +msgstr "当为负时：边（ ``source``, ``target`` ）不存在，因此它不是图的一部分。" msgid "Weight of the edge (``target``, ``source``)," msgstr "边 (``target``, ``source``)的权重，" @@ -6917,19 +6917,19 @@ msgid "``y1``" msgstr "``y1``" msgid "Y coordinate of ``source`` vertex." -msgstr "``source``顶点的Y坐标。" +msgstr "``source`` 顶点的Y坐标。" msgid "``x2``" msgstr "``x2``" msgid "X coordinate of ``target`` vertex." -msgstr "``target``顶点的X坐标。" +msgstr "``target`` 顶点的X坐标。" msgid "``y2``" msgstr "``y2``" msgid "Y coordinate of ``target`` vertex." -msgstr "``target``顶点的Y坐标。" +msgstr "``target`` 顶点的Y坐标。" msgid "Flow" msgstr "流" @@ -6990,7 +6990,7 @@ msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" msgstr "当为 ``true`` 时，如果路径丢失，则停止并返回 **EMPTY SET**" msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "当``false``忽略丢失的路径时，返回找到的所有路径" +msgstr "当 ``false`` 忽略丢失的路径时，返回找到的所有路径" msgid "``U_turn_on_edge``" msgstr "``U_turn_on_edge``" @@ -7008,7 +7008,7 @@ msgid "" "the edge used to reach it. In other words, U turn using the edge with same " "identifier is used when no other path is found." msgstr "" -"当为``false``时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，只" +"当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，只" "有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" msgid "For the TRSP functions" @@ -7034,7 +7034,7 @@ msgid "" "Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " "agg_cost)``" msgstr "" -"返回``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, agg_cost)``" +"返回 ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, agg_cost)``" "的集合" msgid "``path_seq``" @@ -7055,19 +7055,19 @@ msgid "" msgstr "结束顶点的标识符。 当查询中有多个结束顶点时返回。" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." -msgstr "从``start_vid``到 ``end_vid``路径中节点的标识符。" +msgstr "从 ``start_vid``到 ``end_vid`` 路径中节点的标识符。" msgid "" "Identifier of the edge used to go from ``node`` to the next node in the path " "sequence. **-1** for the last node of the path." msgstr "" -"用于从路径序列中的``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后一" +"用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后一" "个节点。" msgid "" "Cost to traverse from ``node`` using ``edge`` to the next node in the path " "sequence." -msgstr "从使用``edge``的 ``node`` 遍历到路径序列中的下一个节点的成本。" +msgstr "从使用 ``edge``的 ``node`` 遍历到路径序列中的下一个节点的成本。" msgid "Used in functions the following:" msgstr "用于以下函数：" @@ -7079,7 +7079,7 @@ msgid "" "Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " "agg_cost)``" msgstr "" -"返回``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, agg_cost)``" +"返回 ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, agg_cost)``" "的集合" msgid "Relative position in the path." @@ -7119,7 +7119,7 @@ msgid "Returned on `One to Many`_ and `Many to Many`_" msgstr "返回`一对多`_和`多对多`_" msgid "Identifier of the node in the path from ``start_pid`` to ``end_pid``." -msgstr "从``start_pid`` 到``end_pid``路径中节点的标识符。" +msgstr "从 ``start_pid`` 到``end_pid`` 路径中节点的标识符。" msgid "When positive is the identifier of the a vertex." msgstr "当正数时是顶点的标识符。" @@ -7130,7 +7130,7 @@ msgstr "当负数时是a点的标识符。" msgid "" "Identifier of the edge used to go from ``node`` to the next node in the path " "sequence." -msgstr "用于从路径序列中的 ``node``到下一个节点的边的标识符。" +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。" msgid "**-1** for the last row of the path." msgstr "**-1** 表示路径的最后一行。" @@ -7144,7 +7144,7 @@ msgstr ":doc:`pgr_dijkstraNear`" msgid "" "Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" msgstr "" -"返回``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" +"返回 ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" msgid "Identifier of the starting vertex of the current path." msgstr "当前路径起始顶点的标识符。" @@ -7212,7 +7212,7 @@ msgid "Result columns for spanning tree functions" msgstr "生成树函数的结果列" msgid "Returns set of ``(edge, cost)``" -msgstr "返回集合``(edge, cost)``" +msgstr "返回集合 ``(edge, cost)``" msgid "Cost to traverse the edge." msgstr "穿越边的成本。" @@ -7519,7 +7519,7 @@ msgid "" "To get additional details on the flags associated with ``createuser`` below " "given command can be used" msgstr "" -"要获取与下面的 ``createuser``相关的标志的更多详细信息，可以使用给定的命令" +"要获取与下面的 ``createuser`` 相关的标志的更多详细信息，可以使用给定的命令" msgid "Creating Database in PostgreSQL" msgstr "在 PostgreSQL 中创建数据库" @@ -7634,7 +7634,7 @@ msgid "" msgstr "我们已经在多个平台上进行了测试，安装或重新安装需要所有步骤。" msgid "The sql signatures are configured and build in the ``cmake`` command." -msgstr "SQL签名是在``cmake``命令中配置和构建的。" +msgstr "SQL签名是在 ``cmake`` 命令中配置和构建的。" msgid "MinGW on Windows" msgstr "Windows 上的 MinGW" @@ -7891,7 +7891,7 @@ msgid "``pgr_ksp`` (One to One)" msgstr "``pgr_ksp`` (一对一)" msgid "Added ``start_vid`` and ``end_vid`` result columns." -msgstr "增加``start_vid``和``end_vid``结果列。" +msgstr "增加 ``start_vid``和``end_vid`` 结果列。" msgid "New overload functions:" msgstr "新的重载函数：" @@ -8012,7 +8012,7 @@ msgid "``heap_paths``" msgstr "``heap_paths``" msgid "When ``false`` Returns at most K paths." -msgstr "当``false``时返回最多 K 条路径。" +msgstr "当 ``false`` 时返回最多 K 条路径。" msgid "When ``true`` all the calculated paths while processing are returned." msgstr "当 ``true`` 时，返回处理时的所有计算路径。" @@ -8021,15 +8021,15 @@ msgid "" "Roughly, when the shortest path has ``N`` edges, the heap will contain about " "than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" -"粗略地说，当最短路径有 ``N`` 个边时，对于``K``值较小且``K > 5``，堆将包含大" +"粗略地说，当最短路径有 ``N`` 个边时，对于``K``值较小且``K > 5`` ，堆将包含大" "约 ``N * K`` 条路径。" msgid "" "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``" -msgstr "从``start_vid``到 ``end_vid``的第一个路径的值为 **1**" +msgstr "从 ``start_vid``到 ``end_vid`` 的第一个路径的值为 **1**" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``" -msgstr "从``start_vid`` 到 ``end_vid``路径中节点的标识符" +msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符" msgid ":math:`0` for the last ``node`` of the path." msgstr ":math:`0` 为路径的最后一个 ``node``。" @@ -8099,7 +8099,7 @@ msgstr "" "可以与:doc:`costMatrix-category` 函数一起使用，最好使用 `directed => false`。" msgid "With ``directed => false``" -msgstr "使用``directed => false``" +msgstr "使用 ``directed => false``" msgid "Will generate a graph that:" msgstr "将生成一个图：" @@ -8114,7 +8114,7 @@ msgid "all traveling costs on edges obey the triangle inequality." msgstr "所有边上的旅行成本都遵循三角不等式。" msgid "When ``start_vid = 0 OR end_vid = 0``" -msgstr "当``start_vid = 0 OR end_vid = 0``" +msgstr "当 ``start_vid = 0 OR end_vid = 0``" msgid "" "The solutions generated is garanteed to be *twice as long as the optimal " @@ -8133,7 +8133,7 @@ msgstr "" "设置在固定位置。" msgid "With ``directed => true``" -msgstr "当``directed => true``" +msgstr "当 ``directed => true``" msgid "" "It is **not garanteed** that the solution will be, in the worse case, twice " @@ -8210,7 +8210,7 @@ msgid "Cost for going from start_vid to end_vid" msgstr "从 start_vid 到 end_vid 的成本" msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" -msgstr "返回集合``(seq, node, cost, agg_cost)``" +msgstr "返回集合 ``(seq, node, cost, agg_cost)``" msgid "Row sequence." msgstr "行顺序。" @@ -8230,10 +8230,10 @@ msgid "``0`` for the last row in the tour sequence." msgstr "``0`` 表示游览序列中的最后一行。" msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "从``seq = 1``的 ``node``到当前节点的总成本。" +msgstr "从 ``seq = 1``的 ``node`` 到当前节点的总成本。" msgid "``0`` for the first row in the tour sequence." -msgstr "``0``表示游览序列中的第一行。" +msgstr "``0`` 表示游览序列中的第一行。" msgid "Start from vertex :math:`1`" msgstr "从顶点 :math:`1` 开始" @@ -8254,7 +8254,7 @@ msgstr "" "**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的``side`` 信息而被忽略" msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" -msgstr "**Line 6** 使用``directed => true``生成一个非对称矩阵" +msgstr "**Line 6** 使用 ``directed => true`` 生成一个非对称矩阵" msgid "" ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " @@ -8394,7 +8394,7 @@ msgid "" "obtained with ``pgr_TSPeuclidean``." msgstr "" "从视觉上看，第一幅图像是 `最优解 `__ ，第二幅图像是使用 ``pgr_TSPeuclidean``获得的解。" +"witour.html>`__ ，第二幅图像是使用 ``pgr_TSPeuclidean`` 获得的解。" msgid ":doc:`sampledata` network." msgstr ":doc:`sampledata` 网络。" @@ -8416,7 +8416,7 @@ msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." msgstr "``pgr_aStar`` (`一对多`_) 增加 ``end_vid`` 列." msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`多对一`_) 增加 ``start_vid``列." +msgstr "``pgr_aStar`` (`多对一`_) 增加 ``start_vid`` 列." msgid "Version 3.2.0" msgstr "版本3.2.0" @@ -8443,7 +8443,7 @@ msgid "``pgr_aStar`` (`Many to Many`_)" msgstr "``pgr_aStar`` (`多对多`_)" msgid "Signature change on ``pgr_astar`` (`One to One`_)" -msgstr "签名更改``pgr_astar`` (`一对一`_)" +msgstr "签名更改 ``pgr_astar`` (`一对一`_)" msgid "**Official** ``pgr_aStar`` (`One to One`_)" msgstr "**官方** ``pgr_aStar`` (`一对一`_)" @@ -8690,7 +8690,7 @@ msgstr "" "radius < spoon\\_radius`" msgid "The ``alpha`` parameter is the **spoon radius**" -msgstr "``alpha``参数是 **spoon radius**" +msgstr "``alpha`` 参数是 **spoon radius**" msgid "" "When the total number of points is less than 3, returns an EMPTY geometry" @@ -8750,10 +8750,10 @@ msgid "The function returns:" msgstr "函数返回：" msgid "``OK`` after the analysis has finished." -msgstr "``OK``分析完成后。" +msgstr "``OK`` 分析完成后。" msgid "``FAIL`` when the analysis was not completed due to an error." -msgstr "``FAIL``当分析因错误而未完成时。" +msgstr "``FAIL`` 当分析因错误而未完成时。" msgid "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" msgstr "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" @@ -8797,7 +8797,7 @@ msgstr "tolerance" msgid "" "``float8`` Snapping tolerance of disconnected edges. (in projection unit)" -msgstr "``float8``断开边的捕捉容差。 （以投影单位表示）" +msgstr "``float8`` 断开边的捕捉容差。 （以投影单位表示）" msgid "the_geom" msgstr "the_geom" @@ -8837,17 +8837,17 @@ msgstr "rows_where" msgid "" "``text`` Condition to select a subset or rows. Default value is ``true`` to " "indicate all rows." -msgstr "``text`` 用于选择子集或行的条件。默认值为``true``，表示选择所有行。" +msgstr "``text`` 用于选择子集或行的条件。默认值为``true`` ，表示选择所有行。" msgid "Uses the vertices table: _vertices_pgr." msgstr "使用这个顶点表：_vertices_pgr。" msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." -msgstr "完全填充顶点表的``cnt`` 和``chk`` 列。" +msgstr "完全填充顶点表的 ``cnt`` 和``chk`` 列。" msgid "" "Returns the analysis of the section of the network defined by ``rows_where``" -msgstr "返回由``rows_where`` 定义的网络部分的分析结果" +msgstr "返回由 ``rows_where`` 定义的网络部分的分析结果" msgid "The vertices table is not found." msgstr "未找到顶点表。" @@ -8880,20 +8880,20 @@ msgid "The structure of the vertices table is:" msgstr "顶点表的结构为：" msgid "``bigint`` Identifier of the vertex." -msgstr "``bigint``顶点的标识符。" +msgstr "``bigint`` 顶点的标识符。" msgid "cnt" msgstr "cnt" msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex." -msgstr "``integer``edge_table 中引用该顶点的顶点数。" +msgstr "``integer`` edge_table 中引用该顶点的顶点数。" msgid "chk" msgstr "chk" msgid "``integer`` Indicator that the vertex might have a problem." -msgstr "``integer``指示顶点可能有问题。" +msgstr "``integer`` 指示顶点可能有问题。" msgid "ein" msgstr "ein" @@ -8902,7 +8902,7 @@ msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "as incoming. See :doc:`pgr_analyzeOneWay `." msgstr "" -"``integer``edge_table 中引用该顶点作为传入的顶点数。 请参阅 :doc:" +"``integer`` edge_table 中引用该顶点作为传入的顶点数。 请参阅 :doc:" "`pgr_analyzeOneWay `。" msgid "eout" @@ -8912,11 +8912,11 @@ msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "as outgoing. See :doc:`pgr_analyzeOneWay `." msgstr "" -"``integer``Edge_table 中引用该顶点作为传出的顶点数。 请参阅 :doc:" +"``integer`` Edge_table 中引用该顶点作为传出的顶点数。 请参阅 :doc:" "`pgr_analyzeOneWay `。" msgid "``geometry`` Point geometry of the vertex." -msgstr "``geometry``顶点的点几何。" +msgstr "``geometry`` 顶点的点几何。" msgid "Usage when the edge table's columns MATCH the default values:" msgstr "当边表的列与默认值匹配时的用法：" @@ -8966,12 +8966,12 @@ msgstr "根据 id 选择行。 显示网络部分的分析。" msgid "" "Selecting the rows where the geometry is near the geometry of row with " "``id`` = 5" -msgstr "选择几何形状接近``id``= 5 的几何形状的行" +msgstr "选择几何形状接近 ``id`` = 5 的几何形状的行" msgid "" "Selecting the rows where the geometry is near the geometry of the row with " "``gid`` =100 of the table ``othertable``." -msgstr "选择几何形状接近表``othertable`` 的``gid`` = 100 的行的几何形状的行。" +msgstr "选择几何形状接近表 ``othertable`` 的``gid`` = 100 的行的几何形状的行。" msgid "Usage when the edge table's columns DO NOT MATCH the default values:" msgstr "当边表的列与默认值不匹配时的用法：" @@ -9007,13 +9007,13 @@ msgstr "根据 id 选择行。" msgid "" "Selecting the rows WHERE the geometry is near the geometry of row with " "``id`` =5 ." -msgstr "选择那些几何与具有``id`` = 5的行的几何接近的行。" +msgstr "选择那些几何与具有 ``id`` = 5的行的几何接近的行。" msgid "" "Selecting the rows WHERE the geometry is near the place='myhouse' of the " "table ``othertable``. (note the use of quote_literal)" msgstr "" -"选择几何图形靠近表``othertable``的 place='myhouse' 的行。 （注意 " +"选择几何图形靠近表 ``othertable`` 的 place='myhouse' 的行。 （注意 " "quote_literal 的使用）" msgid "The examples use the :doc:`sampledata` network." @@ -9167,25 +9167,25 @@ msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex. " "See :doc:`pgr_analyzeGgraph `." msgstr "" -"``integer``edge_table 中引用该顶点的顶点数。 请参阅 :doc:`pgr_analyzeGgraph " +"``integer`` edge_table 中引用该顶点的顶点数。 请参阅 :doc:`pgr_analyzeGgraph " "`。" msgid "" "``integer`` Indicator that the vertex might have a problem. See :doc:" "`pgr_analyzeGraph `." msgstr "" -"``integer``指示顶点可能有问题。 请参阅 :doc:`pgr_analyzeGraph " +"``integer`` 指示顶点可能有问题。 请参阅 :doc:`pgr_analyzeGraph " "`。" msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "as incoming." -msgstr "``integer``edge_table 中引用该顶点作为传入的顶点数。" +msgstr "``integer`` edge_table 中引用该顶点作为传入的顶点数。" msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "as outgoing." -msgstr "``integer``Edge_table 中引用该顶点作为传出的顶点数。" +msgstr "``integer`` Edge_table 中引用该顶点作为传出的顶点数。" msgid ":doc:`pgr_analyzeGraph`" msgstr ":doc:`pgr_analyzeGraph`" @@ -9220,7 +9220,7 @@ msgid "Works for **undirected** graphs." msgstr "适用于 **无向** 图。" msgid "``node`` ascending" -msgstr "``node``升序" +msgstr "``node`` 升序" msgid "Running time: :math:`O(V + E)`" msgstr "运行时间：:math:`O(V + E)`" @@ -9259,13 +9259,13 @@ msgstr "``pgr_bdAstar`` — 使用双向 A* 算法的最短路径。" msgid "" "``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_bdAstar`` (`一对一`_) 增加``start_vid`` 和 ``end_vid``列。" +msgstr "``pgr_bdAstar`` (`一对一`_) 增加``start_vid`` 和 ``end_vid`` 列。" msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." msgstr "``pgr_bdAstar`` (`一对多`_) 增加``end_vid`` 列。" msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_bdAstar`` (`多对一`_) 增加``start_vid``列。" +msgstr "``pgr_bdAstar`` (`多对一`_) 增加``start_vid`` 列。" msgid "``pgr_bdAstar`` (`Combinations`_)" msgstr "``pgr_bdAstar`` (`组合`_)" @@ -9280,7 +9280,7 @@ msgid "``pgr_bdAstar`` (`Many to Many`_)" msgstr "``pgr_bdAstar`` (`多对多`_)" msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" -msgstr "在``pgr_bdAstar`` (`一对一`_)上的签名更改" +msgstr "在 ``pgr_bdAstar`` (`一对一`_)上的签名更改" msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" msgstr "**官方** ``pgr_bdAstar`` (`一对一`_)" @@ -9321,7 +9321,7 @@ msgstr "``pgr_bdAstarCost`` (`组合`_)" msgid "" "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " "using the bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost``函数使用双向 A* 算法汇总最短路径的成本。" +msgstr "``pgr_bdAstarCost`` 函数使用双向 A* 算法汇总最短路径的成本。" msgid "" "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -9496,8 +9496,8 @@ msgstr "" "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -9565,7 +9565,7 @@ msgid "" msgstr "" "Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和" "1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点" -"（``start_vid``）到终点顶点（``end_vid``）的最短路径，其中一些边的权重可以为" +"（ ``start_vid``）到终点顶点（``end_vid`` ）的最短路径，其中一些边的权重可以为" "负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" msgid "" @@ -9681,7 +9681,7 @@ msgid "This implementation work for both directed and undirected graphs." msgstr "该实现适用于 **有向** 图和 **无向** 图。" #, fuzzy -msgid "Running time: :math:`\\Theta(VE)`" +msgid "Running time: :math:`\\Theta(VE)`" msgstr "运行时间：:math:`O(V + E)`" #, fuzzy @@ -9698,7 +9698,7 @@ msgstr "pgr_lineGraph(`Edges SQL`_, [``directed``])" #, fuzzy msgid "Returns set of ``(vid, centrality)``" -msgstr "返回集合``(edge, cost)``" +msgstr "返回集合 ``(edge, cost)``" #, fuzzy msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." @@ -9761,7 +9761,7 @@ msgid "Result columns change:" msgstr "结果列发生变化：" msgid "``n_seq`` is removed" -msgstr "``n_seq``被删除" +msgstr "``n_seq`` 被删除" msgid "``seq`` changed type to ``BIGINT``" msgstr "``seq`` 将类型更改为``BIGINT``" @@ -9785,7 +9785,7 @@ msgid "``component`` ascending." msgstr "``component`` 升序。" msgid "``edge`` ascending." -msgstr "``edge``升序。" +msgstr "``edge`` 升序。" msgid "pgr_biconnectedComponents(`Edges SQL`_)" msgstr "pgr_biconnectedComponents(`Edges SQL`_)" @@ -9806,7 +9806,7 @@ msgid "Has the value of the minimum edge identifier in the component." msgstr "具有组件中最小边标识符的值。" msgid "Identifier of the edge that belongs to the ``component``." -msgstr "属于该``分量``的边的标识符。" +msgstr "属于该 ``分量`` 的边的标识符。" msgid "" "Boost: `Biconnected components _vertices_pgr." msgstr "创建一个顶点表：_vertices_pgr。" msgid "Fills ``id`` and ``the_geom`` columns of the vertices table." -msgstr "填充顶点表的``id`` 和 ``the_geom`` 列。" +msgstr "填充顶点表的 ``id`` 和 ``the_geom`` 列。" msgid "" -"Fills the source and target columns of the edge table referencing the ``id`` " +"Fills the source and target columns of the edge table referencing the ``id``" "of the vertices table." -msgstr "引用顶点表的``id``填充边表的 source列和target列。" +msgstr "引用顶点表的 ``id`` 填充边表的 source列和target列。" msgid "``FAIL`` when the network topology was not built due to an error:" -msgstr "``FAIL``当由于错误原因未能构建网络拓扑时：" +msgstr "``FAIL`` 当由于错误原因未能构建网络拓扑时：" msgid "" "The vertices table is a requirement of the :doc:`pgr_analyzeGraph` and the :" @@ -10571,25 +10571,25 @@ msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex. " "See :doc:`pgr_analyzeGraph`." msgstr "" -"``integer``edge_table 中引用该顶点的顶点数。 参见:doc:`pgr_analyzeGraph`。" +"``integer`` edge_table 中引用该顶点的顶点数。 参见:doc:`pgr_analyzeGraph`。" msgid "" "``integer`` Indicator that the vertex might have a problem. See :doc:" "`pgr_analyzeGraph`." -msgstr "``integer``指示顶点可能有问题。 请参阅 :doc:`pgr_analyzeGraph`。" +msgstr "``integer`` 指示顶点可能有问题。 请参阅 :doc:`pgr_analyzeGraph`。" msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "AS incoming. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer``边表中引用此顶点作为入边的顶点数量。请参考 :doc:" +"``integer`` 边表中引用此顶点作为入边的顶点数量。请参考 :doc:" "`pgr_analyzeOneWay`。" msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "AS outgoing. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer``边表中引用此顶点作为出边的顶点数量。请参考 :doc:" +"``integer`` 边表中引用此顶点作为出边的顶点数量。请参考 :doc:" "`pgr_analyzeOneWay`。" msgid "The simplest way to use pgr_createTopology is:" @@ -10607,8 +10607,8 @@ msgid "" "passed to the function as the geometry column, and the geometry column " "``the_geom`` is passed to the function as the id column." msgstr "" -"当参数未按适当顺序给出时会导致错误：在此示例中，表 ``ege_table`` 的列``id`` " -"被错误地传递给函数作为几何列，而几何列 ``the_geom``被错误地传递给函数作为 id " +"当参数未按适当顺序给出时会导致错误：在此示例中，表 ``ege_table`` 的列``id``" +"被错误地传递给函数作为几何列，而几何列 ``the_geom`` 被错误地传递给函数作为 id " "列。" msgid "" @@ -10636,7 +10636,7 @@ msgid "" "passed to the function AS the geometry column, and the geometry column " "``mygeom`` is passed to the function AS the id column." msgstr "" -"当参数未按适当的顺序给出时，会导致错误。在这个示例中，表``mytable``的列 " +"当参数未按适当的顺序给出时，会导致错误。在这个示例中，表 ``mytable`` 的列 " "``gid`` 被错误地传递给函数作为几何列，而几何列``mygeom`` 被错误地传递给函数作" "为 id 列。" @@ -10689,10 +10689,10 @@ msgid "Create the routing topology on the edge table" msgstr "在边表上创建路由拓扑" msgid "Updating the ``source`` information" -msgstr "更新``source``信息" +msgstr "更新 ``source`` 信息" msgid "Updating the ``target`` information" -msgstr "更新``target``信息" +msgstr "更新 ``target`` 信息" msgid "Inspect the routing topology" msgstr "检查路由拓扑" @@ -10720,10 +10720,10 @@ msgid "" msgstr "``pgr_createVerticesTable`` — 根据 source和target信息重建顶点表。" msgid "``OK`` after the vertices table has been reconstructed." -msgstr "``OK``重建顶点表后。" +msgstr "``OK`` 重建顶点表后。" msgid "``FAIL`` when the vertices table was not reconstructed due to an error." -msgstr "``FAIL``当由于错误而未重建顶点表时。" +msgstr "``FAIL`` 当由于错误而未重建顶点表时。" msgid "" "pgr_createVerticesTable(edge_table, [``the_geom, source, target, " @@ -10746,8 +10746,8 @@ msgid "" "Fills ``id`` and ``the_geom`` columns of the vertices table based on the " "source and target columns of the edge table." msgstr "" -"根据边表的源点（source）和目标点（target）列，填充顶点表的``id``和" -"``the_geom``列。" +"根据边表的源点（source）和目标点（target）列，填充顶点表的 ``id`` 和" +"``the_geom`` 列。" msgid "The names of source, target are the same." msgstr "source, target的名称相同。" @@ -10756,14 +10756,14 @@ msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "as incoming. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer``edge_table 中引用该顶点作为传入的顶点数。 请参阅 :doc:" +"``integer`` edge_table 中引用该顶点作为传入的顶点数。 请参阅 :doc:" "`pgr_analyzeOneWay`。" msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " "as outgoing. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer``Edge_table 中引用该顶点作为传出的顶点数。 请参阅 :doc:" +"``integer`` Edge_table 中引用该顶点作为传出的顶点数。 请参阅 :doc:" "`pgr_analyzeOneWay`。" msgid "The simplest way to use pgr_createVerticesTable" @@ -10775,8 +10775,8 @@ msgid "" "``mytable`` is passed to the function as the geometry column, and the " "geometry column ``the_geom`` is passed to the function as the source column." msgstr "" -"当参数没有按照适当的顺序提供时，将会发生错误：在这个例子中，表``mytable``的源" -"列``source``被错误地传递给函数作为几何列，而几何列``the_geom``被错误地传递给" +"当参数没有按照适当的顺序提供时，将会发生错误：在这个例子中，表 ``mytable`` 的源" +"列 ``source``被错误地传递给函数作为几何列，而几何列``the_geom`` 被错误地传递给" "函数作为源列。" msgid "Example 4" @@ -10797,7 +10797,7 @@ msgstr "示例 7" msgid "" "Selecting the rows where the geometry is near the geometry of row with " "``id`` =5 ." -msgstr "选择几何与具有``id``=5的行的几何接近的行。" +msgstr "选择几何与具有 ``id`` =5的行的几何接近的行。" msgid "Example 8" msgstr "示例 8" @@ -10815,7 +10815,7 @@ msgid "" "``mygeom`` is passed to the function as the source column." msgstr "" "当参数没有按照适当的顺序提供时，会发生错误。在这个例子中，表 ``mytable`` 的" -"``src``列被错误地传递给函数作为几何列，而几何列``mygeom``被错误地传递给函数作" +"``src``列被错误地传递给函数作为几何列，而几何列``mygeom`` 被错误地传递给函数作" "为源列。" msgid "Example 10" @@ -10842,7 +10842,7 @@ msgstr "示例 14" msgid "" "Selecting the rows where the geometry is near the geometry of row with " "``gid`` = 5." -msgstr "选择几何与具有``gid``=5的行的几何接近的行。" +msgstr "选择几何与具有 ``gid`` =5的行的几何接近的行。" msgid "Example 15" msgstr "示例 15" @@ -10972,7 +10972,7 @@ msgid "" "ending vertex (``end_vid``)." msgstr "" "有向无环图（DAG）的最短路径是一种图搜索算法，用于解决加权有向无环图的最短路径" -"问题，找到从起始顶点（``start_vid``）到结束顶点（``end_vid``）的最短路径。" +"问题，找到从起始顶点（ ``start_vid``）到结束顶点（``end_vid`` ）的最短路径。" msgid "" "This implementation can only be used with a **directed** graph with no " @@ -11093,10 +11093,10 @@ msgstr "``BIGINT[]``" msgid "" "Array of identifiers of the edges that have the vertex ``id`` as *first end " "point*." -msgstr "以顶点``id``作为*第一个端点*的边的标识符数组。" +msgstr "以顶点 ``id`` 作为*第一个端点*的边的标识符数组。" msgid "When missing, ``out_edges`` must exist." -msgstr "当缺失时，``out_edges``必须存在。" +msgstr "当缺失时， ``out_edges`` 必须存在。" msgid "``out_edges``" msgstr "``out_edges``" @@ -11104,10 +11104,10 @@ msgstr "``out_edges``" msgid "" "Array of identifiers of the edges that have the vertex ``id`` as *second end " "point*." -msgstr "以顶点``id``作为*第二个端点*的边的标识符数组。" +msgstr "以顶点 ``id`` 作为*第二个端点*的边的标识符数组。" msgid "When missing, ``in_edges`` must exist." -msgstr "缺失时，``in_edges`` 必须存在。" +msgstr "缺失时， ``in_edges`` 必须存在。" msgid "Vertex identifier" msgstr "顶点标识符" @@ -11142,7 +11142,7 @@ msgid "" "want the degree of the whole graph rather than a subset, you can forgo using " "pgr_degree and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" -"如果您已经使用 ``pgr_extractVertices``构建了一个顶点表，并且想要整个图的度而" +"如果您已经使用 ``pgr_extractVertices`` 构建了一个顶点表，并且想要整个图的度而" "不是子集，则可以放弃使用 pgr_ Degree 并直接使用 ``in_edges`` 和 ``out_edges``" "列。" @@ -11224,7 +11224,7 @@ msgid "**options:** ``[directed, max_depth]``" msgstr "**options:** ``[directed, max_depth]``" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." -msgstr "与 `单顶点`_相同，但边按``id``降序排列。" +msgstr "与 `单顶点`_相同，但边按 ``id`` 降序排列。" msgid "" "`Boost: Depth First Search algorithm documentation true``" -msgstr "默认：``partial => true``" +msgstr "默认： ``partial => true``" msgid "With less calculations as possible." msgstr "尽可能减少计算。" @@ -12558,7 +12558,7 @@ msgid "Returns" msgstr "返回" msgid "values on ``edge_id``, ``fraction``, ``side`` columns." -msgstr "``edge_id``, ``fraction``, ``side``列的值。" +msgstr "``edge_id``, ``fraction``, ``side`` 列的值。" msgid "``NULL`` on ``distance``, ``geom``, ``edge`` columns." msgstr "``distance``, ``geom``, ``edge``列上为``NULL``。" @@ -12614,10 +12614,10 @@ msgstr "``partial``" msgid "" "When ``true`` only columns needed for :doc:`withPoints-category` are " "calculated." -msgstr "当为 ``true``时，只计算 :doc:`withPoints-category` 需要的列。" +msgstr "当为 ``true`` 时，只计算 :doc:`withPoints-category` 需要的列。" msgid "When ``false`` all columns are calculated" -msgstr "当为``false``时，所有的列都计算" +msgstr "当为 ``false`` 时，所有的列都计算" msgid "When ``false`` calculations are performed." msgstr "当为 ``false`` 时，执行计算。" @@ -12626,11 +12626,11 @@ msgid "" "When ``true`` calculations are not performed and the query to do the " "calculations is exposed in a PostgreSQL ``NOTICE``." msgstr "" -"当为``true`` 时，不执行计算，并在 PostgreSQL 的 ``NOTICE``中显示执行计算的查" +"当为 ``true`` 时，不执行计算，并在 PostgreSQL 的 ``NOTICE`` 中显示执行计算的查" "询。" msgid "The ``LINESTRING`` geometry of the edge." -msgstr "边的 ``LINESTRING``几何。" +msgstr "边的 ``LINESTRING`` 几何。" msgid "When :math:`cap = 1`, it is the closest edge." msgstr "当 :math:`cap = 1` 时，它是最近的边。" @@ -12641,7 +12641,7 @@ msgid "" msgstr "在 <0,1> 范围内的值，表示相对于边的第一个端点的相对位置。" msgid "Value in ``[r, l]`` indicating if the point is:" -msgstr "``[r, l]``中的值指示该点是否为：" +msgstr "``[r, l]`` 中的值指示该点是否为：" msgid "In the right ``r``." msgstr "在右边的 ``r``。" @@ -12659,10 +12659,10 @@ msgid "Distance from point to edge." msgstr "点到边缘的距离。" msgid "``NULL`` when ``cap = 1`` on the `One point`_ signature" -msgstr "``NULL``当在 `一个点`_签名，``cap = 1``时" +msgstr "``NULL``当在 `一个点`_签名，``cap = 1`` 时" msgid "``POINT`` geometry" -msgstr "``POINT``几何" +msgstr "``POINT`` 几何" msgid "" "`One Point`_: Contains the point on the edge that is ``fraction`` away from " @@ -12686,7 +12686,7 @@ msgstr "绿色节点是 **原始点**" msgid "" "The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." -msgstr "几何``geom`` 是 :math:`sp \\rightarrow ep` 边上的一个点。" +msgstr "几何 ``geom`` 是 :math:`sp \\rightarrow ep` 边上的一个点。" msgid "" "The geometry ``edge`` is a line that connects the **original point** with " @@ -12728,7 +12728,7 @@ msgid "Understanding the result" msgstr "了解结果" msgid "``NULL`` on ``geom``, ``edge``" -msgstr "``NULL`` 在 ``geom``, ``edge``上" +msgstr "``NULL`` 在 ``geom``, ``edge`` 上" msgid "``edge_id`` identifier of the edge close to the **original point**" msgstr "``edge_id`` 靠近 **原始点** 的边的标识符" @@ -12742,41 +12742,41 @@ msgid "For edge :math:`5`:" msgstr "对于边 :math:`5`:" msgid "" -"``fraction``: The closest point from the **original point** is at the :math:" +"``fraction`` : The closest point from the **original point** is at the :math:" "`0.8` fraction of the edge :math:`5`." msgstr "" -"``fraction``：离 **原始点** 最近的点位于边 :math:`5` 处的 :math:`0.8` 分数位" +"``fraction`` ：离 **原始点** 最近的点位于边 :math:`5` 处的 :math:`0.8` 分数位" "置。" msgid "" -"``side``: The **original point** is located to the left side of edge :math:" +"``side`` : The **original point** is located to the left side of edge :math:" "`5`." -msgstr "``side``： **原始点** 位于边 :math:`5` 的左侧。" +msgstr "``side`` ： **原始点** 位于边 :math:`5` 的左侧。" msgid "" -"``distance``: The **original point** is located :math:`0.1` length units " +"``distance`` : The **original point** is located :math:`0.1` length units " "from edge :math:`5`." -msgstr "``distance``： **原始点** 位于边 :math:`5` 的 :math:`0.1` 长度单位处。" +msgstr "``distance`` ： **原始点** 位于边 :math:`5` 的 :math:`0.1` 长度单位处。" msgid "For edge :math:`8`:" msgstr "对于边 :math:`8`：" msgid "" -"``fraction``: The closest point from the **original point** is at the :math:" +"``fraction`` : The closest point from the **original point** is at the :math:" "`0.89..` fraction of the edge :math:`8`." msgstr "" -"``fraction``：离 **原始点** 最近的点位于边 :math:`8` 的 :math:`0.89..` 分数位" +"``fraction`` ：离 **原始点** 最近的点位于边 :math:`8` 的 :math:`0.89..` 分数位" "置。" msgid "" -"``side``: The **original point** is located to the right side of edge :math:" +"``side`` : The **original point** is located to the right side of edge :math:" "`8`." -msgstr "``side``： **原始点** 位于边 :math:`8` 的右侧。" +msgstr "``side`` ： **原始点** 位于边 :math:`8` 的右侧。" msgid "" -"``distance``: The **original point** is located :math:`0.19..` length units " +"``distance`` : The **original point** is located :math:`0.19..` length units " "from edge :math:`8`." -msgstr "``distance``： **原始点** 距离边 :math:`8` 有 :math:`0.19..` 长度单位。" +msgstr "``distance`` ： **原始点** 距离边 :math:`8` 有 :math:`0.19..` 长度单位。" msgid "One answer, all columns" msgstr "一个答案，所有列" @@ -12799,9 +12799,9 @@ msgstr "" "的一条。" msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`5` from " +"``geom`` : Contains the geometry of the closest point on edge :math:`5` from " "the **original point**." -msgstr "``geom``:包含了从 **原始点** 到边 :math:`5` 上最近点的几何形状。" +msgstr "``geom`` :包含了从 **原始点** 到边 :math:`5` 上最近点的几何形状。" msgid "" "``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " @@ -12817,9 +12817,9 @@ msgid "Understanding the result:" msgstr "了解结果：" msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`8` from " +"``geom`` : Contains the geometry of the closest point on edge :math:`8` from " "the **original point**." -msgstr "``geom``：包含了从 **原始点** 到边 :math:`8` 上最近点的几何形状。" +msgstr "``geom`` ：包含了从 **原始点** 到边 :math:`8` 上最近点的几何形状。" msgid "" "``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " @@ -12871,7 +12871,7 @@ msgstr "``edge``为``NULL``" msgid "" "``edge_id`` identifier of the edge close to a **original point** (``geom``)" -msgstr "``edge_id``是与一个 **原始点** （``geom``）靠近的边的标识符" +msgstr "``edge_id``是与一个 **原始点** （``geom`` ）靠近的边的标识符" msgid "" "Two edges at most withing :math:`0.5` distance units from each of the " @@ -12892,7 +12892,7 @@ msgid "" "Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the shortest " "distance to ``POINT(2.9 1.8)``." msgstr "" -"边 :math:`5` 在:math:`8` 之前，因此边 :math:`5` 到``POINT(2.9 1.8)``的距离最" +"边 :math:`5` 在:math:`8` 之前，因此边 :math:`5` 到 ``POINT(2.9 1.8)`` 的距离最" "短。" msgid "One answer per point, all columns" @@ -12944,7 +12944,7 @@ msgstr "" msgid "" "The information needed in the points of interest is ``pid``, ``edge_id``, " "``side``, ``fraction``." -msgstr "兴趣点所需的信息包括``pid``, ``edge_id``, ``side``, ``fraction``。" +msgstr "兴趣点所需的信息包括 ``pid``, ``edge_id``, ``side``, ``fraction``。" msgid "" "On this documentation there will be some 6 fixed points of interest and they " @@ -13150,7 +13150,7 @@ msgid "Circuits present in the pgRouting :doc:`sampledata`" msgstr "pgRouting :doc:`sampledata` 中存在的电路" msgid "Id of the circuit starting from ``1``" -msgstr "电路id从``1``开始" +msgstr "电路id从 ``1`` 开始" msgid "Relative postion in the path. Has value ``0`` for beginning of the path" msgstr "路径中的相对位置。 路径开头的值为 ``0``" @@ -13427,7 +13427,7 @@ msgid "**root vertex**" msgstr "**root vertex**" msgid "Returns set of ``(seq, vertex_id, idom)``" -msgstr "返回集合``(seq, vertex_id, idom)``" +msgstr "返回集合 ``(seq, vertex_id, idom)``" msgid "Identifier of vertex ." msgstr "顶点的标识符。" @@ -13483,7 +13483,7 @@ msgstr "" msgid "" "The ``cost`` and ``reverse_cost`` columns of the result represent existence " "of the edge." -msgstr "使用 ``cost``和 ``reverse_cost``列来表示边的存在。" +msgstr "使用 ``cost``和 ``reverse_cost`` 列来表示边的存在。" #, fuzzy msgid "When the graph is directed the result is directed." @@ -13631,7 +13631,7 @@ msgstr "" #, fuzzy msgid "" "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." -msgstr "使用 ``cost``和 ``reverse_cost``列来表示边的存在。" +msgstr "使用 ``cost``和 ``reverse_cost`` 列来表示边的存在。" #, fuzzy msgid "When positive: the edge exists." @@ -13646,13 +13646,13 @@ msgstr "" #, fuzzy msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "红色箭头对应边表中``cost`` > 0的情况。" +msgstr "红色箭头对应边表中 ``cost`` > 0的情况。" msgid "There are no double head arrows" msgstr "" msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " +"Two pair of edges share the same ending nodes and the ``reverse_cost``" "column is not used." msgstr "" @@ -13822,7 +13822,7 @@ msgstr "存储边结果" msgid "" "The first step is to store the results of the ``pgr_lineGraphFull`` call " "into a table" -msgstr "第一步是将 ``pgr_lineGraphFull``调用的结果存储到表中" +msgstr "第一步是将 ``pgr_lineGraphFull`` 调用的结果存储到表中" msgid "Create the mapping table" msgstr "创建映射表" @@ -13873,10 +13873,10 @@ msgid "" msgstr "运行 :doc:`pgr_dijkstraNear` 时，成本将会增加的地方是边 8，其成本为 0" msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " +"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1``" "from the previus query:" msgstr "" -"要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1``：" +"要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1`` ：" msgid "Adding a value to the restriction" msgstr "向限制添加值" @@ -14012,7 +14012,7 @@ msgid "``pgr_maxCardinalityMatch(text,boolean)``" msgstr "``pgr_maxCardinalityMatch(text,boolean)``" msgid "``directed => false`` when used." -msgstr "使用时``directed => false``。" +msgstr "使用时 ``directed => false``。" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "从 ``pgr_maximumCardinalityMatching`` 重命名" @@ -14280,9 +14280,9 @@ msgid "" "``edge_table_noded``. It uses the ``tolerance`` for deciding that multiple " "nodes within the tolerance are considered the same node." msgstr "" -"该函数读取``edge_table``表，该表具有主键列 ``id`` 和名为``the_geom``的几何" -"列，并将其中的所有段与所有其他段相交，然后创建表``edge_table_noded``。 它使用" -"``tolerance``来决定容差内的多个节点被视为同一节点。" +"该函数读取 ``edge_table``表，该表具有主键列 ``id`` 和名为``the_geom`` 的几何" +"列，并将其中的所有段与所有其他段相交，然后创建表 ``edge_table_noded``。 它使用" +"``tolerance`` 来决定容差内的多个节点被视为同一节点。" msgid "``float8`` tolerance for coincident points (in projection unit)dd" msgstr "``float8`` 重合点公差（以投影单位表示）dd" @@ -14294,7 +14294,7 @@ msgid "``text`` Suffix for the new table's. Default value is ``noded``." msgstr "``text``新表的后缀。 默认值是``noded``。" msgid "The output table will have for ``edge_table_noded``" -msgstr "输出表中将包含``edge_table_noded``内容" +msgstr "输出表中将包含 ``edge_table_noded`` 内容" msgid "``bigint`` Unique identifier for the table" msgstr "``bigint`` 表的唯一标识符" @@ -14304,29 +14304,29 @@ msgstr "old_id" #, fuzzy msgid "``bigint`` Identifier of the edge in original table" -msgstr "``bigint``原表中边的标识符" +msgstr "``bigint`` 原表中边的标识符" msgid "sub_id" msgstr "sub_id" msgid "``integer`` Segment number of the original edge" -msgstr "``integer``原边的段号" +msgstr "``integer`` 原边的段号" msgid "" "``integer`` Empty source column to be used with :doc:`pgr_createTopology` " "function" -msgstr "``integer``与 :doc:`pgr_createTopology` 函数一起使用的空source列" +msgstr "``integer`` 与 :doc:`pgr_createTopology` 函数一起使用的空source列" msgid "" "``integer`` Empty target column to be used with :doc:`pgr_createTopology` " "function" -msgstr "``integer``与 :doc:`pgr_createTopology` 函数一起使用的空target列" +msgstr "``integer`` 与 :doc:`pgr_createTopology` 函数一起使用的空target列" msgid "the geom" msgstr "the geom" msgid "``geometry`` Geometry column of the noded network" -msgstr "``geometry``节点网络的几何列" +msgstr "``geometry`` 节点网络的几何列" msgid "Examples" msgstr "示例" @@ -14955,7 +14955,7 @@ msgid "min cut of the main subgraph" msgstr "主子图的最小割" msgid "Returns set of ``(seq, edge, cost, mincut)``" -msgstr "返回集合``(seq, edge, cost, mincut)``" +msgstr "返回集合 ``(seq, edge, cost, mincut)``" msgid "Edges which divides the set of vertices into two." msgstr "将顶点集一分为二的边。" @@ -15277,7 +15277,7 @@ msgstr "``pgr_trspVia`` - 拟议" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." -msgstr "``pgr_trspVia``穿过有限制的顶点列表的路线。" +msgstr "``pgr_trspVia`` 穿过有限制的顶点列表的路线。" msgid "New proposed function:" msgstr "新提议的函数：" @@ -15335,7 +15335,7 @@ msgid "" "for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " "\\rightarrow 1` is restricted." msgstr "" -"检测哪些子路径通过了限制，本例中是针对``path_id = 5``从``6``到``3`` ，因为该" +"检测哪些子路径通过了限制，本例中是针对 ``path_id = 5``从``6`` 到 ``3`` ，因为该" "路径 :math:`15 \\rightarrow 1`受到限制。" msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." @@ -15348,7 +15348,7 @@ msgstr "" "从 :doc:`pgr_dijkstraVia` 提议的结果中，它删除了冲突路径，并使用 :doc:" "`pgr_trsp` 提议的算法的结果构建解决方案：" -msgid "Getting the same result as ``pgr_trspVia``:" +msgid "Getting the same result as ``pgr_trspVia`` :" msgstr "得到与 ``pgr_trspVia`` 相同的结果：" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." @@ -15459,7 +15459,7 @@ msgid "``r`` for right driving side" msgstr "``r`` 代表右驾驶侧" msgid "``l`` for left driving side" -msgstr "``l``表示左驾驶侧" +msgstr "``l`` 表示左驾驶侧" msgid "Any other value will be considered as ``r``" msgstr "任何其他值将被视为 ``r``" @@ -15468,17 +15468,17 @@ msgid "``details``" msgstr "``details``" msgid "When ``true`` the results will include the points that are in the path." -msgstr "如果为 ``true``，结果将包括路径中的点。" +msgstr "如果为 ``true`` ，结果将包括路径中的点。" msgid "" "When ``false`` the results will not include the points that are in the path." -msgstr "如果为``false``，结果将不包括路径中的点。" +msgstr "如果为 ``false`` ，结果将不包括路径中的点。" msgid "" "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " "the identifier is for a Point." msgstr "" -"当 ``start_vid``、 ``end_vid``和``node``列具有负值时，该标识符用于Point。" +"当 ``start_vid``、 ``end_vid``和``node`` 列具有负值时，该标识符用于Point。" msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "对动态点使用 ``pgr_findCloseEdges``" @@ -15529,7 +15529,7 @@ msgid "" "the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " "\\rightarrow 16` is restricted." msgstr "" -"检测哪些路径通过了限制，在本例中是针对从 ``-6``到``15`` 的 ``path_id = 1``，" +"检测哪些路径通过了限制，在本例中是针对从 ``-6`` 到 ``15`` 的 ``path_id = 1`` ，" "因为路径:math:`9 \\rightarrow 16`受到限制。" msgid "" @@ -15543,8 +15543,8 @@ msgstr "" "从 :doc:`pgr_withPointsVia` 的结果中移除冲突的路径，并使用 :doc:`pgr_trsp` 算" "法的结果构建解决方案：" -msgid "Getting the same result as ``pgr_trspVia_withPoints``:" -msgstr "得到与 ``pgr_trspVia_withPoints``相同的结果：" +msgid "Getting the same result as ``pgr_trspVia_withPoints`` :" +msgstr "得到与 ``pgr_trspVia_withPoints`` 相同的结果：" msgid "" "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " @@ -15575,7 +15575,7 @@ msgid "pgr_trsp_withPoints - Proposed" msgstr "pgr_trsp_withPoints - 拟议" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." -msgstr "``pgr_trsp_withPoints``有限制的路由顶点/点。" +msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" msgid "New proposed signatures:" msgstr "新拟议的签名：" @@ -15726,7 +15726,7 @@ msgstr "pgr_turnRestrictedPath - 实验性" msgid "" "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex -Vertex routing with " "restrictions" -msgstr "``pgr_turnRestrictedPath``使用 Yen 算法顶点- 带限制的顶点路由" +msgstr "``pgr_turnRestrictedPath`` 使用 Yen 算法顶点- 带限制的顶点路由" msgid "New experimental function" msgstr "新实验功能" @@ -15763,7 +15763,7 @@ msgid "" msgstr "当 ``true`` 停止在发现不违反限制的第一条路径上时" msgid "When ``false`` returns at most K paths" -msgstr "当 ``false``时返回最多 K 条路径" +msgstr "当 ``false`` 时返回最多 K 条路径" msgid "When ``true`` returns only paths that do not violate restrictions" msgstr "当 ``true`` 时仅返回不违反限制的路径" @@ -15948,10 +15948,10 @@ msgid "``r`` for right driving side." msgstr "``r`` 代表右驾驶侧。" msgid "``l`` for left driving side." -msgstr "``l``代表左驾驶侧。" +msgstr "``l`` 代表左驾驶侧。" msgid "``b`` for both." -msgstr "``b``对于两者。" +msgstr "``b`` 对于两者。" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges`。" @@ -16190,11 +16190,11 @@ msgid "" "Signature change: ``driving_side`` parameter changed from named optional to " "unnamed compulsory **driving side**." msgstr "" -"签名更改：``driving_side``参数从已命名的可选参数改为未命名的必选参数" +"签名更改： ``driving_side`` 参数从已命名的可选参数改为未命名的必选参数" "**driving side**。" msgid "``pgr_withPointsDD`` (`Single vertex`)" -msgstr "``pgr_withPointsDD``（`单顶点`）" +msgstr "``pgr_withPointsDD`` （`单顶点`）" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." msgstr "添加了 ``depth``、``pred`` 和 ``start_vid`` 列。" @@ -16202,7 +16202,7 @@ msgstr "添加了 ``depth``、``pred`` 和 ``start_vid`` 列。" msgid "Added ``depth``, ``pred`` columns." msgstr "添加了 ``depth``，``pred`` 列。" -msgid "When ``details`` is ``false``:" +msgid "When ``details`` is ``false`` :" msgstr "当 ``details`` 为``false`` 时：" msgid "" @@ -16767,13 +16767,13 @@ msgstr "" msgid "" "``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_aStar`` （`一对一`）增加了 ``start_vid``和 ``end_vid``列。" +msgstr "``pgr_aStar`` （`一对一`）增加了 ``start_vid``和 ``end_vid`` 列。" msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." msgstr "``pgr_aStar``（`一对多`）添加了 ``end_vid`` 列。" msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_aStar``（`多对一`）添加了 ``start_vid``列。" +msgstr "``pgr_aStar``（`多对一`）添加了 ``start_vid`` 列。" msgid "" "`#2523 `__ Standarize " @@ -16787,10 +16787,10 @@ msgid "" msgstr "``pgr_bdAstar``（`一对一`）增加了 ``start_vid`` 和``end_vid`` 列。" msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_bdAstar``（`一对多）添加了``end_vid``列。" +msgstr "``pgr_bdAstar``（`一对多）添加了``end_vid`` 列。" msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_bdAstar``（`多对一`）添加了``start_vid``列。" +msgstr "``pgr_bdAstar``（`多对一`）添加了``start_vid`` 列。" msgid "" "`#2547 `__ Standarize " @@ -16987,10 +16987,10 @@ msgstr "Dijkstra" msgid "" "``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_dijkstra``（`一对一`）增加了``start_vid`` 和``end_vid``列。" +msgstr "``pgr_dijkstra``（`一对一`）增加了``start_vid`` 和``end_vid`` 列。" msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_dijkstra``（`一对多`）添加了 ``end_vid``列。" +msgstr "``pgr_dijkstra``（`一对多`）添加了 ``end_vid`` 列。" msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." msgstr "``pgr_dijkstra`` （`多对一`）添加了 ``start_vid`` 列。" @@ -17098,22 +17098,22 @@ msgid "``pgr_trsp`` (One to One)" msgstr "``pgr_trsp`` （一对一）" msgid "``pgr_trsp`` (One to Many)" -msgstr "``pgr_trsp``（一对多）" +msgstr "``pgr_trsp`` （一对多）" msgid "``pgr_trsp`` (Many to One)" -msgstr "``pgr_trsp``（多对一）" +msgstr "``pgr_trsp`` （多对一）" msgid "``pgr_trsp`` (Many to Many)" -msgstr "``pgr_trsp``（多对多）" +msgstr "``pgr_trsp`` （多对多）" msgid "``pgr_trsp`` (Combinations)" -msgstr "``pgr_trsp``（组合）" +msgstr "``pgr_trsp`` （组合）" msgid "``pgr_trsp_withPoints``" msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "``pgr_trsp_withPoints``（一对一）" +msgstr "``pgr_trsp_withPoints`` （一对一）" msgid "``pgr_trsp_withPoints`` (One to Many)" msgstr "``pgr_trsp_withPoints`` （一对多）" @@ -17122,7 +17122,7 @@ msgid "``pgr_trsp_withPoints`` (Many to One)" msgstr "pgr_trsp_withPoints``（多对一）" msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "``pgr_trsp_withPoints``（多对多）" +msgstr "``pgr_trsp_withPoints`` （多对多）" msgid "``pgr_trsp_withPoints`` (Combinations)" msgstr "``pgr_trsp_withPoints`` （组合）" @@ -17134,10 +17134,10 @@ msgid "``pgr_degree``" msgstr "``pgr_degree``" msgid "``pgr_findCloseEdges`` (One point)" -msgstr "``pgr_findCloseEdges``（单点）" +msgstr "``pgr_findCloseEdges`` （单点）" msgid "``pgr_findCloseEdges`` (Many points)" -msgstr "``pgr_findCloseEdges``（多点）" +msgstr "``pgr_findCloseEdges`` （多点）" msgid "Ordering" msgstr "排序" @@ -17152,7 +17152,7 @@ msgid "``pgr_maxCardinalityMatch(text)``" msgstr "``pgr_maxCardinalityMatch(text)``" msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "弃用``pgr_maxCardinalityMatch(text,boolean)``" +msgstr "弃用 ``pgr_maxCardinalityMatch(text,boolean)``" msgid "Deprecated Functions" msgstr "已废弃的函数" @@ -19385,7 +19385,7 @@ msgid "" "which corresponds to the segment on the oposite direction of the geometry." msgstr "" "pgRouting文档的数据库设计将同一行中的两段保留在一个方向上，其中一个是与几何形" -"状相同方向的，另一个是与几何形状相反方向的。因此，一些信息具有 ``reverse_`` " +"状相同方向的，另一个是与几何形状相反方向的。因此，一些信息具有 ``reverse_``" "前缀，对应于几何形状相反方向的段。" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -19480,7 +19480,7 @@ msgstr "" msgid "" "In this case the because the ``CREATE`` statement was not used, the " "definition of an index on the table is needed." -msgstr "在本例中，由于未使用``CREATE``语句，因此需要在表上定义索引。" +msgstr "在本例中，由于未使用 ``CREATE`` 语句，因此需要在表上定义索引。" msgid "The structure of the table is:" msgstr "表的结构如下：" @@ -19503,7 +19503,7 @@ msgid "" "This queries based on the vertices data create a topology by filling the " "``source`` and ``target`` columns in the edges table." msgstr "" -"此查询基于顶点数据，通过填充边表中的``source``列和``target``列来创建拓扑。" +"此查询基于顶点数据，通过填充边表中的 ``source``列和``target`` 列来创建拓扑。" msgid "Topology data" msgstr "拓扑数据" @@ -19518,7 +19518,7 @@ msgid "" "Many functions can be used with a combinations of ``(source, target)`` pairs " "when wanting a route from ``source`` to ``target``." msgstr "" -"当需要从 ``source`` 到 ``target`` 的路由时，许多函数都可以与 ``(source, " +"当需要从 ``source`` 到 ``target`` 的路由时，许多函数都可以与 `` (source, " "target)`` 对组合使用。" msgid "" @@ -19536,10 +19536,10 @@ msgid "Some functions accept soft restrictions about the segments." msgstr "一些函数接受关于段的软约束。" msgid "Red arrows correspond when ``cost`` > 0 in the edge table." -msgstr "红色箭头对应边表中``cost`` > 0的情况。" +msgstr "红色箭头对应边表中 ``cost`` > 0的情况。" msgid "Blue arrows correspond when ``reverse_cost`` > 0 in the edge table." -msgstr "蓝色箭头对应边表中的``reverse_cost`` > 0 的情况。" +msgstr "蓝色箭头对应边表中的 ``reverse_cost`` > 0 的情况。" msgid "Points are outside the graph." msgstr "点位于图之外。" @@ -19949,15 +19949,15 @@ msgid "The graph is **directed**" msgstr "图是 **有向** 的" msgid "Red arrows show the ``(source, target)`` of the edge on the edge table" -msgstr "红色箭头显示边表上的边``(source, target)``" +msgstr "红色箭头显示边表上的边 ``(source, target)``" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" -msgstr "蓝色箭头显示边表上的边``(target, source)``" +msgstr "蓝色箭头显示边表上的边 ``(target, source)``" msgid "" "Each point location shows where it is located with relation of the edge " "``(source, target)``" -msgstr "每个点位置显示它与边 ``(source, target)``的关系" +msgstr "每个点位置显示它与边 ``(source, target)`` 的关系" msgid "On the right for points **2** and **4**." msgstr "在右侧为第 **2** 点和第 **4** 点。" @@ -20027,13 +20027,13 @@ msgid "On the :doc:`TRSP-family` this option is not valid" msgstr "在 :doc:`TRSP-family` 上，此选项无效" msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``" -msgstr "点 **1** 位于边``(5, 6)``和 ``(6, 5)``" +msgstr "点 **1** 位于边 ``(5, 6)``和 ``(6, 5)``" msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``" -msgstr "点 **2** 位于边``(17, 16)``和 ``16, 17``" +msgstr "点 **2** 位于边 ``(17, 16)``和 ``16, 17``" msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``" -msgstr "点 **4** 位于边``(3, 1)``和``(1, 3)``" +msgstr "点 **4** 位于边 ``(3, 1)``和``(1, 3)``" msgid "Creating temporary vertices" msgstr "创建临时顶点" @@ -20059,10 +20059,10 @@ msgid "Arrival to point ``-2`` can be achived only via vertex **16**." msgstr "只能通过顶点 **16** 才能到达点 ``-2``。" msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." -msgstr "不影响边``(17, 16)``，因此边被保留。" +msgstr "不影响边 ``(17, 16)`` ，因此边被保留。" msgid "It only affects the edge ``(16, 17)``, therefore the edge is removed." -msgstr "它只影响边``(16, 17)``，因此边被移除。" +msgstr "它只影响边 ``(16, 17)`` ，因此边被移除。" msgid "Create two new edges:" msgstr "创建两条新边：" @@ -20070,10 +20070,10 @@ msgstr "创建两条新边：" msgid "" "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " "0.4`)" -msgstr "边``(16, -2)``的成本为``0.4``（原始成本*分数==:math:`1 * 0.4`）" +msgstr "边 ``(16, -2)``的成本为``0.4`` （原始成本*分数==:math:`1 * 0.4`）" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" -msgstr "边``(-2, 17)``的成本为``0.6``（剩余成本）" +msgstr "边 ``(-2, 17)``的成本为``0.6`` （剩余成本）" msgid "The total cost of the additional edges is equal to the original cost." msgstr "附加边的总成本等于原始成本。" @@ -20086,18 +20086,18 @@ msgid "On a left hand side driving network" msgstr "在左侧驾驶网络上" msgid "Arrival to point ``-2`` can be achived only via vertex **17**." -msgstr "只能通过顶点 **17** 才能到达点 ``-2`` 。" +msgstr "只能通过顶点 **17** 才能到达点 ``-2``。" msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." -msgstr "不影响边 ``(16, 17)``，因此保留边。" +msgstr "不影响边 ``(16, 17)`` ，因此保留边。" msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." -msgstr "它只影响边 ``(17, 16)``，因此边被移除。" +msgstr "它只影响边 ``(17, 16)`` ，因此边被移除。" msgid "" "Work with the original edge ``(16, 17)`` as the fraction is a fraction of " "the original:" -msgstr "使用原始边``(16, 17)``，因为分数是原始边的分数：" +msgstr "使用原始边 ``(16, 17)`` ，因为分数是原始边的分数：" msgid "Flip the Edges and add them to the graph:" msgstr "翻转边并将它们添加到图中：" @@ -20105,23 +20105,23 @@ msgstr "翻转边并将它们添加到图中：" msgid "" "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " "graph." -msgstr "边 ``(17, -2)``变为 ``(-2, 16)``，成本为``0.4``，并添加到图中。" +msgstr "边 ``(17, -2)``变为 ``(-2, 16)``，成本为``0.4`` ，并添加到图中。" msgid "" "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " "graph." -msgstr "边 ``(-2, 16)`` 变为 ``(17, -2)``，成本为 ``0.6``，并添加到图中。" +msgstr "边 ``(-2, 16)`` 变为 ``(17, -2)``，成本为 ``0.6`` ，并添加到图中。" msgid "When driving side does not matter" msgstr "当驾驶侧无关紧要时" msgid "Arrival to point ``-2`` can be achived via vertices **16** or **17**." -msgstr "可以通过顶点 **16** 或 **17** 到达点 ``-2`` 。" +msgstr "可以通过顶点 **16** 或 **17** 到达点 ``-2``。" msgid "" "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " "removed." -msgstr "影响边 ``(16, 17)`` 和 ``(17, 16)``，因此边被移除。" +msgstr "影响边 ``(16, 17)`` 和 ``(17, 16)`` ，因此边被移除。" msgid "Create four new edges:" msgstr "创建四个新边：" @@ -20130,20 +20130,20 @@ msgid "Flip the Edges and add all the edges to the graph:" msgstr "翻转边并将所有边添加到图中：" msgid "Edge ``(16, -2)`` is added to the graph." -msgstr "边 ``(16, -2)``被添加到图中。" +msgstr "边 ``(16, -2)`` 被添加到图中。" msgid "Edge ``(-2, 17)`` is added to the graph." -msgstr "边``(-2, 17)``被添加到图中。" +msgstr "边 ``(-2, 17)`` 被添加到图中。" msgid "" "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " "graph." -msgstr "边 ``(16, -2)``变为 ``(-2, 16)``，成本为 0.4，并添加到图中。" +msgstr "边 ``(16, -2)``变为 ``(-2, 16)`` ，成本为 0.4，并添加到图中。" msgid "" "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " "graph." -msgstr "边``(-2, 17)``变为``(17, -2)``，成本为``0.6``，并添加到图中。" +msgstr "边 ``(-2, 17)``变为``(17, -2)``，成本为``0.6`` ，并添加到图中。" msgid "withPoints - Family of functions" msgstr "withPoints - 函数族"