From 08463e5f9f3cac1737a08773e674b8eaee417c0a Mon Sep 17 00:00:00 2001
From: cvvergara <vicky@erosion.dev>
Date: Mon, 23 Sep 2024 15:41:48 -0600
Subject: [PATCH] some manual changes to fix sphinx errors in chinese

---
 .github/workflows/doc-check.yml               |   2 +-
 .../LC_MESSAGES/pgrouting_doc_strings.po      | 424 +++++++++---------
 2 files changed, 214 insertions(+), 212 deletions(-)

diff --git a/.github/workflows/doc-check.yml b/.github/workflows/doc-check.yml
index 88aa3717a4..1c22de909c 100644
--- a/.github/workflows/doc-check.yml
+++ b/.github/workflows/doc-check.yml
@@ -65,7 +65,7 @@ jobs:
           # allways processing english, no matter what the change was
           if [[ "${{ matrix.language }}" == "en" ]]; then echo "PROCESS=true" >> $GITHUB_ENV; exit 0; fi
 
-          if [[ "${{ matrix.language }}" == "zh_Hans" && "${{ github.repository_owner }}" != "pgRouting" ]]; then echo "PROCESS=false" >> $GITHUB_ENV; exit 0; fi
+          # if [[ "${{ matrix.language }}" == "zh_Hans" && "${{ github.repository_owner }}" != "pgRouting" ]]; then echo "PROCESS=false" >> $GITHUB_ENV; exit 0; fi
 
           # when this file changes  all languages are tested
           if git diff --name-only HEAD^ HEAD | grep -q '.github/workflows/doc-check.yml' ; then  echo "PROCESS=true" >> $GITHUB_ENV; exit 0; fi
diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
index 4c890c1bc8..d33ec5c1f0 100644
--- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
+++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
@@ -563,7 +563,7 @@ msgid ""
 "mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton "
 "Kirkman**."
 msgstr ""
-"旅行推销员问题由数学家 **William Rowam Hamilton 爵士**和 **Thomas Penyngton "
+"旅行推销员问题由数学家 **William Rowam Hamilton 爵士** 和 **Thomas Penyngton "
 "Kirkman** 于 18 世纪研究。"
 
 msgid ""
@@ -730,7 +730,7 @@ msgstr "内容"
 msgid ""
 "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it "
 "generalises the travelling salesman problem (TSP)."
-msgstr "车辆路径问题 `VRP` 是 **NP-hard**优化问题，它推广了旅行商问题 (TSP)。"
+msgstr "车辆路径问题 `VRP` 是 **NP-hard** 优化问题，它推广了旅行商问题 (TSP)。"
 
 msgid "The objective of the VRP is to minimize the total route cost."
 msgstr "VRP 的目标是最小化总路由成本。"
@@ -1156,7 +1156,7 @@ msgid "Aggregate cost from ``start_vid`` to ``end_vid``."
 msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。"
 
 msgid "Sequential value starting from **1**."
-msgstr "从**1**开始的顺序值。"
+msgstr "从 **1** 开始的顺序值。"
 
 msgid "``vehicle_seq``"
 msgstr "``vehicle_seq``"
@@ -1179,7 +1179,7 @@ msgid "Current vehicle identifier."
 msgstr "当前车辆标识符。"
 
 msgid "Sumary row has the **total capacity violations**."
-msgstr "摘要行有**总容量违规情况**。"
+msgstr "摘要行有 **总容量违规情况**。"
 
 msgid ""
 "A capacity violation happens when overloading or underloading a vehicle."
@@ -1194,10 +1194,10 @@ msgstr "INTEGER"
 msgid ""
 "Sequential value starting from **1** for the stops made by the current "
 "vehicle. The :math:`m_{th}` stop of the current vehicle."
-msgstr "当前车辆停止的顺序值，从 **1** 开始。 当前第 :math:`m_{th}` 车辆的停止。"
+msgstr "当前车辆停止的顺序值，从 **1** 开始。 当前第:math:`m_{th}`车辆的停止。"
 
 msgid "Sumary row has the **total time windows violations**."
-msgstr "摘要行包含**总时间窗口违规情况**。"
+msgstr "摘要行包含 **总时间窗口违规情况**。"
 
 msgid ""
 "A time window violation happens when arriving after the location has closed."
@@ -1250,7 +1250,7 @@ msgid "Travel time from previous ``stop_seq`` to current ``stop_seq``."
 msgstr "从前一个 ``stop_seq`` 到当前 ``stop_seq`` 的行程时间。"
 
 msgid "Summary has the **total traveling time**:"
-msgstr "总结一下**总的行程时间**："
+msgstr "总结一下 **总的行程时间**："
 
 msgid "The sum of all the ``travel_time``."
 msgstr "所有 ``travel_time`` 的总和。"
@@ -1271,7 +1271,7 @@ msgid "``wait_time``"
 msgstr "``wait_time``"
 
 msgid "Summary row has the **total waiting time**:"
-msgstr "摘要行包含**总等待时间**："
+msgstr "摘要行包含 **总等待时间**："
 
 msgid "The sum of all the ``wait_time``."
 msgstr "所有 ``wait_time`` 的总和。"
@@ -1283,7 +1283,7 @@ msgid "Service duration at current location."
 msgstr "当前位置的服务持续时间。"
 
 msgid "Summary row has the **total service time**:"
-msgstr "摘要行包含**总服务时间**："
+msgstr "摘要行包含 **总服务时间**："
 
 msgid "The sum of all the ``service_time``."
 msgstr "所有``service_time``的总和。"
@@ -1298,10 +1298,10 @@ msgid ":math:`arrival\\_time + wait\\_time + service\\_time`."
 msgstr ":math:`arrival\\_time + wait\\_time + service\\_time`。"
 
 msgid "The ending location has the **total time** used by the current vehicle."
-msgstr "结束位置有当前车辆使用的**总时间**。"
+msgstr "结束位置有当前车辆使用的 **总时间**。"
 
 msgid "Summary row has the **total solution time**:"
-msgstr "摘要行包含**总解决问题时间**："
+msgstr "摘要行包含 **总解决问题时间**："
 
 msgid ""
 ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ "
@@ -1391,12 +1391,12 @@ msgid ""
 "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of "
 "feathers` to `number of boxes` is needed."
 msgstr ""
-"如果车辆的 **容量**以`箱子`来衡量，则需要将`羽毛的千克`换算为`箱子的数量`。"
+"如果车辆的 **容量** 以`箱子`来衡量，则需要将`羽毛的千克`换算为`箱子的数量`。"
 
 msgid ""
 "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of "
 "apples` to `kg` is needed."
-msgstr "如果车辆的**容量**以`kg`为单位，则需要将`一箱苹果`换算为`kg`。"
+msgstr "如果车辆的 **容量** 以 `kg` 为单位，则需要将 `一箱苹果` 换算为 `kg`。"
 
 msgid "Showing how the 2 possible conversions can be done"
 msgstr "显示如何完成两种可能的转换"
@@ -1584,7 +1584,7 @@ msgstr "用于:doc:`pgr_pickDeliver`:"
 msgid ""
 "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`"
+msgstr "给定 :math:`v = d / t` 因此 :math:`t = d / v` 并且 ``因子`` 变为 :math:`1 / v`"
 
 msgid "v"
 msgstr "v"
@@ -1780,8 +1780,8 @@ msgid ""
 "See :ref:`heuristics <astar_heuristics>` available and :ref:`factor "
 "<astar_factor>` handling."
 msgstr ""
-"查看可用的 :ref:`heuristics <astar_heuristics>` 和 :ref:`factor "
-"<astar_factor>` 处理。"
+"查看可用的 :ref:`heuristics <astar_heuristics>` 和 :ref:`factor <astar_factor>` "
+"处理。"
 
 msgid "Advanced documentation"
 msgstr "高级文档"
@@ -1873,8 +1873,9 @@ msgstr "返回图中每对节点的最短路径成本之和。"
 msgid ""
 "Boost returns a :math:`V \\times V` matrix, where the infinity values. "
 "Represent the distance between vertices for which there is no path."
-msgstr "Boost 返回一个 :math:`V \\times V` 矩阵，其中无穷大值。 "
-"表示没有路径的顶点之间的距离。"
+msgstr ""
+"Boost 返回一个 :math:`V \\times V` 矩阵，其中无穷大值。 表示没有路径的顶点之间"
+"的距离。"
 
 msgid ""
 "We return only the non infinity values in form of a set of `(start_vid, "
@@ -1911,7 +1912,7 @@ msgid "``true``"
 msgstr "``true``"
 
 msgid "When ``true`` the graph is considered `Directed`"
-msgstr "当 ``true``时，该图被视为有`有向`"
+msgstr "当 ``true`` 时，该图被视为有`有向`"
 
 msgid "When ``false`` the graph is considered as `Undirected`."
 msgstr "如果为 ``false``，则该图被视为 `无向`。"
@@ -2752,7 +2753,7 @@ msgid "**The main characteristics are:**"
 msgstr "**主要特点是：**"
 
 msgid "Process is done only on edges with **positive** costs."
-msgstr "仅在具有**正**成本的边缘进行处理。"
+msgstr "仅在具有 **正** 成本的边缘进行处理。"
 
 msgid "Running time: :math:`O(E * (E + V * logV))`"
 msgstr "运行时间： :math:`O(E * (E + V * logV))`"
