Component Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
Glossary index CC-BY-SA-4.0 0 0 0 0 0 0 0
pgRouting CC-BY-SA-4.0 94% 269 1,610 16,163 50 27 269 0

Overview

Project website docs.pgrouting.org/dev/en/index.html
Instructions for translators

TBD
Project maintainers User avatar josekrv User avatar cvvergara User avatar sanak
Translation license CC-BY-SA-4.0 index pgRouting
10 days ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 5,231 38,205 283,687
Translated 94% 4,962 95% 36,595 94% 267,524
Needs editing 4% 219 2% 1,144 4% 12,858
Read-only 0% 0 0% 0 0% 0
Failing checks 1% 27 1% 177 1% 1,258
Strings with suggestions 5% 269 4% 1,610 5% 16,163
Untranslated strings 1% 50 1% 466 1% 3,305
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 57 changes 5,540 changes 974 changes 8,555 changes 170 changes 0 changes 19 changes 0 changes 519 changes 241 changes 79 changes 11 changes 754 changes 0 changes 662 changes 34 changes 2,748 changes 176 changes 310 changes
Jun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr May

Quick numbers

38,205
Hosted words
5,231
Hosted strings
94%
Translated
2
Contributors
and previous 30 days

Trends of last 30 days

+2%
Hosted words
+100%
+2%
Hosted strings
+100%
+1%
Translated
+94%
−100%
Contributors
+100%
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, that we need a more general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time.
众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权重为 :math:`1`。如果图中不是并非所有边的权重都相同，我们就需要一种更通用的算法，比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)` 的 Dijkstra 算法。
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
:doc:`pgr_binaryBreadthFirstSearch` [3]_
:doc:`pgr_binaryBreadthFirstSearch` [3]_
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch
`#2683908 <https://github.com/pgRouting/pgrouting/issues/2683908>`__: pgr_trspbinaryBreadthFirstSearch
10 days ago
User avatar None

Resource updated

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
The "locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po" file was changed. 10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, that we need a more general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time.
众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
:doc:`pgr_binaryBreadthFirstSearch` [3]_
pgr_binaryBreadthFirstSearch
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch
`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trsp
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
..rubric:: Version 3.0.0
.rubric:：版本 3.0.0
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
This applies to all signatures of ``pgr_DAGshortestPath``
这适用于 `pgr_DAGshortestPath`` 的所有签名
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Chinese (Simplified)
Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
使用 `这个迁移 `this v3.8 <https://docs.pgrouting.org/3.58/en/pgr_withPointsDD.html#single-vertexdagShortestPath.html#one-to-one>`__ 示例。
10 days ago
Browse all changes for this language