Update locale: commit 8240df5

Author: github-actions[bot]

locale/en/LC_MESSAGES/pgrouting_doc_strings.po

@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v4.1\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2026-03-02 03:27+0000\n"
+"POT-Creation-Date: 2026-03-02 03:45+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -8695,16 +8695,10 @@ msgid ""
 "it is not."
 msgstr ""
 
-msgid ""
-"This function returns the edges of the planar embedding when the graph is "
-"planar."
-msgstr ""
-
 msgid "This implementation uses the Boyer-Myrvold Planarity Testing."
 msgstr ""
 
-msgid ""
-"It will return the edges of the planar embedding when the graph is planar."
+msgid "Returns the edges of the planar embedding when the graph is planar."
 msgstr ""
 
 msgid "If the graph is not planar, it returns an empty set."

locale/pot/pgrouting_doc_strings.pot

@@ -8,7 +8,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: pgRouting v4.1\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2026-03-02 03:27+0000\n"
+"POT-Creation-Date: 2026-03-02 03:45+0000\n"
 "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
 "Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
 "Language-Team: LANGUAGE <LL@li.org>\n"
@@ -7540,13 +7540,10 @@ msgstr ""
 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."
 msgstr ""
 
-msgid "This function returns the edges of the planar embedding when the graph is planar."
-msgstr ""
-
 msgid "This implementation uses the Boyer-Myrvold Planarity Testing."
 msgstr ""
 
-msgid "It will return the edges of the planar embedding when the graph is planar."
+msgid "Returns the edges of the planar embedding when the graph is planar."
 msgstr ""
 
 msgid "If the graph is not planar, it returns an empty set."