diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
index 30ea1d448af..53b09c408c9 100644
--- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
+++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po
@@ -12,7 +12,7 @@ msgstr ""
 "Project-Id-Version: pgRouting v3.6.0-dev\n"
 "Report-Msgid-Bugs-To: \n"
 "POT-Creation-Date: 2024-09-23 01:17+0000\n"
-"PO-Revision-Date: 2024-05-28 16:17+0000\n"
+"PO-Revision-Date: 2024-09-23 02:56+0000\n"
 "Last-Translator: Celia Virginia Vergara Castillo <vicky@erosion.dev>\n"
 "Language-Team: Chinese (Simplified) <https://weblate.osgeo.org/projects/"
 "pgrouting/pgrouting-develop/zh_Hans/>\n"
@@ -1671,7 +1671,7 @@ msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem"
 msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem"
 
 msgid "The queries use the :doc:`sampledata` network."
-msgstr "查询使用:doc:`sampledata` 网络。"
+msgstr "查询使用 :doc:`sampledata` 网络。"
 
 msgid "A* - Family of functions"
 msgstr "A* - 函数族"
@@ -5119,7 +5119,7 @@ msgstr "所使用的列是 ``going`` 和 ``coming``，用于表示边的存在
 msgid ""
 "Flag ``directed`` was used to indicate if it was for a **directed** or "
 "**undirected** graph."
-msgstr "``directed``标志用于指示是**有向**图还是 **无向**图。"
+msgstr "``directed`` 标志用于指示是 **有向** 图还是 **无向** 图。"
 
 msgid "The flag ``directed`` is ignored."
 msgstr "``directed``标志被忽略。"
@@ -5127,7 +5127,7 @@ msgstr "``directed``标志被忽略。"
 msgid ""
 "Regardless of it's value it gives the result considering the graph as "
 "**undirected**."
-msgstr "无论它的值如何，它都会给出将图视为**无向**的结果。"
+msgstr "无论它的值如何，它都会给出将图视为 **无向** 的结果。"
 
 msgid ""
 "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of "
@@ -5863,7 +5863,7 @@ msgstr "当为负时，图上不存在边(``target``, ``source``)。"
 msgid ""
 "The decision of the graph to be **directed** or **undirected** is done when "
 "executing a pgRouting algorithm."
-msgstr "图是**有向**图还是**无向**图的决定是在执行 pgRouting 算法时完成的。"
+msgstr "图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。"
 
 msgid "Graph with ``cost``"
 msgstr "``成本``图"
@@ -6318,7 +6318,7 @@ msgid ""
 msgstr "最后使用存储在顶点表上的数据填充 ``source``和``target`` 。"
 
 msgid "See :doc:`sampledata` for an example for building a topology."
-msgstr "有关构建拓扑的示例，请参阅 :doc:`示例数据`。"
+msgstr "有关构建拓扑的示例，请参阅 :doc:`sampledata`。"
 
 msgid ""
 "Data coming from OSM and using `osm2pgrouting <https://github.com/pgRouting/"
@@ -8516,8 +8516,8 @@ msgid ""
 "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** "
 "graph with heuristic :math:`4`"
 msgstr ""
-"在具有heuristic :math:`4` 的**无向**图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :"
-"math:`10`"
+"在具有heuristic :math:`4` 的 **无向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 "
+":math:`10`"
 
 msgid ""
 "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a "
@@ -8643,7 +8643,7 @@ msgid "cost from `v` to `u` is :math:`0`"
 msgstr "从`v`到`u`的成本是:math:`0`"
 
 msgid "When the graph is **undirected** the cost matrix is symmetric"
-msgstr "当图**无向**时，成本矩阵是对称的"
+msgstr "当图 **无向** 时，成本矩阵是对称的"
 
 msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
 msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
@@ -8652,8 +8652,8 @@ msgid ""
 "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an "
 "**undirected** graph using heuristic :math:`2`"
 msgstr ""