@@ -2911,7 +2912,7 @@ msgid "Dead end"
 msgstr "死端"
 
 msgid "A node is considered a **dead end** node when"
-msgstr "当一个节点被认为是**死端**节点时"
+msgstr "当一个节点被认为是 **死端** 节点时"
 
 msgid "On undirected graphs:"
 msgstr "在无向图上："
@@ -3000,8 +3001,9 @@ msgstr ":math:`\\{x, y\\}`"
 msgid ""
 "From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number of "
 "adjacent vertices is 1. No further checks are needed for those nodes."
-msgstr "从上面来看，节点 :math:`\\{a, b, d\\}` 是死端，因为相邻顶点的数量为 "
-"1。不需要对这些节点进行进一步检查。"
+msgstr ""
+"从上面来看，节点 :math:`\\{a, b, d\\}` 是死端，因为相邻顶点的数量为 1。不需要对"
+"这些节点进行进一步检查。"
 
 msgid ""
 "On the following table, nodes :math:`\\{c, e\\}` because the even that the "
@@ -3014,13 +3016,14 @@ msgstr "操作：死端收缩"
 msgid ""
 "The dead end contraction will stop until there are no more dead end nodes. "
 "For example from the following graph where :math:`w` is the `dead end`_ node:"
-msgstr "死端收缩将停止，直到不再有死端节点。 例如，从下图中，其中 :math:`w` "
-"是`死端`_节点："
+msgstr ""
+"死端收缩将停止，直到不再有死端节点。 例如，从下图中，其中 :math:`w` 是 `死端`_ 节"
+"点："
 
 msgid ""
 "After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and is "
 "contracted:"
-msgstr "收缩 :math:`w` 后，节点 :math:`v` 现在是一个`死端`_ 节点并且已收缩："
+msgstr "收缩 :math:`w` 后，节点 :math:`v` 现在是一个 `死端`_ 节点并且已收缩："
 
 msgid ""
 "After contracting :math:`v`, stop. Node :math:`u` has the information of "
@@ -3028,7 +3031,7 @@ msgid ""
 msgstr "在收缩 :math:`v` 之后，停止。节点 :math:`u` 有已收缩节点的信息。"
 
 msgid "Node :math:`u` has the information of nodes that were contracted."
-msgstr "节点:math:`u`有已收缩节点的信息。"
+msgstr "节点 :math:`u` 有已收缩节点的信息。"
 
 msgid "In the algorithm, linear contraction is represented by 2."
 msgstr "算法中，线性收缩用2表示。"
@@ -3074,10 +3077,10 @@ msgid "The white node is not linear because the linearity is not symetrical."
 msgstr "白色节点不是线性的，因为线性不对称。"
 
 msgid "It is possible to go :math:`y \\rightarrow c \\rightarrow z`"
-msgstr "它是可能去走:math:`y \\rightarrow c \\rightarrow z`"
+msgstr "它是可能去走 :math:`y \\rightarrow c \\rightarrow z`"
 
 msgid "It's not possible to go :math:`z \\rightarrow c \\rightarrow y`"
-msgstr "不可能走:math:`z \\rightarrow c \\rightarrow y`"
+msgstr "不可能走 :math:`z \\rightarrow c \\rightarrow y`"
 
 msgid "Is symmetrical?"
 msgstr "是对称的吗？"
@@ -3109,10 +3112,10 @@ msgstr ""
 "是`线性`_节点："
 
 msgid "Contracting :math:`w`,"
-msgstr "收缩:math:`w`，"
+msgstr "收缩 :math:`w`，"
 
 msgid "The vertex :math:`w` is removed from the graph"
-msgstr "顶点 :math:`w`已从图中移除"
+msgstr "顶点 :math:`w` 已从图中移除"
 
 msgid ""
 "The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are removed "
@@ -3448,7 +3451,7 @@ msgstr "根据函数及其参数，结果可能是对称的。"
 
 msgid ""
 "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`."
-msgstr ":math:`(u, v)`的**总成本**与 :math:`(v, u)`的相同。"
+msgstr ":math:`(u, v)` 的 **总成本** 与 :math:`(v, u)` 的相同。"
 
 msgid ""
 "Any duplicated value in the start or end vertex identifiers are ignored."
@@ -3554,7 +3557,7 @@ msgid "The aggregate cost of `(u, v)` is the same as for `(v, u)`."
 msgstr "`(u, v)`的总成本与 `(v, u)`相同。"
 
 msgid "Any duplicated value in the **start vids** are ignored."
-msgstr "**start vids**中的任何重复值都会被忽略。"
+msgstr "**start vids** 中的任何重复值都会被忽略。"
 
 msgid "Used in:"
 msgstr "用于："
@@ -3599,7 +3602,7 @@ msgstr "如果列存在，则它不能为 NULL。"
 msgid ""
 "If column is not present, a sequential negative **value** will be given "
 "automatically."
-msgstr "如果列不存在，将自动给出连续的负**值**。"
+msgstr "如果列不存在，将自动给出连续的负 **值** 。"
 
 msgid "Identifier of the \"closest\" edge to the point."
 msgstr "距离该点“最近”的边的标识符。"
@@ -3749,7 +3752,7 @@ msgid "Directed graph"
 msgstr "有向图"
 
 msgid "The weighted directed graph, :math:`G_d(V,E)`, is definied by:"
-msgstr "加权有向图， :math:`G_d(V,E)`的定义如下："
+msgstr "加权有向图， :math:`G_d(V,E)` 的定义如下："
 
 msgid "the set of vertices :math:`V`"
 msgstr "顶点集 :math:`V`"
@@ -3889,16 +3892,16 @@ msgid ""
 "`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of "
 "nodes and of edges,"
 msgstr ""
-"换句话说：如果 :math:`start_{vid}` 和 :math:`end_{vid}` "
-"之间存在最短路径，算法会根据节点和边的序列返回该路径、"
+"换句话说：如果 :math:`start_{vid}` 和 :math:`end_{vid}` 之间存在最短路径，算法会"
+"根据节点和边的序列返回该路径、"
 
 msgid ""
 ":math:`path\\_seq` indicates the relative position in the path of the :math:"
 "`node` or :math:`edge`."
-msgstr ":math:`path\\_seq`表示 :math:`node`或:math:`edge`的路径中的相对位置。"
+msgstr ":math:`path\\_seq` 表示 :math:`node` 或 :math:`edge` 的路径中的相对位置。"
 
 msgid ":math:`cost` is the cost of the edge to be used to go to the next node."
-msgstr ":math:`cost`是用于转到下一个节点的边的成本。"
+msgstr ":math:`cost` 是用于转到下一个节点的边的成本。"
 
 msgid ""
 ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node."
@@ -3947,7 +3950,7 @@ msgid "The distance from the **root** to :math:`u` > limit distance."
 msgstr "从 **root** 到 :math:`u` 的距离>限制距离。"
 
 msgid "The distance from the **root** to :math:`v` > limit distance."
-msgstr "从 **root**到 :math:`v`的距离>限制距离。"
+msgstr "从 **root** 到 :math:`v` 的距离>限制距离。"
 
 msgid ""
 "No new nodes are created on the graph, so when is within the limit and is "
@@ -4130,7 +4133,7 @@ msgid "Flow Functions General Information"
 msgstr "流函数一般信息"
 
 msgid "The graph is **directed**."
-msgstr "该图是**有向**的。"
+msgstr "该图是 **有向** 的。"
 
 msgid "Process is done only on edges with positive capacities."
 msgstr "仅在具有正容量的边缘上进行处理。"
@@ -4138,7 +4141,7 @@ msgstr "仅在具有正容量的边缘上进行处理。"
 msgid ""
 "When the maximum flow is 0 then there is no flow and **EMPTY SET** is "
 "returned."
-msgstr "当最大流量为0时则没有流量并返回**EMPTY SET**。"
+msgstr "当最大流量为0时则没有流量并返回 **EMPTY SET** 。"
 
 #, fuzzy
 msgid "There is no flow when source has the same vaule as target."
@@ -4424,11 +4427,10 @@ msgid ""
 "https://pgrouting.org. For other licenses used in pgRouting see the :ref:"
 "`license` page."
 msgstr ""
-"pgRouting 手册根据 `知识共享署名-相同方式共享3.0许可证 "
-"<https://creativecommons.org/licenses/by-sa/3.0/>`_。 您可以随意使用本材料，"
-"但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://"
-"pgrouting.org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 "
-":ref:`license` page.。"
+"pgRouting 手册根据`知识共享署名-相同方式共享3.0许可证 <https://"
+"creativecommons.org/licenses/by-sa/3.0/>`_。 您可以随意使用本材料，但我们要求"
+"您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://pgrouting.org 的链"
+"接。 有关 pgRouting 中使用的其他许可证，请参阅 :ref:`license` page.。"
 
 msgid "General"
 msgstr "常规"
@@ -4748,10 +4750,10 @@ msgid "In ``pgr_aStar`` (`One to One`)"
 msgstr "在``pgr_aStar`` (`一对一`)中"
 
 msgid "``start_vid`` contains the **start vid** parameter value."
-msgstr "``start_vid`` 包含**起始 vid **参数值。"
+msgstr "``start_vid`` 包含 **起始 vid** 参数值。"
 
 msgid "``end_vid`` contains the **end vid** parameter value."
