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 2% 5,095 37,522 278,835 4,825 32 5,097 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 2% 136 1% 683 1% 4,852
Needs editing 5% 270 3% 1,350 4% 11,369
Read-only 0% 0 0% 0 0% 0
Failing checks 1% 32 1% 130 1% 928
Strings with suggestions 97% 5,097 98% 37,528 98% 278,883
Untranslated strings 92% 4,825 94% 36,172 94% 267,466
Last 12 months Previous

Activity in last 12 months

26 changes 0 changes 66 changes 0 changes 417 changes 57 changes 76 changes 52 changes 329 changes 43 changes 0 changes 19 changes 0 changes 54 changes 170 changes 79 changes 11 changes 553 changes 0 changes 740 changes 23 changes 685 changes 125 changes 108 changes
Jun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr May

Quick numbers

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

Trends of last 30 days

+2%
Hosted words
+100%
+2%
Hosted strings
+100%
—
Translated
+2%
—
Contributors
+100%
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
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.
すなわち、距離とは、ソースから別の頂点まで辿るのに必要な辺の最小数である。このようなグラフは，すべての辺が :math:`1` の重みを持つ重み付きグラフとしても解釈できる．グラフ内のすべての辺が同じ重みを持つわけではない場合、ダイクストラのアルゴリズムのように :math:`O(|E|log|V||)` 時間で実行されるような、より一般的なアルゴリズムが必要になる。
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
:doc:`pgr_binaryBreadthFirstSearch` [3]_
:doc:`pgr_kruskalBFS`binaryBreadthFirstSearch` [3]_.
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch
`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch
10 days ago
User avatar None

Resource updated

  1. pgRouting
  2. pgRouting
  3. Japanese
The "locale/ja/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. Japanese
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.
 
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. Japanese
:doc:`pgr_binaryBreadthFirstSearch` [3]_
:doc:`pgr_kruskalBFS`
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. Japanese
`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch
 
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
..rubric:: Version 3.0.0
.ルーブリック:：バージョン 3.0.0
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
This applies to all signatures of ``pgr_DAGshortestPath``
これは ``pgr_DAGshortestPath`` のすべてのシグネチャに適用される。
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
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.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
10 days ago
Browse all changes for this language