-"在**无向**图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` 创"
-"建对称的成本矩阵"
+"在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` "
+"创建对称的成本矩阵"
 
 msgid "Use with :doc:`pgr_TSP`"
 msgstr "使用 :doc:`pgr_TSP`"
@@ -9039,7 +9039,7 @@ msgstr ""
 "quote_literal 的使用）"
 
 msgid "The examples use the :doc:`sampledata` network."
-msgstr "这些示例使用 :doc:`示例数据`网络。"
+msgstr "这些示例使用 :doc:`sampledata` 网络。"
 
 msgid ":doc:`pgr_analyzeOneWay`"
 msgstr ":doc:`pgr_analyzeOneWay`"
@@ -9239,7 +9239,7 @@ msgstr ""
 "那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。"
 
 msgid "Works for **undirected** graphs."
-msgstr "适用于**无向**图。"
+msgstr "适用于 **无向** 图。"
 
 msgid "``node`` ascending"
 msgstr "``node``升序"
@@ -9462,10 +9462,10 @@ msgstr "在**有向**图上从顶点 :math:`\\{6, 1\\}`到顶点:math:`17`"
 msgid ""
 "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an "
 "**undirected** graph"
-msgstr "在**无向**图上从顶点 :math:`\\{6, 1\\}`到顶点 :math:`\\{10, 17\\}`"
+msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}`到顶点 :math:`\\{10, 17\\}`"
 
 msgid "Using a combinations table on an **undirected** graph"
-msgstr "在**无向**图上使用组合表"
+msgstr "在 **无向** 图上使用组合表"
 
 msgid ""
 "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/"
@@ -9543,7 +9543,7 @@ msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])"
 msgid ""
 "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an "
 "**undirected** graph"
-msgstr "在一个**无向**图上的顶点集合:math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵"
+msgstr "在一个* *无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵"
 
 msgid "Use with :doc:`pgr_TSP`."
 msgstr "与 :doc:`pgr_TSP` 一起使用。"
@@ -9661,7 +9661,7 @@ msgid ""
 msgstr "在**有向**图上从顶点 :math:`6` 到顶点 :math:`\\{ 10, 17\\}`"
 
 msgid "Using a combinations table on an **undirected** graph."
-msgstr "在**无向**图上使用组合表。"
+msgstr "在 **无向** 图上使用组合表。"
 
 msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
 msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
@@ -10142,8 +10142,8 @@ 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`，边"
-"按``id``升序排列"
+"从根顶点开始 :math:`{12, 6\\}` 在一个**无向**图上，**depth** :math:`<=2`，"
+"边按 ``id`` 升序排列"
 
 msgid "DFS optional parameters"
 msgstr "DFS 可选参数"
@@ -10926,7 +10926,7 @@ msgstr ""
 "顺序排列在队列中。"
 
 msgid "The implementation is for **undirected** graphs."
-msgstr "该实现适用于**无向**图。"
+msgstr "该实现适用于 **无向** 图。"
 
 msgid ""
 "The bandwidth minimization problems are considered NP-complete problems."
@@ -11051,7 +11051,7 @@ 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 "返回列"
@@ -11071,7 +11071,7 @@ msgid ""
 msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。"
 
 msgid "Calculates the degree of the vertices of an **undirected** graph"
-msgstr "计算**无向**图顶点的度数"
+msgstr "计算 **无向** 图顶点的度数"
 
 msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])"
 msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])"
@@ -11207,7 +11207,7 @@ msgstr ""
 
 msgid ""
 "The implementation works for both **directed** and **undirected** graphs."
-msgstr "该实现适用于**有向**图和**无向**图。"
+msgstr "该实现适用于 **有向** 图和 **无向** 图。"
 
 msgid ""
 "Provides the Depth First Search traversal order from a root vertex or from a "
@@ -11347,7 +11347,7 @@ msgstr "在**有向**图上，从顶点 :math:`6`到顶点 :math:`\\{10, 17\\}`"
 
 msgid ""
 "The examples of this section are based on the :doc:`sampledata` network."