-msgstr "``end_vid`` 包含**结束 vid** 参数值。"
+msgstr "``end_vid`` 包含 **结束 vid** 参数值。"
 
 msgid "In ``pgr_aStar`` (`One to Many`)"
 msgstr "在``pgr_aStar`` (`一对多`)中"
@@ -5177,7 +5179,7 @@ msgid ""
 "compulsory **driving side** and its validity differ for directed and "
 "undirected graphs."
 msgstr ""
-"并且 ``driving_side`` 参数从命名可选变为未命名强制**driving side**，其有效性"
+"并且 ``driving_side`` 参数从命名可选变为未命名强制 **driving side** ，其有效性"
 "对于有向图和无向图是不同的。"
 
 msgid "``pgr_withPointsDD`` (Single vertex)"
@@ -5237,10 +5239,10 @@ msgid "On directed graph ``b`` could be used as **driving side**"
 msgstr "在有向图上 ``b``可以用作 **行驶方向**"
 
 msgid "On undirected graph ``r`` could be used as **driving side**"
-msgstr "在无向图上``r``可以用作**行驶方向**"
+msgstr "在无向图上 ``r`` 可以用作 **行驶方向**"
 
 msgid "Also ``l`` could be used as **driving side**"
-msgstr "此外，``l``也可用作**驾驶侧**"
+msgstr "此外，``l`` 也可用作 **驾驶侧**"
 
 msgid "After Migration"
 msgstr "迁移后"
@@ -5255,7 +5257,7 @@ msgstr "新的输出列是 |result-spantree|"
 msgid ""
 "**driving side** parameter is unnamed compulsory, and valid values differ "
 "for directed and undirected graphs."
-msgstr "**driving side**参数是未命名的强制参数，有向图和无向图的有效值不同。"
+msgstr "**driving side** 参数是未命名的强制参数，有向图和无向图的有效值不同。"
 
 msgid "Does not have a default value."
 msgstr "没有默认值。"
@@ -5279,13 +5281,13 @@ msgstr ""
 msgid ""
 "``depth`` contains the **depth** from the ``start_vid`` vertex to the "
 "``node``."
-msgstr "``depth``包含从``start_vid``顶点到``node``的 **深度**。"
+msgstr "``depth`` 包含从 ``start_vid`` 顶点到 ``node`` 的 **深度**。"
 
 msgid ""
 "To migrate, use an unnamed valid value for **driving side** after the "
 "**distance** parameter:"
 msgstr ""
-"要进行迁移，请在 **distance**参数之后使用一个未命名的有效值作为 **行驶方向"
+"要进行迁移，请在 **distance** 参数之后使用一个未命名的有效值作为 **行驶方向"
 "**："
 
 msgid "To get results from previous versions:"
@@ -5797,7 +5799,7 @@ msgstr "没有几何图形。"
 msgid ""
 "Some graph theory problems require graphs to have weights, called **cost** "
 "in pgRouting."
-msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为**成本**。"
+msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为 **成本** 。"
 
 msgid ""
 "In pgRouting there are several ways to represent a graph on the database:"
@@ -6166,7 +6168,7 @@ msgid ""
 "compatible with pgRouting and when this happens the topology needs to be "
 "adjusted."
 msgstr ""
-"请注意，这些工具**不会**导入与 pgRouting 兼容的结构中的数据，当发生这种情况"
+"请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况"
 "时，需要调整拓扑。"
 
 msgid "Breakup a segments on each segment-segment intersection"
@@ -6478,7 +6480,7 @@ msgid ""
 "application. For example, if the edges have a trait **name**, then that "
 "column is to be copied."
 msgstr ""
-"插入的列和计算方式取决于应用程序。 例如，如果边具有特征**名称**，则将复制该"
+"插入的列和计算方式取决于应用程序。 例如，如果边具有特征 **名称** ，则将复制该"
 "列。"
 
 msgid "For pgRouting calculations"
@@ -6487,7 +6489,7 @@ msgstr "用于 pgRouting 计算"
 msgid ""
 "**factor** based on the position of the intersection of the edges can be "
 "used to adjust the ``cost`` and ``reverse_cost`` columns."
-msgstr "基于边相交位置的**因子**可用于调整``cost`` 和``reverse_cost`` 列。"
+msgstr "基于边相交位置的 **因子** 可用于调整 ``cost`` 和 ``reverse_cost`` 列。"
 
 msgid ""
 "Capacity information, used in the :doc:`flow-family` functions does not need "
@@ -6757,7 +6759,7 @@ msgstr "这是一个内部查询。"
 msgid ""
 "It has no name, so **Edges SQL** gives an idea of what kind of inner query "
 "needs to be used"
-msgstr "它没有名称，因此 **Edges SQL**给出了需要使用哪种内部查询的想法"
+msgstr "它没有名称，因此 **Edges SQL** 给出了需要使用哪种内部查询的想法"
 
 msgid "**start vid**:"
 msgstr "**start vid**:"
@@ -6776,7 +6778,7 @@ msgstr "是第三个参数。"
 msgid ""
 "It has no name, so **end vid** gives an idea of what the third parameter's "
 "value should contain"
-msgstr "它没有名称，因此 **end vid**给出了第三个参数的值应包含的内容"
+msgstr "它没有名称，因此 **end vid** 给出了第三个参数的值应包含的内容"
 
 msgid "Is the fourth parameter."
 msgstr "是第四个参数。"
@@ -6834,22 +6836,22 @@ msgid "When routing from:"
 msgstr "当路由来自："
 
 msgid "From **one** starting vertex"
-msgstr "从**一**起始顶点"
+msgstr "从 **一** 起始顶点"
 
 msgid "to **one** ending vertex"
-msgstr "到**一**结束顶点"
+msgstr "到 **一** 结束顶点"
 
 msgid "One to Many"
 msgstr "一对多"
 
 msgid "to **many** ending vertices"
-msgstr "到**多**结束顶点"
+msgstr "到 **多** 结束顶点"
 
 msgid "Many to One"
 msgstr "多对一"
 
 msgid "From **many** starting vertices"
-msgstr "从**多**起始顶点"
+msgstr "从 **多** 起始顶点"
 
 msgid "Many to Many"
 msgstr "多对多"
@@ -6858,10 +6860,10 @@ msgid "Combinations"
 msgstr "组合"
 
 msgid "From **many** different starting vertices"
-msgstr "从**多个**不同的起始顶点"
+msgstr "从 **多个** 不同的起始顶点"
 
 msgid "to **many** different ending vertices"
-msgstr "到**多个**不同的结束顶点"
+msgstr "到 **多个** 不同的结束顶点"
 
 msgid "Every tuple specifies a pair of a start vertex and an end vertex"
 msgstr "每个元组指定一对起始顶点和结束顶点"
@@ -6973,10 +6975,10 @@ msgid "SQL query as described."
 msgstr "如所述的 SQL 查询。"
 
 msgid "When ``true`` Graph is considered `Directed`"
-msgstr "当为``true``时，图被视为`有向`图"
+msgstr "当为 ``true`` 时，图被视为`有向`图"
 
 msgid "When ``false`` the graph is considered as Undirected."
-msgstr "当为``false``时，图被视为无向图。"
+msgstr "当为 ``false`` 时，图被视为无向图。"
 
 msgid "``strict``"
 msgstr "``strict``"
@@ -6998,7 +7000,7 @@ msgid ""
 "the edge used to reach it. In other words, U turn using the edge with same "
 "identifier is allowed."
 msgstr ""
-"当 为``true``时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话"
+"当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话"
 "说，允许使用具有相同标识符的边来进行掉头。"
 
 msgid ""
@@ -7059,7 +7061,7 @@ msgid ""
 "Identifier of the edge used to go from ``node`` to the next node in the path "
 "sequence. **-1** for the last node of the path."
 msgstr ""
-"用于从路径序列中的``node`` 到下一个节点的边的标识符。**-1** 表示路径的最后一"
+"用于从路径序列中的``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后一"
 "个节点。"
 
 msgid ""
@@ -7084,7 +7086,7 @@ msgid "Relative position in the path."
 msgstr "路径中的相对位置。"
 
 msgid "**1** For the first row of the path."
-msgstr "**1 **对于路径的第一行。"
+msgstr "**1** 对于路径的第一行。"
 
 msgid "``start_pid``"
 msgstr "``start_pid``"
@@ -7131,7 +7133,7 @@ msgid ""
 msgstr "用于从路径序列中的 ``node``到下一个节点的边的标识符。"
 
 msgid "**-1** for the last row of the path."
-msgstr "**-1 **表示路径的最后一行。"
+msgstr "**-1** 表示路径的最后一行。"
 
 msgid "**0** For the first row of the path."
 msgstr "**0** 表示路径的第一行。"
@@ -7174,7 +7176,7 @@ msgstr "路径标识符。"
 
 msgid ""
 "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``."
-msgstr "从``start_vid`` 到 ``end_vid``的第一个路径的值为** 1**。"
+msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1** 。"
 
 msgid "Non selective for multiple paths"
 msgstr "多路径非选择性"
@@ -7344,7 +7346,7 @@ msgstr "要下载此版本："
 msgid ""
 "Go to :ref:`install-short` for more instructions on extracting tar ball and "
 "compiling pgRouting."
