From 6fbc7334acd76c47bd84fb611bc551cdbc0a0384 Mon Sep 17 00:00:00 2001 From: cvvergara Date: Mon, 23 Sep 2024 21:06:14 -0600 Subject: [PATCH] Restoring some changes on original message --- .../LC_MESSAGES/pgrouting_doc_strings.po | 1202 ++++++++--------- 1 file changed, 600 insertions(+), 602 deletions(-) diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index c49cff316c..48a3c2b112 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,5 +1,5 @@ # SOME DESCRIPTIVE TITLE. -#Copyright (C) pgRouting Contributors - Version v3.7.0-dev +# Copyright (C) pgRouting Contributors - Version v3.7.0-dev # This file is distributed under the same license as the pgRouting package. # Regina Obe , 2023. # Wangdapeng , 2023. @@ -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`` 的旅行费用相同" @@ -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`" @@ -3105,7 +3105,7 @@ msgstr "操作：线性收缩" msgid "" "The linear contraction will stop when there are no more linear nodes. For " -"example from the following graph where :math:`v` and :math:`w` are `linear`_" +"example from the following graph where :math:`v` and :math:`w` are `linear`_ " "nodes:" msgstr "" "当不再有线性节点时，线性收缩将停止。 例如，在下图中，其中 :math:`v` 和 :math:`w`" @@ -3160,7 +3160,7 @@ msgstr "" msgid "" "This implementation, cycles ``max_cycles`` times through " -"``operations_order``." +"``operations_order`` ." msgstr "此实现通过 ``operations_order``循环 ``max_cycles`` 次。" msgid "Contracting sample data" @@ -3217,7 +3217,7 @@ 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`` 表添加额外的列，其中：" @@ -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 "" @@ -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 } " @@ -4406,7 +4406,7 @@ msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgid "" -"pgRouting extends the `PostGIS `__ /`PostgreSQL `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " "other network analysis functionality." msgstr "" @@ -4428,7 +4428,7 @@ msgid "" "`license` page." msgstr "" "pgRouting 手册根据`知识共享署名-相同方式共享3.0许可证 `_ 。 您可以随意使用本材料，但我们要求" +"creativecommons.org/licenses/by-sa/3.0/>`_。 您可以随意使用本材料，但我们要求" "您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://pgrouting.org 的链" "接。 有关 pgRouting 中使用的其他许可证，请参阅 :ref:`license` page.。" @@ -4616,8 +4616,7 @@ msgid "" "`#2635 `__ pgr_LineGraph " "ignores directed flag and use negative values for identifiers." msgstr "" -"`#2516 `__ 标准化输出" -"pgr_aStar." +"" msgid "``pgr_lineGraph``" msgstr "``pgr_lineGraph``" @@ -4725,7 +4724,7 @@ 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`` 列可能会丢失：" @@ -5093,7 +5092,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 " @@ -5297,7 +5296,7 @@ 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``" @@ -5482,13 +5481,13 @@ msgstr "在此迁移指南中使用了 ``new_restrictions``。" msgid "" "For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_ pgr_array_reverse`` needed for the migration." +"an array ``_pgr_array_reverse`` needed for the migration." msgstr "" "为了进行这次迁移，pgRouting 提供了一个用于反转数组的辅助函数 " "``_ pgr_array_reverse`` ，这在迁移过程中是必需的。" -msgid "``_ pgr_array_reverse`` :" -msgstr "``_ pgr_array_reverse`` :" +msgid "``_pgr_array_reverse``:" +msgstr "``_pgr_array_reverse``:" msgid "Was created temporally for this migration" msgstr "是为此迁移临时创建的" @@ -6236,7 +6235,7 @@ msgid "Have the identifiers columns indexed." msgstr "对标识符列建立索引。" msgid "" -"Please consult the `PostgreSQL `__" +"Please consult the `PostgreSQL `__ " "documentation and the `PostGIS `__ documentation." msgstr "" "请查阅`PostgreSQL `__ 文档和 `PostGIS " @@ -6303,7 +6302,7 @@ msgid "" "Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an " "example of using ``osm2pgrouting`` on the `workshop `__ ." +"pgrouting.org/latest/en/basic/data.html>`__." msgstr "" "来自 OSM 并使用 `osm2pgrouting `__ 作为导入工具的数据附带路由拓扑。 请参阅`workshop `__ ." +"the edges need to be `split `__." msgstr "" "对交叉点进行一一分析后，对于需要局部修复的交叉点，需要 `分割 `__ 边。" @@ -6574,7 +6573,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,12 +6712,12 @@ 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``)" msgid "" -"`Inner queries`_ : Are compulsory parameters that are ``TEXT`` strings " +"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " "containing SQL queries." msgstr "`Inner queries`_ ：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" @@ -6727,7 +6726,7 @@ msgid "" 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`` ：是非强制命名参数，省略时具有默认值。" @@ -6740,12 +6739,12 @@ msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "例如，对于这个 :doc:`pgr_dijkstra` 签名：" msgid "" -"pgr_dijkstra(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" "pgr_dijkstra(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" -msgid "`Edges SQL`_ :" -msgstr "`Edges SQL`_ :" +msgid "`Edges SQL`_:" +msgstr "`Edges SQL`_:" msgid "Is the first parameter." msgstr "是第一个参数。" @@ -6790,7 +6789,7 @@ msgid "It has a name." msgstr "它有一个名字。" msgid "" -"The full description of the parameters are found on the `Parameters`_" +"The full description of the parameters are found on the `Parameters`_ " "section of each function." msgstr "参数的完整描述可以在每个函数的 `Parameters`_ 部分找到。" @@ -6902,7 +6901,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``)的权重，" @@ -7666,9 +7665,9 @@ msgid "" "`PostgreSQL `__ geospatial database and adds " "routing and other network analysis functionality. A predecessor of pgRouting " "– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__ , was later extended by Orkney and renamed to pgRouting. The project " +"com>`__, was later extended by Orkney and renamed to pgRouting. The project " "is now supported and maintained by `Georepublic `__ , `Paragon Corporation `__ and " +"info>`__, `Paragon Corporation `__ and " "a broad user community." msgstr "" "pgRouting 是 `PostGIS `__ 和 `PostgreSQL `_." msgstr "" "一些 Boost 扩展可根据` Boost 软件许可证 - 版本 1.0 获得 `_ 。" +"org/LICENSE_1_0.txt>`_。" msgid "MIT-X License" msgstr "MIT-X License" @@ -7728,7 +7727,7 @@ msgid "" "Alike 3.0 License `_." msgstr "" "pgRouting 手册根据`知识共享署名-相同方式共享 3.0 许可证获得许可 `_ 。" +"creativecommons.org/licenses/by-sa/3.0/>`_。" msgid "" "In general license information should be included in the header of each " @@ -7934,27 +7933,27 @@ msgstr "签名" msgid "Summary" msgstr "总结" -msgid "pgr_KSP(`Edges SQL`_ , **start vid**, **end vid**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -"pgr_KSP(`Edges SQL`_ , **start vid**, **end vid**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgid "" -"pgr_KSP(`Edges SQL`_ , **start vid**, **end vids**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "" -"pgr_KSP(`Edges SQL`_ , **start vid**, **end vids**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgid "" -"pgr_KSP(`Edges SQL`_ , **start vids**, **end vid**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "" -"pgr_KSP(`Edges SQL`_ , **start vids**, **end vid**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgid "" -"pgr_KSP(`Edges SQL`_ , **start vids**, **end vids**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "" -"pgr_KSP(`Edges SQL`_ , **start vids**, **end vids**, **K**, [**options**])" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgid "pgr_KSP(`Edges SQL`_ , `Combinations SQL`_ , **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_ , `Combinations SQL`_ , **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" msgid "**options:** ``[directed, heap_paths]``" msgstr "**options:** ``[directed, heap_paths]``" @@ -8179,8 +8178,8 @@ msgstr "当数据不完整，但是是连通图时：" msgid "the missing values will be calculated with dijkstra algorithm." msgstr "缺失值将使用 dijkstra 算法计算。" -msgid "pgr_TSP(`Matrix SQL`_ , ``[start_id, end_id]``)" -msgstr "pgr_TSP(`Matrix SQL`_ , ``[start_id, end_id]``)" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" msgid "Returns set of |tsp-result|" msgstr "返回 |tsp-result| 的集合" @@ -8366,7 +8365,7 @@ msgid "" msgstr "" "此示例展示了如何使用Waterloo大学的 `示例数据 `__ （使用西撒哈拉 29 个城市的数据集 `__ ）进行性能测试" +"math.uwaterloo.ca/tsp/world/wi29.tsp>`__）进行性能测试" msgid "Creating a table for the data and storing the data" msgstr "创建数据表并存储数据" @@ -8453,20 +8452,20 @@ msgid "" "`One to One`_ `)` on the:" msgstr "结果相当于 `pgr_aStar(` `一对一`_ `)` 结果的并集：" -msgid "pgr_aStar(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "pgr_aStar(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "pgr_aStar(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "pgr_aStar(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "pgr_aStar(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" -msgstr "pgr_aStar(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgid "**options:** ``[directed, heuristic, factor, epsilon]``" msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" @@ -8563,30 +8562,30 @@ msgstr "`start_vid` 升序" msgid "`end_vid` ascending" msgstr "`end_vid` 升序" -msgid "pgr_aStarCost(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "pgr_aStarCost(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -"pgr_aStarCost(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +"pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "pgr_aStarCost(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -"pgr_aStarCost(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgid "" -"pgr_aStarCost(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -"pgr_aStarCost(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "pgr_aStarCost(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgid "Returns set of |matrix-result|" msgstr "返回 |matrix-result| 的集合" -msgid "pgr_aStarCost(`Edges SQL`_ , **start vids**, **end vids**, [options])" -msgstr "pgr_aStarCost(`Edges SQL`_ , **start vids**, **end vids**, [options])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" msgid "``pgr_aStarCostMatrix``" msgstr "``pgr_aStarCostMatrix``" @@ -8623,8 +8622,8 @@ msgstr "从 `v` 到 `u` 的成本是 :math:`0`" msgid "When the graph is **undirected** the cost matrix is symmetric" msgstr "当图 **无向** 时，成本矩阵是对称的" -msgid "pgr_aStarCostMatrix(`Edges SQL`_ , **start vids**, [**options**])" -msgstr "pgr_aStarCostMatrix(`Edges SQL`_ , **start vids**, [**options**])" +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgid "" "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " @@ -9026,7 +9025,7 @@ msgid ":doc:`pgr_createVerticesTable`" msgstr ":doc:`pgr_createVerticesTable`" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." -msgstr ":doc:`pgr_nodeNetwork` Full line graph of subgraph of edges :math:创建节点到非节点边表。" +msgstr ":doc:`pgr_nodeNetwork` 创建节点到非节点边表。" msgid "pgr_analyzeOneWay" msgstr "pgr_analyzeOneWay" @@ -9259,13 +9258,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`` (`组合`_)" @@ -9290,20 +9289,20 @@ msgid "" "`One to One`_ `)` on the:" msgstr "结果相当于`pgr_bdAStar(` `一对一`_ `)` 结果的并集：" -msgid "pgr_bdAstar(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "pgr_bdAstar(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "pgr_bdAstar(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "pgr_bdAstar(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "pgr_bdAstar(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgid "pgr_bdAstarCost" msgstr "pgr_bdAstarCost" @@ -9324,27 +9323,27 @@ msgid "" msgstr "``pgr_bdAstarCost`` 函数使用双向 A* 算法汇总最短路径的成本。" msgid "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "pgr_bdAstarCost(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgid "``pgr_bdAstarCostMatrix``" msgstr "``pgr_bdAstarCostMatrix``" @@ -9357,8 +9356,8 @@ msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵 msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" msgstr "内部使用 :doc:`pgr_bdAstar` 算法" -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_ , **start vids**, [**options**])" -msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_ , **start vids**, [**options**])" +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgid "``pgr_bdDijkstra``" msgstr "``pgr_bdDijkstra``" @@ -9391,27 +9390,27 @@ msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" msgstr "**官方** ``pgr_bdDijkstra`` (`一对一`_)" msgid "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgid "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -"pgr_bdDijkstra(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "pgr_bdDijkstra(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "Returns set of |old-generic-result|" msgstr "返回 |old-generic-result| 的集合" @@ -9473,34 +9472,34 @@ msgid "" msgstr "``pgr_bdDijkstraCost`` 函数使用双向 Dijkstra 算法汇总最短路径的成本。" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vid**, **end vid** , [``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vid**, **end vid** , [``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vids**, **end vid** , " +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " "[``directed``])" msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vids**, **end vid** , " +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " "[``directed``])" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_ , **start vids**, **end vids**, " +"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``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "``pgr_bdDijkstraCostMatrix``" @@ -9515,8 +9514,8 @@ msgid "" "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "使用双向Dijkstra算法，计算并返回成本矩阵。" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_ , **start vids**, [``directed``])" -msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_ , **start vids**, [``directed``])" +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgid "" "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " @@ -9565,7 +9564,7 @@ msgid "" msgstr "" "Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和" "1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点" -"（ ``start_vid``）到终点顶点（``end_vid`` ）的最短路径，其中一些边的权重可以为" +"（``start_vid``）到终点顶点（``end_vid``）的最短路径，其中一些边的权重可以为" "负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" msgid "" @@ -9611,27 +9610,27 @@ msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "运行时间： :math:`O(| start\\_vids | * ( V * E))`" msgid "" -"pgr_bellmanFord(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"pgr_bellmanFord(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "" -"pgr_bellmanFord(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"pgr_bellmanFord(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"pgr_bellmanFord(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"pgr_bellmanFord(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgid "" -"pgr_bellmanFord(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -"pgr_bellmanFord(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "pgr_bellmanFord(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "" "From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed**" @@ -9681,7 +9680,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 @@ -9692,9 +9691,8 @@ msgstr "运行时间： :math:`O(V + E)`" msgid "Throws when there are no edges in the graph" msgstr "当图中没有边时，返回 EMPTY SET。" -#, fuzzy -msgid "pgr_betweennessCentrality(`Edges SQL`_ , [``directed``])" -msgstr "pgr_lineGraph(`Edges SQL`_ , [``directed``])" +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" #, fuzzy msgid "Returns set of ``(vid, centrality)``" @@ -9885,38 +9883,38 @@ msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "运行时间： :math:`O(| start\\_vids | * |E|)`" msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vid**, **end vid**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " "[``directed``])" msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vid**, **end vid**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " "[``directed``])" msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vid**, **end vids**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " "[``directed``])" msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vid**, **end vids**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " "[``directed``])" msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vids**, **end vid**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " "[``directed``])" msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vids**, **end vid**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " "[``directed``])" msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , `Combinations SQL`_ , " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " "[``directed``])" msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_ , `Combinations SQL`_ , " +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " "[``directed``])" msgid "" @@ -10026,20 +10024,20 @@ msgstr "新的 **实验** 函数" msgid "Running time: Polynomial" msgstr "运行时间：多项式时间" -msgid "pgr_boykovKolmogorov(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_boykovKolmogorov(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_boykovKolmogorov(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_boykovKolmogorov(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_boykovKolmogorov(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_ , `Combinations SQL`_)" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" msgid "Returns set of |result-flow|" msgstr "Returns set of |result-flow|" @@ -10097,11 +10095,11 @@ msgstr "提供从源节点到目标深度级别的广度优先搜索遍历顺序 msgid "Running time: :math:`O(E + V)`" msgstr "运行时间： :math:`O(E + V)`" -msgid "pgr_breadthFirstSearch(`Edges SQL`_ , **root vid**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Edges SQL`_ , **root vid**, [**options**])" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgid "pgr_breadthFirstSearch(`Edges SQL`_ , **root vids**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Edges SQL`_ , **root vids**, [**options**])" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgid "**options:** ``[max_depth, directed]``" msgstr "**options:** ``[max_depth, directed]``" @@ -10373,8 +10371,8 @@ msgstr "当类型为 ``e`` 时，按列``id`` 降序" msgid "The pgr_contraction function has the following signature:" msgstr "pgr_contraction 函数具有以下签名：" -msgid "pgr_contraction(`Edges SQL`_ , **contraction order**, [**options**])" -msgstr "pgr_contraction(`Edges SQL`_ , **contraction order**, [**options**])" +msgid "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" +msgstr "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" msgid "**options:** ``[ max_cycles, forbidden_vertices, directed]``" msgstr "**options:** ``[ max_cycles, forbidden_vertices, directed]``" @@ -10554,7 +10552,7 @@ msgid "Fills ``id`` and ``the_geom`` columns of the vertices table." 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列。" @@ -10776,7 +10774,7 @@ msgid "" "geometry column ``the_geom`` is passed to the function as the source column." msgstr "" "当参数没有按照适当的顺序提供时，将会发生错误：在这个例子中，表 ``mytable`` 的源" -"列 ``source``被错误地传递给函数作为几何列，而几何列``the_geom`` 被错误地传递给" +"列 ``source`` 被错误地传递给函数作为几何列，而几何列``the_geom`` 被错误地传递给" "函数作为源列。" msgid "Example 4" @@ -10815,7 +10813,7 @@ msgid "" "``mygeom`` is passed to the function as the source column." msgstr "" "当参数没有按照适当的顺序提供时，会发生错误。在这个例子中，表 ``mytable`` 的" -"``src``列被错误地传递给函数作为几何列，而几何列``mygeom`` 被错误地传递给函数作" +"``src`` 列被错误地传递给函数作为几何列，而几何列 ``mygeom`` 被错误地传递给函数作" "为源列。" msgid "Example 10" @@ -10972,7 +10970,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 " @@ -11001,20 +10999,20 @@ msgstr "`agg_cost`中未包括的值 `(u, v)`是数学符号中的 :math:`\\inft msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" msgstr "运行时间： :math:`O(| start\\_vids | * (V + E))`" -msgid "pgr_dagShortestPath(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_dagShortestPath(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_dagShortestPath(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_dagShortestPath(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_dagShortestPath(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_dagShortestPath(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_dagShortestPath(`Edges SQL`_ , `Combinations SQL`_)" +msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" msgstr "在 **有向** 图上，从顶点 :math:`5` 到顶点 :math:`11`" @@ -11065,7 +11063,7 @@ msgid "" "best to prep your vertices table before hand and use that vertices table for " "pgr_degree calls." msgstr "" -"`pgr_degree`可以利用`pgr_extractVertices` 的输出，或者可以在调用中嵌入" +"`pgr_degree`可以利用 `pgr_extractVertices` 的输出，或者可以在调用中嵌入" "`pgr_extractVertices`。对于较大规模的网络，最好提前准备好顶点表并在" "`pgr_degree`调用中使用该顶点表。" @@ -11214,11 +11212,11 @@ msgstr "返回值按 `start_vid` 升序排列。" msgid "Depth First Search Running time: :math:`O(E + V)`" msgstr "深度优先搜索运行时间： :math:`O(E + V)`" -msgid "pgr_depthFirstSearch(`Edges SQL`_ , **root vid**, [**options**])" -msgstr "pgr_depthFirstSearch(`Edges SQL`_ , **root vid**, [**options**])" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgid "pgr_depthFirstSearch(`Edges SQL`_ , **root vids**, [**options**])" -msgstr "pgr_depthFirstSearch(`Edges SQL`_ , **root vids**, [**options**])" +msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgid "**options:** ``[directed, max_depth]``" msgstr "**options:** ``[directed, max_depth]``" @@ -11297,18 +11295,18 @@ msgstr "``pgr_dijkstra`` (`一对一`_)的签名更改" msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" msgstr "**官方** ``pgr_dijkstra`` (`一对一`_)" -msgid "pgr_dijkstra(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "pgr_dijkstra(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"pgr_dijkstra(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -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`_, **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``])" +msgid "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 上的重大变更" @@ -11504,27 +11502,27 @@ msgid "" msgstr "``pgr_dijkstraCost`` 函数总结了使用Dijkstra算法的最短路径的成本。" msgid "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -"pgr_dijkstraCost(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"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``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_,`Combinations SQL`_, [``directed``])" msgid "``pgr_dijkstraCostMatrix``" msgstr "``pgr_dijkstraCostMatrix``" @@ -11537,8 +11535,8 @@ msgstr "``pgr_dijkstraCostMatrix`` - 使用 :doc:`pgr_dijkstra` 计算成本矩 msgid "Using Dijkstra algorithm, calculate and return a cost matrix." msgstr "使用 Dijkstra 算法，计算并返回成本矩阵。" -msgid "pgr_dijkstraCostMatrix(`Edges SQL`_ , **start vids**, [``directed``])" -msgstr "pgr_dijkstraCostMatrix(`Edges SQL`_ , **start vids**, [``directed`])" +msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed`])" msgid "``pgr_dijkstraNear`` - Proposed" msgstr "``pgr_dijkstraNear`` - 拟议" @@ -11602,22 +11600,22 @@ msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "组合： :math:`drt * |Starting vids|`" msgid "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vid**, **end vids**, [**options A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vid**, **end vids**, [**options A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgid "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vid**, [**options A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vid**, [**options A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgid "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vids**, [**options B**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vids**, [**options B**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "pgr_dijkstraNear(`Edges SQL`_ , `Combinations SQL`_ , [**options B**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_ ,`Combinations SQL`_ , [**options B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_,`Combinations SQL`_, [**options B**])" msgid "**options A:** ``[directed, cap]``" msgstr "**选项A：** ``[directed, cap]``" @@ -11626,9 +11624,9 @@ msgid "**options B:** ``[directed, cap, global]``" msgstr "**选项B：** ``[directed, cap, global]``" msgid "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vid**, **end vids**, [**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgid "**options:** ``[directed, cap]``" msgstr "**选项：** ``[directed, cap]``" @@ -11656,9 +11654,9 @@ msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "结果显示，位于顶点 :math:`11` 的站最近。" msgid "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vid**, [**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgid "" "Departing on a car from a subway station find the nearest **two** stations " @@ -11677,9 +11675,9 @@ msgid "" msgstr "结果显示，位于顶点 :math:`10` 的站点最近，其次是 :math:`11`。" msgid "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" -"pgr_dijkstraNear(`Edges SQL`_ , **start vids**, **end vids**, [**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgid "**options:** ``[directed, cap, global]``" msgstr "**选项：** ``[定向、上限、全局]```" @@ -11714,8 +11712,8 @@ msgid "" "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "只返回 `一条`路由，因为 `global` 为 `true` 且 `cap` 为 `1" -msgid "pgr_dijkstraNear(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" -msgstr "pgr_dijkstraNear(`Edges SQL`_ ,`Combinations SQL`_ , [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_,`Combinations SQL`_, [**options**])" msgid "" "Find the best car connection between all the stations of two subway lines" @@ -11824,43 +11822,43 @@ msgid "" msgstr "`pgr_dijkstraNearCost`` - 使用 dijkstra 算法，找到通往最近顶点的路径。" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vid**, **end vids**, [**options " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " "A**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vid**, **end vids**, [**options " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " "A**])" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vid**, [**options " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " "A**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vid**, [**options " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " "A**])" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vids**, [**options " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " "B**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vids**, [**options " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " "B**])" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , `Combinations SQL`_ , [**options B**])" +"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ ,`Combinations SQL`_ , [**options B**])" +"pgr_dijkstraNearCost(`Edges SQL`_,`Combinations SQL`_, [**options B**])" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vid**, **end vids**, " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " "[**options**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vid**, **end vids**, " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " "[**options**])" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vid**, " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " "[**options**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vid**, **end vid**, [**options**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgid "" "Departing on a car from a subway station find the nearest **two** stations " @@ -11868,14 +11866,14 @@ msgid "" msgstr "从地铁站开车出发找到距离顶点 :math:`6` 最近的 **两个** 车站" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " "[**options**])" msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " "[**options**])" -msgid "pgr_dijkstraNearCost(`Edges SQL`_ , `Combinations SQL`_ , [**options**])" -msgstr "pgr_dijkstraNearCost(`Edges SQL`_ ,`Combinations SQL`_ , [**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_,`Combinations SQL`_, [**options**])" msgid "" "lines `3~4` sets the start vertices to be from the fisrt subway line and the " @@ -11919,8 +11917,8 @@ msgstr "是路线的一段。" msgid "One Via" msgstr "一次通过" -msgid "pgr_dijkstraVia(`Edges SQL`_ , **via vertices**, [**options**])" -msgstr "pgr_dijkstraVia(`Edges SQL`_ , **via vertices**, [**options**])" +msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" +msgstr "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])" msgid "**options:** ``[directed, strict, U_turn_on_edge]``" msgstr "**选项：** ``[directed, strict, U_turn_on_edge]``" @@ -12022,14 +12020,14 @@ msgstr "" "相应的生成树。" msgid "" -"pgr_drivingDistance(`Edges SQL`_ , **Root vid**, **distance**, [``directed``])" +"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "" -"pgr_drivingDistance(`Edges SQL`_ , **Root vid**, **distance**, [``directed``])" +"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgid "" -"pgr_drivingDistance(`Edges SQL`_ , **Root vids**, **distance**, [**options**])" +"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" -"pgr_drivingDistance(`Edges SQL`_ , **Root vids**, **distance**, [**options**])" +"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgid "**options:** [directed, equicost]" msgstr "**options:** [directed, equicost]" @@ -12188,36 +12186,36 @@ msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "使用 :doc:`pgr_boykovKolmogorov` 计算路径。" msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vid**, **end vid**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " "[``directed``])" msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vid**, **end vid**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " "[``directed``])" msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vid**, **end vids**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " "[``directed``])" msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vid**, **end vids**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " "[``directed``])" msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vids**, **end vid**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " "[``directed``])" msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vid**, **end vid**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " "[``directed``])" msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , **start vids**, **end vids**, " +"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" -msgstr "pgr_edgeDisjointPaths(`Edges SQL`_ ,`Combinations SQL`_ , [``directed`])" +"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_,`Combinations SQL`_, [``directed`])" msgid "Returns set of |result-disjoint|" msgstr "Returns set of |result-disjoint|" @@ -12264,20 +12262,20 @@ msgstr "从 ``pgr_maxFlowEdmondsKarp`` 更名而来" msgid "Running time: :math:`O( V * E ^ 2)`" msgstr "运行时间： :math:`O( V * E ^ 2)`" -msgid "pgr_edmondsKarp(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_edmondsKarp(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_edmondsKarp(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_edmondsKarp(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_edmondsKarp(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_edmondsKarp(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_edmondsKarp(`Edges SQL`_ ,`Combinations SQL`_)" +msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_edmondsKarp(`Edges SQL`_,`Combinations SQL`_)" msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" msgstr "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" @@ -12353,27 +12351,27 @@ msgid "Average case: :math:`O( | E | )`" msgstr "平均情况： :math:`O( | E | )`" msgid "" -"pgr_edwardMoore(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"pgr_edwardMoore(`Edges SQL`_ , **start vid**, **end vid**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "" -"pgr_edwardMoore(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"pgr_edwardMoore(`Edges SQL`_ , **start vid**, **end vids**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"pgr_edwardMoore(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"pgr_edwardMoore(`Edges SQL`_ , **start vids**, **end vid**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgid "" -"pgr_edwardMoore(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -"pgr_edwardMoore(`Edges SQL`_ , **start vids**, **end vids**, [``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "pgr_edwardMoore(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" -msgstr "pgr_edwardMoore(`Edges SQL`_ , `Combinations SQL`_ , [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" @@ -12397,8 +12395,8 @@ msgid "" "out edges" msgstr "当给出边标识符时，它也会计算出入边" -msgid "pgr_extractVertices(`Edges SQL`_ , [``dryrun``])" -msgstr "pgr_extractVertices(`Edges SQL`_ , [``dryrun``])" +msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" +msgstr "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" msgid "RETURNS SETOF |result-extract|" msgstr "RETURNS SETOF |result-extract|" @@ -12518,14 +12516,14 @@ msgid "``EMTPY SET`` is returned on dryrun executions" msgstr "空运行执行时返回 ``EMTPY SET``" msgid "" -"pgr_findCloseEdges(`Edges SQL`_ , **point**, **tolerance**, [**options**])" +"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -"pgr_findCloseEdges(`Edges SQL`_ , **point**, **tolerance**, [**options**])" +"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgid "" -"pgr_findCloseEdges(`Edges SQL`_ , **points**, **tolerance**, [**options**])" +"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" -"pgr_findCloseEdges(`Edges SQL`_ , **points**, **tolerance**, [**options**])" +"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgid "**options:** ``[cap, partial, dryrun]``" msgstr "**options:** ``[cap, partial, dryrun]``" @@ -12665,12 +12663,12 @@ msgid "``POINT`` geometry" msgstr "``POINT`` 几何" msgid "" -"`One Point`_ : Contains the point on the edge that is ``fraction`` away from " +"`One Point`_: Contains the point on the edge that is ``fraction`` away from " "the starting point of the edge." -msgstr "`一个点`_ ：包含边缘上距边缘起点一小部分的点。" +msgstr "`一个点`_：包含边缘上距边缘起点一小部分的点。" -msgid "`Many Points`_ : Contains the corresponding **original point**" -msgstr "`多个点`_ ：包含对应的 **原始点**" +msgid "`Many Points`_: Contains the corresponding **original point**" +msgstr "`多个点`_：包含对应的 **原始点**" msgid "" "``LINESTRING`` geometry from the **original point** to the closest point of " @@ -12742,41 +12740,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 +12797,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 +12815,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 +12869,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 " @@ -12996,8 +12994,8 @@ msgstr "" "成本总和的一种良好选择，适用于*密集图*。我们使用Boost的实现，其运行时间为： :" "math:`\\Theta(V^3)`，" -msgid "pgr_floydWarshall(`Edges SQL`_ , [``directed``])" -msgstr "pgr_floydWarshall(`Edges SQL`_ , [``directed``])" +msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" +msgstr "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" @@ -13261,8 +13259,8 @@ msgstr "" "Johnson算法是计算图中每一对节点的最短路径成本之和的好选择，特别适用于 *稀疏图" "*。它使用了Boost的实现，其运行时间为 :math:`O(V E \\log V)`，" -msgid "pgr johnson(`Edges SQL`_ , [``directed``])" -msgstr "pgr johnson(`Edges SQL`_ , [``directed``])" +msgid "pgr johnson(`Edges SQL`_, [``directed``])" +msgstr "pgr johnson(`Edges SQL`_, [``directed``])" msgid "" "Boost `Johnson `算法。" msgid "Running time: :math:`O( V ^ 3)`" msgstr "运行时间： :math:`O( V ^ 3)`" -msgid "pgr_maxFlow(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_maxFlow(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_maxFlow(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_maxFlow(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_maxFlow(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_maxFlow(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_maxFlow(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_maxFlow(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_maxFlow(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_maxFlow(`Edges SQL`_ , `Combinations SQL`_)" +msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" msgid "RETURNS ``BIGINT``" msgstr "RETURNS ``BIGINT``" @@ -14165,20 +14163,20 @@ msgstr "" ":math:`U`是迭代次数的上限。 在许多现实世界的情况下，迭代次数远小于 :math:" "`U` 。" -msgid "pgr_maxFlowMinCost(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_maxFlowMinCost(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost(`Edges SQL`_ , `Combinations SQL`_)" +msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" msgid "Returns set of |result-flow-mincost|" msgstr "返回 |result-flow-mincost| 的集合" @@ -14210,20 +14208,20 @@ msgstr "当最大流量为0时则没有流量，返回 **0** 。" msgid "Uses :doc:`pgr_maxFlowMinCost`." msgstr "使用 :doc:`pgr_maxFlowMinCost`。" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_ , `Combinations SQL`_)" +msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" msgid "RETURNS FLOAT" msgstr "RETURNS FLOAT" @@ -14575,9 +14573,9 @@ msgid "Signature" msgstr "标识" msgid "" -"pgr_pickDeliver(`Orders SQL`_ , `Vehicles SQL`_ , `Matrix SQL`_ , [**options**])" +"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" -"pgr_pickDeliver(`Orders SQL`_ , `Vehicles SQL`_ , `Matrix SQL`_ , [**options**])" +"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "**options:** ``[factor, max_cycles, initial_sol]``" @@ -14661,9 +14659,9 @@ msgstr "六种不同的可选不同初始解决方案" msgid "the best solution found will be result" msgstr "找到的最佳解决方案将作为结果" -msgid "pgr_pickDeliverEuclidean(`Orders SQL`_ , `Vehicles SQL`_ , [**options**])" +msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" msgstr "" -"pgr_pickDeliverEuclidean(`Orders SQL`_ , `Vehicles SQL`_ , [**options**])" +"pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" msgid "p_x, p_y, p_open, p_close, [p_service,]" msgstr "p_x, p_y, p_open, p_close, [p_service,]" @@ -14755,11 +14753,11 @@ msgid "" msgstr "" "访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" -msgid "pgr_primBFS(`Edges SQL`_ , **root vid**, [``max_depth``])" -msgstr "pgr_primBFS(`Edges SQL`_ , **root vid**, [``max_depth``])" +msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgid "pgr_primBFS(`Edges SQL`_ , **root vids**, [``max_depth``])" -msgstr "pgr_primBFS(`Edges SQL`_ , **root vids**, [``max_depth``])" +msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "``pgr_primDD`` — 使用 Prim 算法的集水区节点。" @@ -14773,11 +14771,11 @@ msgstr "" "使用 Prim 算法，在计算的最小生成树中提取总成本小于或等于距根顶点（或多个顶" "点）距离的节点。" -msgid "pgr_primDD(`Edges SQL`_ , **root vid**, **distance**)" -msgstr "pgr_primDD(`Edges SQL`_ , **root vid**, **distance**)" +msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" +msgstr "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" -msgid "pgr_primDD(`Edges SQL`_ , **root vids**, **distance**)" -msgstr "pgr_primDD(`Edges SQL`_ , **root vids**, **distance**)" +msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" +msgstr "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgid "" "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " @@ -14790,11 +14788,11 @@ msgid "" msgstr "" "访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" -msgid "pgr_primDFS(`Edges SQL`_ , **root vid**, [``max_depth``])" -msgstr "pgr_primDFS(`Edges SQL`_ , **root vid**, [``max_depth``])" +msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" +msgstr "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgid "pgr_primDFS(`Edges SQL`_ , **root vids**, [``max_depth``])" -msgstr "pgr_primDFS(`Edges SQL`_ , **root vids**, [``max_depth``])" +msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" +msgstr "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_pushRelabel``" msgstr "``pgr_pushRelabel``" @@ -14812,20 +14810,20 @@ msgstr "``pgr_pushRelabel`` (`组合`_)" msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "由 ``pgr_maxFlowPushRelabel`` 重命名" -msgid "pgr_pushRelabel(`Edges SQL`_ , **start vid**, **end vid**)" -msgstr "pgr_pushRelabel(`Edges SQL`_ , **start vid**, **end vid**)" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" -msgid "pgr_pushRelabel(`Edges SQL`_ , **start vid**, **end vids**)" -msgstr "pgr_pushRelabel(`Edges SQL`_ , **start vid**, **end vids**)" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" -msgid "pgr_pushRelabel(`Edges SQL`_ , **start vids**, **end vid**)" -msgstr "pgr_pushRelabel(`Edges SQL`_ , **start vids**, **end vid**)" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" -msgid "pgr_pushRelabel(`Edges SQL`_ , **start vids**, **end vids**)" -msgstr "pgr_pushRelabel(`Edges SQL`_ , **start vids**, **end vids**)" +msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" -msgid "pgr_pushRelabel(`Edges SQL`_ , `Combinations SQL`_)" -msgstr "pgr_pushRelabel(`Edges SQL`_ , `Combinations SQL`_)" +msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgid "pgr_sequentialVertexColoring - Proposed" msgstr "pgr_sequentialVertexColoring - 拟议" @@ -15215,38 +15213,38 @@ msgid "Execute the **TRSP** algorithm with restrictions." msgstr "有限制地执行 **TRSP** 算法。" msgid "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vid**, **end vid**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " "[``directed``])" msgstr "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vid**, **end vid**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " "[``directed``])" msgid "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vid**, **end vids**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " "[``directed``])" msgstr "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vid**, **end vids**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " "[``directed``])" msgid "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vids**, **end vid**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " "[``directed``])" msgstr "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vids**, **end vid**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " "[``directed``])" msgid "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vids**, **end vids**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " "[``directed``])" msgstr "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , **start vids**, **end vids**, " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " "[``directed``])" msgid "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , `Combinations SQL`_ , " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " "[``directed``])" msgstr "" -"pgr_trsp(`Edges SQL`_ , `Restrictions SQL`_ , `Combinations SQL`_ , " +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " "[``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." @@ -15311,10 +15309,10 @@ msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "**注意**，完成此操作后， ``U_turn_on_edge`` 标志将被忽略。" msgid "" -"pgr_trspVia(`Edges SQL`_ , `Restrictions SQL`_ , **via vertices**, " +"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " "[**options**])" msgstr "" -"pgr_trspVia(`Edges SQL`_ , `Restrictions SQL`_ , **via vertices**, " +"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " "[**options**])" msgid "" @@ -15335,7 +15333,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 +15346,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``." @@ -15426,10 +15424,10 @@ msgid "Do not use negative values on identifiers of the inner queries." msgstr "不要在内部查询的标识符上使用负值。" msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**via vertices**, [**options**])" msgstr "" -"pgr_trspVia_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**via vertices**, [**options**])" msgid "" @@ -15543,7 +15541,7 @@ msgstr "" "从 :doc:`pgr_withPointsVia` 的结果中移除冲突的路径，并使用 :doc:`pgr_trsp` 算" "法的结果构建解决方案：" -msgid "Getting the same result as ``pgr_trspVia_withPoints`` :" +msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "得到与 ``pgr_trspVia_withPoints`` 相同的结果：" msgid "" @@ -15635,39 +15633,39 @@ msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "运行时间： :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vid**, **end vid**, [**options**])" msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vid**, **end vid**, [**options**])" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vid**, **end vids**, [**options**])" msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vid**, **end vids**, [**options**])" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vids**, **end vid**, [**options**])" msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vids**, **end vid**, [**options**])" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vids**, **end vids**, [**options**])" msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Points SQL`_ , " +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vids**, **end vids**, [**options**])" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Combinations SQL`_ , " -"`Points SQL`_ , [**options**])" +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " +"`Points SQL`_, [**options**])" msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_ , `Restrictions SQL`_ , `Combinations SQL`_ , " -"`Points SQL`_ , [**options**])" +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " +"`Points SQL`_, [**options**])" msgid "**options:** ``[directed, driving_side, details]``" msgstr "**options:** ``[directed, driving_side, details]``" @@ -15737,10 +15735,10 @@ msgid "" msgstr "利用Yen算法获得K条最短路径并对路径进行分析以选择不使用限制的路径" msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_ , `Restrictions SQL`_ , **start vid**, " +"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " "**end vid**, **K**, [**options**])" msgstr "" -"pgr_turnRestrictedPath(`Edges SQL`_ , `Restrictions SQL`_ , **start vid**, " +"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " "**end vid**, **K**, [**options**])" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -15843,38 +15841,38 @@ msgstr "" "当起始顶点和结束顶点不同并且没有路径时： - 不包含的值 (u, v) 的 agg_cost 为 ∞" msgid "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vid**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " "[**options**])" msgstr "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vid**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " "[**options**])" msgid "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "[**options**])" msgstr "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "[**options**])" msgid "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "[**options**])" msgstr "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "[**options**])" msgid "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vids**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " "[**options**])" msgstr "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vids**, " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " "[**options**])" msgid "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , `Combinations SQL`_ , " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " "[**options**])" msgstr "" -"pgr_withPoints(`Edges SQL`_ , `Points SQL`_ , `Combinations SQL`_ , " +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " "[**options**])" msgid "**options:** ``[directed, driving_side, details])``" @@ -16026,38 +16024,38 @@ msgid "" msgstr "出于优化目的， `start_vids`或 `end_vids` 中的任何重复值都将被忽略。" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vid**, **end vid**, " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vid**, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vid**, **end vid**, " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vid**, " "[**options**])" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vids**, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vids**, " "[**options**])" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end vid**, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end vid**, " "[**options**])" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vids**, **end " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end " "vids**, [**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , **start vids**, **end " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end " "vids**, [**options**])" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , `Combinations SQL`_ , " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, `Combinations SQL`_, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , 'Points SQL`_ , `Combinations SQL`_ , " +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, `Combinations SQL`_, " "[**options**])" msgid "**options:** ``[directed, driving_side]``" @@ -16075,24 +16073,24 @@ msgid "From point :math:`1` to vertex :math:`10` with defaults" msgstr "使用默认值从点 :math:`1` 到顶点 :math:`10`" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "[**options**])" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "[**options**])" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " "vids**, [**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " "vids**, [**options**])" msgid "" @@ -16101,10 +16099,10 @@ msgid "" msgstr "从点 :math:`15` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1`" msgid "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , `Combinations SQL`_ , " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " "[**options**])" msgstr "" -"pgr_withPointsCost(`Edges SQL`_ , `Points SQL`_ , `Combinations SQL`_ , " +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " "[**options**])" msgid "Identifier of the starting vertex or point." @@ -16152,10 +16150,10 @@ msgid "" msgstr "``pgr_withPointsCostMatrix`` - 使用 :doc:`pgr_withPoints`计算成本矩阵." msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_ , `Points SQL`_ , **start vids**, " +"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " "[**options**])" msgstr "" -"pgr_withPointsCostMatrix(`Edges SQL`_ , `Points SQL`_ , **start vids**, " +"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " "[**options**])" msgid "" @@ -16194,7 +16192,7 @@ msgstr "" "**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`` 列。" @@ -16236,17 +16234,17 @@ msgstr "" "的所有节点和点。 提取的边将符合相应的生成树。" msgid "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vid**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " "**driving side**, [**options A**])" msgstr "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vid**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " "**driving side**, [**options A**])" msgid "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vids**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " "**driving side**, [**options B**])" msgstr "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vids**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " "**driving side**, [**options B**])" msgid "**options A:** ``[directed, details]``" @@ -16256,10 +16254,10 @@ msgid "**options B:** ``[directed, details, equicost]``" msgstr "**options B:** ``[directed, details, equicost]``" msgid "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vid**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " "**driving side**, [**options**])" msgstr "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vid**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " "**driving side**, [**options**])" msgid "**options:** ``[directed, details]``" @@ -16272,10 +16270,10 @@ msgstr "" "右侧驾驶拓扑，从点 :math:`1` 开始，距离不超过 :math:`3.3`，并提供详细信息。" msgid "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vids**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " "**driving side**, [**options**])" msgstr "" -"pgr_withPointsDD(`Edges SQL`_ , `Points SQL`_ , **root vids**, **distance**, " +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " "**driving side**, [**options**])" msgid "**options:** ``[directed, details, equicost]``" @@ -16386,38 +16384,38 @@ msgid "" msgstr "修改图以包括 `Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K`最短路径。" msgid "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vid**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " "**K**, **driving_side**, [**options**])" msgstr "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vid**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " "**K**, **driving_side**, [**options**])" msgid "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "**K**, **driving_side**, [**options**])" msgstr "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vid**, **end vids**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "**K**, **driving_side**, [**options**])" msgid "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "**K**, **driving_side**, [**options**])" msgstr "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vid**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "**K**, **driving_side**, [**options**])" msgid "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vids**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " "**K**, **driving_side**, [**options**])" msgstr "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , **start vids**, **end vids**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " "**K**, **driving_side**, [**options**])" msgid "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , `Combinations SQL`_ , **K**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " "**driving_side**, [**options**])" msgstr "" -"pgr_withPointsKSP(`Edges SQL`_ , `Points SQL`_ , `Combinations SQL`_ , **K**, " +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " "**driving_side**, [**options**])" msgid "**options:** ``[directed, heap_paths, details]``" @@ -16536,10 +16534,10 @@ msgstr "" "size\\_of(via\\;vertices)`。" msgid "" -"pgr_withPointsVia(`Edges SQL`_ , `Points SQL`_ , **via vertices**, " +"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " "[**options**])" msgstr "" -"pgr_withPointsVia(`Edges SQL`_ , `Points SQL`_ , **via vertices**, " +"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " "[**options**])" msgid "" @@ -16675,7 +16673,7 @@ msgid "" "github.com/pgRouting/pgrouting/commits>`_ on Github." msgstr "" "要查看完整的更改列表，请检查 Github 上的 `Git提交列表 `_ 。" +"pgRouting/pgrouting/commits>`_。" msgid "Mayors" msgstr "主要版本" @@ -16932,10 +16930,10 @@ msgid "Issue fixes" msgstr "问题修复" msgid "" -"`#2565 `__" +"`#2565 `__ " "pgr_pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" -"`#2565 `__" +"`#2565 `__ " "pgr_pgr_lengauerTarjanDominatorTree 触发了一个断言" msgid "SQL enhancements" @@ -17011,18 +17009,18 @@ msgstr "" "utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.2%22>`_" msgid "" -"`#2394 `__ : pgr_bdAstar " +"`#2394 `__: pgr_bdAstar " "accumulates heuristic cost in visited node cost." msgstr "" -"`#2394 `__ ：pgr_bdAstar " +"`#2394 `__：pgr_bdAstar " "在访问的节点成本中累积了启发式成本。" msgid "" -"`#2427 `__ : " +"`#2427 `__: " "pgr_createVerticesTable & pgr_createTopology, variable should be of type " "Record." msgstr "" -"`#2427 `__ : " +"`#2427 `__: " "pgr_createVerticesTable & pgr_createTopology，变量应为 Record 类型。" msgid "pgRouting 3.4.1 Release Notes" @@ -17038,17 +17036,17 @@ msgstr "" "utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.1%22>`_" msgid "" -"`#2401 `__ : pgRouting " +"`#2401 `__: pgRouting " "3.4.0 do not build docs when sphinx is too low or missing" msgstr "" -"`#2401 `__ : pgRouting " +"`#2401 `__: pgRouting " "3.4.0 在 sphinx 过低或丢失时不构建文档" msgid "" -"`#2398 `__ : v3.4.0 does " +"`#2398 `__: v3.4.0 does " "not upgrade from 3.3.3" msgstr "" -"`#2398 `__ : v3.4.0 不能" +"`#2398 `__: v3.4.0 不能" "从 3.3.3 升级" msgid "pgRouting 3.4.0 Release Notes" @@ -17064,10 +17062,10 @@ msgstr "" "utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`_" msgid "" -"`#1891 `__ : pgr_ksp " +"`#1891 `__: pgr_ksp " "doesn't give all correct shortest path" msgstr "" -"`#1891 `__ : pgr_ksp 没有" +"`#1891 `__: pgr_ksp 没有" "给出所有正确的最短路径" msgid "New proposed functions" @@ -17182,10 +17180,10 @@ msgstr "" "utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_" msgid "" -"`#2400 `__ : pgRouting " +"`#2400 `__: pgRouting " "3.3.3 does not build in focal" msgstr "" -"`#2400 `__ : pgRouting " +"`#2400 `__: pgRouting " "3.3.3 在 Focal 上无法构建" msgid "pgRouting 3.3.3 Release Notes" @@ -17248,24 +17246,24 @@ msgid "Restructure of the pgRouting concepts page." msgstr "pgRouting概念页面的重构。" msgid "" -"`#2276 `__ : " +"`#2276 `__: " "edgeDisjointPaths issues with start_vid and combinations" msgstr "" -"`#2276 `__ : " +"`#2276 `__: " "edgeDisjointPaths 与 start_vid 和组合的问题" msgid "" -"`#2312 `__ : " +"`#2312 `__: " "pgr_extractVertices error when target is not BIGINT" msgstr "" -"`#2312 `__ ：当目标不是 " +"`#2312 `__：当目标不是 " "BIGINT 时 pgr_extractVertices 错误" msgid "" -"`#2357 `__ : Apply clang-" +"`#2357 `__: Apply clang-" "tidy performance-*" msgstr "" -"`#2357 `__ ：应用 clang-" +"`#2357 `__：应用 clang-" "tidy performance-*" msgid "pgRouting 3.3.1 Release Notes" @@ -17278,20 +17276,20 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 ` 3.3.1Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.1%22>`_。" msgid "" -"`#2216 `__ : Warnings " +"`#2216 `__: Warnings " "when using clang" msgstr "" -"`#2216 `__ ：使用 clang 时" +"`#2216 `__：使用 clang 时" "发出警告" msgid "" -"`#2266 `__ : Error " +"`#2266 `__: Error " "processing restrictions" msgstr "" -"`#2266 `__ ：错误处理限制" +"`#2266 `__：错误处理限制" msgid "pgRouting 3.3.0 Release Notes" msgstr "pgRouting 3.3.0 发布说明" @@ -17306,38 +17304,38 @@ msgstr "" "utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.0%22>`_ 。" msgid "" -"`#2057 `__ : trspViaEdges " +"`#2057 `__: trspViaEdges " "columns in different order" msgstr "" -"`#2057 `__ : trspViaEdges " +"`#2057 `__: trspViaEdges " "列的顺序不同" msgid "" -"`#2087 `__ : " +"`#2087 `__: " "pgr_extractVertices to proposed" msgstr "" -"`#2087 `__ :拟议的 " +"`#2087 `__:拟议的 " "pgr_extractVertices" msgid "" -"`#2201 `__ : " +"`#2201 `__: " "pgr_depthFirstSearch to proposed" msgstr "" -"`#2201 `__ : 拟议的" +"`#2201 `__: 拟议的" "pgr_depthFirstSearch" msgid "" -"`#2202 `__ : " +"`#2202 `__: " "pgr_sequentialVertexColoring to proposed" msgstr "" -"`#2202 `__ : 拟议的" +"`#2202 `__: 拟议的" "pgr_sequentialVertexColoring" msgid "" -"`#2203 `__ : " +"`#2203 `__: " "pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" msgstr "" -"`#2203 `__ : 拟议的" +"`#2203 `__: 拟议的" "pgr_dijkstraNear 和 pgr_dijkstraNearCost" msgid "Coloring" @@ -17407,20 +17405,20 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.2.2 Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.2%22>`_。" msgid "" -"`#2093 `__ : Compilation " +"`#2093 `__: Compilation " "on Visual Studio" msgstr "" -"`#2093 `__ ：在 Visual " +"`#2093 `__：在 Visual " "Studio 上编译" msgid "" -"`#2189 `__ : Build error " +"`#2189 `__: Build error " "on RHEL 7" msgstr "" -"`#2189 `__ ：RHEL 7 上的构" +"`#2189 `__：RHEL 7 上的构" "建错误" msgid "pgRouting 3.2.1 Release Notes" @@ -17433,13 +17431,13 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.2.1Git关闭里程碑 " "`_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.1%22>`_。" msgid "" -"`#1883 `__ : " +"`#1883 `__: " "pgr_TSPEuclidean crashes connection on Windows" msgstr "" -"`#1883 `__ :" +"`#1883 `__:" "pgr_TSPEuclidean 在 Windows 上导致连接崩溃" msgid "The solution is to use Boost::graph::metric_tsp_approx" @@ -17463,16 +17461,16 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 ` 3.2.0Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.0%22>`_。" msgid "Build" msgstr "构建" msgid "" -"`#1850 `__ : Change Boost " +"`#1850 `__: Change Boost " "min version to 1.56" msgstr "" -"`#1850 `__ ：将 Boost 最低" +"`#1850 `__：将 Boost 最低" "版本更改为 1.56" msgid "Removing support for Boost v1.53, v1.54 & v1.55" @@ -17578,27 +17576,27 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.1.3 Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.3%22>`_。" msgid "" -"`#1825 `__ : Boost " +"`#1825 `__: Boost " "versions are not honored" msgstr "" -"`#1825 `__ ：Boost 版本不" +"`#1825 `__：Boost 版本不" "受支持" msgid "" -"`#1849 `__ : Boost 1.75.0 " +"`#1849 `__: Boost 1.75.0 " "geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" -"`#1849 `__ ：macOS 环境中" +"`#1849 `__：macOS 环境中" "的 Boost 1.75.0 几何“point_xy.hpp”构建错误" msgid "" -"`#1861 `__ : vrp " +"`#1861 `__: vrp " "functions crash server" msgstr "" -"`#1861 `__ ：vrp功能使服务" +"`#1861 `__：vrp功能使服务" "器崩溃" msgid "pgRouting 3.1.2 Release Notes" @@ -17611,41 +17609,41 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.1.2Git关闭里程碑 " "`_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.2%22>`_。" msgid "" -"`#1304 `__ : FreeBSD 12 " +"`#1304 `__: FreeBSD 12 " "64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" -"`#1304 `__ ：FreeBSD 12 " +"`#1304 `__：FreeBSD 12 " "64 位在 pgr_vrOneDepot 测试实验功能上崩溃" msgid "" -"`#1356 `__ : tools/" +"`#1356 `__: tools/" "testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" -"`#1356 `__ ：tools/" +"`#1356 `__：tools/" "testers/pg_prove_tests.sh 在未传递 PostgreSQL 端口时失败" msgid "" -"`#1725 `__ : Server crash " +"`#1725 `__: Server crash " "on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" -"`#1725 `__ _：openbsd上的" +"`#1725 `___：openbsd上的" "pgr_pickDeliver和pgr_vrpOneDepot服务器崩溃" msgid "" -"`#1760 `__ : TSP server " +"`#1760 `__: TSP server " "crash on ubuntu 20.04 #1760" msgstr "" -"`#1760 `__ ：TSP 服务器在 " +"`#1760 `__：TSP 服务器在 " "ubuntu 20.04 上崩溃 #1760" msgid "" -"`#1770 `__ : Remove " +"`#1770 `__: Remove " "warnings when using clang compiler" msgstr "" -"`#1770 `__ ：删除使用 " +"`#1770 `__：删除使用 " "clang 编译器时的警告" msgid "pgRouting 3.1.1 Release Notes" @@ -17658,41 +17656,41 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.1.1 Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.1%22>`_。" msgid "" -"`#1733 `__ : pgr_bdAstar " +"`#1733 `__: pgr_bdAstar " "fails when source or target vertex does not exist in the graph" msgstr "" -"`#1733 `__ ：当图中不存在" +"`#1733 `__：当图中不存在" "源顶点或目标顶点时，pgr_bdAstar 失败" msgid "" -"`#1647 `__ : Linear " +"`#1647 `__: Linear " "Contraction contracts self loops" msgstr "" -"`#1647 `__ ：线性收缩收缩" +"`#1647 `__：线性收缩收缩" "自循环" msgid "" -"`#1640 `__ : " +"`#1640 `__: " "pgr_withPoints fails when points_sql is empty" msgstr "" -"`#1640 `__ : " +"`#1640 `__: " "pgr_withPoints 在 points_sql 为空时失败" msgid "" -"`#1616 `__ : Path " +"`#1616 `__: Path " "evaluation on C++ not updated before the results go back to C" msgstr "" -"`#1616 `__ _：C++ 上的路径" +"`#1616 `___：C++ 上的路径" "评估在结果返回 C 之前没有更新" msgid "" -"`#1300 `__ : " +"`#1300 `__: " "pgr_chinesePostman crash on test data" msgstr "" -"`#1300 `__ :" +"`#1300 `__:" "pgr_chinesePostman 在测试数据上崩溃" msgid "pgRouting 3.1.0 Release Notes" @@ -17705,7 +17703,7 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.1.0 Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.0%22>`_。" msgid "pgr_dijkstra(combinations)" msgstr "pgr_dijkstra(组合)" @@ -17732,7 +17730,7 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 ` 3.0.6Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.6%22>`_。" msgid "pgRouting 3.0.5 Release Notes" msgstr "pgRouting 3.0.5 发布说明" @@ -17744,7 +17742,7 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.0.5Git关闭里程碑 " "`_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.5%22>`_。" msgid "Backport issue fixes" msgstr "回溯问题修复" @@ -17759,7 +17757,7 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 ` 3.0.4Git关闭里程" "碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.4%22>`_。" msgid "pgRouting 3.0.3 Release Notes" msgstr "pgRouting 3.0.3 发布说明" @@ -17774,13 +17772,13 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.0.2Git关闭里程碑 " "`_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.2%22>`_。" msgid "" -"`#1378 `__ : Visual " +"`#1378 `__: Visual " "Studio build failing" msgstr "" -"`#1378 `__ ：Visual " +"`#1378 `__：Visual " "Studio 构建失败" msgid "pgRouting 3.0.1 Release Notes" @@ -17793,13 +17791,13 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.0.1Git关闭里程碑 " "`_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.1%22>`_。" msgid "" -"`#232 `__ : Honor client " +"`#232 `__: Honor client " "cancel requests in C /C++ code" msgstr "" -"`#232 `__ ：在 C /C++ 代码" +"`#232 `__：在 C /C++ 代码" "中尊重客户端取消请求" msgid "pgRouting 3.0.0 Release Notes" @@ -17812,50 +17810,50 @@ msgid "" msgstr "" "要查看此版本关闭的所有问题和拉取请求，请参阅 Github 上的 `3.0.0Git关闭里程碑 " "`_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.0%22>`_。" msgid "Fixed Issues" msgstr "问题修复" msgid "" -"`#1153 `__ : Renamed " +"`#1153 `__: Renamed " "pgr_eucledianTSP to pgr_TSPeuclidean" msgstr "" -"`#1153 `__ ：将 " +"`#1153 `__：将 " "pgr_eucledianTSP 更名为 pgr_TSPeuclidean" msgid "" -"`#1188 `__ : Removed CGAL " +"`#1188 `__: Removed CGAL " "dependency" msgstr "" -"`#1188 `__ ：删除了 CGAL " +"`#1188 `__：删除了 CGAL " "依赖" msgid "" -"`#1002 `__ : Fixed " +"`#1002 `__: Fixed " "contraction issues:" msgstr "" -"`#1002 `__ ：修复收缩问" +"`#1002 `__：修复收缩问" "题：" msgid "" -"`#1004 `__ : Contracts " +"`#1004 `__: Contracts " "when forbidden vertices do not belong to graph" msgstr "" -"`#1004 `__ _：当禁止的顶点" +"`#1004 `___：当禁止的顶点" "不属于图时的收缩" msgid "" -"`#1005 `__ : Intermideate " +"`#1005 `__: Intermideate " "results eliminated" msgstr "" -"`#1005 `__ ：消除中间结果" +"`#1005 `__：消除中间结果" msgid "" -"`#1006 `__ : No loss of " +"`#1006 `__: No loss of " "information" msgstr "" -"`#1006 `__ ：无信息丢失" +"`#1006 `__：无信息丢失" msgid "New functions" msgstr "新函数" @@ -18194,7 +18192,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.6.3Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22%20>`_。" msgid "" "`#1219 `__ Implicit cast " @@ -18227,7 +18225,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.6.2Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22%20>`_。" msgid "" "`#1152 `__ Fixes driving " @@ -18260,7 +18258,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.6.1Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22%20>`_。" msgid "Fixes server crash on several functions." msgstr "修复了多个函数导致服务器崩溃的问题。" @@ -18356,7 +18354,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 ` 2.6.0Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22%20>`_。" msgid "pgr_lineGraphFull" msgstr "pgr_lineGraphFull" @@ -18413,7 +18411,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.5.5Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22%20>`_。" msgid "Fixes driving distance when vertex is not part of the graph" msgstr "修复顶点不在图中时的行驶距离问题" @@ -18434,7 +18432,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.5.4 Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22%20>`_。" msgid "pgRouting 2.5.3 Release Notes" msgstr "pgRouting 2.5.3 发布说明" @@ -18446,7 +18444,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 ` 2.5.3Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22%20>`_。" msgid "" "Fix for postgresql 11: Removed a compilation error when compiling with " @@ -18463,7 +18461,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.5.2Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22%20>`_。" msgid "Fix for postgresql 10.1: Removed a compiler condition" msgstr "postgresql 10.1 的修复：删除了一个编译器条件" @@ -18478,7 +18476,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.5.1Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22%20>`_。" msgid "Fixed prerequisite minimum version of: cmake" msgstr "修正了 cmake 的最低版本要求" @@ -18571,7 +18569,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.4.2Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22%20>`_。" msgid "Improvement" msgstr "改进" @@ -18596,7 +18594,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `2.4.1Git关闭里程碑 `_ 。" +"utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22%20>`_。" msgid "Fixed compiling error on macOS" msgstr "修正了 macOS 上的编译错误" @@ -19271,7 +19269,7 @@ msgid "" msgstr "" "要查看此版本关闭的问题，请参阅 Github 上的 `1.x Git 已关闭问题 `_ 。以下的发行说明已从之前的 ``RELEASE_NOTES`` 文件中复制，" +"x%22+is%3Aclosed>`_。以下的发行说明已从之前的 ``RELEASE_NOTES`` 文件中复制，" "并作为参考保留。" msgid "Changes for release 1.05" @@ -19385,7 +19383,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``." @@ -19503,7 +19501,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 +19516,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,7 +19534,7 @@ 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 的情况。" @@ -19599,13 +19597,13 @@ msgstr "对于不连通的图，不存在单棵树，而是由每个连通分量 msgid "" "pgRouting community support is available through the `pgRouting website " -"`_ , `documentation `_ , tutorials, mailing lists and others. If you’re looking " +"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " "for :ref:`commercial support `, find below a list of " "companies providing pgRouting development and consulting services." msgstr "" "pgRouting 社区支持可通过 `pgRouting 网站 `_ 、`文档 `_ 、教程、邮件列表等获得。 " +"html>`_、`文档 `_、教程、邮件列表等获得。 " "如果您正在寻求 :ref:`商业支持 `，请在下面找到提供 " "pgRouting 开发和咨询服务的公司列表。" @@ -19616,7 +19614,7 @@ msgid "" "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" -"错误在`问题跟踪器 `_ 中报告和管" +"错误在 `问题跟踪器 `_ 中报告和管" "理。 请按照以下步骤操作：" msgid "" @@ -19687,7 +19685,7 @@ msgid "" msgstr "有关如何使用 pgRouting 的一般问题和主题，请写信给用户邮件列表。" msgid "" -"You can also ask at `GIS StackExchange `_" +"You can also ask at `GIS StackExchange `_ " "and tag the question with ``pgrouting``. Find all questions tagged with " "``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " "or subscribe to the `pgRouting questions feed `_ 上提问，并使" "用 ``pgrouting`` 标签。查找所有带有 ``pgrouting`` 标签的问题，请访问 https://" "gis.stackexchange.com/questions/tagged/pgrouting 或订阅 `pgRouting 问题订阅 " -"`_ 。" +"`_。" msgid "Commercial Support" msgstr "商业支持" @@ -19774,7 +19772,7 @@ msgstr "收缩 - 函数族" msgid "" "This family of functions is used for transforming a given input graph :math:" "`G(V,E)` into a new graph :math:`G'(V',E')`." -msgstr "该函数族用于将给定的输入图 :math:`G(V,E)`转换为新图 :math:`G'(V',E')`。" +msgstr "该函数族用于将给定的输入图 :math:`G(V,E)` 转换为新图 :math:`G'(V',E')`。" msgid "Traversal - Family of functions" msgstr "Traversal - 函数族" @@ -20059,10 +20057,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,7 +20068,7 @@ 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`` （剩余成本）"