-msgstr "本节的示例基于 :doc:`示例数据` 网络。"
+msgstr "本节的示例基于 :doc:`sampledata` 网络。"
 
 msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns"
 msgstr "对于带有 ``cost``和``reverse_cost``列的**有向**图"
@@ -11394,7 +11394,7 @@ msgstr ""
 "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`"
 
 msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns"
-msgstr "对于带有 ``cost``和``reverse_cost``列的**无向**图"
+msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **无向** 图"
 
 msgid "Undirected graph with cost and reverse cost columns"
 msgstr "带成本列和反向成本列的无向图"
@@ -11454,7 +11454,7 @@ msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19"
 msgstr "24) 使用 `组合`_ 来获取示例17到19的解决方案"
 
 msgid "For **undirected** graphs only with ``cost`` column"
-msgstr "仅适用于带有``cost``列的**无向**图"
+msgstr "仅适用于带有 ` `cost`` 列的 **无向** 图"
 
 msgid "Undirected graph only with cost column"
 msgstr "仅有成本列的无向图"
@@ -11583,7 +11583,7 @@ msgid "Uses Dijkstra algorithm."
 msgstr "使用 Dijkstra 算法。"
 
 msgid "Works for **directed** and **undirected** graphs."
-msgstr "适用于**有向**和**无向**图。"
+msgstr "适用于 **有向** 和 **无向** 图。"
 
 msgid "When there are more than one path to the same vertex with same cost:"
 msgstr "当有多条路径通向同一顶点且成本相同时："
@@ -11711,7 +11711,7 @@ msgid "Find the best pedestrian connection between two lines of buses"
 msgstr "在两条公交线路之间寻找最佳的行人通道"
 
 msgid "Unsing an **undirected** graph for pedestrian routing"
-msgstr "使用**无向**图进行行人路线规划"
+msgstr "使用 **无向** 图进行行人路线规划"
 
 msgid "The first subway line stations are at :math:`\\{15, 16\\}`"
 msgstr "第一条地铁线的站点位于 :math:`\\{15, 16\\}`"
@@ -12111,7 +12111,7 @@ msgstr ""
 "条边没有相同的颜色。"
 
 msgid "The implementation is for **undirected** and **loop-free** graphs"
-msgstr "针对**无向**和**无环**图实施"
+msgstr "针对 **无向** 和 **无环** 图实施"
 
 msgid "loop free"
 msgstr "无环"
@@ -12172,7 +12172,7 @@ msgid "Returns set of |result-edge-color|"
 msgstr "Returns set of |result-edge-color|"
 
 msgid "Graph coloring of pgRouting :doc:`sampledata`"
-msgstr "pgRouting :doc:`示例数据`的图着色"
+msgstr "pgRouting :doc:`sampledata`的图着色"
 
 msgid "``pgr_edgeDisjointPaths``"
 msgstr "``pgr_edgeDisjointPaths``"
@@ -13033,7 +13033,7 @@ msgstr ""
 "floyd_warshall_shortest.html>`_"
 
 msgid "Queries uses the :doc:`sampledata` network."
-msgstr "查询使用 :doc:`示例数据`网络。"
+msgstr "查询使用 :doc:`sampledata` 网络。"
 
 msgid "``pgr_full_version``"
 msgstr "``pgr_full_version``"
@@ -13170,7 +13170,7 @@ msgid "Returns set of |generic-result|"
 msgstr "返回 |eneric-result| 的集合"
 
 msgid "Circuits present in the pgRouting :doc:`sampledata`"
-msgstr "pgRouting :doc:`示例数据`中存在的电路"
+msgstr "pgRouting :doc:`sampledata` 中存在的电路"
 
 msgid "Id of the circuit starting from ``1``"
 msgstr "电路id从``1``开始"
