Source strings

5,375 Strings 100%
Browse Translate
38,643 Words 100%
298,860 Characters 100%
This translation is being used as source strings within this component.

Strings status

Strings Words Characters
5,375 38,643 298,860
All strings Browse Translate Zen
5,375 38,643 298,860
Read-only strings Browse Translate Zen
233 970 8,829
Strings with any failing checks Browse Translate Zen
4 52 360
Failing check: Unpluralised Browse Translate Zen
1 11 83
Failing check: Ellipsis Browse Translate Zen
228 907 8,386
Failing check: Multiple failing checks Browse Translate Zen

Other components

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
Browse all components

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 Creative Commons Attribution Share Alike 4.0 International
Translation process
  • Translations can be made directly.
  • Translation suggestions can be made.
  • Any authenticated user can contribute.
  • The translation uses bilingual files.
Source code repository https://github.com/pgRouting/pgrouting
Repository branch develop
Last remote commit Merge remote-tracking branch 'weblate/weblate-pgrouting-pgrouting-develop' into develop 91349915db
cvvergara authored 3 days ago
Last commit in Weblate Translated using Weblate (Spanish) 362df661a8
Celia Virginia Vergara Castillo authored 3 days ago
Weblate repository https://weblate.osgeo.org/git/pgrouting/pgrouting-develop/
File mask locale/*/LC_MESSAGES/pgrouting_doc_strings.po
Translation file Download locale/pot/pgrouting_doc_strings.pot
Last change Sept. 22, 2025, 4:50 p.m.
Last author None
3 days ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 5,375 38,643 298,860
Translated 100% 5,375 100% 38,643 100% 298,860
Needs editing 0% 0 0% 0 0% 0
Read-only 100% 5,375 100% 38,643 100% 298,860
Failing checks 4% 233 2% 970 2% 8,829
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 0% 0 0% 0 0% 0
Last 12 months Previous

Activity in last 12 months

50 changes 32 changes 356 changes 21 changes 0 changes 8 changes 0 changes 29 changes 87 changes 38 changes 7 changes 276 changes 0 changes 336 changes 12 changes 351 changes 58 changes 58 changes 0 changes 569 changes 0 changes 29 changes 29 changes 1,689 changes
Sep Oct Nov Dec Jan Feb Mar Apr May Jun Jul Aug

Quick numbers

38,643
Hosted words
5,375
Hosted strings
100%
Translated
1
Contributors
and previous 30 days

Trends of last 30 days

+1%
Hosted words
+100%
+1%
Hosted strings
+100%
—
Translated
+100%
—
Contributors
+100%
User avatar None

Resource updated

  1. pgRouting
  2. pgRouting
  3. English
The "locale/pot/pgrouting_doc_strings.pot" file was changed. 3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges.
Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges.
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
Aims to minimize bandwidth (maximum difference between connected vertex indices.
Aims to minimize bandwidth (maximum difference between connected vertex indices.
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph
``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
|Boost| Boost Graph Inside.
|Boost| Boost Graph Inside.
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
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.
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.
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
``pgr_kingOrdering`` — Returns the King ordering of an undirected graph.
``pgr_kingOrdering`` — Returns the King ordering of an undirected graph.
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
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>`_
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
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.
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.
3 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
Using a combinations table on an undirected graph
Using a combinations table on an undirected graph
3 days ago
Browse all translation changes