Translation status

5,375 Strings 2%
Browse Translate
38,643 Words 1%
298,860 Characters 1%

Strings status

Strings Words Characters
5,375 38,643 298,860
All strings Browse Translate Zen
131 643 4,607
Translated strings Browse Translate Zen
5,244 38,000 294,253
Unfinished strings Browse Translate Zen
4,917 36,371 280,317
Untranslated strings Browse Translate Zen
327 1,629 13,936
Strings marked for edit Browse Translate Zen
5,246 38,006 294,301
Strings with suggestions Browse Translate Zen
46 187 1,341
Strings with any failing checks Browse Translate Zen
1 8 75
Failing check: Unchanged translation Browse Translate Zen
45 179 1,266
Failing check: Mismatched full stop Browse Translate Zen
13 34 257
Failing check: Mismatched colon Browse Translate Zen

Other components

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
Browse all components

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 Creative Commons Attribution Share Alike 4.0 International
Translation process
  • Translations can be made directly.
  • Translation suggestions can be made.
  • Any authenticated user can contribute.
  • The translation uses bilingual files.
Source code repository https://github.com/pgRouting/pgrouting
Repository branch develop
Last remote commit Add missing include for int64_t (#2980) 892b53337e
Regina Obe authored 2 days ago
Last commit in Weblate Translated using Weblate (Spanish) 7b85477003
Celia Virginia Vergara Castillo authored 8 days ago
Weblate repository https://weblate.osgeo.org/git/pgrouting/pgrouting-develop/
File mask locale/*/LC_MESSAGES/pgrouting_doc_strings.po
Translation file Download locale/ja/LC_MESSAGES/pgrouting_doc_strings.po
Last change Sept. 22, 2025, 4:52 p.m.
Last author DeepL
2 days ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 5,375 38,643 298,860
Translated 2% 131 1% 643 1% 4,607
Needs editing 6% 327 4% 1,629 4% 13,936
Read-only 0% 0 0% 0 0% 0
Failing checks 1% 46 1% 187 1% 1,341
Strings with suggestions 97% 5,246 98% 38,006 98% 294,301
Untranslated strings 91% 4,917 94% 36,371 93% 280,317
Last 12 months Previous

Activity in last 12 months

76 changes 52 changes 329 changes 38 changes 0 changes 14 changes 0 changes 54 changes 169 changes 74 changes 11 changes 548 changes 0 changes 734 changes 23 changes 685 changes 121 changes 108 changes 0 changes 1,131 changes 0 changes 56 changes 57 changes 791 changes
Sep Oct Nov Dec Jan Feb Mar Apr May Jun Jul Aug

Quick numbers

38,643
Hosted words
5,375
Hosted strings
2%
Translated
3
Contributors
and previous 30 days

Trends of last 30 days

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges.
時間の複雑さ: :math:`O(V² + E)` ただし、Vは頂点の数、Eは辺の数である。
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
Aims to minimize bandwidth (maximum difference between connected vertex indices.
帯域幅を最小にすることを目的とする（接続された頂点のインデックス間の差の最大値。
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph
``pgr_sloanOrdering`` - 無向グラフのスローン順序を返す
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
|Boost| Boost Graph Inside.
|Boost|ブースト・グラフ・インサイド。
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings.
この方法は、幅優先探索（BFS）トラバーサルに従うが、改良が加えられている。各ステップにおいて、現在の頂点の未訪問の近傍が、その擬似次数の昇順でキューに挿入される。この優先順位付けは、単純なBFS順序付けと比較して、帯域幅が小さくなることが多い。
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
``pgr_kingOrdering`` — Returns the King ordering of an undirected graph.
``pgr_kingOrdering`` - 無向グラフのキングの順序を返す。
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
Boost `Floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_
ブースト `フロイド・ウォーシャル <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_
8 days ago
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, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time.
すなわち、距離とは、ソースから別の頂点まで辿るのに必要な辺の最小数である。このようなグラフは，すべての辺が :math:`1` の重みを持つ重み付きグラフとしても解釈できる．グラフ内のすべての辺が同じ重みを持つわけではない場合、より一般的なアルゴリズムが必要となる。例えば、ダイクストラのアルゴリズムのように :math:`O(|E|log|V||)` の時間で実行される。
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
Using a combinations table on an undirected graph
導かれないグラフ。無向グラフで組合せ表を使う
8 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Japanese
From vertices :math:`\{6, 1\}` to vertices :math:`\{10, 17\}` on an undirected graph
無向グラフ上の頂点 :math:`{6, 1}` から頂点 :math:`{10, 17}` まで
8 days ago
Browse all translation changes