@@ -13222,7 +13222,7 @@ msgid ""
 msgstr "它将根据图形的平面性返回一个布尔值。"
 
 msgid "Applicable only for **undirected** graphs."
-msgstr "仅适用于**无向**图。"
+msgstr "仅适用于 **无向** 图。"
 
 msgid "The algorithm does not considers traversal costs in the calculations."
 msgstr "该算法在计算中不考虑遍历成本。"
@@ -13781,8 +13781,8 @@ msgid ""
 "examples include the subgraph including edges 4, 7, 8, and 10 with "
 "``reverse_cost``."
 msgstr ""
-"本节的示例基于 :doc:`示例数据`网络。 这些示例包括包含具有``reverse_cost``的"
-"边 4、7、8 和 10 的子图。"
+"本节的示例基于 :doc:`sampledata` 网络。 这些示例包括包含具有 ``reverse_cost``"
+" 的边 4、7、8 和 10 的子图。"
 
 msgid "The data"
 msgstr "数据"
@@ -14015,7 +14015,7 @@ msgstr "Returns set of |result-component-make|"
 msgid ""
 "Query done on :doc:`sampledata` network gives the list of edges that are "
 "needed to connect the graph."
-msgstr "在:doc:`示例数据`网络上完成的查询给出了连接图所需的边列表。"
+msgstr "在 :doc:`sampledata` 网络上完成的查询给出了连接图所需的边列表。"
 
 msgid "https://www.boost.org/libs/graph/doc/make_connected.html"
 msgstr "https://www.boost.org/libs/graph/doc/make_connected.html"
@@ -14355,7 +14355,7 @@ msgid "Examples"
 msgstr "示例"
 
 msgid "Let's create the topology for the data in :doc:`sampledata`"
-msgstr "让我们为 :doc:`示例数据`中的数据创建拓扑"
+msgstr "让我们为 :doc:`sampledata` 中的数据创建拓扑"
 
 msgid "Now we can analyze the network."
 msgstr "现在我们可以分析网络了。"
@@ -14870,7 +14870,7 @@ msgstr ""
 "得没有边连接两个相同颜色的顶点。"
 
 msgid "The implementation is applicable only for **undirected** graphs."
-msgstr "该实现仅适用于**无向**图。"
+msgstr "该实现仅适用于 **无向** 图。"
 
 msgid ""
 "Provides the color to be assigned to all the vertices present in the graph."
@@ -15634,7 +15634,7 @@ msgid "**positive** when it belongs to the `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``"
@@ -15977,7 +15977,7 @@ msgid "``b`` for both."
 msgstr "``b``对于两者。"
 
 msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_."
-msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 。"
+msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges`。"
 
 msgid ""
 "All the examples are about traveling from point :math:`1` and vertex :math:"
@@ -16041,7 +16041,7 @@ msgstr ""
 "如果返回的值存储在表中，则唯一索引将是这一对：`(start_vid, end_vid)`.。"
 
 msgid "For **undirected** graphs, the results are **symmetric**."
-msgstr "对于**无向**图，结果是**对称**的。"
+msgstr "对于 **无向** 图，结果是 **对称** 的。"
 
 msgid ""
 "For optimization purposes, any duplicated value in the `start_vids` or "
@@ -16184,8 +16184,7 @@ msgstr ""
 msgid ""
 "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` "
 "on an **undirected** graph"
-msgstr ""
-"**无向**图上的点 :math:`\\{1, 6\\}`和顶点:math:`\\{10, 11\\}`的成本矩阵"
+msgstr "**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵"
 
 msgid "Returning a **symmetrical** cost matrix"
 msgstr "返回**对称**成本矩阵"
@@ -16407,8 +16406,7 @@ msgstr ""
 msgid ""
 "Modifies the graph to include the points defined in the `Points SQL`_ and "
 "using Yen algorithm, finds the :math:`K` shortest paths."
-msgstr ""
-"修改图以包括`Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K`最短路径。"
+msgstr "修改图以包括 `Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K`最短路径。"
 
 msgid ""
 "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, "
