Skip to content

Commit 56eeb4b

Browse files
github-actions[bot]github-actions[bot]
committed
Update locale: commit 1af6c02 
1 parent 1af6c02 commit 56eeb4b

2 files changed

Lines changed: 146 additions & 22 deletions

File tree

‎locale/en/LC_MESSAGES/pgrouting_doc_strings.po‎

Lines changed: 79 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ msgid ""
88
msgstr ""
99
"Project-Id-Version: pgRouting v4.1\n"
1010
"Report-Msgid-Bugs-To: \n"
11-
"POT-Creation-Date: 2026-02-21 01:08+0000\n"
11+
"POT-Creation-Date: 2026-03-02 03:27+0000\n"
1212
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
1313
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
1414
"Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3446,6 +3446,9 @@ msgstr ""
34463446
msgid "Planar Family"
34473447
msgstr ""
34483448

3449+
msgid ":doc:`pgr_boyerMyrvold`"
3450+
msgstr ""
3451+
34493452
msgid ":doc:`pgr_isPlanar`"
34503453
msgstr ""
34513454

@@ -8673,6 +8676,81 @@ msgid ""
86738676
"Bipartite_graph>`__"
86748677
msgstr ""
86758678

8679+
msgid "``pgr_boyerMyrvold`` - Experimental"
8680+
msgstr ""
8681+
8682+
msgid ""
8683+
"``pgr_boyerMyrvold`` — Returns the planar embedding of a graph, if the graph "
8684+
"is planar."
8685+
msgstr ""
8686+
8687+
msgid "Version 4.1.0"
8688+
msgstr ""
8689+
8690+
msgid ""
8691+
"A planar embedding of a graph is a mapping of the graph onto a plane such "
8692+
"that no two edges cross. Given a graph, the Boyer-Myrvold planarity testing "
8693+
"algorithm can produce a planar embedding if the graph is planar, or identify "
8694+
"a Kuratowski subgraph (a subdivision of :math:`K_5` or :math:`K_{3,3}`) if "
8695+
"it is not."
8696+
msgstr ""
8697+
8698+
msgid ""
8699+
"This function returns the edges of the planar embedding when the graph is "
8700+
"planar."
8701+
msgstr ""
8702+
8703+
msgid "This implementation uses the Boyer-Myrvold Planarity Testing."
8704+
msgstr ""
8705+
8706+
msgid ""
8707+
"It will return the edges of the planar embedding when the graph is planar."
8708+
msgstr ""
8709+
8710+
msgid "If the graph is not planar, it returns an empty set."
8711+
msgstr ""
8712+
8713+
msgid "Applicable only for **undirected** graphs."
8714+
msgstr ""
8715+
8716+
msgid "The algorithm does not consider traversal costs in the calculations."
8717+
msgstr ""
8718+
8719+
msgid "Running time: :math:`O(|V|)`"
8720+
msgstr ""
8721+
8722+
msgid "pgr_boyerMyrvold(`Edges SQL`)"
8723+
msgstr ""
8724+
8725+
msgid "RETURNS SETOF |result-edge|"
8726+
msgstr ""
8727+
8728+
msgid "Get the planar embedding of the graph"
8729+
msgstr ""
8730+
8731+
msgid "Returns set of ``(seq, source, target, cost)``"
8732+
msgstr ""
8733+
8734+
msgid "Identifier of the source vertex."
8735+
msgstr ""
8736+
8737+
msgid "Identifier of the target vertex."
8738+
msgstr ""
8739+
8740+
msgid "Cost of the edge."
8741+
msgstr ""
8742+
8743+
msgid "Adding extra edges to create a :math:`K_5` subgraph."
8744+
msgstr ""
8745+
8746+
msgid "The graph is no longer planar, so the result is empty:"
8747+
msgstr ""
8748+
8749+
msgid ""
8750+
"`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold."
8751+
"html>`__"
8752+
msgstr ""
8753+
86768754
msgid "``pgr_boykovKolmogorov``"
86778755
msgstr "``pgr_boykovKolmogorov``"
86788756

@@ -12067,15 +12145,9 @@ msgid ""
1206712145
"It will return a boolean value depending upon the planarity of the graph."
1206812146
msgstr ""
1206912147

12070-
msgid "Applicable only for **undirected** graphs."
12071-
msgstr ""
12072-
1207312148
msgid "The algorithm does not considers traversal costs in the calculations."
1207412149
msgstr ""
1207512150

12076-
msgid "Running time: :math:`O(|V|)`"
12077-
msgstr ""
12078-
1207912151
msgid "pgr_isPlanar(`Edges SQL`)"
1208012152
msgstr ""
1208112153

@@ -12105,11 +12177,6 @@ msgid ""
1210512177
"blue represent :math:`K_5` subgraph."
1210612178
msgstr ""
1210712179

