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,224 38,209 294,308 4,880 30 5,224 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
yesterday

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 5,375 38,643 298,860
Translated 2% 151 1% 434 1% 4,552
Needs editing 6% 344 2% 1,088 3% 10,440
Read-only 0% 0 0% 0 0% 0
Failing checks 1% 30 1% 149 1% 1,111
Strings with suggestions 97% 5,224 98% 38,209 98% 294,308
Untranslated strings 90% 4,880 96% 37,121 94% 283,868
Last 12 months Previous

Activity in last 12 months

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 0 changes 1,131 changes 0 changes 56 changes 57 changes 791 changes 49 changes 234 changes
Oct Nov Dec Jan Feb Mar Apr May Jun Jul Aug Sep

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
+3%
+100%
Contributors
—
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
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는 에지 수입니다.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
Aims to minimize bandwidth (maximum difference between connected vertex indices.
대역폭(연결된 버텍스 인덱스 간의 최대 차이)을 최소화하는 것을 목표로 합니다.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph
:doc:`pgr_bridges``pgr_sloanOrdering`` - 무방향이 없는 그래프의 브릿지슬론 순서를 반환합니다.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
|Boost| Boost Graph Inside.
|부스트| 부스트 그래프 내부.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
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 순서에 비해 대역폭이 더 작은 경우가 많습니다.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
``pgr_kingOrdering`` — Returns the King ordering of an undirected graph.
:doc:`pgr_bridges``pgr_kingOrdering`` - 무방향 그래프의 브릿지이 지정되지 않은 그래프의 킹 순서를 반환합니다.
2 weeks ago
User avatar mt:deepl

Suggestion added

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
Using a combinations table on an undirected graph
:doc:`pgr_bridges` - 무방향 그래프의 브릿지.방향이 지정되지 않은 그래프에서 조합 테이블 사용
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Korean
From vertices :math:`\{6, 1\}` to vertices :math:`\{10, 17\}` on an undirected graph
방향이 없는 그래프의 꼭짓점 :math:`\{6, 1\}`에서 꼭짓점 :math:`\{10, 17\}`까지
2 weeks ago
Browse all changes for this language