From 1f708bb12b85888ed96b50d96e1d8ad7ab7daadb Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" <41898282+github-actions[bot]@users.noreply.github.com> Date: Mon, 26 Aug 2024 11:20:56 +0000 Subject: [PATCH] Update locale: commit eabdbd13db --- .../en/LC_MESSAGES/pgrouting_doc_strings.po | 131 ++++++++++++++++-- locale/pot/pgrouting_doc_strings.pot | 110 +++++++++++++-- 2 files changed, 214 insertions(+), 27 deletions(-) diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po index c0fecff321..6cbbceff42 100644 --- a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po @@ -8,14 +8,14 @@ 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-26 11:20+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=utf-8\n" "Content-Transfer-Encoding: 8bit\n" -"Generated-By: Babel 2.15.0\n" +"Generated-By: Babel 2.16.0\n" msgid "BFS - Category" msgstr "" @@ -3918,6 +3918,14 @@ msgid "" "of 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 "" @@ -4389,6 +4397,15 @@ msgid "" "`__" msgstr "" +msgid "New experimental functions" +msgstr "" + +msgid "Metrics" +msgstr "" + +msgid "pgr_betweennessCentrality" +msgstr "" + msgid "Official functions changes" msgstr "" @@ -4484,6 +4501,9 @@ msgstr "" msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "" +msgid "Metrics - Family of functions" +msgstr "" + msgid "Migration guide" msgstr "" @@ -9100,6 +9120,101 @@ 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 " +"`_" +msgstr "" + +msgid "Queries use the :doc:`sampledata` network." +msgstr "" + msgid "``pgr_biconnectedComponents``" msgstr "" @@ -10210,9 +10325,6 @@ msgid "" "algorithm implemented by Boost.Graph." msgstr "" -msgid "New **experimental** function:" -msgstr "" - msgid "pgr_dagShortestPath(Combinations)" msgstr "" @@ -12387,9 +12499,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." @@ -14094,9 +14203,6 @@ msgstr "" msgid "Rechability of a subgraph" msgstr "" -msgid "``vid``" -msgstr "" - msgid "Identifier of the source of the edges" msgstr "" @@ -15883,9 +15989,6 @@ msgstr "" msgid "``pgr_findCloseEdges`` (Many points)" msgstr "" -msgid "New experimental functions" -msgstr "" - msgid "Ordering" msgstr "" diff --git a/locale/pot/pgrouting_doc_strings.pot b/locale/pot/pgrouting_doc_strings.pot index 61964b7e90..fefd37ce29 100644 --- a/locale/pot/pgrouting_doc_strings.pot +++ b/locale/pot/pgrouting_doc_strings.pot @@ -8,7 +8,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.7.0-dev\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-05-13 17:23+0000\n" +"POT-Creation-Date: 2024-08-26 11:20+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -3535,6 +3535,12 @@ msgstr "" msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of 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 "" @@ -3934,6 +3940,15 @@ msgstr "" msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.0 `__" msgstr "" +msgid "New experimental functions" +msgstr "" + +msgid "Metrics" +msgstr "" + +msgid "pgr_betweennessCentrality" +msgstr "" + msgid "Official functions changes" msgstr "" @@ -4015,6 +4030,9 @@ msgstr "" msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "" +msgid "Metrics - Family of functions" +msgstr "" + msgid "Migration guide" msgstr "" @@ -7906,6 +7924,84 @@ 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 `_" +msgstr "" + +msgid "Queries use the :doc:`sampledata` network." +msgstr "" + msgid "``pgr_biconnectedComponents``" msgstr "" @@ -8806,9 +8902,6 @@ msgstr "" msgid "``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." msgstr "" -msgid "New **experimental** function:" -msgstr "" - msgid "pgr_dagShortestPath(Combinations)" msgstr "" @@ -10639,9 +10732,6 @@ msgstr "" msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with 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." msgstr "" @@ -12070,9 +12160,6 @@ msgstr "" msgid "Rechability of a subgraph" msgstr "" -msgid "``vid``" -msgstr "" - msgid "Identifier of the source of the edges" msgstr "" @@ -13465,9 +13552,6 @@ msgstr "" msgid "``pgr_findCloseEdges`` (Many points)" msgstr "" -msgid "New experimental functions" -msgstr "" - msgid "Ordering" msgstr ""