12108-
msgid ""
12109-
"`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold."
12110-
"html>`__"
12111-
msgstr ""
12112-
1211312180
msgid "``pgr_johnson``"
1211412181
msgstr "``pgr_johnson``"
1211512182

‎locale/pot/pgrouting_doc_strings.pot‎

Lines changed: 67 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ msgid ""
88
msgstr ""
99
"Project-Id-Version: pgRouting v4.1\n"
1010
"Report-Msgid-Bugs-To: \n"
11-
"POT-Creation-Date: 2026-02-21 01:08+0000\n"
11+
"POT-Creation-Date: 2026-03-02 03:27+0000\n"
1212
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
1313
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
1414
"Language-Team: LANGUAGE <LL@li.org>\n"
@@ -3121,6 +3121,9 @@ msgstr ""
31213121
msgid "Planar Family"
31223122
msgstr ""
31233123

3124+
msgid ":doc:`pgr_boyerMyrvold`"
3125+
msgstr ""
3126+
31243127
msgid ":doc:`pgr_isPlanar`"
31253128
msgstr ""
31263129

@@ -7525,6 +7528,69 @@ msgstr ""
75257528
msgid "`Wikipedia: bipartite graph <https://en.wikipedia.org/wiki/Bipartite_graph>`__"
75267529
msgstr ""
75277530

7531+
msgid "``pgr_boyerMyrvold`` - Experimental"
7532+
msgstr ""
7533+
7534+
msgid "``pgr_boyerMyrvold`` — Returns the planar embedding of a graph, if the graph is planar."
7535+
msgstr ""
7536+
7537+
msgid "Version 4.1.0"
7538+
msgstr ""
7539+
7540+
msgid "A planar embedding of a graph is a mapping of the graph onto a plane such that no two edges cross. Given a graph, the Boyer-Myrvold planarity testing algorithm can produce a planar embedding if the graph is planar, or identify a Kuratowski subgraph (a subdivision of :math:`K_5` or :math:`K_{3,3}`) if it is not."
7541+
msgstr ""
7542+
7543+
msgid "This function returns the edges of the planar embedding when the graph is planar."
7544+
msgstr ""
7545+
7546+
msgid "This implementation uses the Boyer-Myrvold Planarity Testing."
7547+
msgstr ""
7548+
7549+
msgid "It will return the edges of the planar embedding when the graph is planar."
7550+
msgstr ""
7551+
7552+
msgid "If the graph is not planar, it returns an empty set."
7553+
msgstr ""
7554+
7555+
msgid "Applicable only for **undirected** graphs."
7556+
msgstr ""
7557+
7558+
msgid "The algorithm does not consider traversal costs in the calculations."
7559+
msgstr ""
7560+
7561+
msgid "Running time: :math:`O(|V|)`"
7562+
msgstr ""
7563+
7564+
msgid "pgr_boyerMyrvold(`Edges SQL`)"
7565+
msgstr ""
7566+
7567+
msgid "RETURNS SETOF |result-edge|"
7568+
msgstr ""
7569+
7570+
msgid "Get the planar embedding of the graph"
7571+
msgstr ""
7572+
7573+
msgid "Returns set of ``(seq, source, target, cost)``"
7574+
msgstr ""
7575+
7576+
msgid "Identifier of the source vertex."
7577+
msgstr ""
7578+
7579+
msgid "Identifier of the target vertex."
7580+
msgstr ""
7581+
7582+
msgid "Cost of the edge."
7583+
msgstr ""
7584+
7585+
msgid "Adding extra edges to create a :math:`K_5` subgraph."
7586+
msgstr ""
7587+
7588+
msgid "The graph is no longer planar, so the result is empty:"
7589+
msgstr ""
7590+
7591+
msgid "`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold.html>`__"
7592+
msgstr ""
7593+
75287594
msgid "``pgr_boykovKolmogorov``"
75297595
msgstr ""
75307596

@@ -10333,15 +10399,9 @@ msgstr ""
1033310399
msgid "It will return a boolean value depending upon the planarity of the graph."
1033410400
msgstr ""
1033510401

10336-
msgid "Applicable only for **undirected** graphs."
10337-
msgstr ""
10338-
1033910402
msgid "The algorithm does not considers traversal costs in the calculations."
1034010403
msgstr ""
1034110404

10342-
msgid "Running time: :math:`O(|V|)`"
10343-
msgstr ""
10344-
1034510405
msgid "pgr_isPlanar(`Edges SQL`)"
1034610406
msgstr ""
1034710407

@@ -10366,9 +10426,6 @@ msgstr ""
1036610426
msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph."
1036710427
msgstr ""
1036810428

10369-
msgid "`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold.html>`__"
10370-
msgstr ""
10371-
1037210429
msgid "``pgr_johnson``"
1037310430
msgstr ""
1037410431

0 commit comments

Comments
 (0)