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 3% 5,065 37,734 278,766 4,778 20 5,065 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 3% 166 1% 471 1% 4,921
Needs editing 5% 287 2% 861 2% 8,323
Read-only 0% 0 0% 0 0% 0
Failing checks 1% 20 1% 106 1% 786
Strings with suggestions 96% 5,065 98% 37,734 98% 278,766
Untranslated strings 91% 4,778 96% 36,873 95% 270,443
Last 12 months Previous

Activity in last 12 months

26 changes 0 changes 66 changes 0 changes 417 changes 57 changes 76 changes 49 changes 328 changes 43 changes 0 changes 19 changes 0 changes 54 changes 170 changes 79 changes 11 changes 553 changes 0 changes 692 changes 23 changes 685 changes 114 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
3%
Translated
2
Contributors
and previous 30 days

Trends of last 30 days

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
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:`O(|E|)`의 폭 우선 검색을 사용하여 찾을 수 있다는 것은 잘 알려져 있습니다. 즉, 거리는 소스에서 다른 정점까지 이동하는 데 필요한 최소 에지 수입니다. 이러한 그래프를 가중 그래프로도 해석할 수 있는데, 여기서 모든 에지는 가중치 :math:`1`을 갖습니다. 그래프의 모든 에지가 동일한 가중치를 가지지 않는다면 :math:`O(|E|log|V|)` 시간 내에 실행되는 Dijkstra의 알고리즘과 같은 보다 일반적인 알고리즘이 필요합니다.
10 days ago
User avatar mt:deepl

Suggestion added

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
`#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. Korean
The "locale/ko/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. Korean
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. Korean
:doc:`pgr_binaryBreadthFirstSearch` [3]_
:doc:`pgr_dijkstraNear`
10 days ago
User avatar None

String added in the repository

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
..rubric:: Version 3.0.0
..루브릭:: 버전 3.0.0
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
This applies to all signatures of ``pgr_DAGshortestPath``
이는 ``pgr_DAGshortestPath``의 모든 시그니처에 적용됩니다.
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
이 v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ 예제 마이그레이션.
10 days ago
Browse all changes for this language