[en] po in multiple files

locale/en/LC_MESSAGES/BFS-category.po

@@ -0,0 +1,290 @@
+# SOME DESCRIPTIVE TITLE.
+# Copyright (C) pgRouting Contributors - Version v3.3.4
+# This file is distributed under the same license as the pgRouting package.
+# FIRST AUTHOR <EMAIL@ADDRESS>, 2022.
+#
+#, fuzzy
+msgid ""
+msgstr ""
+"Project-Id-Version: pgRouting v3.3.4\n"
+"Report-Msgid-Bugs-To: \n"
+"POT-Creation-Date: 2022-10-06 14:22-0500\n"
+"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
+"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
+"Language-Team: LANGUAGE <[email protected]>\n"
+"MIME-Version: 1.0\n"
+"Content-Type: text/plain; charset=utf-8\n"
+"Content-Transfer-Encoding: 8bit\n"
+"Generated-By: Babel 2.10.3\n"
+
+msgid ""
+"**Supported versions:** `Latest <https://docs.pgrouting.org/latest/en"
+"/BFS-category.html>`__ (`3.3 <https://docs.pgrouting.org/3.3/en/BFS-"
+"category.html>`__)"
+msgstr ""
+
+msgid "BFS - Category"
+msgstr ""
+
+msgid ":doc:`pgr_kruskalBFS`"
+msgstr ""
+
+msgid ":doc:`pgr_primBFS`"
+msgstr ""
+
+msgid "Traversal using breadth first search."
+msgstr ""
+
+msgid "It's implementation is only on **undirected** graph."
+msgstr ""
+
+msgid "Process is done only on edges with positive costs."
+msgstr ""
+
+msgid "When the graph is connected"
+msgstr ""
+
+msgid "The resulting edges make up a tree"
+msgstr ""
+
+msgid "When the graph is not connected,"
+msgstr ""
+
+msgid "Finds a minimum spanning tree for each connected component."
+msgstr ""
+
+msgid "The resulting edges make up a forest."
+msgstr ""
+
+msgid "Parameters"
+msgstr ""
+
+msgid "Parameter"
+msgstr ""
+
+msgid "Type"
+msgstr ""
+
+msgid "Description"
+msgstr ""
+
+msgid "`Edges SQL`_"
+msgstr ""
+
+msgid "``TEXT``"
+msgstr ""
+
+msgid "`Edges SQL`_ as described below."
+msgstr ""
+
+msgid "**root vid**"
+msgstr ""
+
+msgid "``BIGINT``"
+msgstr ""
+
+msgid "Identifier of the root vertex of the tree."
+msgstr ""
+
+msgid ""
+"When value is :math:`0` then gets the spanning forest starting in "
+"aleatory nodes for each tree in the forest."
+msgstr ""
+
+msgid "**root vids**"
+msgstr ""
+
+msgid "``ARRAY`` [ **ANY-INTEGER** ]"
+msgstr ""
+
+msgid "Array of identifiers of the root vertices."
+msgstr ""
+
+msgid ":math:`0` values are ignored"
+msgstr ""
+
+msgid "For optimization purposes, any duplicated value is ignored."
+msgstr ""
+
+msgid "Where:"
+msgstr ""
+
+msgid "ANY-INTEGER"
+msgstr ""
+
+msgid "SMALLINT, INTEGER, BIGINT"
+msgstr ""
+
+msgid "ANY-NUMERIC"
+msgstr ""
+
+msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT, NUMERIC"
+msgstr ""
+
+msgid "BFS optional parameters"
+msgstr ""
+
+msgid "Default"
+msgstr ""
+
+msgid "``max_depth``"
+msgstr ""
+
+msgid ":math:`9223372036854775807`"
+msgstr ""
+
+msgid "Upper limit of the depth of the tree."
+msgstr ""
+
+msgid "When negative throws an error."
+msgstr ""
+
+msgid "Inner Queries"
+msgstr ""
+
+msgid "Edges SQL"
+msgstr ""
+
+msgid "Column"
+msgstr ""
+
+msgid "``id``"
+msgstr ""
+
+msgid "**ANY-INTEGER**"
+msgstr ""
+
+msgid "Identifier of the edge."
+msgstr ""
+
+msgid "``source``"
+msgstr ""
+
+msgid "Identifier of the first end point vertex of the edge."
+msgstr ""
+
+msgid "``target``"
+msgstr ""
+
+msgid "Identifier of the second end point vertex of the edge."
+msgstr ""
+
+msgid "``cost``"
+msgstr ""
+
+msgid "**ANY-NUMERICAL**"
+msgstr ""
+
+msgid "Weight of the edge (``source``, ``target``)"
+msgstr ""
+
+msgid "``reverse_cost``"
+msgstr ""
+
+msgid "-1"
+msgstr ""
+
+msgid "Weight of the edge (``target``, ``source``)"
+msgstr ""
+
+msgid ""
+"When negative: edge (``target``, ``source``) does not exist, therefore "
+"it's not part of the graph."
+msgstr ""
+
+msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``"
+msgstr ""
+
+msgid "ANY-NUMERICAL"
+msgstr ""
+
+msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``, ``REAL``, ``FLOAT``"
+msgstr ""
+
+msgid "Result Columns"
+msgstr ""
+
+msgid "Returns SET OF ``(seq, depth, start_vid, node, edge, cost, agg_cost)``"
+msgstr ""
+
+msgid "``seq``"
+msgstr ""
+
+msgid "Sequential value starting from :math:`1`."
+msgstr ""
+
+msgid "``depth``"
+msgstr ""
+
+msgid "Depth of the ``node``."
+msgstr ""
+
+msgid ":math:`0` when ``node`` = ``start_vid``."
+msgstr ""
+
+msgid "``start_vid``"
+msgstr ""
+
+msgid "Identifier of the root vertex."
+msgstr ""
+
+msgid "``node``"
+msgstr ""
+
+msgid "Identifier of ``node`` reached using ``edge``."
+msgstr ""
+
+msgid "``edge``"
+msgstr ""
+
+msgid "Identifier of the ``edge`` used to arrive to ``node``."
+msgstr ""
+
+msgid ":math:`-1` when ``node`` = ``start_vid``."
+msgstr ""
+
+msgid "``FLOAT``"
+msgstr ""
+
+msgid "Cost to traverse ``edge``."
+msgstr ""
+
+msgid "``agg_cost``"
+msgstr ""
+
+msgid "Aggregate cost from ``start_vid`` to ``node``."
+msgstr ""
+
+msgid "See Also"
+msgstr ""
+
+msgid ""
+"`Boost: Prim's algorithm "
+"<https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
+msgstr ""
+
+msgid ""
+"`Boost: Kruskal's algorithm "
+"<https://www.boost.org/libs/graph/doc/kruskal_min_spanning_tree.html>`__"
+msgstr ""
+
+#, python-format
+msgid ""
+"`Wikipedia: Prim's algorithm "
+"<https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"
+msgstr ""
+
+msgid ""
+"`Wikipedia: Kruskal's algorithm "
+"<https://en.wikipedia.org/wiki/Kruskal's_algorithm>`__"
+msgstr ""
+
+msgid "Indices and tables"
+msgstr ""
+
+msgid ":ref:`genindex`"
+msgstr ""
+
+msgid ":ref:`search`"
+msgstr ""
+