-msgstr "转到 :ref:`install-short`以获取有关提取 tar 包和编译 pgRouting 的更多说明。"
+msgstr "转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。"
 
 msgid "git"
 msgstr "git"
@@ -8033,13 +8035,13 @@ msgid ":math:`0` for the last ``node`` of the path."
 msgstr ":math:`0` 为路径的最后一个 ``node``。"
 
 msgid "Aggregate cost from **start vid** to ``node``."
-msgstr "从 **start vid**到``node``的总成本。"
+msgstr "从 **start vid** 到 ``node`` 的总成本。"
 
 msgid "Additional Examples"
 msgstr "其他示例"
 
 msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph"
-msgstr "在无向图中获取从 :math:`6`到:math:`17`的2条路径"
+msgstr "在无向图中获取从 :math:`6` 到 :math:`17` 的2条路径"
 
 msgid "Also get the paths in the heap."
 msgstr "还获取堆中的路径。"
@@ -8127,7 +8129,7 @@ msgid ""
 "as long as the optimal tour, due to the fact that `end_vid` is forced to be "
 "in a fixed position."
 msgstr ""
-"在最坏情况下，**不能保证**解决方案将是最优路径的两倍长，因为 `end_vid` 被强制"
+"在最坏情况下， **不能保证** 解决方案将是最优路径的两倍长，因为 `end_vid` 被强制"
 "设置在固定位置。"
 
 msgid "With ``directed => true``"
@@ -8136,7 +8138,7 @@ msgstr "当``directed => true``"
 msgid ""
 "It is **not garanteed** that the solution will be, in the worse case, twice "
 "as long as the optimal tour"
-msgstr "**不能保证**在最坏情况下解决方案将是最优路径的两倍长"
+msgstr "**不能保证** 在最坏情况下解决方案将是最优路径的两倍长"
 
 msgid "is directed"
 msgstr "有向"
@@ -8309,7 +8311,7 @@ msgid "Name change from pgr_eucledianTSP"
 msgstr "pgr_eucledianTSP 的名称更改"
 
 msgid "New **Official** function"
-msgstr "**官方**新函数"
+msgstr "**官方** 新函数"
 
 msgid ""
 "Any duplicated identifier will be ignored. The coordinates that will be kept"
@@ -8420,7 +8422,7 @@ msgid "Version 3.2.0"
 msgstr "版本3.2.0"
 
 msgid "New **proposed** signature:"
-msgstr "新 **拟议**的签名："
+msgstr "新 **拟议** 的签名："
 
 msgid "``pgr_aStar`` (`Combinations`_)"
 msgstr "``pgr_aStar`` (`组合`_)"
@@ -8429,7 +8431,7 @@ msgid "Version 2.4.0"
 msgstr "版本2.4.0"
 
 msgid "New **Proposed** signatures:"
-msgstr "新**拟议**签名："
+msgstr "新 **拟议** 签名："
 
 msgid "``pgr_aStar`` (`One to Many`_)"
 msgstr "``pgr_aStar`` (`一对多`_)"
@@ -8444,7 +8446,7 @@ msgid "Signature change on ``pgr_astar`` (`One to One`_)"
 msgstr "签名更改``pgr_astar`` (`一对一`_)"
 
 msgid "**Official** ``pgr_aStar`` (`One to One`_)"
-msgstr "**官方**``pgr_aStar`` (`一对一`_)"
+msgstr "**官方** ``pgr_aStar`` (`一对一`_)"
 
 msgid ""
 "The results are equivalent to the union of the results of the `pgr_aStar(` "
@@ -8479,13 +8481,13 @@ msgid ""
 "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with "
 "heuristic :math:`2`"
 msgstr ""
-"在具有heuristic :math:`2` 的**有向**图上，从顶点 :math:`6` 到顶点 :math:`12`"
+"在具有heuristic :math:`2` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`12`"
 
 msgid ""
 "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** "
 "graph with heuristic :math:`3` and factor :math:`3.5`"
 msgstr ""
-"在具有heuristic :math:`3` 和factor :math:`3.5` 的**有向**图上，从顶点 :math:"
+"在具有heuristic :math:`3` 和factor :math:`3.5` 的 **有向** 图上，从顶点 :math:"
 "`6` 到顶点 :math:`\\{10, 12\\}`"
 
 msgid ""
@@ -8499,12 +8501,12 @@ msgid ""
 "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a "
 "**directed** graph with factor :math:`0.5`"
 msgstr ""
-"在具有factor :math:`0.5` 的**有向**图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :"
+"在具有factor :math:`0.5` 的 **有向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :"
 "math:`\\{10, 12\\}`"
 
 msgid ""
 "Using a combinations table on a **directed** graph with factor :math:`0.5`."
-msgstr "在**有向**图上使用组合表，且使用factor :math:`0.5`。"
+msgstr "在 **有向** 图上使用组合表，且使用factor :math:`0.5`。"
 
 msgid "Example 1"
 msgstr "示例1"
@@ -8516,7 +8518,7 @@ msgid "Example 2"
 msgstr "示例2"
 
 msgid "Making **start vids** the same as **end vids**."
-msgstr "使 **start vids**与**end vids**相同。"
+msgstr "使 **start vids** 与 **end vids** 相同。"
 
 msgid "Example 3"
 msgstr "示例3"
@@ -8536,7 +8538,7 @@ msgid "``pgr_aStarCost`` (`Combinations`_)"
 msgstr "``pgr_aStarCost`` (`组合`_)"
 
 msgid "New **proposed** function"
-msgstr "新**拟议**函数"
+msgstr "新 **拟议** 函数"
 
 #, fuzzy
 msgid ""
@@ -8644,10 +8646,10 @@ msgid "Breaking change on signature"
 msgstr "签名的重大更改"
 
 msgid "**Boost 1.54** & **Boost 1.55** are supported"
-msgstr "**Boost 1.54** & **Boost 1.55**被支持"
+msgstr "**Boost 1.54** & **Boost 1.55** 被支持"
 
 msgid "**Boost 1.56+** is preferable"
-msgstr "**Boost 1.56+**更好"
+msgstr "**Boost 1.56+** 更好"
 
 msgid "Boost Geometry is stable on Boost 1.56"
 msgstr "Boost Geometry 在 Boost 1.56 上保持稳定"
@@ -9096,25 +9098,25 @@ msgid "s_in_rules"
 msgstr "s_in_rules"
 
 msgid "``text[]`` source node **in** rules"
-msgstr "``text[]``source节点**输入**规则"
+msgstr "``text[]`` source节点 **输入** 规则"
 
 msgid "s_out_rules"
 msgstr "s_out_rules"
 
 msgid "``text[]`` source node **out** rules"
-msgstr "``text[]``source节点**输出**规则"
+msgstr "``text[]`` source节点 **输出** 规则"
 
 msgid "t_in_rules"
 msgstr "t_in_rules"
 
 msgid "``text[]`` target node **in** rules"
-msgstr "``text[]``target节点**输入**规则"
+msgstr "``text[]`` target节点 **输入** 规则"
 
 msgid "t_out_rules"
 msgstr "t_out_rules"
 
 msgid "``text[]`` target node **out** rules"
-msgstr "``text[]``target节点**输出**规则"
+msgstr "``text[]`` target节点 **输出** 规则"
 
 msgid "oneway"
 msgstr "oneway"
@@ -9151,8 +9153,8 @@ msgid ""
 "``oneway`` value would be counted as ``true`` for the source or target "
 "**in** or **out** condition."
 msgstr ""
-"这些规则被定义为文本字符串数组，如果与 ``oneway``值匹配，则 source或 target**"
-"输入**或**输出**条件将被视为``true``。"
+"这些规则被定义为文本字符串数组，如果与 ``oneway`` 值匹配，则 source或 target **"
+"输入** 或 **输出** 条件将被视为 ``true``。"
 
 msgid ""
 "The vertices table can be created with :doc:`pgr_createVerticesTable` or :"
@@ -9203,7 +9205,7 @@ msgid "Version 2.5.0"
 msgstr "版本2.5.0"
 
 msgid "New **experimental** function"
-msgstr "新**实验**函数"
+msgstr "新 **实验** 函数"
 
 msgid ""
 "Those vertices that belong to more than one biconnected component are called "
@@ -9281,7 +9283,7 @@ msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)"
 msgstr "在``pgr_bdAstar`` (`一对一`_)上的签名更改"
 
 msgid "**Official** ``pgr_bdAstar`` (`One to One`_)"
-msgstr "**官方**``pgr_bdAstar`` (`一对一`_)"
+msgstr "**官方** ``pgr_bdAstar`` (`一对一`_)"
 
 msgid ""
 "The results are equivalent to the union of the results of the `pgr_bdAStar(` "
@@ -9371,7 +9373,7 @@ msgid "pgr_bdDijkstra(`Combinations`_)"
 msgstr "pgr_bdDijkstra(`组合`_)"
 
 msgid "New **Proposed** functions:"
-msgstr "新**拟议**函数："
+msgstr "新 **拟议** 函数："
 
 msgid "``pgr_bdDijkstra`` (`One to Many`_)"
 msgstr "``pgr_bdDijkstra`` (`一对多`_)"
