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 0 0 0 47 0 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 100% 5,231 100% 38,205 100% 283,687
Needs editing 0% 0 0% 0 0% 0
Read-only 100% 5,231 100% 38,205 100% 283,687
Failing checks 1% 47 1% 292 1% 2,126
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

24 changes 0 changes 1 change 0 changes 238 changes 29 changes 50 changes 32 changes 356 changes 38 changes 0 changes 25 changes 0 changes 29 changes 100 changes 55 changes 7 changes 293 changes 0 changes 354 changes 17 changes 351 changes 58 changes 58 changes
Jun Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr May

Quick numbers

38,205
Hosted words
5,231
Hosted strings
100%
Translated
1
Contributors
and previous 30 days

Trends of last 30 days

+2%
Hosted words
+100%
+2%
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. 10 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, that we need a more general algorithm, 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, 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. English
:doc:`pgr_binaryBreadthFirstSearch` [3]_
:doc:`pgr_binaryBreadthFirstSearch` [3]_
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
`#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. English
The "locale/pot/pgrouting_doc_strings.pot" file was changed. 10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
..rubric:: Version 3.0.0
..rubric:: Version 3.0.0
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
This applies to all signatures of ``pgr_DAGshortestPath``
This applies to all signatures of ``pgr_DAGshortestPath``
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example.
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
Using ``pgr_DAGshortestPath``
Using ``pgr_DAGshortestPath``
10 days ago
User avatar None

String added in the repository

  1. pgRouting
  2. pgRouting
  3. English
|result-1-1|
|result-1-1|
10 days ago
Browse all changes for this language