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 0% 5,231 38,205 283,687 5,231 0 5,231 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 0% 0 0% 0 0% 0
Needs editing 0% 0 0% 0 0% 0
Read-only 0% 0 0% 0 0% 0
Failing checks 0% 0 0% 0 0% 0
Strings with suggestions 100% 5,231 100% 38,205 100% 283,687
Untranslated strings 100% 5,231 100% 38,205 100% 283,687
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 57 changes 10,529 changes 48 changes 328 changes 43 changes 0 changes 19 changes 0 changes 54 changes 170 changes 78 changes 11 changes 553 changes 0 changes 675 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
0%
Translated
2
Contributors
and previous 30 days

Trends of last 30 days

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
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.
Es ist bekannt, dass in einem ungewichteten Graphen die kürzesten Pfade zwischen einer einzelnen Quelle und allen anderen Knoten mit Hilfe von Breadth First Search in :math:`O(|E|)` gefunden werden können, d.h. die Entfernung ist die minimale Anzahl von Kanten, die man von der Quelle zu einem anderen Knoten zurücklegen muss. Wir können einen solchen Graphen auch als einen gewichteten Graphen interpretieren, bei dem jede Kante das Gewicht :math:`1` hat. Wenn nicht alle Kanten im Graphen das gleiche Gewicht haben, benötigen wir einen allgemeineren Algorithmus, wie den Dijkstra-Algorithmus, der in :math:`O(|E|log|V|)` Zeit läuft.
10 days ago
User avatar mt:deepl

Suggestion added

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

Suggestion added

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

String added in the repository

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
..rubric:: Version 3.0.0
..rubrik:: Version 3.0.0
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
This applies to all signatures of ``pgr_DAGshortestPath``
Dies gilt für alle Signaturen von ``pgr_DAGshortestPath``
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
Migrieren von `diesem v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ Beispiel.
10 days ago
Browse all changes for this language