@@ -9418,7 +9420,7 @@ msgid "Returns set of |result-1-1|"
 msgstr "返回 |result-1-1| 的集合"
 
 msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph"
-msgstr "在**有向**图上从顶点 :math:`6`到顶点 :math:`10`"
+msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`10`"
 
 msgid "Returns set of |result-1-m|"
 msgstr "返回 |result-1-m| 的集合"
@@ -9426,14 +9428,14 @@ msgstr "返回 |result-1-m| 的集合"
 msgid ""
 "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** "
 "graph"
-msgstr "在**有向**图上从顶点:math:`6`到顶点:math:`\\{10, 17\\}`"
+msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`"
 
 msgid "Returns set of |result-m-1|"
 msgstr "返回 |result-m-1| 的集合"
 
 msgid ""
 "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph"
-msgstr "在**有向**图上从顶点 :math:`\\{6, 1\\}`到顶点:math:`17`"
+msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`"
 
 msgid ""
 "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an "
@@ -9532,13 +9534,13 @@ msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm."
 msgstr "``pgr_bellmanFord`` — 使用 Bellman-Ford 算法的最短路径。"
 
 msgid "New **experimental** signature:"
-msgstr "新**实验性**签名："
+msgstr "新 **实验性** 签名："
 
 msgid "``pgr_bellmanFord`` (`Combinations`_)"
 msgstr "``pgr_bellmanFord`` (`组合`_)"
 
 msgid "New **experimental** signatures:"
-msgstr "新**实验**签名："
+msgstr "新 **实验** 签名："
 
 msgid "``pgr_bellmanFord`` (`One to One`_)"
 msgstr "``pgr_bellmanFord`` (`一对一`_)"
@@ -9632,9 +9634,9 @@ 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** "
+"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed**"
 "graph"
-msgstr "在**有向**图上从顶点 :math:`6` 到顶点 :math:`\\{ 10, 17\\}`"
+msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{ 10, 17\\}`"
 
 msgid "Using a combinations table on an **undirected** graph."
 msgstr "在 **无向** 图上使用组合表。"
@@ -9655,7 +9657,7 @@ msgid "Version 3.7.0"
 msgstr "版本3.6.0"
 
 msgid "New **experimental** function:"
-msgstr "新的**实验**函数："
+msgstr "新的 **实验** 函数："
 
 msgid ""
 "The Brandes Algorithm takes advantage of the sparse graphs for evaluating "
@@ -9676,7 +9678,7 @@ msgstr ""
 
 #, fuzzy
 msgid "This implementation work for both directed and undirected graphs."
-msgstr "该实现适用于**有向**图和**无向**图。"
+msgstr "该实现适用于 **有向** 图和 **无向** 图。"
 
 #, fuzzy
 msgid "Running time:  :math:`\\Theta(VE)`"
@@ -9940,7 +9942,7 @@ msgid ""
 msgstr "`pgr_bipartite` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。"
 
 msgid "New **experimental** signature"
-msgstr "新的**实验**签名"
+msgstr "新的 **实验** 签名"
 
 msgid ""
 "A bipartite graph is a graph with two sets of vertices which are connected "
@@ -10007,7 +10009,7 @@ msgstr ""
 "目标的流量最大。"
 
 msgid "New **proposed** signature"
-msgstr "新的**拟议**签名"
+msgstr "新的 **拟议** 签名"
 
 msgid "``pgr_boykovKolmogorov`` (`Combinations`_)"
 msgstr "``pgr_boykovKolmogorov`` (`组合`_)"
@@ -10016,10 +10018,10 @@ msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``"
 msgstr "从``pgr_maxFlowBoykovKolmogorov``更名而来"
 
 msgid "**Proposed** function"
-msgstr "**拟议**函数"
+msgstr "**拟议** 函数"
 
 msgid "New **Experimental** function"
-msgstr "新的**实验**函数"
+msgstr "新的 **实验** 函数"
 
 msgid "Running time: Polynomial"
 msgstr "运行时间：多项式时间"
@@ -10111,13 +10113,13 @@ msgid ""
 "From root vertex :math:`6` on a **directed** graph with edges in ascending "
 "order of ``id``"
 msgstr ""
-"从根顶点:math:`6` 开始，该顶点位于一个**有向**图中，其边按 ``id``升序排列"
+"从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列"
 
 msgid ""
 "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with "
 "**depth** :math:`<= 2` and edges in ascending order of ``id``"
 msgstr ""
-"从根顶点开始 :math:`{12, 6\\}` 在一个**无向**图上，**depth** :math:`<=2`，"
+"从根顶点开始 :math:`{12, 6\\}` 在一个 **无向** 图上，**depth** :math:`<=2`，"
 "边按 ``id`` 升序排列"
 
 msgid "DFS optional parameters"
@@ -10442,16 +10444,16 @@ msgid "All numbers on this column are ``DISTINCT``"
 msgstr "此列中的所有数字都是``DISTINCT``"
 
 msgid "When ``type`` = **'v'**."
-msgstr "当``type`` = **'v'**时。"
+msgstr "当 ``type`` = **'v'** 时。"
 
 msgid "Identifier of the modified vertex."
 msgstr "修改顶点的标识符。"
 
 msgid "When ``type`` = **'e'**."
-msgstr "当 ``type`` = **'e'**时。"
+msgstr "当 ``type`` = **'e'** 时。"
 
 msgid "Decreasing sequence starting from **-1**."
-msgstr "从**-1**开始递减序列。"
+msgstr "从 **-1** 开始递减序列。"
 
 msgid ""
 "Representing a pseudo `id` as is not incorporated in the set of original "
@@ -10468,7 +10470,7 @@ msgid ""
 "When ``type`` = **'e'**: Identifier of the source vertex of the current edge "
 "(``source``, ``target``)."
 msgstr ""
-"当 ``type`` = **'e'**时：当前边（``source``，``target``）的source顶点标识符。"
+"当 ``type`` = **'e'** 时：当前边（``source``，``target``）的source顶点标识符。"
 
 msgid ""
 "When ``type`` = **'e'**: Identifier of the target vertex of the current edge "
@@ -10975,7 +10977,7 @@ msgstr ""
 msgid ""
 "This implementation can only be used with a **directed** graph with no "
 "cycles i.e. directed acyclic graph."
-msgstr "这个实现只能用于**有向**图，且没有循环，即有向无环图。"
+msgstr "这个实现只能用于 **有向** 图，且没有循环，即有向无环图。"
 
 msgid ""
 "The algorithm relies on topological sorting the dag to impose a linear "
@@ -11015,18 +11017,18 @@ 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`"
+msgstr "在 **有向** 图上，从顶点 :math:`5` 到顶点 :math:`11`"
 
 msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`"
-msgstr "从顶点:math:`5`到顶点 :math:`\\{7, 11\\}`"
+msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`"
 
 msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`"
-msgstr "从顶点:math:`\\{5, 10\\}`到顶点 :math:`11`"
+msgstr "从顶点 :math:`\\{5, 10\\}` 到顶点 :math:`11`"
 
 msgid ""
 "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an "
 "**undirected** graph"
-msgstr "在 **无向** 图上，从顶点:math:`\\{5, 15\\}`到顶点:math:`\\{11, 17\\}`"
+msgstr "在 **无向** 图上，从顶点 :math:`\\{5, 15\\} `到顶点 :math:`\\{11, 17\\}`"
 
 msgid "Return columns"
 msgstr "返回列"
@@ -11161,7 +11163,7 @@ msgid "Version 3.3.0"
 msgstr "版本 3.3.0"
 
 msgid "Promoted to **proposed** function"
-msgstr "升级至**拟议**函数"
+msgstr "升级至 **拟议** 函数"
 
 msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)"
 msgstr "``pgr_depthFirstSearch`` (`单个顶点`_)"
@@ -11272,13 +11274,13 @@ msgid "``pgr_dijkstra`` (`Combinations`_)"
 msgstr "``pgr_dijkstra`` (`组合`_)"
 
 msgid "**Official** functions"
-msgstr "**官方**函数"
+msgstr "**官方** 函数"
 
 msgid "Version 2.2.0"
 msgstr "版本 2.2.0"
 
 msgid "New **proposed** functions:"
-msgstr "新的**拟议**函数："
+msgstr "新的 **拟议** 函数："
 
 msgid "``pgr_dijkstra`` (`One to Many`_)"
 msgstr "``pgr_dijkstra`` (`一对多`_)"
@@ -11293,7 +11295,7 @@ msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)"
 msgstr "``pgr_dijkstra`` (`一对一`_)的签名更改"
 
 msgid "**Official** ``pgr_dijkstra`` (`One to One`_)"
-msgstr "**官方**``pgr_dijkstra`` (`一对一`_)"
+msgstr "**官方** ``pgr_dijkstra`` (`一对一`_)"
 
 msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
 msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
@@ -11318,7 +11320,7 @@ msgstr "请阅读 :doc:`migration` 关于如何从旧的结果列迁移到新的
 
 msgid ""
 "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**"
-msgstr "在**有向**图上，从顶点 :math:`6`到顶点 :math:`\\{10, 17\\}`"
+msgstr "在 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`"
 
 msgid ""
 "The examples of this section are based on the :doc:`sampledata` network."
