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,375 38,643 298,860 5,375 0 5,375 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
15 hours ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 5,375 38,643 298,860
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,375 100% 38,643 100% 298,860
Untranslated strings 100% 5,375 100% 38,643 100% 298,860
Last 12 months Previous

Activity in last 12 months

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

Quick numbers

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

Trends of last 30 days

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges.
Zeitaufwand: :math:`O(V² + E)`, wobei V die Anzahl der Eckpunkte und E die Anzahl der Kanten ist.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
Aims to minimize bandwidth (maximum difference between connected vertex indices.
Ziel ist es, die Bandbreite zu minimieren (maximale Differenz zwischen den Indizes der verbundenen Knotenpunkte).
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph
``pgr_sloanOrdering`` - Liefert die Sloan-Ordnung eines ungerichteten Graphen
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
|Boost| Boost Graph Inside.
|Booster Graph Inside.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
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.
Die Methode folgt einem Breadth-First-Search-Traversal (BFS), jedoch mit einer Verfeinerung: Bei jedem Schritt werden die nicht besuchten Nachbarn des aktuellen Scheitelpunkts in aufsteigender Reihenfolge ihres Pseudo-Grads in die Warteschlange eingefügt, wobei der Pseudo-Grad eines Scheitelpunkts die Anzahl der Kanten ist, die ihn mit noch nicht besuchten Scheitelpunkten verbinden. Diese Priorisierung führt häufig zu einer geringeren Bandbreite im Vergleich zu einfacheren BFS-Reihenfolgen.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
``pgr_kingOrdering`` — Returns the King ordering of an undirected graph.
``pgr_kingOrdering`` - Gibt die Königsordnung eines ungerichteten Graphen zurück.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
Boost `Floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_
Boost `Floyd-Warshall <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. 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, then we a more general algorithm is needed, 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, wird ein allgemeinerer Algorithmus benötigt, wie der Dijkstra-Algorithmus, der in :math:`O(|E|log|V|)` Zeit läuft.
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
Using a combinations table on an undirected graph
Verwendung einer Kombinationstabelle für einen ungerichteten Graphen
2 weeks ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. German
From vertices :math:`\{6, 1\}` to vertices :math:`\{10, 17\}` on an undirected graph
Von Knoten :math:`\{6, 1\}` zu Knoten :math:`\{10, 17\}` auf einem ungerichteten Graphen
2 weeks ago
Browse all changes for this language