@@ -19420,16 +19418,16 @@ msgid "Identifier of the ending vertex of the geometry ``geom``"
 msgstr "几何体 ``geom`` 终止顶点的标识符"
 
 msgid "Cost to traverse from `source` to ``target``."
-msgstr "从`source` 到 ``target`` 的遍历成本。"
+msgstr "从 `source` 到 ``target`` 的遍历成本。"
 
 msgid "Cost to traverse from `target` to ``source``."
-msgstr "从 `target`到 ``source``的遍历成本。"
+msgstr "从 `target` 到 ``source`` 的遍历成本。"
 
 msgid "Flow capacity from `source` to ``target``."
-msgstr "从`source`到``target``的流量。"
+msgstr "从 `source` 到 ``target`` 的流量。"
 
 msgid "Flow capacity from `target` to ``source``."
-msgstr "从`target`到``source``的流量。"
+msgstr "从 `target` 到 ``source`` 的流量。"
 
 msgid "``category``"
 msgstr "``category``"
@@ -19443,18 +19441,16 @@ msgstr ":math:`x` 几何图形起始顶点的坐标。"
 msgid ""
 "For convinience it is saved on the table but can be calculated as "
 "``ST_X(ST_StartPoint(geom))``."
-msgstr ""
-"为了方便起见，它被保存在表格中，但也可以计算为 ``ST_X(ST_StartPoint(geom)) "
-"``。"
+msgstr "为了方便起见，它被保存在表格中，但也可以计算为 "
+"``ST_X(ST_StartPoint(geom))``。"
 
 msgid ":math:`y` coordinate of the ending vertex of the geometry."
-msgstr ":math:`y`几何图形结束顶点的坐标。"
+msgstr ":math:`y` 几何图形结束顶点的坐标。"
 
 msgid ""
 "For convinience it is saved on the table but can be calculated as "
 "``ST_Y(ST_EndPoint(geom))``."
-msgstr ""
-"为方便起见，它保存在表格中，但也可以计算为``ST_Y(ST_EndPoint(geom))``。"
+msgstr "为方便起见，它保存在表格中，但也可以计算为 ``ST_Y(ST_EndPoint(geom))``。"
 
 msgid "The geometry of the segments."
 msgstr "分段的几何形状。"
@@ -19468,11 +19464,11 @@ msgid ""
 msgstr "可以选择在不同的列上创建索引。建议的做法是"
 
 msgid "``id`` indexed."
-msgstr "``id``列创建索引 。"
+msgstr "``id`` 列创建索引 。"
 
 msgid ""
 "``source`` and ``target`` columns indexed to speed up pgRouting queries."
-msgstr "``source``和``target``列建立索引以加快 pgRouting 查询。"
+msgstr "``source`` 和 ``target`` 列建立索引以加快 pgRouting 查询。"
 
 msgid ""
 "``geom`` indexed to speed up gemetry processes that might be needed in the "
@@ -19480,7 +19476,7 @@ msgid ""
 msgstr "``geom`` 列建立索引以加快前端可能需要的 gemetry 处理。"
 
 msgid "For this small example the indexes are skipped, except for ``id``"
-msgstr "在这个小例子中，除了 ``id``以外，其他索引都被跳过"
+msgstr "在这个小例子中，除了 ``id`` 以外，其他索引都被跳过"
 
 msgid "Edges data"
 msgstr "边数据"
@@ -19586,7 +19582,7 @@ msgid "Directed, with cost and reverse_cost"
 msgstr "具有cost和reverse_cost的有向图"
 
 msgid "Undirected graph with ``cost`` and ``reverse_cost``"
-msgstr "具有``cost``和``reverse_cost``的无向图"
+msgstr "具有 ``cost`` 和 ``reverse_cost`` 的无向图"
 
 msgid ""
 "When working with city networks, this is recommended for point of view of "