@@ -11635,7 +11637,7 @@ msgid "Departing on car from vertex :math:`6` find the nearest subway station."
 msgstr "从顶点:math:`6`乘车出发，找到最近的地铁站。"
 
 msgid "Using a **directed** graph for car routing."
-msgstr "使用**有向**图进行汽车路线规划。"
+msgstr "使用 **有向** 图进行汽车路线规划。"
 
 msgid ""
 "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`"
@@ -11661,7 +11663,7 @@ msgstr ""
 msgid ""
 "Departing on a car from a subway station find the nearest **two** stations "
 "to vertex :math:`2`"
-msgstr "从地铁站开车出发，找到距离顶点 :math:`2`最近的**两个**车站"
+msgstr "从地铁站开车出发，找到距离顶点 :math:`2`最近的 **两个** 车站"
 
 msgid "On line `4`: using the positional parameter: `directed` set to ``true``"
 msgstr "第`4`行：使用位置参数：`directed`设置为`true`"
@@ -11863,7 +11865,7 @@ msgstr ""
 msgid ""
 "Departing on a car from a subway station find the nearest **two** stations "
 "to vertex :math:`6`"
-msgstr "从地铁站开车出发找到距离顶点:math:`6`最近的**两个**车站"
+msgstr "从地铁站开车出发找到距离顶点 :math:`6` 最近的 **两个** 车站"
 
 msgid ""
 "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, "
@@ -11959,7 +11961,7 @@ msgid ""
 "All this examples are about the route that visits the vertices :math:`\\{5, "
 "7, 1, 8, 15\\}` in that order on a **directed** graph."
 msgstr ""
-"所有这些示例都是关于在**有向**图上按顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}"
+"所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}"
 "` 的路径。"
 
 msgid "The main query"
@@ -12006,7 +12008,7 @@ msgid "Signature change pgr_drivingDistance(single vertex)"
 msgstr "签名更改 pgr_drivingDistance（单顶点）"
 
 msgid "New **Official** pgr_drivingDistance(multiple vertices)"
-msgstr "新**官方** pgr_drivingDistance(多顶点)"
+msgstr "新 **官方** pgr_drivingDistance(多顶点)"
 
 msgid "Official:: pgr_drivingDistance(single vertex)"
 msgstr "官方:: pgr_drivingDistance(单顶点)"
@@ -12158,7 +12160,7 @@ msgid ""
 msgstr "``pgr_edgeDisjointPaths`` - 计算两组顶点之间的边不相交路径。"
 
 msgid "New **proposed** function:"
-msgstr "新的**拟议**函数："
+msgstr "新的 **拟议** 函数："
 
 msgid "pgr_edgeDisjointPaths(Combinations)"
 msgstr "pgr_edgeDisjointPaths(组合)"
@@ -12383,7 +12385,7 @@ msgid "``pgr_extractVertices`` — Extracts the vertices information"
 msgstr "``pgr_extractVertices`` — 提取顶点信息"
 
 msgid "Classified as **proposed** function"
-msgstr "列为**拟议**函数"
+msgstr "列为 **拟议** 函数"
 
 msgid ""
 "This is an auxiliary function for extracting the vertex information of the "
@@ -12490,7 +12492,7 @@ msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry."
 msgstr "``pgr_findCloseEdges`` -查找点几何图形的闭合边。"
 
 msgid "New **proposed** signatures:"
-msgstr "新的**拟议**签名："
+msgstr "新的 **拟议** 签名："
 
 msgid "``pgr_findCloseEdges`` (`One point`_)"
 msgstr "``pgr_findCloseEdges`` (`一个点`_)"
@@ -12668,19 +12670,19 @@ msgid ""
 msgstr "`一个点`_：包含边缘上距边缘起点一小部分的点。"
 
 msgid "`Many Points`_: Contains the corresponding **original point**"
-msgstr "`多个点`_：包含对应的**原始点**"
+msgstr "`多个点`_：包含对应的 **原始点**"
 
 msgid ""
 "``LINESTRING`` geometry from the **original point** to the closest point of "
 "the edge with identifier ``edge_id``"
 msgstr ""
-"从**原始点**到具有标识符``edge_id``的边的最近点的``LINESTRING``几何图形"
+"从 **原始点** 到具有标识符 ``edge_id`` 的边的最近点的 ``LINESTRING`` 几何图形"
 
 msgid "One point results"
 msgstr "单一点的结果"
 
 msgid "The green nodes is the **original point**"
-msgstr "绿色节点是**原始点**"
+msgstr "绿色节点是 **原始点**"
 
 msgid ""
 "The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge."
@@ -12689,18 +12691,18 @@ msgstr "几何``geom`` 是 :math:`sp \\rightarrow ep` 边上的一个点。"
 msgid ""
 "The geometry ``edge`` is a line that connects the **original point** with "
 "``geom``"
-msgstr "几何``edge``是连接**original point**和``geom``的线"
+msgstr "几何 ``edge`` 是连接 **original point** 和 ``geom`` 的线"
 
 msgid "Many point results"
 msgstr "多点成果"
 
 msgid "The green nodes are the **original points**"
-msgstr "绿色节点为**原始点**"
+msgstr "绿色节点为 **原始点**"
 
 msgid ""
 "The geometry ``geom``, marked as **g1** and **g2** are the **original "
 "points**"
-msgstr "标为**g1**和**g2**的几何体``geom``是**原始点**"
+msgstr "标为 **g1** 和 **g2** 的几何体 ``geom`` 是 **原始点**"
 
 msgid ""
 "The geometry ``edge``, marked as **edge1** and **edge2** is a line that "
@@ -12729,7 +12731,7 @@ msgid "``NULL`` on ``geom``, ``edge``"
 msgstr "``NULL`` 在 ``geom``, ``edge``上"
 
 msgid "``edge_id`` identifier of the edge close to the **original point**"
-msgstr "``edge_id``靠近**原始点**的边的标识符"
+msgstr "``edge_id`` 靠近 **原始点** 的边的标识符"
 
 msgid ""
 "Two edges are withing :math:`0.5` distance units from the **original "
@@ -12749,12 +12751,12 @@ msgstr ""
 msgid ""
 "``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 "
 "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`："
@@ -12769,12 +12771,12 @@ msgstr ""
 msgid ""
 "``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 "
 "from edge :math:`8`."
-msgstr "``distance``：**原始点** 距离边 :math:`8`有 :math:`0.19..` 长度单位。"
+msgstr "``distance``： **原始点** 距离边 :math:`8` 有 :math:`0.19..` 长度单位。"
 
 msgid "One answer, all columns"
 msgstr "一个答案，所有列"
@@ -12787,25 +12789,25 @@ msgstr "计算所有列"
 
 msgid ""
 "``edge_id`` identifier of the edge **closest** to the **original point**"
-msgstr "``edge_id``与**原始点**最**接近**的边的标识符"
+msgstr "``edge_id`` 与 **原始点** 最 **接近** 的边的标识符"
 
 msgid ""
 "From all edges within :math:`0.5` distance units from the **original "
 "point**: :math:`{5}` is the closest one."
 msgstr ""
-"从距离**原始点**不超过 :math:`0.5` 距离单位的所有边中，边 :math:`{5}` 是最近"
+"从距离 **原始点** 不超过 :math:`0.5` 距离单位的所有边中，边 :math:`{5}` 是最近"
 "的一条。"
 
 msgid ""
 "``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 "
 "the closest point on on edge :math:`5` ``geom``"
 msgstr ""
-"``edge``：包含了从**原始点**到边 :math:`5```geom`` 上最近点的``LINESTRING``几"
+"``edge``：包含了从 **原始点** 到边 :math:`5```geom`` 上最近点的 ``LINESTRING`` 几"
 "何形状"
 
 msgid "At most two answers with all columns"
@@ -12817,13 +12819,13 @@ msgstr "了解结果："
 msgid ""
 "``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 "
 "the closest point on on edge :math:`8` ``geom``"
 msgstr ""
-"``edge``：包含了从**原始点**到边 :math:`8` ``geom``上最近点的``LINESTRING``几"
+"``edge``：包含了从 **原始点** 到边 :math:`8` ``geom`` 上最近点的 ``LINESTRING`` 几"
 "何形状"
 
 msgid "One point dry run execution"
@@ -12869,13 +12871,13 @@ 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 "
 "**original points**:"
 msgstr ""
-"每个**原始点**中，最多有两条边位于距离不超过 :math:`0.5`距离单位的范围内："
+"每个 **原始点** 中，最多有两条边位于距离不超过 :math:`0.5` 距离单位的范围内："
 
 msgid "For ``POINT(1.8 0.4)`` and ``POINT(0.3 1.8)`` only one edge was found."
 msgstr "对于 ``POINT(1.8 0.4)`` 和 ``POINT(0.3 1.8)`` ，只找到一条边。"
@@ -12897,20 +12899,20 @@ msgid "One answer per point, all columns"
 msgstr "每点一个答案，所有列"
 
 msgid "For the **original point** ``POINT(2.9 1.8)``"
-msgstr "对于**原始点** ``POINT(2.9 1.8)``"
+msgstr "对于 **原始点** ``POINT(2.9 1.8)``"
 
 msgid "Edge :math:`5` is the closest edge to the **original point**"
