Merge pull request #2645 from osgeoweblate/weblate-pgrouting-pgrouting-develop

Translations update from OSGeo Weblate

Author: cvvergara

locale/de/LC_MESSAGES/pgrouting_doc_strings.po

@@ -6,7 +6,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v3.6.0-dev\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-05-13 17:23+0000\n"
+"POT-Creation-Date: 2024-08-16 18:52+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: Automatically generated\n"
 "Language-Team: none\n"
@@ -3908,6 +3908,14 @@ msgid ""
 "an undirected graph."
 msgstr ""
 
+msgid ":doc:`metrics-family`"
+msgstr ""
+
+msgid ""
+":doc:`pgr_betweennessCentrality` - Calculates relative betweenness "
+"centrality using Brandes Algorithm"
+msgstr ""
+
 msgid ":doc:`TRSP-family`"
 msgstr ""
 
@@ -4376,6 +4384,15 @@ msgid ""
 "utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`__"
 msgstr ""
 
+msgid "New experimental functions"
+msgstr ""
+
+msgid "Metrics"
+msgstr ""
+
+msgid "pgr_betweennessCentrality"
+msgstr ""
+
 msgid "Official functions changes"
 msgstr ""
 
@@ -4470,6 +4487,9 @@ msgstr ""
 msgid "Kruskal's running time: :math:`O(E * log E)`"
 msgstr ""
 
+msgid "Metrics - Family of functions"
+msgstr ""
+
 msgid "Migration guide"
 msgstr ""
 
@@ -9077,6 +9097,99 @@ msgstr ""
 msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
 msgstr ""
 
+msgid "``pgr_betweennessCentrality``"
+msgstr ""
+
+msgid ""
+"``pgr_betweennessCentrality`` - Calculates the relative betweeness "
+"centrality using Brandes Algorithm"
+msgstr ""
+
+msgid "Version 3.7.0"
+msgstr ""
+
+msgid "New **experimental** function:"
+msgstr ""
+
+msgid ""
+"The Brandes Algorithm takes advantage of the sparse graphs for evaluating "
+"the betweenness centrality score of all vertices."
+msgstr ""
+
+msgid ""
+"Betweenness centrality measures the extent to which a vertex lies on the "
+"shortest paths between all other pairs of vertices. Vertices with a high "
+"betweenness centrality score may have considerable influence in a network by "
+"the virtue of their control over the shortest paths passing between them."
+msgstr ""
+
+msgid ""
+"The removal of these vertices will affect the network by disrupting the it, "
+"as most of the shortest paths between vertices pass through them."
+msgstr ""
+
+msgid "This implementation work for both directed and undirected graphs."
+msgstr ""
+
+msgid "Running time:  :math:`\\Theta(VE)`"
+msgstr ""
+
+msgid "Running space: :math:`\\Theta(VE)`"
+msgstr ""
+
+msgid "Throws when there are no edges in the graph"
+msgstr ""
+
+msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])"
+msgstr ""
+
+msgid "Returns set of ``(vid, centrality)``"
+msgstr ""
+
+msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`."
+msgstr ""
+
+msgid "Explanation"
+msgstr ""
+
+msgid "The betweenness centrality are between parenthesis."
+msgstr ""
+
+msgid "The leaf vertices have betweenness centrality :math:`0`."
+msgstr ""
+
+msgid ""
+"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:"
+"`10`."
+msgstr ""
+
+msgid "Removing vertex :math:`6` will create three graph components."
+msgstr ""
+
+msgid "Removing vertex :math:`10` will create two graph components."
+msgstr ""
+
+msgid "``vid``"
+msgstr ""
+
+msgid "Identifier of the vertex"
+msgstr ""
+
+msgid "``centrality``"
+msgstr ""
+
+msgid ""
+"Relative betweenness centrality score of the vertex (will be in range [0,1])"
+msgstr ""
+
+msgid ""
+"Boost's `betweenness_centrality <https://www.boost.org/doc/libs/1_84_0/libs/"
+"graph/doc/betweenness_centrality.html>`_"
+msgstr ""
+
+msgid "Queries use the :doc:`sampledata` network."
+msgstr ""
+
 msgid "``pgr_biconnectedComponents``"
 msgstr ""
 
@@ -10181,9 +10294,6 @@ msgid ""
 "implemented by Boost.Graph."
 msgstr ""
 
-msgid "New **experimental** function:"
-msgstr ""
-
 msgid "pgr_dagShortestPath(Combinations)"
 msgstr ""
 
@@ -12354,9 +12464,6 @@ msgid ""
 "breadth First Search ordering."
 msgstr ""
 
-msgid "Version 3.7.0"
-msgstr ""
-
 msgid ""
 "Visits and extracts the nodes information in Breath First Search ordering of "
 "the Minimum Spanning Tree created using Kruskal's algorithm."
@@ -14055,9 +14162,6 @@ msgstr ""
 msgid "Rechability of a subgraph"
 msgstr ""
 
-msgid "``vid``"
-msgstr ""
-
 msgid "Identifier of the source of the edges"
 msgstr ""
 
@@ -15822,9 +15926,6 @@ msgstr ""
 msgid "``pgr_findCloseEdges`` (Many points)"
 msgstr ""
 
-msgid "New experimental functions"
-msgstr ""
-
 msgid "Ordering"
 msgstr ""