@@ -19603,7 +19599,7 @@ msgid "Directed, with cost"
 msgstr "有向，有成本"
 
 msgid "Undirected graph with ``cost``"
-msgstr "带有 ``cost``的无向图"
+msgstr "带有 ``cost`` 的无向图"
 
 msgid "Undirected, with cost"
 msgstr "无向，有成本"
@@ -19900,7 +19896,7 @@ msgid "**directed** graph"
 msgstr "**有向**图"
 
 msgid "**undirected** graph"
-msgstr "**无向**图"
+msgstr "**无向** 图"
 
 msgid "Arriving at the point:"
 msgstr "到达点："
@@ -19940,7 +19936,7 @@ msgid "**Temporal**: for example points given through a web application"
 msgstr "**时间**：例如通过 Web 应用程序给出的点"
 
 msgid "The numbering of the points are handled with negative sign."
-msgstr "在点 SQL 中使用pgr_findCloseEdges。"
+msgstr ""
 
 msgid ""
 "This sign change is to avoid confusion when there is a vertex with the same "
@@ -19960,7 +19956,7 @@ msgid "positive sign is a vertex of the original graph"
 msgstr "正号是原始图的顶点"
 
 msgid "negative sign is a point of the `Points SQL`_"
-msgstr "负号是`Points SQL`_ 的一个点"
+msgstr "负号是 `Points SQL`_ 的一个点"
 
 msgid "About points"
 msgstr "关于积分"
@@ -19969,9 +19965,8 @@ msgid ""
 "For this section the following city (see :doc:`sampledata`) some interesing "
 "points such as restaurant, supermarket, post office, etc. will be used as "
 "example."
-msgstr ""
-"对于本节，将使用以下城市（参见:doc:`示例数据`）一些有趣的点（例如餐馆、超市、"
-"邮局等）作为示例。"
+msgstr "对于本节，将使用以下城市（参见 "
+":doc:`sampledata`）一些有趣的点（例如餐馆、超市、邮局等）作为示例。"
 
 msgid "The graph is **directed**"
 msgstr "图是**有向**的"
@@ -20049,10 +20044,10 @@ msgid "Like having all points to be considered in both sides ``b``"
 msgstr "就像双方都要考虑所有点 ``b``"
 
 msgid "Prefered usage on **undirected** graphs"
-msgstr "**无向**图上的首选用法"
+msgstr "**无向** 图上的首选用法"
 
 msgid "On the :doc:`TRSP-family` this option is not valid"
-msgstr "在 :doc:`TRSP-family`上，此选项无效"
+msgstr "在 :doc:`TRSP-family` 上，此选项无效"
 
 msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``"
 msgstr "点**1**位于边``(5, 6)``和 ``(6, 5)``"
@@ -20188,19 +20183,19 @@ msgid "Depending on the name:"
 msgstr "取决于名称："
 
 msgid "pgr_withPoints is pgr_dijkstra **with points**"
-msgstr "pgr_withPoints 是**带有点**的 pgr_dijkstra"
+msgstr "pgr_withPoints 是 **带有点** 的 pgr_dijkstra"
 
 msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**"
-msgstr "pgr_withPointsCost 是**带有点**的 pgr_dijkstraCost"
+msgstr "pgr_withPointsCost 是 **带有点** 的 pgr_dijkstraCost"
 
 msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**"
-msgstr "pgr_withPointsCostMatrix 是**带有点**的 pgr_dijkstraCostMatrix"
+msgstr "pgr_withPointsCostMatrix 是 **带有点** 的 pgr_dijkstraCostMatrix"
 
 msgid "pgr_withPointsKSP is pgr_ksp **with points**"
-msgstr "pgr_withPointsKSP 是**带有点**的 pgr_ksp"
+msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp"
 
 msgid "pgr_withPointsDD is pgr_drivingDistance **with points**"
-msgstr "pgr_withPointsDD 是**带有点**的 pgr_drivenDistance"
+msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance"
 
 #, fuzzy
 msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**"