-msgstr "边 :math:`5`是距离**原始点**最近的边"
+msgstr "边 :math:`5`是距离 **原始点** 最近的边"
 
 msgid ""
 "``geom``: Contains the geometry of the **original point** ``POINT(2.9 1.8)``"
-msgstr "``geom``：包含了**原始点**的几何形状，即 ``POINT(2.9 1.8)``"
+msgstr "``geom``：包含了 **原始点** 的几何形状，即 ``POINT(2.9 1.8)``"
 
 msgid ""
 "``edge``: Contains the ``LINESTRING`` geometry of the **original point** "
 "(``geom``) to the closest point on on edge."
 msgstr ""
-"``edge``：包含了**原始点**（``geom``）到最接近的边上的``LINESTRING``几何形"
+"``edge``：包含了 **原始点** （``geom``）到最接近的边上的 ``LINESTRING`` 几何形"
 "状。"
 
 msgid "Many points dry run execution"
@@ -13018,7 +13020,7 @@ msgid ""
 msgstr "``pgr_full_version`` — 获取pgRouting版本信息的详细信息。."
 
 msgid "New **official** function"
-msgstr "**官方**新功能"
+msgstr "**官方** 新功能"
 
 msgid "Get complete details of pgRouting version information"
 msgstr "获取 pgRouting 版本信息的完整详细信息"
@@ -13332,8 +13334,8 @@ msgid ""
 "than or equal to a **distance** from a **root** vertex (or vertices) within "
 "the calculated minimum spanning tree."
 msgstr ""
-"使用 Kruskal 算法，在计算的最小生成树中提取总成本小于或等于距**根**顶点（或多"
-"个顶点）**距离**的节点。"
+"使用 Kruskal 算法，在计算的最小生成树中提取总成本小于或等于距 **根** 顶点（或多"
+"个顶点） **距离** 的节点。"
 
 msgid "Returned tree nodes from a root vertex are on Depth First Search order."
 msgstr "从根顶点返回的树节点遵循深度优先搜索顺序。"
@@ -13393,8 +13395,8 @@ msgid ""
 "**idom**, once **idom** of each vertex is calculated then by making every "
 "**idom** of each vertex as its parent, the dominator tree can be built."
 msgstr ""
-"该算法计算每个顶点的**直接支配者**（称为**idom**），一旦计算出每个顶点的"
-"**idom**，然后通过将每个顶点的**idom**作为其父节点，可以构建支配树。"
+"该算法计算每个顶点的 **直接支配者**（称为 **idom**），一旦计算出每个顶点的"
+" **idom**，然后通过将每个顶点的 **idom** 作为其父节点，可以构建支配树。"
 
 msgid "The algorithm works in directed graph only."
 msgstr "该算法仅适用于有向图。"
@@ -13729,7 +13731,7 @@ msgstr ""
 "点的每个可能的转弯都有一条新边。"
 
 msgid "This function is for **directed** graphs."
-msgstr "该函数适用于**有向**图。"
+msgstr "该函数适用于 **有向** 图。"
 
 msgid ""
 "Results are undefined when a negative vertex id is used in the input graph."
@@ -14082,7 +14084,7 @@ msgid "``pgr_maxFlow`` (`Combinations`_)"
 msgstr "``pgr_maxFlow`` (`组合`_)"
 
 msgid "New **Proposed** function"
-msgstr "新**拟议** 的函数"
+msgstr "新 **拟议** 的函数"
 
 #, fuzzy
 msgid "Calculates the maximum flow from the sources to the targets."
@@ -14090,7 +14092,7 @@ msgstr "计算从 `source(s)`到 `target(s)`的最大流量。"
 
 msgid ""
 "When the maximum flow is **0** then there is no flow and **0** is returned."
-msgstr "当最大流量为**0**时则没有流量，返回**0**。"
+msgstr "当最大流量为 **0** 时则没有流量，返回 **0** 。"
 
 msgid "Uses the :doc:`pgr_pushRelabel <pgr_pushRelabel>` algorithm."
 msgstr "使用:doc:`pgr_pushRelabel <pgr_pushRelabel>`算法。"
@@ -14139,7 +14141,7 @@ msgid "``pgr_maxFlowMinCost`` (`Combinations`_)"
 msgstr "``pgr_maxFlowMinCost`` (`组合`_)"
 
 msgid "**TODO** check which statement is true:"
-msgstr "**TODO **检查哪个陈述是正确的："
+msgstr "**TODO** 检查哪个陈述是正确的："
 
 msgid "The cost value of all input edges must be nonnegative."
 msgstr "所有输入边的成本值必须是非负的。"
@@ -14203,7 +14205,7 @@ msgid "**The cost value of all input edges must be nonnegative.**"
 msgstr "**所有输入边的成本值必须是非负的。**"
 
 msgid "When the maximum flow is 0 then there is no flow and **0** is returned."
-msgstr "当最大流量为0时则没有流量，返回**0**。"
+msgstr "当最大流量为0时则没有流量，返回 **0** 。"
 
 msgid "Uses :doc:`pgr_maxFlowMinCost`."
 msgstr "使用:doc:`pgr_maxFlowMinCost`。"
@@ -14708,7 +14710,7 @@ msgstr ""
 "customers/ 上发布的最佳解决方案信息进行比较"
 
 msgid "The best solution found for **lc101** is a travel time: 828.94"
-msgstr "找到的 **lc101**的最佳解是行程时间：828.94"
+msgstr "找到的 **lc101** 的最佳解是行程时间：828.94"
 
 msgid "This implementation's travel time: 854.54"
 msgstr "此实施的行程时间：854.54"
@@ -14922,7 +14924,7 @@ msgid "Sum of the weights of all edges between the two sets is mincut."
 msgstr "两组之间所有边的权重之和是最小割。"
 
 msgid "A **mincut** is a cut having the least weight."
-msgstr "**最小切割**是重量最小的切割。"
+msgstr "**最小切割** 是重量最小的切割。"
 
 msgid "Values are returned when graph is connected."
 msgstr "连接图形时返回值。"
@@ -14995,7 +14997,7 @@ msgid ""
 msgstr "有向图的强连接组件是一组彼此可达的顶点。"
 
 msgid "Works for **directed** graphs."
-msgstr "适用于**有向**图。"
+msgstr "适用于 **有向** 图。"
 
 msgid "Components are described by vertices identifiers."
 msgstr "组件由顶点标识符描述。"
@@ -15532,7 +15534,7 @@ msgstr ""
 
 msgid ""
 "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths."
-msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP algorithm`。"
+msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP 算法`。"
 
 msgid ""
 "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths "
@@ -15606,10 +15608,10 @@ msgid "Vertices of the graph are:"
 msgstr "图的顶点是："
 
 msgid "**positive** when it belongs to the `Edges SQL`_"
-msgstr "当它属于`Edges SQL`_ 时为**正**"
+msgstr "当它属于 `Edges SQL`_ 时为 **正**"
 
 msgid "**negative** when it belongs to the `Points SQL`_"
-msgstr "当它属于 `Points SQL`_ 为**负**"
+msgstr "当它属于 `Points SQL`_ 为 **负**"
 
 msgid "Driving side can not be ``b``"
 msgstr "驾驶侧不可能为 ``b``"
@@ -15823,10 +15825,10 @@ msgid "pgr_withPoints(Combinations)"
 msgstr "pgr_withPoints（组合）"
 
 msgid "**positive** when it belongs to the edges_sql"
-msgstr "当它属于edges_sql时为**正**"
+msgstr "当它属于edges_sql时为 **正**"
 
 msgid "**negative** when it belongs to the points_sql"
-msgstr "当它属于 points_sql时为**负**"
+msgstr "当它属于 points_sql时为 **负**"
 
 msgid ""
 "When the starting vertex and ending vertex are the same, there is no path. - "
@@ -16067,7 +16069,7 @@ msgstr "返回|matrix-pid|的集合"
 msgid ""
 "There is no **details** flag, unlike the other members of the withPoints "
 "family of functions."
-msgstr "与 withPoints 函数系列的其他成员不同，没有**详细信息**标志。"
+msgstr "与 withPoints 函数系列的其他成员不同，没有 **详细信息** 标志。"
 
 msgid "From point :math:`1` to vertex :math:`10` with defaults"
 msgstr "使用默认值从点 :math:`1`到顶点:math:`10`"
@@ -16162,13 +16164,13 @@ msgid ""
 msgstr "**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵"
 
 msgid "Returning a **symmetrical** cost matrix"
-msgstr "返回**对称**成本矩阵"
+msgstr "返回 **对称** 成本矩阵"
 
 msgid "Using the default ``side`` value on the **points_sql** query"
-msgstr "在**points_sql**查询上使用默认``side``值"
+msgstr "在 **points_sql** 查询上使用默认 ``side`` 值"
 
 msgid "Using the default ``driving_side`` value"
-msgstr "使用默认``driving_side``值"
+msgstr "使用默认 ``driving_side`` 值"
 
 msgid ""
 "Find the matrix cost of the routes from vertex :math:`1` and the two closest "
@@ -16182,7 +16184,7 @@ msgstr "``pgr_withPointsDD`` - 拟议"
 msgid ""
 "``pgr_withPointsDD`` - Returns the driving **distance** from a starting "
 "point."
