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 84% 786 7,158 54,658 412 55 1,235 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 84% 4,445 81% 31,047 80% 229,029
Needs editing 7% 374 6% 2,412 8% 23,564
Read-only 0% 0 0% 0 0% 0
Failing checks 1% 55 1% 364 1% 2,431
Strings with suggestions 23% 1,235 27% 10,450 28% 81,817
Untranslated strings 7% 412 12% 4,746 10% 31,094
Last 12 months Previous

Activity in last 12 months

26 changes 0 changes 66 changes 0 changes 417 changes 115 changes 117 changes 149 changes 1,190 changes 95 changes 10 changes 31 changes 0 changes 57 changes 290 changes 220 changes 11 changes 1,097 changes 0 changes 808 changes 319 changes 969 changes 225 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
84%
Translated
2
Contributors
and previous 30 days

Trends of last 30 days

+2%
Hosted words
+100%
+2%
Hosted strings
+100%
−6%
Translated
+91%
−50%
Contributors
+100%
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Spanish
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 bien sabido que los caminos más cortos entre un único origen y todos los demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. PTambién podemos interpretar este grafo también como un grafo ponderado, en el que cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo tienen el mismo peso, necesitaremos un algoritmo más general, como el Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`.
10 days ago
User avatar mt:deepl

Suggestion added

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Spanish
`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch
`#2760908 <https://github.com/pgRouting/pgrouting/issues/2760908>`__: pgr_degreebinaryBreadthFirstSearch
10 days ago
User avatar None

Resource updated

  1. pgRouting
  2. pgRouting
  3. Spanish
The "locale/es/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. Spanish
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 bien sabido que los caminos más cortos entre un único origen y todos los demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. Podemos interpretar este grafo también como un grafo ponderado, en el que cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo tienen el mismo peso, necesitaremos un algoritmo más general, como el Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`.
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. Spanish
:doc:`pgr_binaryBreadthFirstSearch` [3]_
pgr_binaryBreadthFirstSearch
10 days ago
User avatar None

String added in the repository

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

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Spanish
..rubric:: Version 3.0.0
..rúbrica:: Versión 3.0.0
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Spanish
This applies to all signatures of ``pgr_DAGshortestPath``
Esto se aplica a todas las firmas de ``pgr_DAGshortestPath``.
10 days ago
User avatar mt:deepl

Suggestion added

  1. pgRouting
  2. pgRouting
  3. Spanish
Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
UsMigrando `éstethis v3.8 <https://docs.pgrouting.org/3.58/en/pgr_withPointsDD.html#single-vertexdagShortestPath.html#one-to-one>`__ ejemplo.
10 days ago
Browse all changes for this language