-msgstr "``pgr_withPointsDD`` -返回从起点开始的行驶**距离**。"
+msgstr "``pgr_withPointsDD`` - 返回从起点开始的行驶 **距离** 。"
 
 msgid ""
 "Signature change: ``driving_side`` parameter changed from named optional to "
@@ -16230,7 +16232,7 @@ msgid ""
 "``**distance**`` from the starting point. The edges extracted will conform "
 "the corresponding spanning tree."
 msgstr ""
-"修改图以包含点，并使用 Dijkstra 算法，提取成本小于或等于距起点``**距离**``值"
+"修改图以包含点，并使用 Dijkstra 算法，提取成本小于或等于距起点 ``**距离**`` 值"
 "的所有节点和点。 提取的边将符合相应的生成树。"
 
 msgid ""
@@ -16425,7 +16427,7 @@ msgid ""
 "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with "
 "**left** side driving."
 msgstr ""
-"在具有**左侧**驾驶的有向图上，从点 :math:`1` 到点 :math:`2` 获取两条路径。"
+"在具有 **左侧** 驾驶的有向图上，从点 :math:`1` 到点 :math:`2` 获取两条路径。"
 
 msgid "For a directed graph."
 msgstr "有向图。"
@@ -16446,19 +16448,19 @@ msgid ""
 "**directed** graph with **right** side driving and **details** set to "
 "**True**"
 msgstr ""
-"在具有**右侧**驾驶的**有向**图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:"
-"`3` 获取一条路径，且**details** 设置为 **True**"
+"在具有 **右侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:"
+"`3` 获取一条路径，且 **details** 设置为 **True**"
 
 msgid ""
 "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and "
 "vertex :math:`1` on a **directed** graph with **left** side driving and "
 "**heap_paths** set to **True**"
 msgstr ""
-"在具有**左侧**驾驶的**有向**图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:"
-"`3` 和顶点 :math:`1` 获取一条路径，且**heap_paths** 设置为 **True**"
+"在具有 **左侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:"
+"`3` 和顶点 :math:`1` 获取一条路径，且 **heap_paths** 设置为 **True**"
 
 msgid "Using a combinations table on an **directed** graph"
-msgstr "在**有向**图上使用组合表"
+msgstr "在 **有向** 图上使用组合表"
 
 msgid "`Points SQL`_ query as described."
 msgstr "按照描述的方式执行 `Points SQL`_ 查询。"
@@ -16543,7 +16545,7 @@ msgstr ""
 msgid ""
 "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that "
 "order on a **directed** graph."
-msgstr "在**有向**图上按顺序访问顶点 :math:`\\{ -6, 15, -1\\}` 的路线。"
+msgstr "在 **有向** 图上按顺序访问顶点 :math:`\\{ -6, 15, -1\\}` 的路线。"
 
 msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_"
 msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 函数"
@@ -16552,7 +16554,7 @@ msgid ""
 "All this examples are about the route that visits the vertices :math:`\\{-1, "
 "7, -3, 16, 15\\}` in that order on a **directed** graph."
 msgstr ""
-"所有这些示例都是关于在**有向**图上按顺序访问顶点 :math:`\\{-1, 7, -3, 16, "
+"所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{-1, 7, -3, 16, "
 "15\\}` 的路线。"
 
 msgid "Prim - Family of functions"
@@ -19802,13 +19804,13 @@ msgid "path"
 msgstr "path"
 
 msgid "represents a section of a **route**."
-msgstr "代表**route**的一部分。"
+msgstr "代表 **route** 的一部分。"
 
 msgid "route"
 msgstr "route"
 
 msgid "is a sequence of **paths**"
-msgstr "是一系列**paths**"
+msgstr "是一系列 **paths**"
 
 msgid "**Used in:**"
 msgstr "**用于：**"
@@ -19868,7 +19870,7 @@ msgid "Kind of graph:"
 msgstr "图的种类："
 
 msgid "**directed** graph"
-msgstr "**有向**图"
+msgstr "**有向** 图"
 
 msgid "**undirected** graph"
 msgstr "**无向** 图"
@@ -19887,10 +19889,10 @@ msgid "Countries with:"
 msgstr "具有以下条件的国家："
 
 msgid "**Right** side driving"
-msgstr "**右侧**驾驶"
+msgstr "**右侧** 驾驶"
 
 msgid "**Left** side driving"
-msgstr "**左侧**驾驶"
+msgstr "**左侧** 驾驶"
 
 msgid "Some points are:"
 msgstr "一些要点是："
@@ -19944,7 +19946,7 @@ msgstr "对于本节，将使用以下城市（参见 "
 ":doc:`sampledata`）一些有趣的点（例如餐馆、超市、邮局等）作为示例。"
 
 msgid "The graph is **directed**"
-msgstr "图是**有向**的"
+msgstr "图是 **有向** 的"
 
 msgid "Red arrows show the ``(source, target)`` of the edge on the edge table"
 msgstr "红色箭头显示边表上的边``(source, target)``"
@@ -19961,10 +19963,10 @@ msgid "On the right for points **2** and **4**."
 msgstr "在右侧为第 **2** 点和第 **4** 点。"
 
 msgid "On the left for points **1**, **3** and **5**."
-msgstr "左侧为第 **1**、 **3** 和 **5** 点。"
+msgstr "左侧为第 **1**、**3** 和 **5** 点。"
 
 msgid "On both sides for point **6**."
-msgstr "在两侧为第**6**点。"
+msgstr "在两侧为第 **6** 点。"
 
 msgid ""
 "The representation on the data base follows the `Points SQL`_ description, "
@@ -19995,25 +19997,25 @@ msgid "Point **2** located on edge ``(16, 17)``"
 msgstr "点 **2** 位于边缘 ``(16, 17)``"
 
 msgid "Point **3** located on edge ``(8, 12)``"
-msgstr "点 **3** 位于边缘``(8, 12)``"
+msgstr "点 **3** 位于边缘 ``(8, 12)``"
 
 msgid "Point **4** located on edge ``(1, 3)``"
-msgstr "点 **4 **位于边 ``(1, 3)``"
+msgstr "点 **4** 位于边 ``(1, 3)``"
 
 msgid "Point **5** located on edge ``(10, 11)``"
 msgstr "点 **5** 位于边缘 ``(10, 11)``"
 
 msgid "Point **6** located on edges ``(6, 7)`` and ``(7, 6)``"
-msgstr "点** 6** 位于边``(6, 7)``和``(7, 6)``"
+msgstr "点 **6** 位于边 ``(6, 7)`` 和 ``(7, 6)``"
 
 msgid "Point **1** located on edge ``(5, 6)``"
-msgstr "点 **1 ** 位于边 ``(5, 6)``"
+msgstr "点 **1** 位于边 ``(5, 6)``"
 
 msgid "Point **2** located on edge ``(17, 16)``"
 msgstr "点 **2** 位于边 ``(17, 16)``"
 
 msgid "Point **4** located on edge ``(3, 1)``"
-msgstr "点 4 位于边``(3, 1)``"
+msgstr "点 **4** 位于边 ``(3, 1)``"
 
 msgid "Like having all points to be considered in both sides ``b``"
 msgstr "就像双方都要考虑所有点 ``b``"
@@ -20025,13 +20027,13 @@ msgid "On the :doc:`TRSP-family` this option is not valid"
 msgstr "在 :doc:`TRSP-family` 上，此选项无效"
 
 msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``"
-msgstr "点 **1** 位于边 ``(5, 6)`` 和 ``(6, 5)``"
+msgstr "点 **1** 位于边``(5, 6)``和 ``(6, 5)``"
 
 msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``"
-msgstr "点 **2** 位于边 ``(17, 16)`` 和 ``16, 17``"
+msgstr "点 **2** 位于边``(17, 16)``和 ``16, 17``"
 
 msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``"
-msgstr "点 **4**位于边``(3, 1)``和``(1, 3)``"
+msgstr "点 **4** 位于边``(3, 1)``和``(1, 3)``"
 
 msgid "Creating temporary vertices"
 msgstr "创建临时顶点"
@@ -20054,7 +20056,7 @@ msgid "On a right hand side driving network"
 msgstr "在右侧行驶网络"
 
 msgid "Arrival to point ``-2`` can be achived only via vertex **16**."
-msgstr "只能通过顶点 **16**才能到达点 ``-2``。"
+msgstr "只能通过顶点 **16** 才能到达点 ``-2``。"
 
 msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept."
 msgstr "不影响边``(17, 16)``，因此边被保留。"
@@ -20084,7 +20086,7 @@ msgid "On a left hand side driving network"
 msgstr "在左侧驾驶网络上"
 
 msgid "Arrival to point ``-2`` can be achived only via vertex **17**."
-msgstr "只能通过顶点 **17 **才能到达点 ``-2`` 。"
+msgstr "只能通过顶点 **17** 才能到达点 ``-2`` 。"
 
 msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept."
 msgstr "不影响边 ``(16, 17)``，因此保留边。"
@@ -20114,7 +20116,7 @@ msgid "When driving side does not matter"
 msgstr "当驾驶侧无关紧要时"
 
 msgid "Arrival to point ``-2`` can be achived via vertices **16** or **17**."
-msgstr "可以通过顶点 **16**或 **17**到达点 ``-2`` 。"
+msgstr "可以通过顶点 **16** 或 **17** 到达点 ``-2`` 。"
 
 msgid ""
 "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are "