# SOME DESCRIPTIVE TITLE.
# Copyright (C) pgRouting Contributors - Version v4.1
# This file is distributed under the same license as the pgRouting package.
# FIRST AUTHOR <EMAIL@ADDRESS>, 2022.
# Pedro Jose Rios Vergara <jose@georepublic.de>, 2022, 2025.
# Celia Virginia Vergara Castillo <vicky@georepublic.de>, 2022.
# Celia Virginia Vergara Castillo <vicky@erosion.dev>, 2023, 2024, 2025.
# DeepL <noreply-mt-deepl@weblate.org>, 2024, 2025.
msgid ""
msgstr ""
"Project-Id-Version: pgRouting v4.1\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2026-01-08 15:44+0000\n"
"PO-Revision-Date: 2025-12-17 13:47+0000\n"
"Last-Translator: Celia Virginia Vergara Castillo <vicky@erosion.dev>\n"
"Language-Team: Spanish <https://weblate.osgeo.org/projects/pgrouting/pgrouting-develop/es/>\n"
"Language: es\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Plural-Forms: nplurals=2; plural=n != 1;\n"
"X-Generator: Weblate 5.4.3\n"
"Generated-By: Babel 2.10.3\n"

msgid "BFS - Category"
msgstr "BFS - Categoría"

msgid ":doc:`pgr_kruskalBFS`"
msgstr ":doc:`pgr_kruskalBFS`"

msgid ":doc:`pgr_primBFS`"
msgstr ":doc:`pgr_primBFS`"

msgid "Traversal using breadth first search."
msgstr "recorrido usando la búsqueda en anchura."

msgid "It's implementation is only on **undirected** graph."
msgstr "Su implementación es solo para grafo **no dirigido**."

msgid "Process is done only on edges with positive costs."
msgstr "El proceso se realiza sólo en aristas con costos positivos."

msgid "When the graph is connected"
msgstr "Cuando el grafo es conectado"

msgid "The resulting edges make up a tree"
msgstr "Las aristas resultantes componen un árbol"

msgid "When the graph is not connected,"
msgstr "Cuando el grafo no está conectado,"

msgid "Finds a minimum spanning tree for each connected component."
msgstr "Encuentra un árbol de expansión mínimo para cada componente conectado."

msgid "The resulting edges make up a forest."
msgstr "Las aristas resultantes conforman un bosque."

msgid "Parameters"
msgstr "Parámetros"

msgid "Parameter"
msgstr "Parámetro"

msgid "Type"
msgstr "Tipo"

msgid "Description"
msgstr "Descripción"

msgid "`Edges SQL`_"
msgstr "`SQL de aristas`_"

msgid "``TEXT``"
msgstr "``TEXT``"

msgid "`Edges SQL`_ as described below."
msgstr "`SQL de aristas`_ descritas más adelante."

msgid "**root vid**"
msgstr "**raíz**"

msgid "``BIGINT``"
msgstr "``BIGINT``"

msgid "Identifier of the root vertex of the tree."
msgstr "Identificador del vértice raíz del árbol."

msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest."
msgstr "Cuando el valor es :math:`0` se obtiene el bosque de expansión que comienza en nodos aleatorios para cada árbol del bosque."

msgid "**root vids**"
msgstr "**raices**"

msgid "``ARRAY`` [ **ANY-INTEGER** ]"
msgstr "``ARRAY`` [**ENTEROS** ]"

msgid "Array of identifiers of the root vertices."
msgstr "Arreglo de identificadores de los vértices raíz."

msgid ":math:`0` values are ignored"
msgstr "Valores :math:`0` son ignorados"

msgid "For optimization purposes, any duplicated value is ignored."
msgstr "Con el propósito de optimización, valores duplicados son ignorados."

msgid "Where:"
msgstr "Donde:"

msgid "ANY-INTEGER"
msgstr "ENTEROS"

msgid "SMALLINT, INTEGER, BIGINT"
msgstr "``SMALLINT, INTEGER, BIGINT``"

msgid "ANY-NUMERIC"
msgstr "FLOTANTE"

msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT, NUMERIC"
msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT, NUMERIC"

msgid "BFS optional parameters"
msgstr "Párametros opcionales de BFS"

msgid "Default"
msgstr "x Defecto"

msgid "``max_depth``"
msgstr "``max_depth``"

msgid ":math:`9223372036854775807`"
msgstr ":math:`9223372036854775807`"

msgid "Upper limit of the depth of the tree."
msgstr "Límite superior para la profundidad del árbol."

msgid "When negative throws an error."
msgstr "Cuando negativo arroja error."

msgid "Inner Queries"
msgstr "Consultas Internas"

msgid "Edges SQL"
msgstr "SQL aristas"

msgid "Column"
msgstr "Columna"

msgid "``id``"
msgstr "``id``"

msgid "**ANY-INTEGER**"
msgstr "**ENTEROS**"

msgid "Identifier of the edge."
msgstr "Identificador de la arista."

msgid "``source``"
msgstr "``source``"

msgid "Identifier of the first end point vertex of the edge."
msgstr "Identificador del primer vértice de la arista."

msgid "``target``"
msgstr "``target``"

msgid "Identifier of the second end point vertex of the edge."
msgstr "Identificador del segundo vértice de la arista."

msgid "``cost``"
msgstr "``cost``"

msgid "**ANY-NUMERICAL**"
msgstr "**FLOTANTES**"

msgid "Weight of the edge (``source``, ``target``)"
msgstr "Peso de la arista (``source``, ``target``)"

msgid "``reverse_cost``"
msgstr "``reverse_cost``"

msgid "-1"
msgstr "-1"

msgid "Weight of the edge (``target``, ``source``)"
msgstr "Peso de la arista (``target``, ``source``)"

msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph."
msgstr "Cuando negativo: la arista (``target``, ``source``) no existe, por lo tanto no es parte del grafo."

msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``"
msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``"

msgid "ANY-NUMERICAL"
msgstr "FLOTANTES"

msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``, ``REAL``, ``FLOAT``"
msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``, ``REAL``, ``FLOAT``"

msgid "Result columns"
msgstr "Columnas de resultados"

msgid "Returns set of ``(seq, depth, start_vid, node, edge, cost, agg_cost)``"
msgstr "Devuelve el conjunto de ``(seq, depth, start_vid, node, edge, cost, agg_cost)``"

msgid "``seq``"
msgstr "``seq``"

msgid "Sequential value starting from :math:`1`."
msgstr "Valor secuencial a partir de :math:`1`."

msgid "``depth``"
msgstr "``depth``"

msgid "Depth of the ``node``."
msgstr "Profundidad del ``node``."

msgid ":math:`0` when ``node`` = ``start_vid``."
msgstr ":math:`0` cuando ``node`` = ``start_vid``."

msgid "``start_vid``"
msgstr "``start_vid``"

msgid "Identifier of the root vertex."
msgstr "Identificador del vértice raíz."

msgid "``node``"
msgstr "``node``"

msgid "Identifier of ``node`` reached using ``edge``."
msgstr "Identificador del ``node`` alcanzado usando ``edge``."

msgid "``edge``"
msgstr "``edge``"

msgid "Identifier of the ``edge`` used to arrive to ``node``."
msgstr "Identificador del ``edge`` utilizado para llegar a ``node``."

msgid ":math:`-1` when ``node`` = ``start_vid``."
msgstr ":math:`-1` cuando ``node`` = ``start_vid``."

msgid "``FLOAT``"
msgstr "``FLOAT``"

msgid "Cost to traverse ``edge``."
msgstr "Costo por recorrer ``edge``."

msgid "``agg_cost``"
msgstr "``agg_cost``"

msgid "Aggregate cost from ``start_vid`` to ``node``."
msgstr "Costo agregado desde ``start_vid`` hasta ``node``."

msgid "See Also"
msgstr "Ver también"

msgid "`Boost: Prim's algorithm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
msgstr "`Boost: Algoritmo de Prim <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"

msgid "`Boost: Kruskal's algorithm <https://www.boost.org/libs/graph/doc/kruskal_min_spanning_tree.html>`__"
msgstr "`Boost: algoritmo de Kruskal <https://www.boost.org/libs/graph/doc/kruskal_min_spanning_tree.html>`__"

msgid "`Wikipedia: Prim's algorithm <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"
msgstr "`Wikipedia: algoritmo de Prim <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"

msgid "`Wikipedia: Kruskal's algorithm <https://en.wikipedia.org/wiki/Kruskal's_algorithm>`__"
msgstr "`Wikipedia: algoritmo de Kruskal <https://en.wikipedia.org/wiki/Kruskal's_algorithm>`__"

msgid "Indices and tables"
msgstr "Índices y tablas"

msgid ":ref:`genindex`"
msgstr ":ref:`genindex`"

msgid ":ref:`search`"
msgstr ":ref:`search`"

msgid "DFS - Category"
msgstr "DFS - Categoría"

msgid "Traversal using Depth First Search."
msgstr "Recorrido usando búsqueda en profundidad."

msgid ":doc:`pgr_kruskalDFS`"
msgstr ":doc:`pgr_kruskalDFS`"

msgid ":doc:`pgr_primDFS`"
msgstr ":doc:`pgr_primDFS`"

msgid "Proposed"
msgstr "Propuesta"

msgid "Proposed functions for next mayor release."
msgstr "Funciones propuestas para la próxima versión mayor."

msgid "They are not officially in the current release."
msgstr "No están oficialmente en la versión actual."

msgid "Code has been reviewed therefore is not experimental."
msgstr ""

msgid "Name, signature and functionality might not change."
msgstr "Es posible que el nombre, la firma y la funcionalidad no cambien."

msgid "pgTap tests have being done. But might need more."
msgstr "Se han hecho pruebas con pgTap. Pero tal vez se necesiten más."

msgid "Documentation might need refinement."
msgstr "Es posible que la documentación necesite un refinamiento."

msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph."
msgstr ":doc:`pgr_depthFirstSearch` - Recorrido de búsqueda en profundidad del grafo."

msgid "In general:"
msgstr "En general:"

msgid "K shortest paths - Category"
msgstr "Rutas más cortas K - Categoría"

msgid ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra"
msgstr ":doc:`pgr_KSP` - Algoritmo de Yen basado en pgr_dijkstra"

msgid ":doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints"
msgstr ":doc:`pgr_withPointsKSP` - Algoritmo de Yen basado en pgr_withPoints"

msgid "TRSP - Family of functions"
msgstr "TRSP - Familia de funciones"

msgid "When points are also given as input:"
msgstr "Cuando los puntos también se dan como entrada:"

msgid ":doc:`pgr_trsp` - Routing with restrictions."
msgstr ":doc:`pgr_trsp` - Ruteo con restricciones."

msgid ":doc:`pgr_trspVia` - Via Vertices routing with restrictions."
msgstr ":doc:`pgr_trspVia` - Ruteo Via Vértices con restricciones."

msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions."
msgstr ":doc:`pgr_trsp_withPoints` - Ruteo de Punto/Vértice con restricciones."

msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions."
msgstr ":doc:`pgr_trspVia_withPoints` - Ruteo Vía Punto/Vértice con restricciones."

msgid "Experimental"
msgstr "Experimental"

msgid "Experimental functions"
msgstr "Funciones experimentales"

msgid "They are not officially of the current release."
msgstr "No son oficialmente de la versión actual."

msgid "They likely will not be officially be part of the next release:"
msgstr "Es probable que oficialmente no formen parte de la siguiente versión:"

msgid "The functions might not make use of ANY-INTEGER and ANY-NUMERICAL"
msgstr "Las funciones no podrían hacer uso de ANY-INTEGER ni ANY-NUMERICAL"

msgid "Name might change."
msgstr "El nombre puede cambiar."

msgid "Signature might change."
msgstr "La firma puede cambiar."

msgid "Functionality might change."
msgstr "La funcionalidad puede cambiar."

msgid "pgTap tests might be missing."
msgstr "Las pruebas de pgTap pueden faltar."

msgid "Might need c/c++ review."
msgstr "Posiblemente C/C++ necesite revisión."

msgid "Documentation if any might need to be rewritten."
msgstr "Hay documentación que, en dado caso, podría ser necesario reescribir."

msgid "Might need a lot of feedback from the community."
msgstr "Puede ser necesaria retroalimentación por parte de la comunidad."

msgid ":doc:`pgr_turnRestrictedPath` - Routing with restrictions."
msgstr ":doc:`pgr_turnRestrictedPath` - Ruteo con restricciones."

msgid "Introduction"
msgstr "Introducción"

msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions."
msgstr "Las restricciones viales son una secuencia de tramos viales que no se pueden tomar de manera secuencial. Algunas restricciones están implícitas en un grafo dirigido, por ejemplo, caminos de un solo sentido donde el sentido contrario ni siquiera se inserta en el grafo. Pero normalmente en giros como prohibido vuelta a la izquierda o a la derecha, de ahí el nombre de restricciones de giro, a veces hay restricciones."

msgid "TRSP algorithm"
msgstr "Algoritmo TRSP"

msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex."
msgstr "Wl algoritmo interno TRSP realiza una búsqueda de avanzada sobre el algoritmo de Dijkstra para encontrar un camino que contenga una restricción. Esto permite que el algoritmo pase dos veces sobre el mismo vértice."

msgid "`Edges SQL`_ query as described."
msgstr "`SQL de aristas`_ como se describen."

msgid "`Restrictions SQL`_"
msgstr "`SQL de restricciones`_"

msgid "`Restrictions SQL`_ query as described."
msgstr "`SQL de restricciones`_ consulta como se describe."

msgid "**via vertices**"
msgstr "**vértices**"

msgid "``ARRAY[`` **ANY-INTEGER** ``]``"
msgstr "``ARRAY[`` **ANY-INTEGER** ``]``"

msgid "Array of ordered vertices identifiers that are going to be visited."
msgstr "Arreglo ordenado de identificadores de vértices que serán visitados."

msgid "Restrictions"
msgstr "Restricciones"

msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions."
msgstr "En redes de caminos, hay restricciones como vuelta a la izquierda o derecha, no vuelta en U."

msgid "A restriction is a sequence of edges, called path and that path is to be avoided."
msgstr "Una restricción es una secuencia de aristas, llamado trayectoria y esa trayectoria se debe evitar."

msgid "**Restrictions on the road network**"
msgstr "**Restricciones en la red de calles**"

msgid "These restrictions are represented on a table as follows:"
msgstr "Éstas restricciones son representadas en la siguiente tabla:"

msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored."
msgstr "La tabla tiene un identificador, el cual pueda ser necesario para la administración de las restricciones, pero el algoritmo no necesita esa información. Si se le da, será ignorada."

msgid "Restrictions SQL"
msgstr "SQL restricciones"

msgid "``path``"
msgstr "``path``"

msgid "``ARRAY`` [**ANY-INTEGER**]"
msgstr "``ARRAY`` [**ENTEROS**]"

msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception."
msgstr "Secuencia de identificadores de aristas que forman un camino que no se permite tomar. - Arreglos vacios o ``NULL`` son ignorados. - Arreglos que tienen ``NULL`` arrojan una excepción."

msgid "``Cost``"
msgstr "``Cost``"

msgid "Cost of taking the forbidden path."
msgstr "Costo de tomar el camino prohibido."

msgid "Traveling Sales Person - Family of functions"
msgstr "Vendedor Viajante - Familia de funciones"

msgid ":doc:`pgr_TSP` - When input is given as matrix cell information."
msgstr ":doc:`pgr_TSP` - Cuando la entrada es la información de celdas de una matriz."

msgid ":doc:`pgr_TSPeuclidean` - When input are coordinates."
msgstr ":doc:`pgr_TSPeuclidean` - Cuando la información son coordenadas."

msgid "Table of Contents"
msgstr "Tabla de Contenido"

msgid "General Information"
msgstr "Información general"

msgid "Problem Definition"
msgstr "Definición del Problema"

msgid "The travelling salesperson problem (TSP) asks the following question:"
msgstr "En el problema del vendedor viajante (TSP) hace la siguiente pregunta:"

msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*"
msgstr "*Dada una lista de ciudades y las distancias entre cada par de ciudades, que corresponde con la ruta más corta posible que para visite cada ciudad exactamente una vez y regrese a la ciudad de origen?*"

msgid "Origin"
msgstr "Origen"

msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**."
msgstr "El problema del vendedor viajante fue estudiado en el siglo 18 por matemáticos **Sir William Rowam Hamilton** y **Thomas Penyngton Kirkman**."

msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**."
msgstr "Se puede encontrar una discusión sobre el trabajo de Hamilton & Kirkman en el libro **Graph Theory (Biggs et al. 1976)**."

msgid "ISBN-13: 978-0198539162"
msgstr "ISBN-13: 978-0198539162"

msgid "ISBN-10: 0198539169"
msgstr "ISBN-10: 0198539169"

msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) <https://homepages.cwi.nl/~lex/files/histco.ps>`__"
msgstr "Se cree que la forma general del TSP ha sido estudiada por primera vez por Kalr Menger en Viena y Harvard. El problema fue promovido más tarde por Hassler, Whitney & Merrill en Princeton. Una descripción detallada sobre la conexión entre Menger & Whitney, y el desarrollo del TSP se puede encontrar en `On the history of combinatorial optimization (till 1960) <https://homepages.cwi.nl/~lex/files/histco.ps>`_"

msgid "To calculate the number of different tours through :math:`n` cities:"
msgstr "Para calcular el número de recorridos diferentes a través de :math:`n` ciudades:"

msgid "Given a starting city,"
msgstr "Dada una ciudad de partida,"

msgid "There are :math:`n-1` choices for the second city,"
msgstr "Hay :math:`n-1` opción para la segunda ciudad,"

msgid "And :math:`n-2` choices for the third city, etc."
msgstr "Y :math:`n-2` opciones para la tercera ciudad, etc."

msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`."
msgstr "Al multiplicarlas obtenemos :math:`(n-1)! = (n-1) (n-2) . . 1`."

msgid "Now since the travel costs do not depend on the direction taken around the tour:"
msgstr "Ahora, dado que los costos de viaje no dependen de la dirección tomada alrededor del recorrido:"

msgid "this number by 2"
msgstr "este número por 2"

msgid ":math:`(n-1)!/2`."
msgstr ":math:`(n-1)!/2`."

msgid "Characteristics"
msgstr "Características"

msgid "This problem is an NP-hard optimization problem."
msgstr "Este problema es un problema de optimización NP-duro."

msgid "Metric Algorithm is used"
msgstr "Se utiliza el algoritmo métrico"

msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:"
msgstr "La implementación genera soluciones que *son el doble de largas que el recorrido óptimo en el peor de los casos*:"

msgid "Graph characteristics for best performance:"
msgstr ""

msgid "Graph is undirected"
msgstr "El grafo es no dirigido"

msgid "Graph is fully connected"
msgstr "El grafo está completamente conectado"

msgid "Graph where traveling costs on edges obey the triangle inequality."
msgstr "Grafo donde los costos de viaje en los segmentos cumplen con la desigualdad del triángulo."

msgid "The traveling costs are symmetric:"
msgstr "Los costos del viaje son simétricos:"

msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``"
msgstr "Los costos del viaje de ``u`` a ``v`` son tanto como viajar de ``v`` a ``u``"

msgid "TSP optional parameters"
msgstr "Parámetros opcionales de TSP"

msgid "``start_id``"
msgstr "``start_id``"

msgid "``0``"
msgstr "``0``"

msgid "The first visiting vertex"
msgstr "El primer vértice visitado"

msgid "When `0` any vertex can become the first visiting vertex."
msgstr "Cuando `0` cualquier vértice puede convertirse en el primer vértice visitado."

msgid "``end_id``"
msgstr "``end_id``"

msgid "Last visiting vertex before returning to ``start_vid``."
msgstr "Último vértice visitado antes de regresar a ``start_vid``."

msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``."
msgstr "Cuando ``0`` cualquier vértice puede convertirse en el último vértice visitado antes de regresar a ``start_vid``."

msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex"
msgstr "Cuando ``NOT 0`` y ``start_vid = 0`` entonces es el primer y último vértice"

msgid "References"
msgstr "Referencias"

msgid "`Boost: metric TSP approx <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
msgstr "`Boost: aproximación métrica de TSP <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"

msgid "`University of Waterloo TSP <https://www.math.uwaterloo.ca/tsp/>`__"
msgstr "`Universided de Waterloo TSP <https://www.math.uwaterloo.ca/tsp/>`__"

msgid "`Wikipedia: Traveling Salesman Problem <https://en.wikipedia.org/wiki/Traveling_salesman_problem>`__"
msgstr "`Wikipedia: Problema del viajante <https://es.wikipedia.org/wiki/Problema_del_viajante>`__"

msgid "Vehicle Routing Functions - Category"
msgstr "Funciones de Ruteo de Vehículos - Categoría"

msgid "Pickup and delivery problem"
msgstr "Problema de recogida y entrega"

msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix"
msgstr ":doc:`pgr_pickDeliver` - Recogida y Entrega utilizando una Matriz de Costos"

msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances"
msgstr ":doc:`pgr_pickDeliverEuclidean` - Recoger y Entregar con distancias Euclideanas"

msgid "Distribution problem"
msgstr "Problema de distribución"

msgid ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders"
msgstr ":doc:`pgr_vrpOneDepot` - Desde un único depósito, distribuye los pedidos"

msgid "Contents"
msgstr "Contenido"

msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)."
msgstr "Problemas de Ruteo de Vehículos `VRP` son problemas de optimización **NP-hard** , que generaliza el problema del vendedor viajante (TSP)."

msgid "The objective of the VRP is to minimize the total route cost."
msgstr "El objetivo del VRP es minimizar el costo total de la ruta."

msgid "There are several variants of the VRP problem,"
msgstr "Hay distintas variantes del problema VRP,"

msgid "**pgRouting does not try to implement all variants.**"
msgstr "**pgRouting no intenta implementar todas las variantes.**"

msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods."
msgstr "Problema de Ruteo de Vehículos Capacitados `CVRP` donde los vehículos tienen una capacidad de transporte limitada de las mercancías."

msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made."
msgstr "Problema de Ruteo del Vehículo con Ventanas de Tiempo `VRPTW` donde las ubicaciones tienen ventanas de tiempo dentro de las cuales se deben realizar las visitas del vehículo."

msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations."
msgstr "Problema de Ruteo de Vehículos con Recogida y Entrega `VRPPD` donde una serie de mercancías necesitan ser trasladadas de ciertas ubicaciones de recogida a otros lugares de entrega."

msgid "Limitations"
msgstr "Limitaciones"

msgid "No multiple time windows for a location."
msgstr "No hay varias ventanas de tiempo para una ubicación."

msgid "Less vehicle used is considered better."
msgstr "Menos vehículo utilizado se considera mejor."

msgid "Less total duration is better."
msgstr "Menos duración total es mejor."

msgid "Less wait time is better."
msgstr "Menos tiempo de espera es mejor."

msgid "Pick & Delivery"
msgstr "Recogida y Entrega"

msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows"
msgstr "Problema: `CVRPPDTW` Problema de Ruteo de vehículos de recogida y entrega capacitado con Ventanas de Tiempo"

msgid "Times are relative to `0`"
msgstr "Los tiempos son relativos a `0`"

msgid "The vehicles"
msgstr "Los vehículos"

msgid "have start and ending service duration times."
msgstr "tienen tiempos de duración del servicio de inicio y fin."

msgid "have opening and closing times for the start and ending locations."
msgstr "tienen horarios de apertura y cierre para las ubicaciones de inicio y finalización."

msgid "have a capacity."
msgstr "tienen cierta capacidad."

msgid "The orders"
msgstr "Las órdenes"

msgid "Have pick up and delivery locations."
msgstr "Tener lugares de recogida y entrega."

msgid "Have opening and closing times for the pickup and delivery locations."
msgstr "Tener horarios de apertura y cierre para las ubicaciones de recogida y entrega."

msgid "Have pickup and delivery duration service times."
msgstr "Tener tiempos de servicio de recogida y entrega."

msgid "have a demand request for moving goods from the pickup location to the delivery location."
msgstr "solicitar el traslado de mercancías desde el lugar de recogida hasta el lugar de entrega."

msgid "Time based calculations:"
msgstr "Cálculos basados en el tiempo:"

msgid "Travel time between customers is :math:`distance / speed`"
msgstr "El tiempo de viaje entre los clientes es :math:`distancia / velocidad`"

msgid "Pickup and delivery order pair is done by the same vehicle."
msgstr "El par de órdenes de recogida y entrega se realiza por el mismo vehículo."

msgid "A pickup is done before the delivery."
msgstr "La recogida se realiza antes de la entrega."

msgid "Pick & deliver"
msgstr "Recogida y Entrega"

msgid "Used in :doc:`pgr_pickDeliverEuclidean`"
msgstr "Usado en :doc:`pgr_pickDeliverEuclidean`"

msgid "`Orders SQL`_"
msgstr "`SQL de órdenes`_"

msgid "`Orders SQL`_ as described below."
msgstr "`SQL de órdenes`_ como se describe más adelante."

msgid "`Vehicles SQL`_"
msgstr "`SQL de Vehículos`_"

msgid "`Vehicles SQL`_ as described below."
msgstr "`SQL de Vehículos`_ como se describe más adelante."

msgid "Used in :doc:`pgr_pickDeliver`"
msgstr "Usado en :doc:`pgr_pickDeliver`"

msgid "`Matrix SQL`_"
msgstr "`SQL de matriz`_"

msgid "`Matrix SQL`_ as described below."
msgstr "`SQL de matriz`_ como se describe más adelante."

msgid "Pick-Deliver optional parameters"
msgstr "Parámetros opcionales de Recoger-Entregar"

msgid "``factor``"
msgstr "``factor``"

msgid "``NUMERIC``"
msgstr "``NUMERIC``"

msgid "1"
msgstr "1"

msgid "Travel time multiplier. See :ref:`pd_factor`"
msgstr "Multiplicador de tiempo de viaje. Ver :ref:`pd_factor`"

msgid "``max_cycles``"
msgstr "``max_cycles``"

msgid "``INTEGER``"
msgstr "``INTEGER``"

msgid "10"
msgstr "10"

msgid "Maximum number of cycles to perform on the optimization."
msgstr "Número máximo de ciclos a realizar en la optimización."

msgid "``initial_sol``"
msgstr "``initial_sol``"

msgid "4"
msgstr "4"

msgid "Initial solution to be used."
msgstr "Solución inicial a utilizar."

msgid "``1`` One order per truck"
msgstr "``1`` Una orden por camión"

msgid "``2`` Push front order."
msgstr "``2`` Empuje la orden delantera."

msgid "``3`` Push back order."
msgstr "``3`` Empuje la orden trasera."

msgid "``4`` Optimize insert."
msgstr "``4`` Optimizar inserción."

msgid "``5`` Push back order that allows more orders to be inserted at the back"
msgstr "``5`` Orden de retroceso que permite insertar más órdenes en la parte posterior"

msgid "``6`` Push front order that allows more orders to be inserted at the front"
msgstr "``6`` Orden de avance que permite insertar más órdenes en la parte frontal"

msgid "Orders SQL"
msgstr "SQL de órdenes"

msgid "Common columns for the orders SQL in both implementations:"
msgstr "En general, las columnas para las órdenes SQL es la misma en ambas implementaciones:"

msgid "|ANY-INTEGER|"
msgstr "|ANY-INTEGER|"

msgid "Identifier of the pick-delivery order pair."
msgstr "Identificador del par de órdenes recogida-entrega."

msgid "``demand``"
msgstr "``demand``"

msgid "|ANY-NUMERICAL|"
msgstr "|ANY-NUMERICAL|"

msgid "Number of units in the order"
msgstr "Número de unidades en la orden"

msgid "``p_open``"
msgstr "``p_open``"

msgid "The time, relative to 0, when the pickup location opens."
msgstr "La hora, en relación con 0, cuando se abre la ubicación de recogida."

msgid "``p_close``"
msgstr "``p_close``"

msgid "The time, relative to 0, when the pickup location closes."
msgstr "La hora, en relación con 0, cuando se cierra la ubicación de recogida."

msgid "[``p_service``]"
msgstr "[``p_service``]"

msgid "The duration of the loading at the pickup location."
msgstr "La duración de la carga en el lugar de recogida."

msgid "When missing: 0 time units are used"
msgstr "Cuando falta: Son usadas 0 unidades de tiempo"

msgid "``d_open``"
msgstr "``d_open``"

msgid "The time, relative to 0, when the delivery location opens."
msgstr "La hora, en relación con 0, cuando se abre la ubicación de entrega."

msgid "``d_close``"
msgstr "``d_close``"

msgid "The time, relative to 0, when the delivery location closes."
msgstr "La hora, en relación con 0, cuando se cierra la ubicación de entrega."

msgid "[``d_service``]"
msgstr "[``d_service``]"

msgid "The duration of the unloading at the delivery location."
msgstr "La duración de la descarga en el lugar de entrega."

msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:"
msgstr "Para :doc:`pgr_pickDeliver` los identificadores de ubicación de la carga y envío son necesarias:"

msgid "``p_node_id``"
msgstr "``p_node_id``"

msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_."
msgstr "El identificador de nodo de la recogida debe coincidir con un identificador de vértice en la `SQL de matriz`_."

msgid "``d_node_id``"
msgstr "``d_node_id``"

msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_."
msgstr "El identificador de nodo de la entrega debe coincidir con un identificador de vértice en la `SQL de matriz`_."

msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:"
msgstr "Para :doc:`pgr_pickDeliverEuclidean` los valores :math:`(x, y)` de las ubicaciones son necesarias:"

msgid "``p_x``"
msgstr "``p_x``"

msgid ":math:`x` value of the pick up location"
msgstr ":math:`x` valor de la ubicación de recogida"

msgid "``p_y``"
msgstr "``p_y``"

msgid ":math:`y` value of the pick up location"
msgstr ":math:`y` valor de la ubicación de recogida"

msgid "``d_x``"
msgstr "``d_x``"

msgid ":math:`x` value of the delivery location"
msgstr "valor :math:`x` de la ubicación de entrega"

msgid "``d_y``"
msgstr "``d_y``"

msgid ":math:`y` value of the delivery location"
msgstr "valor :math:`y` del lugar de entrega"

msgid "Vehicles SQL"
msgstr "SQL de Vehículos"

msgid "Common columns for the vehicles SQL in both implementations:"
msgstr "Las columnas comunas para vehículos SQL son las mismas en ambas implementaciones:"

msgid "Identifier of the vehicle."
msgstr "Identificador del vehículo."

msgid "``capacity``"
msgstr "``capacity``"

msgid "Maiximum capacity units"
msgstr "Máxima capacidad"

msgid "``start_open``"
msgstr "``start_open``"

msgid "The time, relative to 0, when the starting location opens."
msgstr "La hora, en relación con 0, cuando se abre la ubicación inicial."

msgid "``start_close``"
msgstr "``start_close``"

msgid "The time, relative to 0, when the starting location closes."
msgstr "La hora, en relación con 0, cuando se cierra la ubicación inicial."

msgid "[``start_service``]"
msgstr "[``start_service``]"

msgid "The duration of the loading at the starting location."
msgstr "La duración de la carga en la ubicación inicial."

msgid "When missing: A duration of :math:`0` time units is used."
msgstr "Cuando falta: Una duración de :math: `0` unidades de tiempo son usadas."

msgid "[``end_open``]"
msgstr "[``end_open``]"

msgid "The time, relative to 0, when the ending location opens."
msgstr "La hora, en relación con 0, cuando se abre la ubicación final."

msgid "When missing: The value of ``start_open`` is used"
msgstr "Cuando falte: El valor de``start_open`` se usara"

msgid "[``end_close``]"
msgstr "[``end_close``]"

msgid "The time, relative to 0, when the ending location closes."
msgstr "La hora, en relación con 0, cuando se cierra la ubicación final."

msgid "When missing: The value of ``start_close`` is used"
msgstr "Cuando falte: Se usara el valor de ``start_close``"

msgid "[``end_service``]"
msgstr "[``end_service``]"

msgid "The duration of the loading at the ending location."
msgstr "La duración de la carga en la ubicación final."

msgid "When missing: A duration in ``start_service`` is used."
msgstr "Cuando falte: Se usara una duración en ``start_service``."

msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:"
msgstr "Para :doc:`pgr_pickDeliver` se necesitan los identificadores de salida y destino:"

msgid "``start_node_id``"
msgstr "``start_node_id``"

msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_."
msgstr "El identificador de nodo de la ubicación inicial debe coincidir con un identificador de vértice en la `SQL de matriz`_."

msgid "[``end_node_id``]"
msgstr "[``end_node_id``]"

msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_."
msgstr "El identificador de nodo de la ubicación final debe coincidir con un identificador de vértice en la `SQL de matriz`_."

msgid "When missing: ``end_node_id`` is used."
msgstr "Cuando falte: Se usara``end_node_id``."

msgid "``start_x``"
msgstr "``start_x``"

msgid ":math:`x` value of the starting location"
msgstr "Valor :math:`x` de la ubicación de salida"

msgid "``start_y``"
msgstr "``start_y``"

msgid ":math:`y` value of the starting location"
msgstr "Valor :math:`y` de la ubicación de salida"

msgid "[``end_x``]"
msgstr "[``end_x``]"

msgid ":math:`x` value of the ending location"
msgstr "Valor :math:`x` de la ubicación del destino"

msgid "When missing: ``start_x`` is used."
msgstr "Cuando falte: Se usará ``start_x``."

msgid "[``end_y``]"
msgstr "[``end_y``]"

msgid ":math:`y` value of the ending location"
msgstr "Valor :math:`y` del la ubicaclón del destino"

msgid "When missing: ``start_y`` is used."
msgstr "Cuando falte: Se usará ``start_y``."

msgid "Matrix SQL"
msgstr "SQL de matriz"

msgid "Set of |matrix-result|"
msgstr "Conjunto de |matrix-result|"

msgid "Identifier of the starting vertex."
msgstr "Identificador del vértice de salida."

msgid "``end_vid``"
msgstr "``end_vid``"

msgid "Identifier of the ending vertex."
msgstr "Identificador del vértice final."

msgid "Aggregate cost from ``start_vid`` to ``end_vid``."
msgstr "Costo afregado desde ``start_vid`` hasta ``end_vid``."

msgid "Sequential value starting from **1**."
msgstr "Valor secuencial a partir de **1**."

msgid "``vehicle_seq``"
msgstr "``vehicle_seq``"

msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution."
msgstr "Valor secuencial a partir de **1** para vehículos actuales. El vehículo :math:`n_{th}` en la solución."

msgid "Value :math:`-2` indicates it is the summary row."
msgstr "Valor :math:`-2` para indicar que es una fila de resumen."

msgid "``vehicle_id``"
msgstr "``vehicle_id``"

msgid "BIGINT"
msgstr "BIGINT"

msgid "Current vehicle identifier."
msgstr "Identificador del vehículo actual."

msgid "Summary row has the **total capacity violations**."
msgstr "Fila de resumen tiene el **total de infracciones de capacidad**."

msgid "A capacity violation happens when overloading or underloading a vehicle."
msgstr "Cuando se sobrecarga o subrogar un vehículo, ocurre una infracción de capacidad."

msgid "``stop_seq``"
msgstr "``stop_seq``"

msgid "INTEGER"
msgstr "INTEGER"

msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle."
msgstr "Valor secuencial a partir de **1** para las paradas realizadas por el vehículo actual. La parada :math:`m_{th}` del vehículo actual."

msgid "Summary row has the **total time windows violations**."
msgstr "Fila de resumen tiene el **total de violaciones de ventanas de tiempo**."

msgid "A time window violation happens when arriving after the location has closed."
msgstr "Una infracción de ventana de tiempo ocurre cuando se llega a la ubicación después de que ésta cerró."

msgid "``stop_type``"
msgstr "``stop_type``"

msgid "Kind of stop location the vehicle is at"
msgstr "Tipo de parada en la que se encuentra el vehículo"

msgid ":math:`-1`: at the solution summary row"
msgstr ":math:`-1`: en la fila de resumen de solución"

msgid ":math:`1`: Starting location"
msgstr "``1``: Ubicación inicial"

msgid ":math:`2`: Pickup location"
msgstr ":math:`2`: Ubicación de recogida"

msgid ":math:`3`: Delivery location"
msgstr ":math:`3`: Lugar de entrega"

msgid ":math:`6`: Ending location and indicates the vehicle's summary row"
msgstr ":math:`6`: Ubicación final indica la fila de resumen del vehículo"

msgid "``order_id``"
msgstr "``order_id``"

msgid "Pickup-Delivery order pair identifier."
msgstr "Identificador de par de órdenes Recoger-Entregar."

msgid "Value :math:`-1`: When no order is involved on the current stop location."
msgstr "Valor :math:`-1`: Cuando no hay pedidos involucrados en la ubicación de la parada actual."

msgid "``cargo``"
msgstr "``cargo``"

msgid "Cargo units of the vehicle when leaving the stop."
msgstr "Unidades de carga del vehículo al salir de la parada."

msgid "Value :math:`-1` on solution summary row."
msgstr "El valor :math:`-1` en fila de resumen de solución."

msgid "``travel_time``"
msgstr "``travel_time``"

msgid "Travel time from previous ``stop_seq`` to current ``stop_seq``."
msgstr "Tiempo de viaje desde el ``stop_seq`` anterior hasta el ``stop_seq`` actual."

msgid "Summary has the **total traveling time**:"
msgstr "El resumen tiene el **tiempo total de viaje**:"

msgid "The sum of all the ``travel_time``."
msgstr "La suma de todos los ``travel_time``."

msgid "``arrival_time``"
msgstr "``arrival_time``"

msgid "Time spent waiting for current location to open."
msgstr "Tiempo de espera para la apertura de la ubicación actual."

msgid ":math:`-1`: at the solution summary row."
msgstr ":math:`-1` en fila de resumen de solución."

msgid ":math:`0`: at the starting location."
msgstr ":math:`0`: en la ubicación inicial."

msgid "``wait_time``"
msgstr "``wait_time``"

msgid "Summary row has the **total waiting time**:"
msgstr "La fila de resumen tiene el **tiempo total de espera**:"

msgid "The sum of all the ``wait_time``."
msgstr "La suma de todo el ``wait_time``."

msgid "``service_time``"
msgstr "``service_time``"

msgid "Service duration at current location."
msgstr "Duralción del servicio en la ubicación actual."

msgid "Summary row has the **total service time**:"
msgstr "La fila de resumen tiene el **tiempo total de servicio**:"

msgid "The sum of all the ``service_time``."
msgstr "La suma de todo el ``service_time``."

msgid "``departure_time``"
msgstr "``departure_time``"

msgid "The time at which the vehicle departs from the stop."
msgstr "El tiempo en el que el vehículo sale desde la parada."

msgid ":math:`arrival\\_time + wait\\_time + service\\_time`."
msgstr ":math:`arrival\\_time + wait\\_time + service\\_time`."

msgid "The ending location has the **total time** used by the current vehicle."
msgstr "El destino final tiene el **tiempo total** utilizado por el vehículo actual."

msgid "Summary row has the **total solution time**:"
msgstr "La fila de resumen tiene el **tiempo total de solución**:"

msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`."
msgstr ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`."

msgid "Summary Row"
msgstr "Fila de Resumen"

msgid "Continues the sequence"
msgstr "Continúa la secuencia"

msgid "**total capacity violations**:"
msgstr "**infracciones de capacidad total**:"

msgid "**total time windows violations**:"
msgstr "**Cantidad total de violaciones de ventanas de tiempo**:"

msgid ":math:`-1`"
msgstr ":math:`-1`"

msgid "**total traveling time**:"
msgstr "**tiempo total transportándose**:"

msgid "**total waiting time**:"
msgstr "*tiempo total de espera**:"

msgid "**total service time**:"
msgstr "**tiempo total de servicio**:"

msgid "Handling Parameters"
msgstr "Parámetros de Manipulación"

msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered."
msgstr "Para definir un problema, hay que hacer varias consideraciones, para obtener resultados consistentes. En esta sección se proporciona una idea de cómo se deben considerar los parámetros."

msgid "`Capacity and Demand Units Handling`_"
msgstr "`Manejo de Unidades de Capacidad y Demanda`_"

msgid "`Locations`_"
msgstr "`Ubicaciones`_"

msgid "`Time Handling`_"
msgstr "`Manejo del tiempo`_"

msgid "`Factor Handling`_"
msgstr "`Manejo de Factor`_"

msgid "Capacity and Demand Units Handling"
msgstr "Manejo de Unidades de Capacidad y Demanda"

msgid "The `capacity` of a vehicle, can be measured in:"
msgstr "La `capacidad` de un vehículo, se puede medir en:"

msgid "Volume units like :math:`m^3`."
msgstr "Unidades de volumen como :math:`m^3`."

msgid "Area units like :math:`m^2` (when no stacking is allowed)."
msgstr "Unidades de área como :math:`m^2` (cuando no se permite el apilamiento)."

msgid "Weight units like :math:`kg`."
msgstr "Unidades de peso como :math:`kg`."

msgid "Number of boxes that fit in the vehicle."
msgstr "Número de cajas que caben en el vehículo."

msgid "Number of seats in the vehicle"
msgstr "Número de asientos en el vehículo"

msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`."
msgstr "La solicitud de `demanda` de las órdenes de recogida-entrega debe utilizar las mismas unidades que las utilizadas en la `capacidad` del vehículo."

msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)."
msgstr "Para manejar problemas como: 10 cajas (de igual dimensión) de manzanas y 5 kg de plumas que van a ser transportadas (no embaladas en cajas)."

msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed."
msgstr "Si la **capacidad** del vehículo se mide mediante `cajas`, se necesita una conversión de `kg de plumas` a `número equivalente de cajas`."

msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed."
msgstr "Si la **capacidad** del vehículo se mide en `kg`, se necesita una conversión de `cajas de manzanas` a `kg`."

msgid "Showing how the 2 possible conversions can be done"
msgstr "Mostrar cómo se pueden hacer las 2 conversiones posibles"

msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples."
msgstr "Sea: - :math:`f_boxes`: el número de cajas necesarias para `1` kg de plumas. - :math:`a_weight`: peso de `1` caja de manzanas."

msgid "Capacity Units"
msgstr "Unidades de Capacidad"

msgid "apples"
msgstr "Manzanas"

msgid "feathers"
msgstr "plumas"

msgid "boxes"
msgstr "cajas"

msgid ":math:`5 * f\\_boxes`"
msgstr ":math:`5 * f\\_cajas`"

msgid "kg"
msgstr "kg"

msgid ":math:`10 * a\\_weight`"
msgstr ":math:`10 * a\\_peso`"

msgid "5"
msgstr "5"

msgid "Locations"
msgstr "Ubiaciones"

msgid "When using :doc:`pgr_pickDeliverEuclidean`:"
msgstr "Cuando se use :doc:`pgr_pickDeliverEuclidean`:"

msgid "The vehicles have :math:`(x, y)` pairs for start and ending locations."
msgstr "Los vehículos tienen :math:`(x, y)` pares para las ubicaciones de inicio y fin."

msgid "The orders Have :math:`(x, y)` pairs for pickup and delivery locations."
msgstr "Los pedidos tienen :math:`(x, y)` pares para ubicaciones de recogida y entrega."

msgid "When using :doc:`pgr_pickDeliver`:"
msgstr "Cuando se use :doc:`pgr_pickDeliver`:"

msgid "The vehicles have identifiers for the start and ending locations."
msgstr "Los vehículos tienen identificadores para las ubicaciones de inicio y finalización."

msgid "The orders have identifiers for the pickup and delivery locations."
msgstr "Los pedidos tienen identificadores para las ubicaciones de recogida y entrega."

msgid "All the identifiers are indices to the given matrix."
msgstr "Todos los identificadores son índices de la matriz dada."

msgid "Time Handling"
msgstr "Manejo del Tiempo"

msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units."
msgstr "El tiempo es relativo a **0**. Todas las unidades de tiempo se convierte a la referencia de **0** y las mismas unidades de tiempo."

msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds."
msgstr "Supongamos que el conductor de un vehículo comienza el turno a las 9:00 am y termina el turno a las 4:30 pm y la duración del tiempo de servicio es de 10 minutos con 30 segundos."

msgid "Meaning of 0"
msgstr "Significado de 0"

msgid "time units"
msgstr "unidades de tiempo"

msgid "9:00 am"
msgstr "9:00 am"

msgid "4:30 pm"
msgstr "4:30 pm"

msgid "10 min 30 secs"
msgstr "10 min 30 seg"

msgid "0:00 am"
msgstr "0:00 am"

msgid "hours"
msgstr "horas"

msgid "9"
msgstr "9"

msgid "16.5"
msgstr "16.5"

msgid ":math:`10.5 / 60 = 0.175`"
msgstr ":math:`10.5 / 60 = 0.175`"

msgid "minutes"
msgstr "minutos"

msgid ":math:`9*60 = 54`"
msgstr ":math:`9*60 = 54`"

msgid ":math:`16.5*60 = 990`"
msgstr ":math:`16.5*60 = 990`"

msgid "10.5"
msgstr "10.5"

msgid "0"
msgstr "0"

msgid "7.5"
msgstr "7.5"

msgid ":math:`7.5*60 = 540`"
msgstr ":math:`7.5*60 = 540`"

msgid "Factor handling"
msgstr "Manipulación del Factor"

msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values."
msgstr "``factor`` funciona como un multiplicador que convierte valores de distancia a unidades de tiempo, ya sea en valores matriciales o euclidianos."

msgid "When the values are already in the desired time units"
msgstr "Los valores ya están en la unidad de tiempo deseada"

msgid "``factor`` should be **1**"
msgstr "``factor`` debería ser **1**"

msgid "When ``factor`` > 1 the travel times are faster"
msgstr "Cuando ``factor`` > 1 el tiempo de viaje es más rápido"

msgid "When ``factor`` < 1 the travel times are slower"
msgstr "Cuando ``factor`` > 1 el tiempo de viaje es más lento"

msgid "For the :doc:`pgr_pickDeliverEuclidean`:"
msgstr "Para el :doc:`pgr_pickDeliverEuclidean`:"

msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity."
msgstr "Trabajando con la unidad de tiempo en segundos, con x/y en lat/lon : Factor: dependería en la ubicación de los puntos y la velocidad promedio, digamos con velocidad de 25m/s."

msgid "Latitude"
msgstr "Latitud"

msgid "Conversion"
msgstr "Conversión"

msgid "Factor"
msgstr "Factor"

msgid "45"
msgstr "45"

msgid "1 longitude degree is (78846.81m)/(25m/s)"
msgstr "1 grado de longitud es (78846.81m)/(25m/s)"

msgid "3153 s"
msgstr "3153 s"

msgid "1 longitude degree is (111319.46 m)/(25m/s)"
msgstr "1 grado de longitud es (111319.46 m)/(25m/s)"

msgid "4452 s"
msgstr "4452 s"

msgid "For the :doc:`pgr_pickDeliver`:"
msgstr "Para el :doc:`pgr_pickDeliver`:"

msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`"
msgstr "Dado :math:`v = d / t`entonces :math:`t = d / v` y el ``factor`` se convierte en :math:`1 / v`"

msgid "v"
msgstr "v"

msgid "Velocity"
msgstr "Velocidad"

msgid "d"
msgstr "d"

msgid "Distance"
msgstr "Distancia"

msgid "t"
msgstr "t"

msgid "Time"
msgstr "Tiempo"

msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`"
msgstr "Para las siguientes equivalencias :math:`10m/s \\approx 600m/min \\approx 36 km/hr`"

msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:"
msgstr "Trabajando con segundos para las unidades de tiempo y la matriz en metros: Para un valor de longitud de 1000m en la matriz:"

msgid "Units"
msgstr "Unidades"

msgid "velocity"
msgstr "velocidad"

msgid "Result"
msgstr "Resultado"

msgid "seconds"
msgstr "segundos"

msgid ":math:`10 m/s`"
msgstr ":math:`10 m/s`"

msgid ":math:`\\frac{1}{10m/s}`"
msgstr ":math:`\\frac{1}{10m/s}`"

msgid ":math:`0.1s/m`"
msgstr ":math:`0.1s/m`"

msgid ":math:`1000m * 0.1s/m = 100s`"
msgstr ":math:`1000m * 0.1s/m = 100s`"

msgid ":math:`600 m/min`"
msgstr ":math:`600 m/min`"

msgid ":math:`\\frac{1}{600m/min}`"
msgstr ":math:`\\frac{1}{600m/min}`"

msgid ":math:`0.0016min/m`"
msgstr ":math:`0.0016min/m`"

msgid ":math:`1000m * 0.0016min/m = 1.6min`"
msgstr ":math:`1000m * 0.0016min/m = 1.6min`"

msgid "Hours"
msgstr "Horas"

msgid ":math:`36 km/hr`"
msgstr ":math:`36 km/hr`"

msgid ":math:`\\frac{1}{36 km/hr}`"
msgstr ":math:`\\frac{1}{36 km/hr}`"

msgid ":math:`0.0277hr/km`"
msgstr ":math:`0.0277hr/km`"

msgid ":math:`1km * 0.0277hr/km = 0.0277hr`"
msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`"

msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem"
msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem"

msgid ":doc:`sampledata`"
msgstr ":doc:`sampledata`"

msgid "A* - Family of functions"
msgstr "A* - Familia de Funciones"

msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph."
msgstr "El algoritmo A * (pronunciado \"A estrella\") se basa en el algoritmo de Dijkstra con una heurística que permite resolver problemas de ruta más cortos evaluando sólo un subconjunto de la gráfica."

msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path."
msgstr ":doc:`pgr_aStar` - Algoritmo A* para la ruta más corta."

msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths."
msgstr ":doc:`pgr_aStarCost` - Obtener el costo agregado de las rutas más cortas."

msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths."
msgstr ":doc:`pgr_aStarCostMatrix` - Obtener la matriz de costos de las rutas más cortas."

msgid "The main Characteristics are:"
msgstr "Las características principales son:"

msgid "Process works for directed and undirected graphs."
msgstr "El proceso funciona para grafos dirigidos y no dirigidos."

msgid "Ordering is:"
msgstr "Ordenamiento es:"

msgid "first by ``start_vid`` (if exists)"
msgstr "primero por ``start_vid`` (si existe)"

msgid "then by ``end_vid``"
msgstr "luego por ``end_vid``"

msgid "Values are returned when there is a path."
msgstr "Los valores se devuelven cuando hay una ruta."

msgid "Let :math:`v` and :math:`u` be nodes on the graph:"
msgstr "Sean :math:`v` y :math:`u` nodos en el grafo:"

msgid "If there is no path from :math:`v` to :math:`u`:"
msgstr "Si no hay camino de :math:`v` a :math:`u`:"

msgid "no corresponding row is returned"
msgstr "no se devuelve ninguna fila correspondiente"

msgid "``agg_cost`` from :math:`v` to :math:`u` is :math:`\\infty`"
msgstr "``agg_cost`` de :math:`v` a :math:`u` es :math:`\\infty`"

msgid "There is no path when :math:`v = u` therefore"
msgstr "No hay camino cuando :math:`v = u` por lo tanto"

msgid "``agg_cost`` from `v` to `u` is :math:`0`"
msgstr "``agg_cost`` de `v` a `u` es :math:`0`"

msgid "When :math:`(x,y)` coordinates for the same vertex identifier differ:"
msgstr "Cuando las coordenadas (x,y) para el mismo identificador de vértice difieren:"

msgid "A random selection of the vertex's :math:`(x,y)` coordinates is used."
msgstr "Se utiliza una selección aleatoria de las coordenadas del vértice :math:`(x,y)`."

msgid "Running time: :math:`O((E + V) * \\log V)`"
msgstr "Tiempo de ejecución: :math:`O((E + V) * \\log V)`"

msgid "aStar optional parameters"
msgstr "Parámetros opcionales de aStar"

msgid "``heuristic``"
msgstr "``heuristic``"

msgid "Heuristic number. Current valid values 0~5."
msgstr "Número heurístico. Valores válidos 0~5."

msgid "0: :math:`h(v) = 0` (Use this value to compare with pgr_dijkstra)"
msgstr "0: :math:`h(v) = 0` (Utilizar este valor para comparar con pgr_dijkstra)"

msgid "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`"
msgstr "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`"

msgid "2: :math:`h(v) = abs(min(\\Delta x, \\Delta y))`"
msgstr "2: :math:`h(v) = abs(min(\\Delta x, \\Delta y))`"

msgid "3: :math:`h(v) = \\Delta x * \\Delta x + \\Delta y * \\Delta y`"
msgstr "3: :math:`h(v) = \\Delta x * \\Delta x + \\Delta y * \\Delta y`"

msgid "4: :math:`h(v) = sqrt(\\Delta x * \\Delta x + \\Delta y * \\Delta y)`"
msgstr "4: :math:`h(v) = sqrt(\\Delta x * \\Delta x + \\Delta y * \\Delta y)`"

msgid "5: :math:`h(v) = abs(\\Delta x) + abs(\\Delta y)`"
msgstr "5: :math:`h(v) = abs(\\Delta x) + abs(\\Delta y)`"

msgid "``1``"
msgstr "``1``"

msgid "For units manipulation. :math:`factor > 0`."
msgstr "Para la manipulación de unidades. math:`factor > 0`."

msgid "``epsilon``"
msgstr "``epsilon``"

msgid "For less restricted results. :math:`epsilon >= 1`."
msgstr "Para resultados menos restringidos. :math:`epsilon >= 1`."

msgid "See :ref:`heuristics <astar_heuristics>` available and :ref:`factor <astar_factor>` handling."
msgstr "Ver :ref:`heuristicas <astar_heuristics>` disponibles y manupulación de :ref:`factor <astar_factor>`."

msgid "Advanced documentation"
msgstr "Documentación avanzada"

msgid "Heuristic"
msgstr "Heurística"

msgid "Currently the heuristic functions available are:"
msgstr "Actualmente las funciones heurísticas disponibles son:"

msgid "where :math:`\\Delta x = x_1 - x_0` and :math:`\\Delta y = y_1 - y_0`"
msgstr "Donde :math:`\\Delta x = x_1 - x_0` y :math:`\\Delta y = y_1 - y_0`"

msgid "Analysis 1"
msgstr "Análisis 1"

msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)"
msgstr "Trabajando con coste/coste_inverso como longitud en grados, x/y en lat/lon: Factor = 1 (no es necesario cambiar las unidades)"

msgid "Analysis 2"
msgstr "Análisis 2"

msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:"
msgstr "Trabajando con coste/coste_inverso como longitud en metros, x/y en lat/lon: Factor = dependería de la ubicación de los puntos:"

msgid "1 longitude degree is 78846.81 m"
msgstr "1 grado de longitud son 78846.81 m"

msgid "78846"
msgstr "78846"

msgid "1 longitude degree is 111319.46 m"
msgstr "1 grado de longitud es 111319,46 m"

msgid "111319"
msgstr "111319"

msgid "Analysis 3"
msgstr "Análisis 3"

msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed."
msgstr "Trabajando con cost/reverse_cost con el tiempo en segundos, x / y en lat/lon: Factor: que depende de la ubicación de los puntos y en la velocidad promedio, digamos que 25m/s es la velocidad."

msgid ":doc:`bdAstar-family`"
msgstr ":doc:`bdAstar-family`"

msgid "`Boost: A* search <https://www.boost.org/libs/graph/doc/astar_search.html>`__"
msgstr "`Boost: Búsqueda A* <https://www.boost.org/libs/graph/doc/astar_search.html>`__"

msgid "https://en.wikipedia.org/wiki/A*_search_algorithm"
msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm"

msgid "All Pairs - Family of Functions"
msgstr "Todos los Pares - Familia de Funciones"

msgid "The following functions work on all vertices pair combinations"
msgstr "Las siguientes funciones funcionan en todas las combinaciones de pares de vértices"

msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm."
msgstr ":doc:`pgr_floydWarshall` - Algoritmo de Floyd-Warshall."

msgid ":doc:`pgr_johnson` - Johnson's algorithm"
msgstr ":doc:`pgr_johnson` - Algoritmo de Johnson"

msgid "The main characteristics are:"
msgstr "Las principales características son:"

msgid "It does not return a path."
msgstr "No devuelve una ruta."

msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph."
msgstr "Regresa la suma de los costos de la ruta más corta para cada par de nodos del grafo."

msgid "Boost returns a :math:`V \\times V` matrix, where the infinity values. Represent the distance between vertices for which there is no path."
msgstr "Boost devuelve una matriz :math:`V \\times V` donde los valores infinitos representan la distancia entre vértices para los que no hay ruta."

msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`."
msgstr "Solo regresa los valores no infinitos en forma de un conjunto de `(start_vid, end_vid, agg_cost)`."

msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`."
msgstr "Sea el caso donde los valores devueltos se almacenan en una tabla, por lo que el índice único sería el par: `(start_vid, end_vid)`."

msgid "For the undirected graph, the results are symmetric."
msgstr "Para el grafo no dirigido, los resultados son simétricos."

msgid "The `agg_cost` of `(u, v)` is the same as for `(v, u)`."
msgstr "El `agg_cost` de `(u, v)` es el mismo que para `(v, u)`."

msgid "When `start_vid` = `end_vid`, the `agg_cost` = 0."
msgstr "Cuando `start_vid` = `end_vid`, el `agg_cost` = 0."

msgid "**Recommended, use a bounding box of no more than 3500 edges.**"
msgstr "**Recomendación: utilice un cuadro delimitador de no más de 3500 aristas.**"

msgid "Optional parameters"
msgstr "Parámetros opcionales"

msgid "``directed``"
msgstr "``directed``"

msgid "``BOOLEAN``"
msgstr "``BOOLEAN``"

msgid "``true``"
msgstr "``true``"

msgid "When ``true`` the graph is considered `Directed`"
msgstr "Cuando ``true`` el gráfo se considera `Dirigido`"

msgid "When ``false`` the graph is considered as `Undirected`."
msgstr "Cuando ``false`` el gráfo se considera `No Dirigido`."

msgid "Performance"
msgstr "Rendimiento"

msgid "The following tests:"
msgstr "Las siguientes pruebas:"

msgid "non server computer"
msgstr "computadora que no sea servidor"

msgid "with AMD 64 CPU"
msgstr "con unidad de procesamiento central AMD 64"

msgid "4G memory"
msgstr "memoria 4G"

msgid "trusty"
msgstr "confiable"

msgid "PostgreSQL version 9.3"
msgstr "PostgreSQL versión 9.3"

msgid "Data"
msgstr "Datos"

msgid "The following data was used"
msgstr "Se usaron los siguientes datos"

msgid "Data processing was done with osm2pgrouting-alpha"
msgstr "El procesamiento de datos se llevó a cabo con osm2pgrouting-alpha"

msgid "Results"
msgstr "Resultados"

msgid "Test"
msgstr "Prueba"

msgid "One"
msgstr "Uno"

msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each <SIZE> 30 tests were executed to get the average The tested query is:"
msgstr "Esta prueba no se hace con cuadro delimitador. La densidad del gráfico que se pasa es extremadamente baja. Para cada <SIZE> se ejecutaron 30 pruebas para obtener el medio. La consulta probada es:"

msgid "The results of this tests are presented as:"
msgstr "Los resultados de la prueba son:"

msgid "SIZE"
msgstr "TAMAÑO"

msgid "is the number of edges given as input."
msgstr "es la cantidad de aristas dadas como entradas."

msgid "EDGES"
msgstr "ARISTAS"

msgid "is the total number of records in the query."
msgstr "es el número de registros en la consulta."

msgid "DENSITY"
msgstr "DENSIDAD"

msgid "is the density of the data :math:`\\dfrac{E}{V \\times (V-1)}`."
msgstr "es la densidad de los datos :math:`\\dfrac{E}{V \\times (V-1)}`."

msgid "OUT ROWS"
msgstr "REGISTROS DEVUELTOS"

msgid "is the number of records returned by the queries."
msgstr "es el número de registros devueltos por las consultas."

msgid "Floyd-Warshall"
msgstr "Floyd-Warshall"

msgid "is the average execution time in seconds of pgr_floydWarshall."
msgstr "es el tiempo promedio de ejecución en segundos de pgr_floydWarshall."

msgid "Johnson"
msgstr "Johnson"

msgid "is the average execution time in seconds of pgr_johnson."
msgstr "es el tiempo promedio de ejecución en segundos de pgr_johnson."

msgid "500"
msgstr "500"

msgid "0.18E-7"
msgstr "0.18E-7"

msgid "1346"
msgstr "1346"

msgid "0.14"
msgstr "0.14"

msgid "0.13"
msgstr "0.13"

msgid "1000"
msgstr "1000"

msgid "0.36E-7"
msgstr "0.36E-7"

msgid "2655"
msgstr "2655"

msgid "0.23"
msgstr "0.23"

msgid "0.18"
msgstr "0.18"

msgid "1500"
msgstr "1500"

msgid "0.55E-7"
msgstr "0.55E-7"

msgid "4110"
msgstr "4110"

msgid "0.37"
msgstr "0.37"

msgid "0.34"
msgstr "0.34"

msgid "2000"
msgstr "2000"

msgid "0.73E-7"
msgstr "0.73E-7"

msgid "5676"
msgstr "5676"

msgid "0.56"
msgstr "0.56"

msgid "2500"
msgstr "2500"

msgid "0.89E-7"
msgstr "0.89E-7"

msgid "7177"
msgstr "7177"

msgid "0.84"
msgstr "0.84"

msgid "0.51"
msgstr "0.51"

msgid "3000"
msgstr "3000"

msgid "1.07E-7"
msgstr "1.07E-7"

msgid "8778"
msgstr "8778"

msgid "1.28"
msgstr "1.28"

msgid "0.68"
msgstr "0.68"

msgid "3500"
msgstr "3500"

msgid "1.24E-7"
msgstr "1.24E-7"

msgid "10526"
msgstr "10526"

msgid "2.08"
msgstr "2.08"

msgid "0.95"
msgstr "0.95"

msgid "4000"
msgstr "4000"

msgid "1.41E-7"
msgstr "1.41E-7"

msgid "12484"
msgstr "12484"

msgid "3.16"
msgstr "3.16"

msgid "1.24"
msgstr "1.24"

msgid "4500"
msgstr "4500"

msgid "1.58E-7"
msgstr "1.58E-7"

msgid "14354"
msgstr "14354"

msgid "4.49"
msgstr "4.49"

msgid "1.47"
msgstr "1.47"

msgid "5000"
msgstr "5000"

msgid "1.76E-7"
msgstr "1.76E-7"

msgid "16503"
msgstr "16503"

msgid "6.05"
msgstr "6.05"

msgid "1.78"
msgstr "1.78"

msgid "5500"
msgstr "5500"

msgid "1.93E-7"
msgstr "1.93E-7"

msgid "18623"
msgstr "18623"

msgid "7.53"
msgstr "7.53"

msgid "2.03"
msgstr "2.03"

msgid "6000"
msgstr "6000"

msgid "2.11E-7"
msgstr "2.11E-7"

msgid "20710"
msgstr "20710"

msgid "8.47"
msgstr "8.47"

msgid "2.37"
msgstr "2.37"

msgid "6500"
msgstr "6500"

msgid "2.28E-7"
msgstr "2.28E-7"

msgid "22752"
msgstr "22752"

msgid "9.99"
msgstr "9.99"

msgid "2.68"
msgstr "2.68"

msgid "7000"
msgstr "7000"

msgid "2.46E-7"
msgstr "2.46E-7"

msgid "24687"
msgstr "24687"

msgid "11.82"
msgstr "11.82"

msgid "3.12"
msgstr "3.12"

msgid "7500"
msgstr "7500"

msgid "2.64E-7"
msgstr "2.64E-7"

msgid "26861"
msgstr "26861"

msgid "13.94"
msgstr "13.94"

msgid "3.60"
msgstr "3.60"

msgid "8000"
msgstr "8000"

msgid "2.83E-7"
msgstr "2.83E-7"

msgid "29050"
msgstr "29050"

msgid "15.61"
msgstr "15.61"

msgid "4.09"
msgstr "4.09"

msgid "8500"
msgstr "8500"

msgid "3.01E-7"
msgstr "3.01E-7"

msgid "31693"
msgstr "31693"

msgid "17.43"
msgstr "17.43"

msgid "4.63"
msgstr "4.63"

msgid "9000"
msgstr "9000"

msgid "3.17E-7"
msgstr "3.17E-7"

msgid "33879"
msgstr "33879"

msgid "19.19"
msgstr "19.19"

msgid "5.34"
msgstr "5.34"

msgid "9500"
msgstr "9500"

msgid "3.35E-7"
msgstr "3.35E-7"

msgid "36287"
msgstr "36287"

msgid "20.77"
msgstr "20.77"

msgid "6.24"
msgstr "6.24"

msgid "10000"
msgstr "10000"

msgid "3.52E-7"
msgstr "3.52E-7"

msgid "38491"
msgstr "38491"

msgid "23.26"
msgstr "23.26"

msgid "6.51"
msgstr "6.51"

msgid "Two"
msgstr "Dos"

msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each <SIZE> 30 tests were executed to get the average The tested edge query is:"
msgstr "Esta prueba se hace con cuadro delimitador. La densidad del gráfico que se pasa es superior a la de la prueba 1. Para cada <SIZE> se ejecutaron 30 pruebas para obtener el medio. La consulta de arista que se prueba es:"

msgid "The tested queries"
msgstr "Las consultas probadas"

msgid "is the size of the bounding box."
msgstr "es el tamaño del cuadro delimitador."

msgid "0.001"
msgstr "0.001"

msgid "44"
msgstr "44"

msgid "0.0608"
msgstr "0.0608"

msgid "1197"
msgstr "1197"

msgid "0.10"
msgstr "0.10"

msgid "0.002"
msgstr "0.002"

msgid "99"
msgstr "99"

msgid "0.0251"
msgstr "0.0251"

msgid "4330"
msgstr "4330"

msgid "0.003"
msgstr "0.003"

msgid "223"
msgstr "223"

msgid "0.0122"
msgstr "0.0122"

msgid "18849"
msgstr "18849"

msgid "0.12"
msgstr "0.12"

msgid "0.004"
msgstr "0.004"

msgid "358"
msgstr "358"

msgid "0.0085"
msgstr "0.0085"

msgid "71834"
msgstr "71834"

msgid "0.16"
msgstr "0.16"

msgid "0.005"
msgstr "0.005"

msgid "470"
msgstr "470"

msgid "0.0070"
msgstr "0.0070"

msgid "116290"
msgstr "116290"

msgid "0.22"
msgstr "0.22"

msgid "0.19"
msgstr "0.19"

msgid "0.006"
msgstr "0.006"

msgid "639"
msgstr "639"

msgid "0.0055"
msgstr "0.0055"

msgid "207030"
msgstr "207030"

msgid "0.27"
msgstr "0.27"

msgid "0.007"
msgstr "0.007"

msgid "843"
msgstr "843"

msgid "0.0043"
msgstr "0.0043"

msgid "346930"
msgstr "346930"

msgid "0.64"
msgstr "0.64"

msgid "0.38"
msgstr "0.38"

msgid "0.008"
msgstr "0.008"

msgid "996"
msgstr "996"

msgid "0.0037"
msgstr "0.0037"

msgid "469936"
msgstr "469936"

msgid "0.90"
msgstr "0.90"

msgid "0.49"
msgstr "0.49"

msgid "0.009"
msgstr "0.009"

msgid "1146"
msgstr "1146"

msgid "0.0032"
msgstr "0.0032"

msgid "613135"
msgstr "613135"

msgid "1.26"
msgstr "1.26"

msgid "0.62"
msgstr "0.62"

msgid "0.010"
msgstr "0.010"

msgid "1360"
msgstr "1360"

msgid "0.0027"
msgstr "0.0027"

msgid "849304"
msgstr "849304"

msgid "1.87"
msgstr "1.87"

msgid "0.82"
msgstr "0.82"

msgid "0.011"
msgstr "0.011"

msgid "1573"
msgstr "1573"

msgid "0.0024"
msgstr "0.0024"

msgid "1147101"
msgstr "1147101"

msgid "2.65"
msgstr "2.65"

msgid "1.04"
msgstr "1.04"

msgid "0.012"
msgstr "0.012"

msgid "1789"
msgstr "1789"

msgid "0.0021"
msgstr "0.0021"

msgid "1483629"
msgstr "1483629"

msgid "3.72"
msgstr "3.72"

msgid "1.35"
msgstr "1.35"

msgid "0.013"
msgstr "0.013"

msgid "1975"
msgstr "1975"

msgid "0.0019"
msgstr "0.0019"

msgid "1846897"
msgstr "1846897"

msgid "4.86"
msgstr "4.86"

msgid "1.68"
msgstr "1.68"

msgid "0.014"
msgstr "0.014"

msgid "2281"
msgstr "2281"

msgid "0.0017"
msgstr "0.0017"

msgid "2438298"
msgstr "2438298"

msgid "7.08"
msgstr "7.08"

msgid "2.28"
msgstr "2.28"

msgid "0.015"
msgstr "0.015"

msgid "2588"
msgstr "2588"

msgid "0.0015"
msgstr "0.0015"

msgid "3156007"
msgstr "3156007"

msgid "10.28"
msgstr "10.28"

msgid "2.80"
msgstr "2.80"

msgid "0.016"
msgstr "0.016"

msgid "2958"
msgstr "2958"

msgid "0.0013"
msgstr "0.0013"

msgid "4090618"
msgstr "4090618"

msgid "14.67"
msgstr "14.67"

msgid "3.76"
msgstr "3.76"

msgid "0.017"
msgstr "0.017"

msgid "3247"
msgstr "3247"

msgid "0.0012"
msgstr "0.0012"

msgid "4868919"
msgstr "4868919"

msgid "18.12"
msgstr "18.12"

msgid "4.48"
msgstr "4.48"

msgid ":doc:`pgr_johnson`"
msgstr ":doc:`pgr_johnson`"

msgid ":doc:`pgr_floydWarshall`"
msgstr ":doc:`pgr_floydWarshall`"

msgid "Boost `floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`__"
msgstr "Boost `floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"

msgid "Bidirectional A* - Family of functions"
msgstr "A* Bidireccional - Familia de Funciones"

msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm."
msgstr "El algoritmo bidirectional A* (leído \"A estrella\") se basa en el algoritmo A*."

msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths."
msgstr ":doc:`pgr_bdAstar` - Algoritmo bidireccional A* para obtener rutas."

msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths."
msgstr ":doc:`pgr_bdAstarCost` - Algoritmo bidireccional A* para calcular el coste de las rutas."

msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths."
msgstr ":doc:`pgr_bdAstarCostMatrix` - Algoritmo bidireccional A* para calcular una matriz de costes de rutas."

msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph."
msgstr "La búsqueda bidireccional, basado en algoritmo de A*, encuentra el camino más corto desde el vértice inicial (``start_vid``) hasta el vértice final (``end_vid``). Ejecuta dos búsquedas simultáneas: uno hacia adelande del ``start_vid`` y la otra en reversa desde el ``end_vid``, parando cuando las dos se encuentran en el medio. Esta aplicación puede utilizarse con un grafo dirigido y un grafo sin dirección."

msgid "For large graphs where there is a path between the starting vertex and ending vertex:"
msgstr "Para grandes grafos donde hay un camino entre el vértice inicial y el vértice final:"

msgid "It is expected to terminate faster than :doc:`pgr_aStar`"
msgstr "Se espera que termine más rápido que :doc:`pgr_aStar`"

msgid ":doc:`aStar-family`"
msgstr ":doc:`aStar-family`"

msgid "Bidirectional Dijkstra - Family of functions"
msgstr "Bidirectional Dijkstra - Familia de funciones"

msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths."
msgstr ":doc:`pgr_bdDijkstra` - Algoritmo Dijkstra bidireccional para las rutas más cortas."

msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths"
msgstr ":doc:`pgr_bdDijkstraCost` - Dijkstra bidireccional para calcular el costo de las rutas más cortas"

msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths."
msgstr ":doc:`pgr_bdDijkstraCostMatrix` - Algoritmo bidireccional de Dijkstra para crear una matriz de costes de las rutas más cortas."

msgid "Synopsis"
msgstr "Sinopsis"

msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex."
msgstr "Basado en el algoritmo de Dijkstra, la búsqueda bidireccional encuentra el camino más corto entre el vértice de inicio al vértice final."

msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle."
msgstr "Corre dos búsquedas simultaneas: una adelante de la fuente y otra atrás del objetivo, parándose cuando los dos coinciden en medio."

msgid "This implementation can be used with a directed graph and an undirected graph."
msgstr "Esta implementación se puede usar para los grafos dirigidos y no dirigidos."

msgid "A negative value on a cost column is interpreted as the edge does not exist."
msgstr "Valor no negativo en una columna de costo se interpreta como la arista no exite."

msgid "When there is no path:"
msgstr "Cuando no hay ruta:"

msgid "When the starting vertex and ending vertex are the same."
msgstr "Cuando el vértice de salida y el vértice destino son iguales."

msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`"
msgstr "El **costo agregado** de los valores no incluídos :math:`(v, v)` es :math:`0`"

msgid "When the starting vertex and ending vertex are the different and there is no path:"
msgstr "Cuando el vértice de salida y el vértice destino son diferentes y no hay ninguna ruta:"

msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`"
msgstr "El **costo agregado** de los valores no incluídos :math:`(u, v)` es :math: `\\infty`"

msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored."
msgstr "Para fines de optimización, se ignora cualquier valor duplicado en los vertices de salida o destino."

msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`"
msgstr "Tiempo de ejecución (peor de los casos): :math:`O((V \\log V + E))`"

msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:"
msgstr "Para grandes gráficos donde hay un camino entre el vértice inicial y el vértice final:"

msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`"
msgstr "Se espera que termine más rápido que :doc:`pgr_dijkstra`"

msgid "`Boost  <https://www.boost.org/libs/graph/doc>`__"
msgstr "`Boost <https://www.boost.org/libs/graph/doc>`__"

msgid "Chinese Postman Problem - Family of functions"
msgstr "Problema del Cartero Chino - Familia de funciones"

msgid ":doc:`pgr_chinesePostman`"
msgstr ":doc:`pgr_chinesePostman`"

msgid ":doc:`pgr_chinesePostmanCost`"
msgstr ":doc:`pgr_chinesePostmanCost`"

msgid "**The main characteristics are:**"
msgstr "**Las principales características son:**"

msgid "Process is done only on edges with **positive** costs."
msgstr "El proceso se realiza solo en bordes con costos **positivos**."

msgid "Running time: :math:`O(E * (E + V * logV))`"
msgstr "Tiempo de ejecución: :math:`O(E * (E + V * logV))`"

msgid "Graph must be connected."
msgstr "El grafo debe estar conectado."

msgid "An Edges SQL that represents a **directed** graph with the following columns"
msgstr "Un SQL de aristas que representa un grafo **dirigido** con las siguientes columnas"

msgid "Coloring - Family of functions"
msgstr "Coloración - Familia de funciones"

msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach."
msgstr ":doc:`pgr_sequentialVertexColoring`- Algoritmo de coloración de vértices mediante un enfoque codicioso."

msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach."
msgstr ":doc:`pgr_bipartite` - Algoritmo de grafo bipartito mediante un enfoque de coloración basado en DFS."

msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem."
msgstr ":doc:`pgr_edgeColoring` - Algoritmo de coloración de segmentos utilizando el teorema de Vizing."

msgid "Returns set of |result_edge_color|"
msgstr "Regresa el conjunto de |result_edge_color|"

msgid "``color``"
msgstr "``color``"

msgid "Color of the edge."
msgstr "Color de la arista."

msgid "The minimum value of color is 1."
msgstr "El valor mínimo de color es 1."

msgid "Returns set of |result_node_color|"
msgstr "Regresa el conjunto de |result_node_color|"

msgid "Identifier of the node."
msgstr "Identificador del nodo."

msgid "Color of the node."
msgstr "Color del nodo."

msgid "`Boost: <https://www.boost.org/libs/graph/doc/table_of_contents.html>`__"
msgstr "`Boost: <https://www.boost.org/libs/graph/doc/table_of_contents.html>`__"

msgid "Components - Family of functions"
msgstr "Componentes - Familia de funciones"

msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph."
msgstr ":doc:`pgr_connectedComponents` - Componentes conectados de un grafo no dirigido."

msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph."
msgstr ":doc:`pgr_strongComponents` - Componentes fuertemente conectados de un grafo dirigido."

msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph."
msgstr ":doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo no dirigido."

msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph."
msgstr ":doc:`pgr_articulationPoints` - Puntos de articulación de un grafo no dirigido."

msgid ":doc:`pgr_bridges` - Bridges of an undirected graph."
msgstr ":doc:`pgr_bridges` - Puentes de un grafo no dirigido."

msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected."
msgstr ":doc:`pgr_makeConnected` - Detalles de aristas para hacer grafos conectados."

msgid "Contraction - Family of functions"
msgstr "Contraction - Familia de funciones"

msgid ":doc:`pgr_contraction`"
msgstr ":doc:`pgr_contraction`"

msgid ":doc:`pgr_contractionDeadEnd`"
msgstr ":doc:`pgr_contractionDeadEnd`"

msgid ":doc:`pgr_contractionLinear`"
msgstr ":doc:`pgr_contractionLinear`"

msgid ":doc:`pgr_contractionHierarchies`"
msgstr ":doc:`pgr_contractionHierarchies`"

msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path."
msgstr "En grafos de gran tamaño, como los grafos de carreteras o las redes eléctricas, la contracción de grafos puede utilizarse para acelerar algunos algoritmos de grafos. La contracción puede reducir el tamaño del grafo eliminando algunos de los vértices y aristas y añadiendo aristas que representen una secuencia de aristas originales (en algunos métodos pueden conservarse las originales). De este modo, disminuye el tiempo y el espacio totales utilizados por los algoritmos de grafos, en particular los que buscan un camino óptimo."

msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms."
msgstr "Esta implementación ofrece un marco flexible para agregar algoritmos de contracción en el futuro, actualmente, admite dos algoritmos."

msgid "Dead end contraction"
msgstr "Contracción sin salida"

msgid "Linear contraction"
msgstr "Contracción lineal"

msgid "Contraction hierarchies"
msgstr "Jerarquías de contracción"

msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own."
msgstr ""

msgid "All functions allow the user to forbid contraction on a set of nodes."
msgstr "Todas las funciones permiten al usuario prohibir la contracción en un conjunto de nodos."

msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf"
msgstr "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf"

msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf"
msgstr "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf"

msgid "https://jlazarsfeld.github.io/ch.150.project/contents/"
msgstr ""

msgid "Cost - Category"
msgstr "Costo - Categoría"

msgid ":doc:`pgr_aStarCost`"
msgstr ":doc:`pgr_aStarCost`"

msgid ":doc:`pgr_bdAstarCost`"
msgstr ":doc:`pgr_bdAstarCost`"

msgid ":doc:`pgr_dijkstraCost`"
msgstr ":doc:`pgr_dijkstraCost`"

msgid ":doc:`pgr_dijkstraNearCost`"
msgstr ":doc:`pgr_dijkstraNearCost`"

msgid ":doc:`pgr_bdDijkstraCost`"
msgstr ":doc:`pgr_bdDijkstraCost`"

msgid ":doc:`pgr_withPointsCost`"
msgstr ":doc:`pgr_withPointsCost`"

msgid "Each function works as part of the family it belongs to."
msgstr "Cada función funciona como parte de la familia a la que pertenece."

msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested."
msgstr "Devuelve la suma de los costos de la ruta más corta para cada par de combinación de nodos requeridos."

msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: ``(start_vid, end_vid)``."
msgstr "Sea el caso que los valores devueltos se almacenen en una tabla, el índice único sería el par: `(start_vid, end_vid)`."

msgid "Depending on the function and its parameters, the results can be symmetric."
msgstr "Dependiendo de la función y sus parámetros, los resultados pueden ser simétricos."

msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`."
msgstr "El **costo agregado** de :math:`(u, v)` es el mismo que para :math:`(v, u)`."

msgid "Any duplicated value in the start or end vertex identifiers are ignored."
msgstr "Se omite cualquier valor duplicado en los identificadores de vertices de inicio y destino."

msgid "The returned values are ordered:"
msgstr "Los valores regresados se ordenan:"

msgid "``start_vid`` ascending"
msgstr "``start_vid`` ascendente"

msgid "``end_vid`` ascending"
msgstr "``end_vid`` ascendente"

msgid "Cost Matrix - Category"
msgstr "Cost Matrix - Categoría"

msgid ":doc:`pgr_aStarCostMatrix`"
msgstr ":doc:`pgr_aStarCostMatrix`"

msgid ":doc:`pgr_dijkstraCostMatrix`"
msgstr ":doc:`pgr_dijkstraCostMatrix`"

msgid ":doc:`pgr_bdAstarCostMatrix`"
msgstr ":doc:`pgr_bdAstarCostMatrix`"

msgid ":doc:`pgr_bdDijkstraCostMatrix`"
msgstr ":doc:`pgr_bdDijkstraCostMatrix`"

msgid ":doc:`pgr_withPointsCostMatrix`"
msgstr ":doc:`pgr_withPointsCostMatrix`"

msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`."
msgstr ":doc:`TSP-family` necesita como entrada una matriz de costos simétrica y sin borde `(u, v)`, debe valorar :math:`\\infty`."

msgid "This collection of functions will return a cost matrix in form of a table."
msgstr "Esta colección de funciones devolverá una matriz de costes en forma de tabla."

msgid "Can be used as input to :doc:`pgr_TSP`."
msgstr "Se puede utilizar como entrada para :doc:`pgr_TSP`."

msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value."
msgstr "Usar directamente cuando la matriz resultante es simétrica y no hay valor :math:`\\infty`."

msgid "It will be the users responsibility to make the matrix symmetric."
msgstr "Es responsabilidad dels usuario hacer que la matriz sea simétrica."

msgid "By using geometric or harmonic average of the non symmetric values."
msgstr "Mediante el uso de la media geométrica o armónica de los valores no simétricos."

msgid "By using max or min the non symmetric values."
msgstr "Mediante el uso de max o min, los valores no simétricos."

msgid "By setting the upper triangle to be the mirror image of the lower triangle."
msgstr "Estableciendo el triángulo superior para que sea la imagen reflejada del triángulo inferior."

msgid "By setting the lower triangle to be the mirror image of the upper triangle."
msgstr "Estableciendo el triángulo inferior para que sea la imagen reflejada del triángulo superior."

msgid "It is also the users responsibility to fix an :math:`\\infty` value."
msgstr "También es responsabilidad de los usuarios para fijar un valor :math:`\\infty`."

msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph."
msgstr "Devuelve la suma de los costos de la ruta más corta para la combinación de pares de nodos en el grafo."

msgid "When the starting vertex and ending vertex are the same, there is no path."
msgstr "Cuando el vértice inicial y el vértice final son iguales, no hay camino."

msgid "The aggregate cost in the non included values `(v, v)` is `0`."
msgstr "El costo agregado de los valores no incluídos `(v, v)` es `0`."

msgid "When the starting vertex and ending vertex are the different and there is no path."
msgstr "Cuando el vértice inicial y el vértice final son diferentes y no hay ruta."

msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`."
msgstr "El costo agregado de los valores no incluídos ``(u, v)`` es :math: `\\infty`."

msgid "Let be the case the values returned are stored in a table:"
msgstr "Sea el caso, los valores devueltos se almacenan en una tabla:"

msgid "The unique index would be the pair: ``(start_vid, end_vid)``."
msgstr "El índice único es el par: ``(start_vid, end_vid)``."

msgid "The aggregate cost of `(u, v)` is the same as for `(v, u)`."
msgstr "El costo agregado de `(u, v)` es el mismo que para `(v, u)`."

msgid "Any duplicated value in the **start vids** are ignored."
msgstr "Se omite cualquier valor duplicado en las **salidas**."

msgid "Used in:"
msgstr "Usado en:"

msgid "`Edges SQL`_ as described below"
msgstr "`SQL de aristas`_ como se describe a continuación"

msgid "**start vids**"
msgstr "**salidas**"

msgid "``ARRAY[BIGINT]``"
msgstr "``ARRAY[BIGINT]``"

msgid "Array of identifiers of starting vertices."
msgstr "Arreglo de identificadores de vértices iniciales."

msgid "`Points SQL`_"
msgstr "`SQL de puntos`_"

msgid "`Points SQL`_ as described below"
msgstr "`SQL de puntos`_ como se describe abajo"

msgid "Points SQL"
msgstr "SQL de puntos"

msgid "``pid``"
msgstr "``pid``"

msgid "**value**"
msgstr "**valor**"

msgid "Identifier of the point."
msgstr "Identificador del punto."

msgid "Use with positive value, as internally will be converted to negative value"
msgstr "Use con un valor positivo, dado que internamente se convertirá a un valor negativo"

msgid "If column is present, it can not be NULL."
msgstr "Si columna esta presente, no puede ser NULL."

msgid "If column is not present, a sequential negative **value** will be given automatically."
msgstr "Si columna no esta presente, un **valor** secuencial negativo se otorgará automáticamente."

msgid "``edge_id``"
msgstr "``edge_id``"

msgid "Identifier of the \"closest\" edge to the point."
msgstr "Identificador de la arista \"más cercana\" al punto."

msgid "``fraction``"
msgstr "``fraction``"

msgid "Value in <0,1> that indicates the relative position from the first end point of the edge."
msgstr "El valor en <0,1> que indica la posición relativa desde el primer punto final de la arista."

msgid "``side``"
msgstr "``side``"

msgid "``CHAR``"
msgstr "``CHAR``"

msgid "``b``"
msgstr "``b``"

msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:"
msgstr "Valor en [``b``, ``r``, ``l``, ``NULL``] que indica si el punto es:"

msgid "In the right ``r``,"
msgstr "A la derecha ``r``,"

msgid "In the left ``l``,"
msgstr "A la izquierda `l`,"

msgid "In both sides ``b``, ``NULL``"
msgstr "En ambos lados ``b``, ``NULL``"

msgid ":doc:`TSP-family`"
msgstr ":doc:`TSP-family`"

msgid "Dijkstra - Family of functions"
msgstr "Dijkstra - Familia de funciones"

msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths."
msgstr ":doc:`pgr_dijkstra` - Algoritmo de Dijkstra para las rutas más cortas."

msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths."
msgstr ":doc:`pgr_dijkstraCost` - Obtener el costo agregado de las rutas más cortas."

msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix."
msgstr ":doc:`pgr_dijkstraCostMatrix` - Usar pgr_dijkstra para crear una matriz de costes."

msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information."
msgstr ":doc:`pgr_drivingDistance` - Usar pgr_dijkstra para calcular información de captación."

msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths."
msgstr ":doc:`pgr_KSP` - Usar el algoritmo Yen con pgr_dijkstra para obtener las K rutas más cortas."

msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices."
msgstr ":doc:`pgr_dijkstraVia` - Obtener una ruta para una secuencia de vértices."

msgid ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex."
msgstr ":doc:`pgr_dijkstraNear` - Obtener la ruta al vértice más cercano."

msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex."
msgstr ":doc:`pgr_dijkstraNearCost` - Consigue el costo del vértice más cercano."

msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph."
msgstr "Algoritmo de Dijkstra, concebido por el informático holandés Edsger Dijkstra en 1956. Es un algoritmo de búsqueda en grafos que resuelve el problema de ruta más corta para un grafo con costos de aristas no negativos, produciendo la ruta más corta desde un vértice inicial a un vértice final . Esta implementación se puede utilizar con un grafos dirigidos y no dirigidos."

msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`"
msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V \\log V + E))`"

msgid "The Dijkstra family functions are based on the Dijkstra algorithm."
msgstr "Las funciones de la familia de Dijkstra se basan en el algoritmo de Dijkstra."

msgid "`Combinations SQL`_"
msgstr "`SQL de combinaciones`_"

msgid "`Combinations SQL`_ as described below"
msgstr "`SQL de combinaciones`_ como se describe a abajo"

msgid "**start vid**"
msgstr "**salida**"

msgid "Identifier of the starting vertex of the path."
msgstr "Identificador del vértice inicial de la ruta."

msgid "**end vid**"
msgstr "**destino**"

msgid "Identifier of the ending vertex of the path."
msgstr "Identificador del vértice final de la ruta."

msgid "**end vids**"
msgstr "**destinos**"

msgid "Array of identifiers of ending vertices."
msgstr "Arreglo de identificadores de vértices finales."

msgid "Combinations SQL"
msgstr "SQL Combinaciones"

msgid "Identifier of the departure vertex."
msgstr "Identificador del vértice de partida."

msgid "Identifier of the arrival vertex."
msgstr "Identificador del vértice de llegada."

msgid "The problem definition (Advanced documentation)"
msgstr "La definición de problema (Documentación avanzada)"

msgid "Given the following query:"
msgstr "Dada la siguiente consulta:"

msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)"
msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)"

msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`"
msgstr "Donde :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`"

msgid "and"
msgstr "y"

msgid ":math:`source = \\bigcup source_i`,"
msgstr ":math:`source = \\bigcup source_i`,"

msgid ":math:`target = \\bigcup target_i`,"
msgstr ":math:`target = \\bigcup target_i`,"

msgid "The graphs are defined as follows:"
msgstr "Los gráficos se definen como sigue:"

msgid "Directed graph"
msgstr "Grafo dirigido"

msgid "The weighted directed graph, :math:`G_d(V,E)`, is defined by:"
msgstr "El ponderado del grafo dirigido, :math:`G_d(V,E)`, se define por:"

msgid "the set of vertices :math:`V`"
msgstr "el conjunto de vértices :math:`V`"

msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup  {end_{vid}}`"
msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`"

msgid "the set of edges :math:`E`"
msgstr "El conjunto de aristas :math:`E`"

msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ }  & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} &  \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"
msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"

msgid "Undirected graph"
msgstr "Grafo no dirigido"

msgid "The weighted undirected graph, :math:`G_u(V,E)`, is defined by:"
msgstr "El grafo ponderado no dirigido, :math:`G_u(V,E)`, es definido por:"

msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup  {end_{vid}}`"
msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`"

msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\}  & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\}  & \\quad \\text{ if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ }  & \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"
msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"

msgid "The problem"
msgstr "El problema"

msgid "Given:"
msgstr "Dado:"

msgid ":math:`start_{vid} \\in V` a starting vertex"
msgstr ":math:`start_{vid} \\in V` un vértice inicial"

msgid ":math:`end_{vid} \\in V` an ending vertex"
msgstr ":math:`end_{vid} \\in V` un vértice final"

msgid ":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`"
msgstr ":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`"

msgid "Then:"
msgstr "Entonces:"

msgid ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`"
msgstr ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`"

msgid "where:"
msgstr "donde:"

msgid ":math:`path\\_seq_i = i`"
msgstr ":math:`path\\_seq_i = i`"

msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`"
msgstr ":math:`path\\_seq_{| \\pi |} = | \\pi |`"

msgid ":math:`node_i \\in V`"
msgstr ":math:`node_i \\in V`"

msgid ":math:`node_1 = start_{vid}`"
msgstr ":math:`node_1 = start_{vid}`"

msgid ":math:`node_{| \\pi |}  = end_{vid}`"
msgstr ":math:`node_{| \\pi |} = end_{vid}`"

msgid ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`"
msgstr ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`"

msgid ":math:`edge_i  = \\begin{cases}  id_{(node_i, node_{i+1},cost_i)}  &\\quad  \\text{when } i \\neq | \\pi | \\\\ -1 &\\quad  \\text{when } i = | \\pi | \\\\ \\end{cases}`"
msgstr ":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad \\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\\\ \\end{cases}`"

msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`"
msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`"

msgid ":math:`agg\\_cost_i  = \\begin{cases}  0   &\\quad  \\text{when } i = 1  \\\\ \\displaystyle\\sum_{k=1}^{i}  cost_{(node_{k-1}, node_k)}  &\\quad  \\text{when } i \\neq 1 \\\\ \\end{cases}`"
msgstr ":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad \\text{when } i \\neq 1 \\\\ \\end{cases}`"

msgid "In other words: The algorithm returns a the shortest path between :math:`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of nodes and of edges,"
msgstr "En otras palabras: El algoritmo devuelve la ruta más corta entre :math:`start_{vid}` y :math:`end_{vid}`, si es que existe, en términos de una secuencia de nodos y de aristas,"

msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`."
msgstr ":math:`path\\_seq` indica la posición relativa en el camino de :math:`node` o :math:`edge`."

msgid ":math:`cost` is the cost of the edge to be used to go to the next node."
msgstr ":math:`cost` es el coste del borde que se utilizará para ir al siguiente nodo."

msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node."
msgstr ":math:`agg\\_cost` es el costo desde el :math:`start_{vid}` hasta el nodo."

msgid "If there is no path, the resulting set is empty."
msgstr "Si no hay ruta, el conjunto resultante estará vacío."

msgid "Driving Distance - Category"
msgstr "Distancia Manejando - Categoría"

msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm"
msgstr ":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo de Dijkstra"

msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm"
msgstr ":doc:`pgr_primDD` - Distancia de manejo basada en el algoritmo de Prim"

msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm"
msgstr ":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal"

msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints"
msgstr ":doc:`pgr_withPointsDD` - Distancia Manejando basada en pgr_withPoints"

msgid "Calculate nodes that are within a distance."
msgstr "Calcular nodos que están dentro de una distancia."

msgid "Extracts all the nodes that have costs less than or equal to the value distance."
msgstr "Extrae todos los nodos que tienen costos menor o igual al valor de la distancia."

msgid "The edges extracted will conform to the corresponding spanning tree."
msgstr "Las aristas extraídas conformarán el correspondiente árbol de expansión."

msgid "Edge :math:`(u, v)` will not be included when:"
msgstr "Arista :math:`(u, v)` no se incluye cuando:"

msgid "The distance from the **root** to :math:`u` > limit distance."
msgstr "La distancia de la **raiz** a:math:`u` > límite de la distancia."

msgid "The distance from the **root** to :math:`v` > limit distance."
msgstr "La distancia de la **raiz** a :math:`v` > límite de la distancia."

msgid "No new nodes are created on the graph, so when is within the limit and is not within the limit, the edge is not included."
msgstr "No se crean nuevos nodos en el grafo, por lo que cuando el vértice está dentro de los límites y parte de la arista no está dentro de los límites, la arsta no se incluye."

msgid "Edges SQL as described below."
msgstr "SQL de aristas como se describen abajo."

msgid "**Root vid**"
msgstr "**Raíz**"

msgid "**Root vids**"
msgstr "**Raíces**"

msgid "``ARRAY[ANY-INTEGER]``"
msgstr "``ARREGLO[ENTEROS]``"

msgid "**distance**"
msgstr "**distancia**"

msgid "Upper limit for the inclusion of a node in the result."
msgstr "Límite superior para la inclusión del nodo en el resultado."

msgid "Returns set of |result-spantree|"
msgstr "Regresa el conjunto de |result-spantree|"

msgid ":math:`depth-1` is the depth of ``pred``"
msgstr ":math:`depth-1` es la profundidad de ``pred``"

msgid "``pred``"
msgstr "``pred``"

msgid "Predecessor of ``node``."
msgstr "Presdecesor de ``node``."

msgid "When ``node`` = ``start_vid`` then has the value ``node``."
msgstr "Cuando ``node`` = ``start_vid`` entonces tiene el valor ``node``."

msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``."
msgstr "Identificador del ``edge`` utilizado para llegar desde ``pred`` hasta ``node``."

msgid "Experimental Functions"
msgstr "Funciones Experimentales"

msgid "Families"
msgstr "Familias"

msgid ":doc:`flow-family`"
msgstr ":doc:`flow-family`"

msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges."
msgstr ":doc:`pgr_maxFlowMinCost` - Detalles del flujo y el coste en los bordes."

msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation."
msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Solo el cálculo del Coste Mínimo."

msgid ":doc:`chinesePostmanProblem-family`"
msgstr ":doc:`chinesePostmanProblem-family`"

msgid ":doc:`coloring-family`"
msgstr ":doc:`coloring-family`"

msgid ":doc:`contraction-family`"
msgstr ":doc:`contraction-family`"

msgid ":doc:`transformation-family`"
msgstr ":doc:`transformation-family`"

msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph."
msgstr ":doc:`pgr_lineGraphFull` - Algoritmo de transformación para generar un grafo de líneas a partir de cada vértice en el grafo de entrada."

msgid ":doc:`traversal-family`"
msgstr ":doc:`traversal-family`"

msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph."
msgstr ":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del grafo."

msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph."
msgstr ":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura del grafo."

msgid ":doc:`components-family`"
msgstr ":doc:`components-family`"

msgid ":doc:`ordering-family`"
msgstr ":doc:`ordering-family`"

msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph."
msgstr ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no dirigido."

msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph."
msgstr ":doc:`pgr_topologicalSort` - Orden lineal de los vértices para grafos acíclicos dirigidos."

msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph."
msgstr ":doc:`pgr_sloanOrdering` - Regresa el ordenamiento Sloan de un grafo no dirigido."

msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph."
msgstr ":doc:`pgr_kingOrdering` - Regresa el ordenamiento King de un grafo no dirigido."

msgid ":doc:`metrics-family`"
msgstr ":doc:`metrics-family`"

msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm"
msgstr ":doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes"

msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph."
msgstr ":doc:`pgr_bandwidth` - Calcula el ancho de banda de un grafo."

msgid ":doc:`TRSP-family`"
msgstr ":doc:`TRSP-family`"

msgid "categories"
msgstr "Categorías"

msgid ":doc:`VRP-category`"
msgstr ":doc:`VRP-category`"

msgid "Shortest Path Category"
msgstr "Rutas más cortas Categoría"

msgid ":doc:`pgr_bellmanFord`"
msgstr ":doc:`pgr_bellmanFord`"

msgid ":doc:`pgr_dagShortestPath`"
msgstr ":doc:`pgr_dagShortestPath`"

msgid ":doc:`pgr_edwardMoore`"
msgstr ":doc:`pgr_edwardMoore`"

msgid "Planar Family"
msgstr "Familia Planar"

msgid ":doc:`pgr_isPlanar`"
msgstr ":doc:`pgr_isPlanar`"

msgid "Miscellaneous Algorithms"
msgstr "Algoritmos Diversos"

msgid ":doc:`pgr_lengauerTarjanDominatorTree`"
msgstr ":doc:`pgr_lengauerTarjanDominatorTree`"

msgid ":doc:`pgr_stoerWagner`"
msgstr ":doc:`pgr_stoerWagner`"

msgid ":doc:`pgr_transitiveClosure`"
msgstr ":doc:`pgr_transitiveClosure`"

msgid ":doc:`pgr_hawickCircuits`"
msgstr ":doc:`pgr_hawickCircuits`"

msgid "Flow - Family of functions"
msgstr "Flow - Familia de funciones"

msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm."
msgstr ":doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo empuja y reetiquetado."

msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges."
msgstr ":doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles del flujo en aristas."

msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges."
msgstr ":doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo del flujo en aristas."

msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges."
msgstr ":doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del flujo en aristas."

msgid "Applications"
msgstr "Aplicaciones"

msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices."
msgstr ":doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre dos grupos de vértices."

msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph."
msgstr ":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de coincidencia dentro de un grafo."

msgid "Flow Functions General Information"
msgstr "Información General de las Funciones de Flujo"

msgid "The graph is **directed**."
msgstr "El grafo es **dirigido**."

msgid "Process is done only on edges with positive capacities."
msgstr "El proceso se realiza sólo en aristas con capacidades positivas."

msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned."
msgstr "Cuando el flujo máximo es 0 entonces no hay flujo, se devolverá: **EMPTY SET**."

msgid "There is no flow when source has the same value as target."
msgstr "No hay flujo cuando el origen tiene el mismo valor que el destino."

msgid "Any duplicated values in source or target are ignored."
msgstr "Los valores duplicados en origen o destino se ignoran."

msgid "Calculates the flow/residual capacity for each edge. In the output"
msgstr "Calcula la capacidad de flujo/residuo para cada arista. En la salida"

msgid "Edges with zero flow are omitted."
msgstr "Se omiten las aristas con flujo cero."

msgid "Creates"
msgstr "Crea"

msgid "a **super source** and edges from it to all the sources,"
msgstr "una **super fuente** y aristas desde ella a todas las fuentes,"

msgid "a **super target** and edges from it to all the targetss."
msgstr "un **super objetivo** y aristas desde él a todos los objetivos."

msgid "The maximum flow through the graph is guaranteed to be the value returned by :doc:`pgr_maxFlow <pgr_maxFlow>` when executed with the same parameters and can be calculated:"
msgstr "Se garantiza que el flujo máximo a través del grafo es el valor devuelto por :doc:`pgr_maxFlow <pgr_maxFlow>` cuando es ejecutado con los mismos parámetros y se puede calcular:"

msgid "By aggregation of the outgoing flow from the sources"
msgstr "Mediante la suma de los flujos salientes de las fuentes"

msgid "By aggregation of the incoming flow to the targets"
msgstr "Mediante la suma de los flujos llegantes a los destinos"

msgid ":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary."
msgstr ":doc:`pgr_maxFlow` es el flujo máximo y este máximo tiene garantía de ser el mismo en las funciones :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, pero el flujo actual para cada arista puede variar."

msgid "Capacity edges"
msgstr "Aristas de capacidad"

msgid ":doc:`pgr_pushRelabel`"
msgstr ":doc:`pgr_pushRelabel`"

msgid ":doc:`pgr_edmondsKarp`"
msgstr ":doc:`pgr_edmondsKarp`"

msgid ":doc:`pgr_boykovKolmogorov`"
msgstr ":doc:`pgr_boykovKolmogorov`"

msgid "``reverse_capacity``"
msgstr "``reverse_capacity``"

msgid "Capacity-Cost edges"
msgstr "Aristas Capacidad-Costo"

msgid ":doc:`pgr_maxFlowMinCost`"
msgstr ":doc:`pgr_maxFlowMinCost`"

msgid ":doc:`pgr_maxFlowMinCost_Cost`"
msgstr ":doc:`pgr_maxFlowMinCost_Cost`"

msgid "Capacity of the edge (``source``, ``target``)"
msgstr "Capacidad de la arista (``source``, ``target``)"

msgid "Capacity of the edge (``target``, ``source``)"
msgstr "Capacidad de la arista (``target``, ``source``)"

msgid "Weight of the edge (``source``, ``target``) if it exist"
msgstr "Peso de la arista (``source``, ``target``) si existe"

msgid "Weight of the edge (``target``, ``source``) if it exist"
msgstr "Peso de la arista (``target``, ``source``) si existe"

msgid "Cost edges"
msgstr "Aristas de costo"

msgid ":doc:`pgr_edgeDisjointPaths`"
msgstr ":doc:`pgr_edgeDisjointPaths`"

msgid "Used in"
msgstr "Usado en"

msgid "**seq**"
msgstr "**seq**"

msgid "``INT``"
msgstr "``INT``"

msgid "**edge**"
msgstr "**arista**"

msgid "Identifier of the edge in the original query (edges_sql)."
msgstr "Identificador de la arista en la consulta original(edges_sql)."

msgid "**start_vid**"
msgstr "**start_vid**"

msgid "**end_vid**"
msgstr "**end_vid**"

msgid "**flow**"
msgstr "**flujo**"

msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)."
msgstr "Flujo a través del arista en la dirección (``start_vid``, ``end_vid``)."

msgid "**residual_capacity**"
msgstr "**residual_capacity**"

msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)."
msgstr "Capacidad residual del arista en la dirección (``start_vid``, ``end_vid``)."

msgid "For :doc:`pgr_maxFlowMinCost`"
msgstr "Para :doc:`pgr_maxFlowMinCost`"

msgid "**source**"
msgstr "**origen**"

msgid "**target**"
msgstr "**objetivo**"

msgid "Flow through the edge in the direction (source, target)."
msgstr "Flujo a través de la arista en la dirección (origen, destino)."

msgid "Residual capacity of the edge in the direction (source, target)."
msgstr "Capacidad residual de la arista en la dirección (origen, destino)."

msgid "**cost**"
msgstr "**costo**"

msgid "The cost of sending this flow through the edge in the direction (source, target)."
msgstr "El costo de enviar este flujo a través de la arista en la dirección (origen, destino)."

msgid "**agg_cost**"
msgstr "**agg_cost**"

msgid "The aggregate cost."
msgstr "El costo agregado."

msgid "Advanced Documentation"
msgstr "Documentación Avanzada"

msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow."
msgstr "Una red de flujo es un gráfico dirigido donde cada arista tiene una capacidad y un flujo. El flujo a través de una arista no debe exceder la capacidad de la misma. Además, el flujo entrante y saliente de un nodo debe ser igual, excepto para el origen que solo tiene flujo saliente, y el destino (receptor) que solo tiene flujo entrante."

msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge."
msgstr "Los algoritmos de Flujo Máximo se calculan a través del grafo del flujo máximo y el flujo de cada arista."

msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary."
msgstr "Se garantiza que el flujo máximo a través del grafo sea el mismo con todas las implementaciones, pero el flujo real a través de cada arista puede variar."

msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`"
msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`"

msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`"
msgstr "donde: :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`"

msgid "Graph definition"
msgstr "Definición de grafo"

msgid "The weighted directed graph, :math:`G(V,E)`, is defined as:"
msgstr "El grafo ponderado dirigido, :math:`G(V,E)`, se define como:"

msgid "the set of vertices  :math:`V`"
msgstr "Conjunto de vértices :math:`V`"

msgid ":math:`source\\_vertex  \\cup  sink\\_vertex  \\bigcup  source_i  \\bigcup  target_i`"
msgstr ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcuptarget_i`"

msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad  \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`"
msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`"

msgid "Maximum flow problem"
msgstr "Problema de Flujo Máximo"

msgid ":math:`G(V,E)`"
msgstr ":math:`G(V,E)`"

msgid ":math:`source\\_vertex \\in V` the source vertex"
msgstr ":math:`source\\_vertex \\in V` el vértice de origen"

msgid ":math:`sink\\_vertex \\in V` the sink vertex"
msgstr ":math:`sink\\_vertex \\in V` el vértice pozo"

msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`"
msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`"

msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`"
msgstr ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`"

msgid ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their residual capacity and flow. The maximum flow through the graph can be obtained by aggregating on the source or sink and summing the flow from/to it. In particular:"
msgstr ":math:`\\boldsymbol{\\Phi}` es un subconjunto de las aristas originales con su flujo y capacidad residual. El flujo máximo a través del grafo se puede obtener agregando en el origen o sumidero y sumiendo el flujo hacia él. En particular:"

msgid ":math:`id_i = i`"
msgstr ":math:`id_i = i`"

msgid ":math:`edge\\_id = id_i` in edges_sql"
msgstr ":math:`edge\\_id = id_i` en edges_sql"

msgid ":math:`residual\\_capacity_i = capacity_i - flow_i`"
msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`"

msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem"
msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem"

msgid "pgRouting extends the `PostGIS <https://postgis.net>`__/`PostgreSQL <https://www.postgresql.org>`__ geospatial database to provide geospatial routing and other network analysis functionality."
msgstr "pgRouting extiende la base de datos geospacial de `PostGIS <https://postgis.net>`__/`PostgreSQL <https://www.postgresql.org>`__ para proporcionar enrutamiento geoespacial y otras funciones de análisis de red."

msgid "This is the manual for pgRouting |release|."
msgstr "Este es el manual para la version |release| de pgRouting."

msgid "Creative Commons Attribution-Share Alike 3.0 License"
msgstr "Licencia de Creative Commons Attribution-Share Alike 3.0"

msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_. Feel free to use this material any way you like, but we ask that you attribute credit to the pgRouting Project and wherever possible, a link back to https://pgrouting.org. For other licenses used in pgRouting see the :ref:`license` page."
msgstr "El Manual de pgRouting está bajo licencia `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_. Siéntase libre de usar este material de la manera que desee, pero le pedimos que atribuya el crédito correspondiente al proyecto pgRouting y, siempre que sea posible, visite https://pgrouting.org. Para otras licencias utilizadas en pgRouting, consulte la página :ref:`license` ."

msgid "General"
msgstr "General"

msgid ":doc:`sampledata` that is used in the examples of this manual."
msgstr ":doc:`sampledata` es usado en los ejemplos de este manual."

msgid "Pgrouting Concepts"
msgstr "Conceptos de pgRouting"

msgid ":doc:`routingFunctions`"
msgstr ":doc:`routingFunctions`"

msgid ":doc:`allpairs-family`"
msgstr ":doc:`allpairs-family`"

msgid ":doc:`bdDijkstra-family`"
msgstr ":doc:`bdDijkstra-family`"

msgid ":doc:`dijkstra-family`"
msgstr ":doc:`dijkstra-family`"

msgid ":doc:`kruskal-family`"
msgstr ":doc:`kruskal-family`"

msgid ":doc:`pgr_kruskal`"
msgstr ":doc:`pgr_kruskal`"

msgid ":doc:`pgr_kruskalDD`"
msgstr ":doc:`pgr_kruskalDD`"

msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex."
msgstr ":doc:`pgr_degree` - Regresa un conjunto de vertices y la cantidad de aristas incidentes al vértice."

msgid ":doc:`prim-family`"
msgstr ":doc:`prim-family`"

msgid ":doc:`pgr_prim`"
msgstr ":doc:`pgr_prim`"

msgid ":doc:`pgr_primDD`"
msgstr ":doc:`pgr_primDD`"

msgid ":doc:`reference`"
msgstr ":doc:`reference`"

msgid ":doc:`pgr_version`"
msgstr ":doc:`pgr_version`"

msgid ":doc:`pgr_full_version`"
msgstr ":doc:`pgr_full_version`"

msgid ":doc:`utilities-family`"
msgstr ":doc:`utilities-family`"

msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information."
msgstr ":doc:`pgr_extractVertices` - Extrae información de vértices basada en la tabla de aristas."

msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly"
msgstr ":doc:`pgr_findCloseEdges` - Encuentra las aristas cercanas a una geometría al vuelo"

msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other."
msgstr ""

msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other."
msgstr ""

msgid ":doc:`withPoints-family`"
msgstr ":doc:`withPoints-family`"

msgid ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph."
msgstr ":doc:`pgr_withPoints` - Ruta desde/hacia puntos en cualquier parte del grafo."

msgid ":doc:`pgr_withPointsCost` - Costs of the shortest paths."
msgstr ":doc:`pgr_withPointsCost` - Costos de las tutas más cortas."

msgid ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths."
msgstr ":doc:`pgr_withPointsCostMatrix` - Costos de las rutas más cortas."

msgid ":doc:`pgr_withPointsKSP` - K shortest paths."
msgstr ":doc:`pgr_withPointsKSP` - rutas más cortas K."

msgid ":doc:`pgr_withPointsDD` - Driving distance."
msgstr ":doc:`pgr_withPointsDD` - Distancia de conducción."

msgid ":doc:`pgr_withPointsVia` - Via routing"
msgstr ":doc:`pgr_withPointsVia` - Ruteo vía ubicaciones"

msgid "Functions by categories"
msgstr "Funciones por categorías"

msgid ":doc:`cost-category`"
msgstr ":doc:`cost-category`"

msgid ":doc:`costMatrix-category`"
msgstr ":doc:`costMatrix-category`"

msgid ":doc:`drivingDistance-category`"
msgstr ":doc:`drivingDistance-category`"

msgid ":doc:`KSP-category`"
msgstr ":doc:`KSP-category`"

msgid ":doc:`spanningTree-category`"
msgstr ":doc:`spanningTree-category`"

msgid ":doc:`BFS-category`"
msgstr ":doc:`BFS-category`"

msgid ":doc:`DFS-category`"
msgstr ":doc:`DFS-category`"

msgid ":doc:`withPoints-category`"
msgstr ":doc:`withPoints-category`"

msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm."
msgstr ":doc:`withPoints-family` - Funciones basadas en el algoritmo Dijkstra."

msgid "From the :doc:`TRSP-family`:"
msgstr "Desde :doc:`TRSP-family` :"

msgid "Available Functions but not official pgRouting functions"
msgstr "Funciones disponibles pero no oficiales de pgRouting"

msgid ":doc:`proposed`"
msgstr ":doc:`proposed`"

msgid ":doc:`experimental`"
msgstr ":doc:`experimental`"

msgid ":doc:`release_notes`"
msgstr ":doc:`release_notes`"

msgid "pgRouting 4.0"
msgstr "pgRouting 4.0"

msgid "pgRouting 4.0.0-alpha1 Release Notes"
msgstr "Notas de la versión de pgRouting 4.0.0-alpha1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "Build"
msgstr "Construir"

msgid "C++ standard is std17"
msgstr ""

msgid "Using this standard, all supported toolchains across our CI matrix will work."
msgstr ""

msgid "The code is not yet modified to use std17:"
msgstr ""

msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard."
msgstr ""

msgid "The user's documentation is built by default."
msgstr "La documentación del usuario se construye por defecto."

msgid "The doxygen documentation is built by default."
msgstr "La documentación doxygen se construye por defecto."

msgid "For developers:"
msgstr "Para desarrolladores:"

msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks."
msgstr ""

msgid "Tidy checks are done on CI."
msgstr ""

msgid "Documentation build"
msgstr "Construcción de la documentación"

msgid "The doxygen documentation is built by default"
msgstr "La documentación doxygen se construye por defecto"

msgid "The HTML documentation is built by default"
msgstr "La documentación HTML se crea por defecto"

msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default"
msgstr "Los idiomas traducidos (en, es, sv, zh_Hans) para documentación HTML se construyen por defecto"

msgid "`WITH-DOC` is not used anymore"
msgstr ""

msgid "User Documentation is not built when"
msgstr "La documentación de usuario no se crea cuando"

msgid "Sphinx is not found"
msgstr ""

msgid "When all Sphinx formats are OFF"
msgstr ""

msgid "To not build HTML default format: `-DBUILD_HTML=OFF`"
msgstr ""

msgid "When all languages are OFF"
msgstr ""

msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`"
msgstr ""

msgid "Documentation output location: ``build/doc/_build/<format>``"
msgstr ""

msgid "For example: for HTML output is on `build/doc/_build/html` directory"
msgstr ""

msgid "Developers' Documentation is not built when"
msgstr "La documentación de los desarrolladores no se construye cuando"

msgid "Doxygen is not found"
msgstr ""

msgid "To not build Doxygen documentation: `-DBUILD_DOXY=OFF`"
msgstr ""

msgid "Summary of changes by function"
msgstr ""

msgid "pgr_aStar"
msgstr "pgr_aStar"

msgid "Combinations signature promoted to official."
msgstr "Firmas de combinaciones promovidas a oficial."

msgid "pgr_aStarCost"
msgstr "pgr_aStarCost"

msgid "pgr_bandwidth"
msgstr "pgr_bandwidth"

msgid "New experimental function."
msgstr "Nueva función experimental."

msgid "pgr_bdAstar"
msgstr "pgr_bdAstar"

msgid "pgr_bdAstarCost"
msgstr "pgr_bdAstarCost"

msgid "pgr_bdDijkstra"
msgstr "pgr_bdDijkstra"

msgid "Output columns standardized to |short-generic-result|"
msgstr "Las columnas de resultados estandarizadas a |short-generic-result|"

msgid "pgr_bdDijkstraCost"
msgstr "pgr_bdDijkstraCost"

msgid "pgr_bellmanFord"
msgstr "pgr_bellmanFord"

msgid "pgr_binaryBreadthFirstSearch"
msgstr "pgr_binaryBreadthFirstSearch"

msgid "pgr_bipartite"
msgstr "pgr_bipartite"

msgid "Output columns standardized to |result_node_color|"
msgstr "Columnas de resultados estandarizados a |result_node_color|"

msgid "pgr_boykovKolmogorov"
msgstr "pgr_boykovKolmogorov"

msgid "pgr_breadthFirstSearch"
msgstr "pgr_breadthFirstSearch"

msgid ":"
msgstr ""

msgid "Standardizing output columns to |result-spantree|"
msgstr "Columnas de resultados estandarizados a |result-spantree|"

msgid "pgr_contraction"
msgstr "pgr_contraction"

msgid "Breaking change, signatures no longer available:"
msgstr ""

msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)"
msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)"

msgid "pgr_dagShortestPath"
msgstr "pgr_dagShortestPath"

msgid "pgr_depthFirstSearch"
msgstr "pgr_depthFirstSearch"

msgid "pgr_dijkstra"
msgstr "pgr_dijkstra"

msgid "pgr_dijkstraCost"
msgstr "pgr_dijkstraCost"

msgid "pgr_dijkstraNear"
msgstr "pgr_dijkstraNear"

msgid "Function promoted to official."
msgstr "Función promovida a oficial."

msgid "pgr_dijkstraNearCost"
msgstr "pgr_dijkstraNearCost"

msgid "pgr_dijkstraVia"
msgstr "pgr_dijkstraVia"

msgid "pgr_edgeColoring"
msgstr "pgr_edgeColoring"

msgid "Output columns standardized to |result_edge_color|"
msgstr "Columnas de resultados estandarizados a |result_edge_color|"

msgid "pgr_edgeDisjointPaths"
msgstr "pgr_edgeDisjointPaths"

msgid "Output columns standardized to |generic-result|"
msgstr "Columnas de resultados estandarizados a |generic-result|"

msgid "pgr_edmondsKarp"
msgstr "pgr_edmondsKarp"

msgid "pgr_edwardMoore"
msgstr "pgr_edwardMoore"

msgid "Version 3.2.0"
msgstr "Versión 3.2.0"

msgid "New experimental signature:"
msgstr "Nueva firma experimental:"

msgid "pgr_edwardMoore(Combinations)"
msgstr "pgr_edwardMoore(Combinaciones)"

msgid "Version 3.0.0"
msgstr "Versión 3.0.0"

msgid "pgr_kingOrdering"
msgstr "pgr_kingOrdering"

msgid "pgr_KSP"
msgstr "pgr_KSP"

msgid "All signatures promoted to official."
msgstr "Todas las firmas promovidas a oficial."

msgid "pgr_maxCardinalityMatch"
msgstr "pgr_maxCardinalityMatch"

msgid "pgr_maxCardinalityMatch(text,boolean)"
msgstr "pgr_maxCardinalityMatch(text,boolean)"

msgid "pgr_maxFlow"
msgstr "pgr_maxFlow"

msgid "pgr_pushRelabel"
msgstr "pgr_pushRelabel"

msgid "pgr_sequentialVertexColoring"
msgstr "pgr_sequentialVertexColoring"

msgid "pgr_sloanOrdering"
msgstr "pgr_sloanOrdering"

msgid "pgr_topologicalSort"
msgstr "pgr_topologicalSort"

msgid "Standardize output to |result_node_order|"
msgstr "Columnas de resultados estandarizados a|result_node_order|"

msgid "pgr_transitiveClosure"
msgstr "pgr_transitiveClosure"

msgid "Standardized output to |result-closure|"
msgstr "Estandarización de columnas de resultados a |result-closure|"

msgid "pgr_trsp"
msgstr "pgr_trsp"

msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)"
msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)"

msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"

msgid "pgr_trspVia"
msgstr "pgr_trspVia"

msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)"
msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)"

msgid "pgr_trspVia_withPoints"
msgstr "pgr_trspVia_withPoints"

msgid "**Driving side** parameter is positional unnamed."
msgstr "El parámetro **Lado de Manejo** era opcional ahora es obligatorio posicional sin nombre."

msgid "Valid values depend on kind of graph"
msgstr "Valores válidos dependen del tipo de grafo"

msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)"
msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)"

msgid "pgr_trsp_withPoints"
msgstr "pgr_trsp_withPoints"

msgid "**Driving side** parameter is positional unnamed and compulsory."
msgstr "El parámetro **driving_side** era opcional ahora es obligatorio sin nombre."

msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"

msgid "pgr_TSP"
msgstr "pgr_TSP"

msgid "Results change depending on input order"
msgstr "Los resultados cambian dependiendo el orden de entrada"

msgid "Only for undirected graphs"
msgstr "Solo para grafos no dirigidos"

msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"

msgid "pgr_TSPeuclidean"
msgstr "pgr_TSPeuclidean"

msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)"
msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)"

msgid "pgr_turnRestrictedPath"
msgstr "pgr_turnRestrictedPath"

msgid "Output columns standardized to |nksp-result|"
msgstr "Columnas de salida estandarizados a |nksp-result|"

msgid "pgr_withPoints"
msgstr "pgr_withPoints"

msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,text,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,text,boolean,character,boolean)"

msgid "pgr_withPointsCost"
msgstr "pgr_withPointsCost"

msgid "**Driving side** parameter is unnamed and compulsory."
msgstr "El parámetro **Driving side** es obligatorio sin nombre."

msgid "Output columns standardized to |matrix-result|"
msgstr "Columnas de resultados estandarizados a |matrix-result|"

msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)"
msgstr "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)"

msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"
msgstr "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"

msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"
msgstr "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"

msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)"
msgstr "pgr_withpointscost(text,text,bigint,bigint,boolean,character)"

msgid "pgr_withpointscost(text,text,text,boolean,character)"
msgstr "pgr_withpointscost(text,text,text,boolean,character)"

msgid "pgr_withPointsCostMatrix"
msgstr "pgr_withPointsCostMatrix"

msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"
msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"

msgid "pgr_withPointsDD"
msgstr "pgr_withPointsDD"

msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)"
msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)"

msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"

msgid "pgr_withPointsKSP"
msgstr "pgr_withPointsKSP"

msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

msgid "pgr_withPointsVia"
msgstr "pgr_withPointsVia"

msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "Functions promoted to official"
msgstr "Funciones promovidas a oficial"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia_withPoints"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia_withPoints"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp_withPoints"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp_withPoints"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPoints"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPoints"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCost"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCost"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCostMatrix"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCostMatrix"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsDD"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsDD"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsKSP"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsKSP"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsVia"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsVia"

msgid "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNear"
msgstr "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNear"

msgid "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNearCost"
msgstr "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNearCost"

msgid "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraVia"
msgstr "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraVia"

msgid "Signatures promoted to official"
msgstr "Firmas promovidas a oficial"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStar(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStar(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStarCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStarCost(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstar(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstar(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstarCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstarCost(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstra(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstra(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstraCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstraCost(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstra(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstra(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstraCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstraCost(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_KSP(All signatures)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_KSP(Todas las firmas)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_boykovKolmogorov(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_boykovKolmogorov(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_edmondsKarp(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_edmondsKarp(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_maxFlow(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_maxFlow(Combinaciones)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_pushRelabel(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_pushRelabel(Combinaciones)"

msgid "New experimental functions."
msgstr "Nuevas funciones experimentales."

msgid "Metrics"
msgstr "Métricas"

msgid "`#2951 <https://github.com/pgRouting/pgrouting/issues/2951>`__: pgr_bandwidth"
msgstr "`#2951 <https://github.com/pgRouting/pgrouting/issues/2951>`__: pgr_bandwidth"

msgid "Ordering"
msgstr "Ordenamiento"

msgid "`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: pgr_kingOrdering"
msgstr "`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: pgr_kingOrdering"

msgid "`#2955 <https://github.com/pgRouting/pgrouting/issues/2955>`__: pgr_sloanOrdering"
msgstr "`#2955 <https://github.com/pgRouting/pgrouting/issues/2955>`__: pgr_sloanOrdering"

msgid "SQL signatures and output standardization"
msgstr ""

msgid "`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__: Standardize output columns of functions with different output"
msgstr "`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__: Estandarizar columnas de resultados de funciones con diferente salida"

msgid "columns within overloads"
msgstr "columnas dentro de las sobrecargas"

msgid "Standardized to |short-generic-result|"
msgstr "Estandardizar de las columnas de resultados a |short-generic-result|"

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPoints"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPoints"

msgid "`#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__: pgr_bdDijkstra"
msgstr "`#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__: pgr_bdDijkstra"

msgid "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__: pgr_bellmanFord"
msgstr "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__: pgr_bellmanFord"

msgid "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__: pgr_binaryBreadthFirstSearch"
msgstr "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__: pgr_binaryBreadthFirstSearch"

msgid "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__: pgr_edwardMoore"
msgstr "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__: pgr_edwardMoore"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_dagShortestPath"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_dagShortestPath"

msgid "Standardized to |matrix-result|"
msgstr "Estandardizar de las columnas de resultados a |matrix-result|"

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCost"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCost"

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCostMatrix"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCostMatrix"

msgid "Standardized to |generic-result|"
msgstr "Estandardizar de las columnas de resultados a |generic-result|"

msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_edgeDisjointPaths"
msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_edgeDisjointPaths"

msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPath"
msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPath"

msgid "Standardized to |result_edge_color|"
msgstr "Estandardizar de las columnas de resultados a |result_edge_color|"

msgid "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_edgeColoring"
msgstr "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_edgeColoring"

msgid "Standardized to |result_node_color|"
msgstr "Estandardizar de las columnas de resultados a |result_node_color|"

msgid "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_bipartite"
msgstr "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_bipartite"

msgid "`#2927 <https://github.com/pgRouting/pgrouting/issues/2927>`__: pgr_sequentialVertexColoring"
msgstr "`#2927 <https://github.com/pgRouting/pgrouting/issues/2927>`__: pgr_sequentialVertexColoring"

msgid "Standardized to |result-spantree|"
msgstr "Estandardizar de las columnas de resultados a |result-spantree|"

msgid "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_breadthFirstSearch"
msgstr "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_breadthFirstSearch"

msgid "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_depthFirstSearch"
msgstr "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_depthFirstSearch"

msgid "Standardized to |result_node_order|"
msgstr "Estandardizar de las columnas de resultados a |result_node_order|"

msgid "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_topologicalSort"
msgstr "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_topologicalSort"

msgid "Standardized to |result-closure|"
msgstr "Estandardizar de las columnas de resultados a |result-closure|"

msgid "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_transitiveClosure"
msgstr "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_transitiveClosure"

msgid "Removal of SQL deprecated signatures"
msgstr "Eliminación de funciones SQL obsoletas"

msgid "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__: pgr_contraction"
msgstr "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__: pgr_contraction"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trsp"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trsp"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trspVia"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trspVia"

msgid "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__: pgr_findCloseEdges"
msgstr "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__: pgr_findCloseEdges"

msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"
msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"

msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"
msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__: pgr_withPointsDD"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__: pgr_withPointsDD"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__: pgr_withPointsKSP"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__: pgr_withPointsKSP"

msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__: pgr_maxCardinalityMatch"
msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__: pgr_maxCardinalityMatch"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSP"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSP"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSPeuclidean"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSPeuclidean"

msgid "Removal of SQL deprecated functions"
msgstr "Eliminación de funciones obsoletas"

msgid "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspViaedges"
msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspViaedges"

msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspViaVertices"
msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspViaVertices"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__: pgr_alphaShape"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__: pgr_alphaShape"

msgid "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__: pgr_createTopology"
msgstr "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__: pgr_createTopology"

msgid "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__: pgr_analyzeGraph"
msgstr "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__: pgr_analyzeGraph"

msgid "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__: pgr_analyzeOneWay"
msgstr "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__: pgr_analyzeOneWay"

msgid "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__: pgr_createVerticesTable"
msgstr "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__: pgr_createVerticesTable"

msgid "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"
msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"

msgid "Removal of SQL deprecated internal functions"
msgstr "Eliminación de funciones internas SQL obsoletas"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape(text,double precision)"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape(text,double precision)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_checkVertTab(text,text[],integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_checkVertTab(text,text[],integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,text,integer,text)"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,text,boolean,boolean)"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,text,boolean,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,boolean)"

msgid "`#2735 <https://github.com/pgRouting/pgrouting/issues/2735>`__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)"
msgstr "`#2735 <https://github.com/pgRouting/pgrouting/issues/2735>`__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_endPoint(geometry)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_endPoint(geometry)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_getcolumntype(text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getTableName(text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getTableName(text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,text,integer,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIntable(text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIntable(text,text)"

msgid "`#2745 <https://github.com/pgRouting/pgrouting/issues/2745>`__ _pgr_kruskal(text,anyarray,text,bigint,double precision)"
msgstr "`#2745 <https://github.com/pgRouting/pgrouting/issues/2745>`__ _pgr_kruskal(text,anyarray,text,bigint,double precision)"

msgid "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)"
msgstr "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)"

msgid "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)"
msgstr "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)"

msgid "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,text,integer,boolean,boolean)"
msgstr "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,text,integer,boolean,boolean)"

msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ _pgr_maxCardinalityMatch(text,boolean)"
msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ _pgr_maxCardinalityMatch(text,boolean)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_msg(integer,text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_msg(integer,text,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_onerror(boolean,integer,text,text,text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_onerror(boolean,integer,text,text,text,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_pointtoid(geometry,double precision,text,integer)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_pointtoid(geometry,double precision,text,integer)"

msgid "`#2743 <https://github.com/pgRouting/pgrouting/issues/2743>`__ _pgr_prim(text,anyarray,text,bigint,double precision)"
msgstr "`#2743 <https://github.com/pgRouting/pgrouting/issues/2743>`__ _pgr_prim(text,anyarray,text,bigint,double precision)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_quote_ident(text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_quote_ident(text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_startPoint(geometry)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_startPoint(geometry)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,anyarray,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,anyarray,anyarray,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,anyarray,bigint,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,anyarray,bigint,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,anyarray,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,bigint,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,bigint,boolean)"

msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)"
msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_versionLess(text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_versionLess(text,text)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)"

msgid "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)"
msgstr "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)"

msgid "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp(text,text,anyarray,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp(text,text,anyarray,anyarray,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,anyarray,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,anyarray,anyarray,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,text,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,text,boolean)"

msgid "Summary of functions and signatures no longer on pgrouting"
msgstr "Resumen de funciones y firmas que ya no están en pgrouting"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ pgr_alphashape(geometry,double precision)"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ pgr_alphashape(geometry,double precision)"

msgid "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__ pgr_analyzegraph(text,double precision,text,text,text,text,text)"
msgstr "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__ pgr_analyzegraph(text,double precision,text,text,text,text,text)"

msgid "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)"
msgstr "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)"

msgid "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__ pgr_contraction(text,bigint[],integer,bigint[],boolean)"
msgstr "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__ pgr_contraction(text,bigint[],integer,bigint[],boolean)"

msgid "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)"
msgstr "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)"

msgid "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__ pgr_createverticestable(text,text,text,text,text)"
msgstr "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__ pgr_createverticestable(text,text,text,text,text)"

msgid "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"
msgstr "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"

msgid "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"
msgstr "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"

msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ pgr_maxCardinalityMatch(text,boolean)"
msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ pgr_maxCardinalityMatch(text,boolean)"

msgid "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)"
msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,integer,integer,boolean,boolean,text)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,integer,integer,boolean,boolean,text)"

msgid "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)"
msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)"

msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"
msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,text,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,text,boolean,character)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,text,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,text,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "Code enhancements"
msgstr "Mejoras del código"

msgid "Removal of unused C/C++ code"
msgstr "Eliminación de código C/C++ no utilizado"

msgid "Refactor the Script to build the update PostgreSQL file."
msgstr ""

msgid "One process & driver for:"
msgstr ""

msgid "allpairs: johnson and Floyd-Warshall"
msgstr ""

msgid "Shortest path: Dijkstra and withPoints using Dijkstra"
msgstr ""

msgid "Deprecation of internal C/C++ functions"
msgstr "Obsolescencia de funciones internas C/C++"

msgid "Deprecated functions are substituted by new function."
msgstr ""

msgid "_pgr_drivingDistance => _pgr_drivingDistancev4"
msgstr "_pgr_drivingDistance => _pgr_drivingDistancev4"

msgid "_pgr_withPointsDD => _pgr_withPointsddv4"
msgstr "_pgr_withPointsDD => _pgr_withPointsddv4"

msgid "_pgr_kruskal => _pgr_kruskalv4"
msgstr ""

msgid "_pgr_prim => _pgr_primv4"
msgstr ""

msgid "_pgr_dijkstra => _pgr_dijkstra_v4"
msgstr "_pgr_dijkstra => _pgr_dijkstra_v4"

msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4"
msgstr "_pgr_withPointsKSP => _pgr_withPointsKSP_v4"

msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4"
msgstr "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4"

msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4"
msgstr "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4"

msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4"
msgstr "_pgr_withPointsVia => _pgr_withPointsvia_v4"

msgid "Internal C/C++ functions in legacy"
msgstr "Funciones C/C++ internas en legado"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath"

msgid "All releases"
msgstr "Todas las versiones"

msgid "Kruskal - Family of functions"
msgstr "Kruskal - Familia de funciones"

msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest."
msgstr "Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo que en cada ciclo encuentra y agrega la arista del menor peso posible que conecta dos árboles en el bosque."

msgid "**The main Characteristics are:**"
msgstr "**Las características principales son:**"

msgid "The total weight of all the edges in the tree or forest is minimized."
msgstr "Se minimiza el peso total de todos los bordes del árbol o bosque."

msgid "Kruskal's running time: :math:`O(E * log E)`"
msgstr "Tiempo de ejecución de Kruskal: :math:`O(E * log E)`"

msgid "Metrics - Family of functions"
msgstr "Métricas - Familia de funciones"

msgid "Migration guide"
msgstr "Guía de migración"

msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions."
msgstr "Varias funciones están teniendo cambios en las firmas, y/o han sido remplazadas por nuevas funciones."

msgid "Results can be different because of the changes."
msgstr "Resultados pueden ser diferentes dado los cambios."

msgid "All deprecated functions will be removed on next major version 4.0.0"
msgstr "Todas las funciones obsoletas serán removidas en las siguiente versión mayor 4.0.0"

msgid "Migration to standardized columns"
msgstr "Migración a columnas estandarizadas"

msgid "There has been an effort to standardize function output columns names and types."
msgstr ""

msgid ":ref:`pgRouting-concepts:Result columns for cost functions`"
msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`"

msgid "|matrix-result|"
msgstr "|matrix-result|"

msgid ":ref:`pgRouting-concepts:Result columns for single path functions`"
msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`"

msgid "|short-generic-result|"
msgstr "|short-generic-result|"

msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`"
msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`"

msgid "|result-spantree|"
msgstr "|result-spantree|"

msgid "Function"
msgstr "Función"

msgid ":doc:`pgr_dijkstra`"
msgstr ":doc:`pgr_dijkstra`"

msgid "`Migration of single path functions`_"
msgstr "`Migración de funciones de una sola ruta`_"

msgid ":doc:`pgr_aStar`"
msgstr ":doc:`pgr_aStar`"

msgid ":doc:`pgr_bdAstar`"
msgstr ":doc:`pgr_bdAstar`"

msgid ":doc:`pgr_drivingDistance`"
msgstr ":doc:`pgr_drivingDistance`"

msgid "`Migration of spanning tree functions`_"
msgstr "`Migración de las funciones del árbol de expansión`_"

msgid ":doc:`pgr_withPointsDD`"
msgstr ":doc:`pgr_withPointsDD`"

msgid ":doc:`pgr_bdDijkstra`"
msgstr ":doc:`pgr_bdDijkstra`"

msgid ":doc:`pgr_binaryBreadthFirstSearch`"
msgstr ":doc:`pgr_binaryBreadthFirstSearch`"

msgid ":doc:`pgr_bipartite`"
msgstr ":doc:`pgr_bipartite`"

msgid "`Migration of output column name change`_"
msgstr "`Migración de cambio de nombre de columna de salida`_"

msgid ":doc:`pgr_breadthFirstSearch`"
msgstr ":doc:`pgr_breadthFirstSearch`"

msgid ":doc:`pgr_depthFirstSearch`"
msgstr ":doc:`pgr_depthFirstSearch`"

msgid ":doc:`pgr_edgeColoring`"
msgstr ":doc:`pgr_edgeColoring`"

msgid "`Migration of multiple paths functions`_"
msgstr "`Migración de funciones de rutas múltiples`_"

msgid ":doc:`pgr_sequentialVertexColoring`"
msgstr ":doc:`pgr_sequentialVertexColoring`"

msgid ":doc:`pgr_topologicalSort`"
msgstr ":doc:`pgr_topologicalSort`"

msgid ":doc:`pgr_withPoints`"
msgstr ":doc:`pgr_withPoints`"

msgid "`Migration of cost functions`_"
msgstr "`Migración de las funciones de coste`_"

msgid "Migration of cost functions"
msgstr "Migración de las funciones de coste"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|"
msgstr ""

msgid "The following functions need to be migrated when they are being used in an application."
msgstr ""

msgid "Version"
msgstr "Versión"

msgid "From"
msgstr ""

msgid "``pgr_withPointsCost``"
msgstr "``pgr_withPointsCost``"

msgid "v < 4.0"
msgstr ""

msgid "|matrix-pid|"
msgstr "|matrix-pid|"

msgid "``pgr_withPointsCostMatrix``"
msgstr "``pgr_withPointsCostMatrix``"

msgid "**to** |matrix-result|"
msgstr "**a** |matrix-result|"

msgid "Migration of |matrix-pid|"
msgstr "Migración de |matrix-pid|"

msgid "Signatures to be migrated:"
msgstr "Firmas que serán migradas:"

msgid "One to One"
msgstr "Uno a Uno"

msgid "One to Many"
msgstr "Uno a Muchos"

msgid "Many to One"
msgstr "Muchos a Uno"

msgid "Many to Many"
msgstr "Muchos a Muchos"

msgid "Combinations"
msgstr "Combinaciones"

msgid "Breaking change"
msgstr "Cambio de ruptura"

msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting"
msgstr ""

msgid "New output columns are |matrix-result|"
msgstr "Las nuevas columnas de salida son |matrix-result|"

msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``."
msgstr ""

msgid "Examples"
msgstr "Ejemplos"

msgid "Examples for One to One for cost functions"
msgstr "Ejemplos de uno a uno para funciones de coste"

msgid "Using ``pgr_withPointsCost``"
msgstr "Usando ``pgr_withPointsCost``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-one>`__."

msgid "from"
msgstr "de"

msgid "to"
msgstr "a"

msgid "Examples for One to Many for cost functions"
msgstr "Ejemplos de funciones de coste de Uno a Muchos"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-many>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-many>`__."

msgid "Examples for Many to One for cost functions"
msgstr "Ejemplos de funciones de coste de Muchos a Uno"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-one>`__."

msgid "Examples for Many to Many for cost functions"
msgstr "Ejemplos de funciones de coste de Muchos a Muchos"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-many>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-many>`__."

msgid "Examples for Combinations for cost functions"
msgstr "Ejemplos de funciones de coste de Combinaciones"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#combinations>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#combinations>`__."

msgid "Migration of multiple paths functions"
msgstr "Migración de funciones de múltiples rutas"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|"
msgstr "Las columnas estandarizadas :ref:`pgRouting-concepts:Result columns for single path functions` son |nksp-result|"

msgid "``pgr_KSP``"
msgstr "``pgr_KSP``"

msgid "v < 3.6"
msgstr ""

msgid ":ref:`from_ksp_result`"
msgstr ":ref:`from_ksp_result`"

msgid "``pgr_edgeDisjointPaths``"
msgstr "``pgr_edgeDisjointPaths``"

msgid ":ref:`from_result_disjoint`"
msgstr ":ref:`from_result_disjoint`"

msgid "Migration of |ksp-result|"
msgstr "Migración de |ksp-result|"

msgid "|nksp-result|"
msgstr "|nksp-result|"

msgid "Before updating pgRouting, enumerate the |ksp-result|"
msgstr "Antes de actualizar pgRouting, enumerar los |ksp-result|"

msgid "One to One example using ``pgr_KSP``"
msgstr ""

msgid "Using `this <https://docs.pgrouting.org/3.5/en/pgr_KSP.html#signatures>`__ example."
msgstr "Usando `éste <https://docs.pgrouting.org/3.5/en/pgr_KSP.html#signatures>`__ ejemplo."

msgid "Migration of |result-disjoint|"
msgstr "Migración de |result-disjoint|"

msgid "Before updating pgRouting, enumerate the |result-disjoint|"
msgstr "Antes de actualizar pgRouting, enumerar los |result-disjoint|"

msgid "Skip when applicable, ``start_vid``"
msgstr ""

msgid "Skip when applicable, ``end_vid``"
msgstr "Omitir cuando proceda, ``end_vid``"

msgid "One to One example using ``pgr_edgeDisjointPaths``"
msgstr "Ejemplo de Uno a Uno con ``pgr_edgeDisjointPaths``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.6/en/pgr_edgeDisjointPaths.html#one-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.6 <https://docs.pgrouting.org/3.6/en/pgr_edgeDisjointPaths.html#one-to-one>`__."

msgid "Before updating pgRouting enumerate the columns: |ksp-result|"
msgstr "Antes de actualizar pgRouting enumerar las columnas: |ksp-result|"

msgid "Migration of single path functions"
msgstr "Migración de funciones de ruta única"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|"
msgstr "Las columnas estandarizadas :ref:`pgRouting-concepts:Result columns for single path functions` son |short-generic-result|"

msgid "``pgr_dijkstra``"
msgstr "``pgr_dijkstra``"

msgid "v < 3.5"
msgstr ""

msgid "|old-generic-result|"
msgstr "|old-generic-result|"

msgid "``pgr_aStar``"
msgstr "``pgr_aStar``"

msgid "``pgr_bdDijkstra``"
msgstr "``pgr_bdDijkstra``"

msgid "``pgr_bellmanFord``"
msgstr "``pgr_bellmanFord``"

msgid "``pgr_dagShortestPath``"
msgstr "``pgr_dagShortestPath``"

msgid "|result-1-1|"
msgstr "|result-1-1|"

msgid "``pgr_edwardMoore``"
msgstr "``pgr_edwardMoore``"

msgid "``pgr_withPoints``"
msgstr "``pgr_withPoints``"

msgid "|old-pid-result|"
msgstr "|old-pid-result|"

msgid "Migration of |old-generic-result|"
msgstr "Migración de |old-generic-result|"

msgid "Before updating pgRouting, enumerate the corresponding columns of the signature"
msgstr ""

msgid "Migration of |old-pid-result|"
msgstr "Migración de |old-pid-result|"

msgid "To get the old version column names, depending on the signature:"
msgstr ""

msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``"
msgstr "Filtrar las columnas ``start_vid`` y /o ``end_vid``"

msgid "Rename the columns:"
msgstr "Cambio de nombre en las columnas:"

msgid "``start_vid`` to ``start_pid``"
msgstr "``start_vid`` a ``end_pid``"

msgid "``end_vid`` to ``end_pid``"
msgstr "``end_vid`` a ``end_pid``"

msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting"
msgstr ""

msgid "Migration of |result-1-1|"
msgstr "Migración de |result-1-1|"

msgid "To get the old version column names:"
msgstr "Para obtener los nombres de columna de la versión antigua:"

msgid "Filter out the columns: ``start_vid`` and ``end_vid``"
msgstr "Filtrar las columnas: ``start_vid`` y ``end_vid``"

msgid "Examples with One to One with one route result"
msgstr ""

msgid "Using ``pgr_aStar``"
msgstr "Usando ``pgr_aStar``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_aStar.html#one-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.5 <https://docs.pgrouting.org/3.5/en/pgr_aStar.html#one-to-one>`__."

msgid "Before updating pgRouting enumerate the columns: |result-1-1|"
msgstr ""

msgid "Using ``pgr_bdDijkstra``"
msgstr "Usando ``pgr_bdDijkstra``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#one-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#one-to-one>`__."

msgid "Using ``pgr_DAGshortestPath``"
msgstr "Usando ``pgr_DAGshortestPath``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__."

msgid "This applies to all signatures of ``pgr_DAGshortestPath``"
msgstr ""

msgid "Examples for One to Many with one route result"
msgstr ""

msgid "Using ``pgr_bdAstar``"
msgstr "Usando ``pgr_bdAstar``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_bdAstar.html#one-to-many>`__ example."
msgstr "Migrando ejemplo `de v3.5 <https://docs.pgrouting.org/3.5/en/pgr_bdAstar.html#one-to-many>`__."

msgid "Before updating pgRouting enumerate the columns: |result-1-m|"
msgstr ""

msgid "Using ``pgr_withPoints``"
msgstr "Usando ``pgr_withPoints``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#one-to-many>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#one-to-many>`__."

msgid "|pid-1-m|"
msgstr ""

msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``."
msgstr "Para obtener los nombres de columna de la firma antigua: filtrar la columna ``start_vid`` y cambiar el nombre de ``end_vid`` a ``end_pid``."

msgid "Examples for Many to One with one route result"
msgstr ""

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#many-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#many-to-one>`__."

msgid "Before updating pgRouting enumerate the columns: |result-m-1|"
msgstr ""

msgid "Using ``pgr_dijkstra``"
msgstr "Usando ``pgr_dijkstra``"

msgid "Migrating `this v3.4 <https://docs.pgrouting.org/3.4/en/pgr_dijkstra.html#many-to-one>`__ example."
msgstr "Migrando ejemplo `de v3.4 <https://docs.pgrouting.org/3.4/en/pgr_dijkstra.html#many-to-one>`__."

msgid "Examples for Many to Many with one route result"
msgstr ""

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#many-to-many>`__ example."
msgstr "Migrando ejemplo `de v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#many-to-many>`__."

msgid "|pid-m-m|"
msgstr ""

msgid "Examples for combinations with one route result"
msgstr ""

msgid "Migrating `this v3.8 `this <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#combinations>`__ example."
msgstr "Migrando ejemplo `de v3.8 `this <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#combinations>`__."

msgid "Migration of spanning tree functions"
msgstr "Migración de las funciones de árbol de expansión"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|"
msgstr ""

msgid "``pgr_drivingDistance``"
msgstr "``pgr_drivingDistance``"

msgid ":ref:`from_result_dij_dd`"
msgstr ":ref:`from_result_dij_dd`"

msgid "``pgr_withPointsDD``"
msgstr "``pgr_withPointsDD``"

msgid ":ref:`from_result_generic_no_seq`"
msgstr ":ref:`from_result_generic_no_seq`"

msgid "``pgr_kruskalDD``"
msgstr "``pgr_kruskalDD``"

msgid "v < 3.7"
msgstr ""

msgid ":ref:`from_result_bfs`"
msgstr ":ref:`from_result_bfs`"

msgid "``pgr_kruskalBFS``"
msgstr "``pgr_kruskalBFS``"

msgid "``pgr_kruskalDFS``"
msgstr "``pgr_kruskalDFS``"

msgid "``pgr_primDD``"
msgstr "``pgr_primDD``"

msgid "``pgr_primBFS``"
msgstr "``pgr_primBFS``"

msgid "``pgr_primDFS``"
msgstr "``pgr_primDFS``"

msgid "``pgr_breadthFisrtSearch``"
msgstr "``pgr_breadthFisrtSearch``"

msgid "v < 4.0.0"
msgstr ""

msgid "``pgr_depthFisrtSearch``"
msgstr "``pgr_depthFisrtSearch``"

msgid "to |result-spantree|"
msgstr "a |result-spantree|"

msgid "Migration from |result-bfs|."
msgstr "Migración de |result-bfs|."

msgid "Single vertex"
msgstr "Vértice único"

msgid "Multiple vertices"
msgstr "Múltiples vértices"

msgid "Before updating pgRouting enumerate the columns: |result-bfs|"
msgstr ""

msgid "Single vertex example using ``pgr_kruskalDD``"
msgstr "Ejemplo de vértice único con ``pgr_kruskalDD``"

msgid "Migrating `this v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDD.html#single-vertex>`__ example."
msgstr "Migrando ejemplo `de v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDD.html#single-vertex>`__."

msgid "Before updating pgRouting enumerate the columns: |result-bfs|."
msgstr ""

msgid "Multiple vertices example using ``pgr_kruskalDFS``"
msgstr "Ejemplo de vértices múltiples con ``pgr_kruskalDFS``"

msgid "Migrating `this v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDFS.html#multiple-vertices>`__ example."
msgstr "Migrando ejemplo `de v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDFS.html#multiple-vertices>`__."

msgid "Migration from |result-dij-dd|"
msgstr "Migración de |result-dij-dd|"

msgid "Migration depends on the signature."
msgstr ""

msgid "For single vertex:"
msgstr "Para vértice único:"

msgid "Before updating pgRouting, enumerate |result-1-1| columns"
msgstr "Antes de actualizar pgRouting, enumerar las columnas |result-1-1|"

msgid "For multiple vertices:"
msgstr "Para múltiples vértices:"

msgid "Changes must be done after updating pgRouting."
msgstr ""

msgid "To get the old version column names |result-dij-dd-m|:"
msgstr "Para obtener los nombres de columna de la versión antigua |result-dij-dd-m|:"

msgid "filter out the column ``pred`` and ``depth`` and"
msgstr "filtrar las columnas ``pred`` y ``depth`` y"

msgid "rename ``start_vid`` to ``from_v``."
msgstr "renombrar ``start_vid`` a ``from_v``."

msgid "Single vertex example using ``pgr_drivingDistance``"
msgstr "Ejemplo de vértice único con ``pgr_drivingDistance``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#single-vertex>`__ example."
msgstr "Migrando ejemplo `de v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#single-vertex>`__."

msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns"
msgstr "Antes de actualizar pgRouting, enumerar las columnas |result-1-1-no-seq|"

msgid "Multiple vertices example using ``pgr_drivingDistance``"
msgstr "Ejemplo de vértices múltiples con ``pgr_drivingDistance``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#multiple-vertices>`__ example."
msgstr "Migrando ejemplo `de v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#multiple-vertices>`__."

msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``."
msgstr ""

msgid "Migration of |result-generic-no-seq|"
msgstr "Migración de |result-generic-no-seq|"

msgid "After updating pgRouting:"
msgstr ""

msgid "Enumerate |result-1-1-no-seq| columns"
msgstr "Enumerar las columnas |result-1-1-no-seq|"

msgid "Use an unnamed valid value for **driving side** after the **distance** parameter."
msgstr "Usar un valor válido sin nombre para **lado de manejo** después del parámetro **distancia**."

msgid "Enumerate |result-m-1-no-seq| columns"
msgstr "Enumerar las columnas |result-m-1-no-seq|"

msgid "Default value of **driving side** parameter"
msgstr "Valor por defecto del parámetro **lado conductor**"

msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs."
msgstr "El parámetro **lado conductor** no tiene nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos."

msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]"
msgstr "En grafos dirigidos: Los valores válidos son [``r``, ``R``, ``l``, ``L``]"

msgid "Default value = 'r';"
msgstr "Valor por defecto = 'r';"

msgid "In undirected graph: valid values are [``b``, ``B``]"
msgstr "En grafos no dirigidos: Los valores válidos son [``b``, ``B``]"

msgid "Default value = 'b';"
msgstr "Valor por defecto = 'b';"

msgid "Single vertex example using ``pgr_withPointsDD``"
msgstr "Ejemplo de vértice único con ``pgr_withPointsDD``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#single-vertex>`__ example."
msgstr "Migrando ejemplo `de v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#single-vertex>`__."

msgid "Multiple vertices example using ``pgr_withPointsDD``"
msgstr "Ejemplo de vértices múltiples con ``pgr_withPointsDD``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#multiple-vertex>`__ example."
msgstr "Migrando ejemplo `de v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#multiple-vertex>`__."

msgid "Migration of output column name change"
msgstr "Migración del cambio de nombre de la columna de salida"

msgid "The standardized result columns:"
msgstr "Columnas de resultados estandarizados:"

msgid "|result_edge_color|"
msgstr "|result_edge_color|"

msgid "|result_node_color|"
msgstr "|result_node_color|"

msgid "|result_node_order|"
msgstr "|result_node_order|"

msgid "Changes on column names must be done after updating pgRouting."
msgstr ""

msgid "``pgr_edgeColoring``"
msgstr "``pgr_edgeColoring``"

msgid ":ref:`from_old_edge_color`"
msgstr ":ref:`from_old_edge_color`"

msgid "``pgr_bipartite``"
msgstr "``pgr_bipartite``"

msgid ":ref:`from_old_node_color`"
msgstr ":ref:`from_old_node_color`"

msgid "``pgr_sequentialVertexColoring``"
msgstr "``pgr_sequentialVertexColoring``"

msgid "``pgr_topologicalSort``"
msgstr "``pgr_topologicalSort``"

msgid ":ref:`from_toposort`"
msgstr ":ref:`from_toposort`"

msgid "``pgr_transitiveClosure``"
msgstr "``pgr_transitiveClosure``"

msgid ":ref:`from_old_closure`"
msgstr ":ref:`from_old_closure`"

msgid "Migration from |result-old-closure|"
msgstr "Migración de |result-old-closure|"

msgid "Migration to: |result-old-closure|"
msgstr "Migración a: |result-old-closure|"

msgid "After update:"
msgstr ""

msgid "Remove column ``seq``"
msgstr "Eliminar la columna ``seq``"

msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``"
msgstr ""

msgid "Migration from |result-toposort|"
msgstr "Migración de |result-toposort|"

msgid "Migration to: |result_node_order|"
msgstr "Migración a: |result_node_order|"

msgid "Rename ``sorted_v`` to ``node``"
msgstr "Cambiar el nombre de ``sorted_v`` a ``node``"

msgid "Migration from |old-edge-color|"
msgstr "Migración de |old-edge-color|"

msgid "Migration to: |result_edge_color|"
msgstr "Migración a: |result_edge_color|"

msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``."
msgstr ""

msgid "Migration from |old-node-color|"
msgstr "Migración de |old-node-color|"

msgid "Migration to: |result_node_color|"
msgstr "Migración a: |result_node_color|"

msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``."
msgstr ""

msgid "Migration of deleted functions"
msgstr "Migración de funciones eliminadas"

msgid "Functions no longer on pgRouting"
msgstr "Funciones que ya no están en pgRouting"

msgid "Migration of ``pgr_alphaShape``"
msgstr "Migración de ``pgr_alphaShape``"

msgid "Deprecated"
msgstr "Obsoleto"

msgid "`v3.8.0 <https://docs.pgrouting.org/3.8>`__"
msgstr "`v3.8.0 <https://docs.pgrouting.org/3.8>`__"

msgid "Removed"
msgstr "Eliminado"

msgid "`v4.0.0 <https://docs.pgrouting.org/4.0>`__"
msgstr "`v4.0.0 <https://docs.pgrouting.org/4.0>`__"

msgid "**Before Deprecation:** The following was calculated:"
msgstr "**Antes de la Depreciación:** Se calculó lo siguiente:"

msgid "An alphaShape was calculated"
msgstr "Se ha calculado un alphaShape"

msgid "**After Deprecation:**"
msgstr "**Después de la eliminación:**"

msgid "PostGIS has two ways of generating alphaShape."
msgstr ""

msgid "If you have SFCGAL, which you can install using"
msgstr ""

msgid "Since PostGIS 3.5+ use `CG_AlphaShape <https://postgis.net/docs/CG_AlphaShape.html>`__"
msgstr ""

msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``"
msgstr ""

msgid "Other PostGIS options are"
msgstr ""

msgid "`ST_ConvexHull <https://postgis.net/docs/ST_ConvexHull.html>`__"
msgstr ""

msgid "`ST_ConcaveHull <https://postgis.net/docs/ST_ConcaveHull.html>`__"
msgstr ""

msgid "Migration of ``pgr_nodeNetwork``"
msgstr "Migración de ``pgr_nodeNetwork``"

msgid "**Before Deprecation:** A table with `<edges>_nodded` was created. with split edges."
msgstr ""

msgid "**Migration**"
msgstr "**Migración**"

msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`"
msgstr ""

msgid "Migration of ``pgr_createTopology``"
msgstr "Migración de ``pgr_createTopology``"

msgid "A table with `<edges>_vertices_pgr` was created."
msgstr "Se ha creado una tabla con `<edges>_vertices_pgr`."

msgid "**After Deprecation:** The user is responsible to create the complete topology."
msgstr "**Después de la depreciación** El usuario es responsable de crear la topología completa."

msgid "Build a routing topology"
msgstr "Construir una topología de ruteo"

msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology."
msgstr "La información básica para usar la mayoría de las funciones de pgRouting ``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama topología de ruteo."

msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation."
msgstr "``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para reducir el tamaño de la base de datos debido al tamaño de las columnas de geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``."

msgid "When the data comes with geometries and there is no routing topology, then this step is needed."
msgstr "Cuando los datos vienen con geometrías y no hay topología de ruteo, entonces este paso es necesario."

msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions."
msgstr "Todos los vértices iniciales y finales de las geometrías necesitan un identificador que se almacenará en las columnas ``source`` y ``target`` de la tabla de los datos. Del mismo modo, ``cost`` y ``reverse_cost`` necesitan tener el valor de atravesar la arista en ambas direcciones."

msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE <https://www.postgresql.org/docs/current/sql-altertable.html>`__)"
msgstr "Si las columnas no existen, hay que añadirlas a la tabla en cuestión. (véase `ALTER TABLE <https://www.postgresql.org/docs/current/sql-altertable.html>`__)"

msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph."
msgstr "La función :doc:`pgr_extractVertices` se utiliza para crear una tabla de vértices basada en el identificador de arista y la geometría de la arista del grafo."

msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up."
msgstr "Finalmente, utilizando los datos almacenados en las tablas de vértices, se rellenan los campos ``source`` y ``target``."

msgid "Migration of ``pgr_createVerticesTable``"
msgstr "Migracion de ``pgr_createVerticesTable``"

msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose."
msgstr "**Después de la depreciación:** El usuario es responsable de crear la tabla de vértices, índices, etc. Para ello puede utilizar :doc:`pgr_extractVertices`."

msgid "Migration of ``pgr_analyzeOneWay``"
msgstr "Migración de ``pgr_analyzeOneWay``"

msgid "Number of potential problems in directionality"
msgstr "Número de problemas potenciales en la dirección"

msgid "WHERE"
msgstr "Donde"

msgid "Directionality problems were calculated based on codes."
msgstr "Los problemas de dirección se calcularon a partir de códigos."

msgid "Dead ends."
msgstr "Callejones sin salida."

msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:"
msgstr "Un problema de ruteo puede surgir cuando desde un vértice sólo hay una salida o una entrada, pero no ambas:"

msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not."
msgstr "Guardando o usando directamente :doc:`pgr_extractVertices` se obtiene la información de los callejones sin salida y se determina si la arista adyacente es unidireccional o no."

msgid "In this example :doc:`pgr_extractVertices` has already been applied."
msgstr "En este ejemplo :doc:`pgr_extractVertices` ya se ha aplicado."

msgid "Bridges."
msgstr "Puentes."

msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way."
msgstr "Otro problema para ruteo puede surgir cuando en un grafo no dirigido hay una arista cuya eliminación aumenta el numero de componentes conectados, y el puente es solo de un sentido."

msgid "To determine if the bridges are or not one way."
msgstr "Para determinar si los puentes son o no unidireccionales."

msgid "Migration of ``pgr_analyzeGraph``"
msgstr "Migración de ``pgr_analyzeGraph``"

msgid "Number of isolated segments."
msgstr "Número de segmentos aislados."

msgid "Number of dead ends."
msgstr "Cantidad de callejones sin salida."

msgid "Number of potential gaps found near dead ends."
msgstr "Número de huecos potenciales encontrados cerca de callejones sin salida."

msgid "Number of intersections. (between 2 edges)"
msgstr "Número de intersecciones. (entre 2 aristas)"

msgid "Graph component"
msgstr "Componente de grafo"

msgid "A connected subgraph that is not part of any larger connected subgraph."
msgstr "Un sub-grafo conectando no es parte de un grafo conectado mas grande."

msgid "Isolated segment"
msgstr "Segmento aislado"

msgid "A graph component with only one segment."
msgstr "Un componente de grafo con un solo segmento."

msgid "Dead ends"
msgstr "Callejones sin salida"

msgid "A vertex that participates in only one edge."
msgstr "Un vértice que participa en una sola arista."

msgid "gaps"
msgstr "Espacios"

msgid "Space between two geometries."
msgstr "Espacio entre dos geometrías."

msgid "Intersection"
msgstr "Intersección"

msgid "Is a topological relationship between two geometries."
msgstr "Es una relación topológica entre dos geometrías."

msgid "Migration."
msgstr "Migración."

msgid "Components."
msgstr "Componentes."

msgid "Instead of counting only isolated segments, determine all the components of the graph."
msgstr "En lugar de contar sólo segmentos aislados, determinar todos los componentes del grafo."

msgid "Depending of the final application requirements use:"
msgstr "Dependiendo de los requisitos de la aplicación final utilizar:"

msgid ":doc:`pgr_connectedComponents`"
msgstr ":doc:`pgr_connectedComponents`"

msgid ":doc:`pgr_strongComponents`"
msgstr ":doc:`pgr_strongComponents`"

msgid ":doc:`pgr_biconnectedComponents`"
msgstr ":doc:`pgr_biconnectedComponents`"

msgid "For example:"
msgstr "Por ejemplo:"

msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`."
msgstr "En lugar de contar los callejones sin salida, determine todos los callejones sin salida del grafo utilizando :doc:`pgr_degree`."

msgid "Potential gaps near dead ends."
msgstr "Huecos potenciales cerca de callejones sin salida."

msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`."
msgstr ""

msgid "Topological relationships."
msgstr "Relaciones topológicas."

msgid "Instead of counting intersections, determine topological relationships between geometries."
msgstr ""

msgid "Several PostGIS functions can be used: `ST_Intersects <https://postgis.net/docs/ST_Intersects.html>`__, `ST_Crosses <https://postgis.net/docs/ST_Crosses.html>`__, `ST_Overlaps <https://postgis.net/docs/ST_Overlaps.html>`__, etc."
msgstr "Se pueden utilizar varias funciones de PostGIS: `ST_Intersects <https://postgis.net/docs/ST_Intersects.html>`__, `ST_Crosses <https://postgis.net/docs/ST_Crosses.html>`__, `ST_Overlaps <https://postgis.net/docs/ST_Overlaps.html>`__, etc."

msgid "Migration of ``pgr_trsp`` (Vertices)"
msgstr "Migración de `pgr_trsp`` (Vértices)"

msgid "Signature:"
msgstr "Firma:"

msgid "`v3.4.0 <https://docs.pgrouting.org/3.4>`__"
msgstr "`v3.4.0 <https://docs.pgrouting.org/3.4>`__"

msgid ":doc:`pgr_trsp`"
msgstr ":doc:`pgr_trsp`"

msgid "`Migration of restrictions`_"
msgstr "`Migración de restricciones`_"

msgid "Use ``pgr_dijkstra`` when there are no restrictions."
msgstr "Usar ``pgr_dijkstra`` cuando no hay restricciones."

msgid "Use :doc:`pgr_dijkstra` instead."
msgstr "Usa en vez :doc:`pgr_dijkstra`."

msgid "To get the original column names:"
msgstr "Para obtener los nombres originales de las columnas:"

msgid "``id1`` is the node"
msgstr "``id1`` es el nodo"

msgid "``id2`` is the edge"
msgstr "``id2`` es la arista"

msgid "Use ``pgr_trsp`` when there are restrictions."
msgstr "Usar ``pgr_trspVia`` cuando hay restricciones."

msgid "Use :doc:`pgr_trsp` (One to One) instead."
msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)."

msgid "Migration of ``pgr_trsp`` (Edges)"
msgstr "Migración de ``pgr_trsp`` (Aristas)"

msgid ":doc:`pgr_trsp_withPoints`"
msgstr ":doc:`pgr_trsp_withPoints`"

msgid "Migration of ``pgr_trspViaVertices``"
msgstr "Migraciones de ``pgr_trspViaVertices``"

msgid ":doc:`pgr_dijkstraVia`"
msgstr ":doc:`pgr_dijkstraVia`"

msgid ":doc:`pgr_trspVia`"
msgstr ":doc:`pgr_trspVia`"

msgid "Use ``pgr_dijkstraVia`` when there are no restrictions"
msgstr "Usar ``pgr_dijkstraVia`` cuando no hay restricciones"

msgid "Use :doc:`pgr_dijkstraVia` instead."
msgstr "Usar :doc:`pgr_dijkstraVia` en su lugar."

msgid "``id1`` is the path identifier"
msgstr "``id1`` es el identificador de camino"

msgid "``id2`` is the node"
msgstr "``id2`` es el nodo"

msgid "``id3`` is the edge"
msgstr "``id3`` es la arista"

msgid "Use ``pgr_trspVia`` when there are restrictions"
msgstr "Usar ``pgr_trspVia`` cuando hay restricciones"

msgid "Use :doc:`pgr_trspVia` instead."
msgstr "Usar :doc:`pgr_trspVia` en su lugar."

msgid "Migration of ``pgr_trspViaEdges``"
msgstr "Migración de ``pgr_trspViaEdges``"

msgid ":doc:`pgr_withPointsVia`"
msgstr ":doc:`pgr_withPointsVia`"

msgid ":doc:`pgr_trspVia_withPoints`"
msgstr ":doc:`pgr_trspVia_withPoints`"

msgid "Use ``pgr_withPointsVia`` when there are no restrictions"
msgstr "Usar ``pgr_withPointsVia`` cuando no hay restricciones"

msgid "Use :doc:`pgr_withPointsVia` instead."
msgstr "Usar :doc:`pgr_withPointsVia` en su lugar."

msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions"
msgstr "Usar ``pgr_trspVia_withPoints`` cuando hay restricciones"

msgid "Use :doc:`pgr_trspVia_withPoints` instead."
msgstr "Usar :doc:`pgr_trspVia_withPoints` en su lugar."

msgid "Not yet classified migrations"
msgstr ""

msgid "Migration of ``pgr_withPointsKSP``"
msgstr "Migración de ``pgr_withPointsKSP``"

msgid "Starting from `v3.6.0 <https://docs.pgrouting.org/3.6/en/migration.html>`__ :doc:`pgr_withPointsKSP` result columns are being standardized."
msgstr "A partir de `v3.6.0 <https://docs.pgrouting.org/3.6/es/migration.html>`__ en :doc:`pgr_withPointsKSP` las columnas de resultados están siendo estandarizadas."

msgid "|ksp-result|"
msgstr "|ksp-result|"

msgid "|generic-result|"
msgstr "|generic-result|"

msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs."
msgstr "Y el parámetro ``driving side`` ha cambiado de opcional con nombre a **lado conductor** sin nombre y su validez difiere para grafos dirigidos y no dirigidos."

msgid "``pgr_withPointsKSP`` (`One to One`)"
msgstr "``pgr_withPointsKSP`` (`Uno a Uno`)"

msgid "Before Migration"
msgstr "Antes de la migración"

msgid "Output columns were |old-pid-result|"
msgstr "Regresa conjunto de |old-generic-result|"

msgid "the columns ``start_vid`` and ``end_vid`` do not exist."
msgstr "las columnas ``start_vid`` y ``end_vid`` no existen."

msgid "Migration"
msgstr "Migración"

msgid "Be aware of the existence of the additional result Columns."
msgstr "Tener en cuenta la existencia de las columnas adicionales de resultados."

msgid "New output columns are |generic-result|"
msgstr "Las nuevas columnas de salida son |generic-result|"

msgid "Using `this <https://docs.pgrouting.org/3.5/en/pgr_withPointsKSP.html#signatures>`__ example."
msgstr "Usando `este <https://docs.pgrouting.org/3.5/en/pgr_withPointsKSP.html#signatures>`__ ejemplo."

msgid "``start_vid`` contains the **start vid** parameter value."
msgstr "``start_vid`` contiene el valor del parámetro **start vid**."

msgid "``end_vid`` contains the **end vid** parameter value."
msgstr "``end_vid`` contiene el valor del parámetro **end vid**."

msgid "If needed filter out the additional columns, for example, to return the original columns:"
msgstr "Si es necesario, filtrar las columnas adicionales, por ejemplo, para devolver las columnas originales:"

msgid "Use ``pgr_withPoints`` when there are no restrictions."
msgstr "Usar ``pgr_withPoints`` cuando no hay restricciones."

msgid "Use :doc:`pgr_withPoints` (One to One) instead."
msgstr "Utilizar en su lugar :doc:`pgr_withPoints` (Uno a Uno)."

msgid "Use ``pgr_trsp_withPoints`` when there are restrictions."
msgstr "Usar ``pgr_trsp_withPoints`` cuando hay restricciones."

msgid "Use :doc:`pgr_trsp_withPoints` instead."
msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`."

msgid "Migration of ``pgr_maxCardinalityMatch``"
msgstr "Migración de ``pgr_maxCardinalityMatch``"

msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed."
msgstr ":doc:`pgr_maxCardinalityMatch` funciona solamente para grafos no dirigidos, entonces la bandera ``directed`` ha sido removida."

msgid "Starting from `v3.4.0 <https://docs.pgrouting.org/3.4/en/migration.html>`__"
msgstr "A partir de v3.4.0 <https://docs.pgrouting.org/3.4/es/migration.html>`__"

msgid "Signature to be migrated:"
msgstr "Firma que serán migrada:"

msgid "Migration is needed, because:"
msgstr "Migración es necesaria, porque:"

msgid "Use ``cost`` and ``reverse_cost`` on the inner query"
msgstr "Usa ``cost`` y ``reverse_cost`` en la consulta interna"

msgid "Results are ordered"
msgstr "Los resultados son ordenados"

msgid "Works for undirected graphs."
msgstr "Funciona para grafos no dirigidos."

msgid "New signature"
msgstr "Nueva firma"

msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column."
msgstr "``pgr_maxCardinalityMatch(text)`` regresa solamente la columna ``edge``."

msgid "The optional flag ``directed`` is removed."
msgstr "La bandera opcional ``directed`` es removida."

msgid "Before migration"
msgstr "Antes de migración"

msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge."
msgstr "Las columnas usadas son ``going`` y ``coming`` para representar la existencia de la arista."

msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph."
msgstr "La flag ``directed`` es usada para indicar si fue para un grafo **dirigido** or **no dirigido**."

msgid "The flag ``directed`` is ignored."
msgstr "La bandera ``directed`` es ignorada."

msgid "Regardless of it's value it gives the result considering the graph as **undirected**."
msgstr "Independiente de su valor, da el resultado considerando el grafo como **no dirigido**."

msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge."
msgstr "Usa las columnas ``cost`` y ``reverse_cost`` para representar la existenica de una arista."

msgid "Do not use the flag ``directed``."
msgstr "No use la bandera ``directed``."

msgid "In the query returns only ``edge`` column."
msgstr "En la consulta solo devuelve la columna ``edge``."

msgid "Migration of restrictions"
msgstr "Migración de restricciones"

msgid "The structure of the restrictions have changed:"
msgstr "La estructura de las restricciones ha cambiado:"

msgid "Old restrictions structure"
msgstr "Estructura de restricciones vieja"

msgid "On the deprecated signatures:"
msgstr "Sobre las firmas obsoletas:"

msgid "Column ``rid`` is ignored"
msgstr "La columna ``rid`` es ignorada"

msgid "``via_path``"
msgstr "``via_path``"

msgid "Must be in reverse order."
msgstr "Debe de estar en orden reverso."

msgid "Is of type ``TEXT``."
msgstr "Es de tipo ``TEXT``."

msgid "When more than one via edge must be separated with ``,``."
msgstr "Cuando hay más de una arista debe de ser separada con ``,``."

msgid "``target_id``"
msgstr "``target_id``"

msgid "Is the last edge of the forbidden path."
msgstr "Es la última arista del camino prohibido."

msgid "Is of type ``INTEGER``."
msgstr "Es de tipo de ``INTEGER``."

msgid "``to_cost``"
msgstr "``to_cost``"

msgid "Is of type ``FLOAT``."
msgstr "Es de tipo ``FLOAT``."

msgid "Creation of the old restrictions table"
msgstr "Creación de la vieja table de restricciones"

msgid "Old restrictions fill up"
msgstr "Las viejas restricciones se llenan"

msgid "Old restrictions contents"
msgstr "Contenido de viejas restricciones"

msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`"
msgstr "La restricción con ``rid = 2`` representa :math:`3 \\rightarrow 5 \\rightarrow9`"

msgid ":math:`3\\rightarrow5`"
msgstr ":math:`3\\rightarrow5`"

msgid "is on column ``via_path`` in reverse order"
msgstr "esta en la columna ``via_path`` en orden reverso"

msgid "is of type ``TEXT``"
msgstr "es de tipo ``TEXT``"

msgid ":math:`9`"
msgstr ":math:`9`"

msgid "is on column ``target_id``"
msgstr "está en la columna ``target_id``"

msgid "is of type ``INTEGER``"
msgstr "es de tipo ``INTEGER``"

msgid "New restrictions structure"
msgstr "Estructura de nuevas restricciones"

msgid "Column ``id`` is ignored"
msgstr "La columna ``id`` es ignorada"

msgid "Column ``path``"
msgstr "Columna ``path``"

msgid "Is of type ``ARRAY[ANY-INTEGER]``."
msgstr "Es de tipo ``ARRAY[ANY-INTEGER]``."

msgid "Contains all the edges involved on the restriction."
msgstr "Contiene todas las aristas involucradas con la restricción"

msgid "The array has the ordered edges of the restriction."
msgstr "El conjunto tiene las aristas ordenadas de la restricción."

msgid "Column ``cost``"
msgstr "Columna ``cost``"

msgid "Is of type ``ANY-NUMERICAL``"
msgstr "Es de tipo``ANY-NUMERICAL``"

msgid "The creation of the restrictions table"
msgstr "La creación de la tabla de restricciones"

msgid "Adding the restrictions"
msgstr "Agregando las restricciones"

msgid "Restrictions data"
msgstr "Datos de restricciones"

msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`."
msgstr "La restricción con``rid = 2`` representa el camino :math:`3 \\rightarrow5 \\rightarrow9`."

msgid "By inspection the path is clear."
msgstr "El camino es claro por inspección."

msgid "To transform the old restrictions table to the new restrictions structure,"
msgstr "Para transformar la antigua tabla de restricciones a la nueva estructura de restricciones,"

msgid "Create a new table with the new restrictions structure."
msgstr "Crea una nueva tabla con la nueva estructura de restricciones."

msgid "In this migration guide ``new_restrictions`` is been used."
msgstr "En esta guía de migración ``new_restrictions`` está siendo usada."

msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration."
msgstr "Para esta migración pgRouting proporciona una función auxiliar para la inversión de un conjunto ``_pgr_array_reverse`` necesaria para la migración."

msgid "``_pgr_array_reverse``:"
msgstr "``_pgr_array_reverse``:"

msgid "Was created temporally for this migration"
msgstr "Se creo temporalmente para esta migración"

msgid "Is not documented."
msgstr "No está documentado."

msgid "Will be removed on the next mayor version 4.0.0"
msgstr "Se eliminara en la próxima versión mayor 4.0.0"

msgid "The migrated table contents:"
msgstr "El contenido de la tabla de migración:"

msgid ":doc:`pgRouting-concepts`"
msgstr ":doc:`pgRouting-concepts`"

msgid "Ordering - Family of functions"
msgstr "Ordenamiento - Familia de funciones"

msgid "pgRouting Concepts"
msgstr "Conceptos de pgRouting"

msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:"
msgstr "Esta es una guía simple que va a través de los pasos básicos para empezar trabajar con pgRouting. Esta guía cubre:"

msgid "Graphs"
msgstr "Grafos"

msgid "A graph is an ordered pair :math:`G = (V ,E)` where:"
msgstr "Un grafo es un par ordenado :math:`G = (V ,E)` donde:"

msgid ":math:`V` is a set of vertices, also called nodes."
msgstr ":math:`V` es un conjunto de vértices, también llamados nodos."

msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`"

msgid "There are different kinds of graphs:"
msgstr "Hay diferentes tipos de grafos:"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`"

msgid "Undirected simple graph"
msgstr "Grafo no dirigido simple"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`"

msgid "Directed simple graph"
msgstr "Grafo dirigido simple"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`"

msgid "Graphs:"
msgstr "Grafos:"

msgid "Do not have geometries."
msgstr "No tienen geometrías."

msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting."
msgstr "Algunos problemas de teoría de grafos requieren tener pesos, llamados **cost** en pgRouting."

msgid "In pgRouting there are several ways to represent a graph on the database:"
msgstr "En pgRouting hay varias maneras de representar in grafo en la base de datos:"

msgid "With ``cost``"
msgstr "Con ``cost``"

msgid "(``id``, ``source``, ``target``, ``cost``)"
msgstr "(``id``, ``source``, ``target``, ``cost``)"

msgid "With ``cost`` and ``reverse_cost``"
msgstr "Con ``cost`` y ``reverse_cost``"

msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)"
msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)"

msgid "Identifier of the edge. Requirement to use the database in a consistent. manner."
msgstr "Identificador de la asirsta. Requerimiento para mantener consistente la base de datos."

msgid "Identifier of a vertex."
msgstr "Identificador de un vértice."

msgid "Weight of the edge (``source``, ``target``):"
msgstr "Peso de la arista (``source``, ``target``):"

msgid "When negative the edge (``source``, ``target``) do not exist on the graph."
msgstr "Cuando negativo: la arista (``source``, ``target``) no existe en el grafo."

msgid "``cost`` must exist in the query."
msgstr "``cost`` debe existir en la consulta."

msgid "When negative the edge (``target``, ``source``) do not exist on the graph."
msgstr "Cuando negativo: la arista (``target``, ``source``) no existe en el grafo."

msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm."
msgstr "La decisión del grafo de ser **directed** o **undirected** es resultado al ejecutar el algoritmo de pgRouting."

msgid "Graph with ``cost``"
msgstr "Grafo con ``cost``"

msgid "The weighted directed graph, :math:`G_d(V,E)`:"
msgstr "El grafo ponderado dirigido, :math:`G_d(V,E)`:"

msgid "Graph data is obtained with a query"
msgstr "Datos de l grafo se obtienen mediante una consulta"

msgid "``SELECT id, source, target, cost FROM edges``"
msgstr "``SELECT id, source, target, cost FROM edges``"

msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`"
msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ cuando } cost_{id} \\ge 0 \\}`"

msgid "Edges where ``cost`` is non negative are part of the graph."
msgstr "Aristas donde ``cost`` es no negativo son parte del grafo."

msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`"
msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`"

msgid "All vertices in ``source`` and ``target`` are part of the graph."
msgstr "Todos los vértices``source`` y ``target`` son parte del grafo."

msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`"
msgstr "En un grafo dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`"

msgid "For the following data:"
msgstr "Para los siguientes datos:"

msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph."
msgstr "La arista :math:`2` (:math:`1 \\rightarrow 3`) no es parte del grafo."

msgid "The data is representing the following graph:"
msgstr "Los datos se representan en el siguiente grafo:"

msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`"
msgstr "En un grafo no dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` no tiene direccionalidad: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`"

msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`"
msgstr "En términos de un grafo dirigido es como tener dos aristas: :math:`source_{id} \\leftrightarrow target_{id}`"

msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph."
msgstr "Arista :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) no es parte del grafo."

msgid "Graph with ``cost`` and ``reverse_cost``"
msgstr "Grafo con ``cost`` y ``reverse_cost``"

msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``"
msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``"

msgid "The set of edges :math:`E`:"
msgstr "El conjunto de aristas :math:`E`:"

msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`"
msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`"

msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph."
msgstr "Aristas :math:`(source \\rightarrow target)` done ``cost`` es no negativo son parte del grafo."

msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph."
msgstr "Aristas :math:`(target \\rightarrow source)` donde ``reverse_cost`` es no negativo son parte del grafo."

msgid "The set of vertices :math:`V`:"
msgstr "El conjunto de vértices :math:`V`:"

msgid "In a directed graph both edges have directionality"
msgstr "En un grafo dirigido ambas aristas tiene direccionalidad"

msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`"
msgstr "arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`"

msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`"
msgstr "arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` tiene direccionalidad: :math:`target_{id} \\rightarrow source_{id}`"

msgid "Edges not part of the graph:"
msgstr "Aristas no son parte del grafo:"

msgid ":math:`2` (:math:`1 \\rightarrow 3`)"
msgstr ":math:`2` (:math:`1 \\rightarrow 3`)"

msgid ":math:`3` (:math:`3 \\rightarrow 2`)"
msgstr ":math:`3` (:math:`3 \\rightarrow 2`)"

msgid "In a directed graph both edges do not have directionality"
msgstr "En un grafo dirigido ambas aristas no tiene direccionalidad"

msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`"
msgstr "Arista :math:`(source_{id}, target_{id}, cost_{id})` es :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`"

msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`"
msgstr "Arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` es :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`"

msgid "In terms of a directed graph is like having four edges:"
msgstr "En términos de un grafo dirigido es como tener cuatro aristas:"

msgid ":math:`source_i \\leftrightarrow target_i`"
msgstr ":math:`source_i \\leftrightarrow target_i`"

msgid ":math:`target_i \\leftrightarrow source_i`"
msgstr ":math:`target_i \\leftrightarrow source_i`"

msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)"
msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)"

msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)"
msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)"

msgid "Graphs without geometries"
msgstr "Grafos sin geometrías"

msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph."
msgstr "Relaciones personales, genealogía, problemas de dependencia de archivos puede ser resueltos usando pgRouting. Esos problemas, normalmente, no vienen con las geometrías asociadas con el grafo."

msgid "Wiki example"
msgstr "Ejemplo de Wiki"

msgid "Solve the example problem taken from `wikipedia <https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm>`__):"
msgstr "Resuelva el problema de ejemplo tomado de `wikipedia <https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm>`__):"

msgid "Problem is to find the shortest path from :math:`1` to :math:`5`."
msgstr "Problema es encontrar el camino mas corto desde :math:`1` a :math:`5`."

msgid "Is an undirected graph."
msgstr "Es un grafo dirigido."

msgid "Although visually looks like to have geometries, the drawing is not to scale."
msgstr "Aunque visualmente se vea con geometrías, el dibujo no es a escala."

msgid "No geometries associated to the vertices or edges"
msgstr "Las geometrías no esta asociadas con los vértices o aristas"

msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`"
msgstr "Tiene 6 vértices :math:`\\{1,2,3,4,5,6\\}`"

msgid "Has 9 edges:"
msgstr "Tiene 9 aristas:"

msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`"
msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`"

msgid "The graph can be represented in many ways for example:"
msgstr "El grafo puede ser representados de varias maneras por ejemplo:"

msgid "Prepare the database"
msgstr "Prepara la base de datos"

msgid "Create a database for the example, access the database and install pgRouting: ::"
msgstr "Crea una base de datos para el ejemplo, acceda a la base de datos e instala pgRouting: ::"

msgid "Create a table"
msgstr "Crear una tabla"

msgid "The basic elements needed to perform basic routing on an undirected graph are:"
msgstr "Los elementos básicos necesarios para realizar routing básico en un grafo no dirigido son:"

msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT"
msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT"

msgid "Using this table design for this example:"
msgstr "Usando este diseño de tabla para este ejemplo:"

msgid "Insert the data"
msgstr "Introduzca los datos"

msgid "Find the shortest path"
msgstr "En cuentre el camino más corto"

msgid "To solve this example :doc:`pgr_dijkstra` is used:"
msgstr "Para resolver el ejemplo se usa :doc:`pgr_dijkstra`:"

msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`"
msgstr "Para ir de :math:`1` a :math:`5` el camino que atraviesa los siguientes vértices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`"

msgid "Vertex information"
msgstr "Información de vertices"

msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`"
msgstr "Para obtener la información de los vértices, use :doc:`pgr_extractVertices`"

msgid "Graphs with geometries"
msgstr "Grafos con geometrías"

msgid "Create a routing Database"
msgstr "Crear una Base de Datos de Ruteo"

msgid "The first step is to create a database and load pgRouting in the database."
msgstr "El primer paso para crear una base de datos y cargar pgRouting en la base de datos."

msgid "Typically create a database for each project."
msgstr "Típicamente se crea una base de datos para cada proyecto."

msgid "Once having the database to work in, load your data and build the routing application in that database."
msgstr "Una vez que se tenga una base de datos, cargue sus datos y construya la aplicación de routeo en esa base de datos."

msgid "Load Data"
msgstr "Cargar Datos"

msgid "There are several ways to load your data into pgRouting."
msgstr "Hay varias maneras de cargar tus datos en pgRouting."

msgid "Manually creating a database."
msgstr "Creando manualmente la base de datos."

msgid "`Graphs without geometries`_"
msgstr "`Grafos sin geometrías`_"

msgid ":doc:`sampledata`: a small graph used in the documentation examples"
msgstr ":doc:`sampledata`: un pequeño grafo utilizado en los ejemplos de la documentación"

msgid "Using `osm2pgrouting <https://workshop.pgrouting.org/latest/en/basic/data.html>`__"
msgstr "Usando `osm2pgrouting <https://workshop.pgrouting.org/latest/en/basic/data.html>`__"

msgid "There are various open source tools that can help, like:"
msgstr "Existen varias herramientas de codigo abierto que pueden ayudar, como:"

msgid "shp2pgsql"
msgstr "shp2pgsql"

msgid "postgresql shapefile loader"
msgstr "cargador a postgresql de archivos shape"

msgid "ogr2ogr"
msgstr "ogr2ogr"

msgid "vector data conversion utility"
msgstr "herramienta de conversión de datos vectoriales"

msgid "osm2pgsql"
msgstr "osm2pgsql"

msgid "load OSM data into postgresql"
msgstr "cargar datos de OSM a postgresql"

msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted."
msgstr "Tener en cuenta que estas herramientas **no** importan los datos a una estructura compatible con pgRouting y cuando esto sucede, la topología necesita ser ajustada."

msgid "Breakup a segments on each segment-segment intersection"
msgstr "Rompe en segmentos cada intersección segmento-segmento"

msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``."
msgstr "Cuando falte, agregue columnas y asigne valores a ``source``, ``target``, ``cost``, ``reverse_cost``."

msgid "Connect a disconnected graph."
msgstr "Conecte un grafo desconectado."

msgid "Create the complete graph topology"
msgstr "Crea la topología de un grafo completo"

msgid "Create one or more graphs based on the application to be developed."
msgstr "Crea uno o mas grafos según la aplicación que se desarrolla."

msgid "Create a contracted graph for the high speed roads"
msgstr "Crea un grafo contraído para calles de alta velocidad"

msgid "Create graphs per state/country"
msgstr "Crear grafos por estado/país"

msgid "In few words:"
msgstr "En pocas palabras:"

msgid "Prepare the graph"
msgstr "Prepara el grafo"

msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned."
msgstr "Qué y cómo preparar el grafo, dependerá de la aplicación y/o de la calidad de los datos y/o de lo cerca que esté la información de tener una topología utilizable por pgRouting y/o algunos otros factores no mencionados."

msgid "The steps to prepare the graph involve geometry operations using `PostGIS <https://postgis.net/>`__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph."
msgstr "Los pasos para preparar el grafo implican operaciones de geometría utilizando `PostGIS <https://postgis.net/>`__ y algunos otros implican operaciones de grafos como :doc:`pgr_contraction` para contraer un grafo."

msgid "The `workshop <https://workshop.pgrouting.org/latest>`__ has a step by step on how to prepare a graph using Open Street Map data, for a small application."
msgstr "El `taller <https://workshop.pgrouting.org/latest>`__ tiene un paso a paso sobre cómo preparar un grafo utilizando datos de Open Street Map, para una pequeña aplicación."

msgid "The use of indexes on the database design in general:"
msgstr "El uso de índices en el diseño de bases de datos en general:"

msgid "Have the geometries indexed."
msgstr "Tener las geometrías indexadas."

msgid "Have the identifiers columns indexed."
msgstr "Tener indexadas las columnas de identificadores."

msgid "Please consult the `PostgreSQL <https://www.postgresql.org/docs/>`__ documentation and the `PostGIS <https://postgis.net/>`__ documentation."
msgstr "Consultar la documentación de `PostgreSQL <https://www.postgresql.org/docs/>`__ y la documentación de `PostGIS <https://postgis.net/>`__."

msgid "Data coming from OSM and using `osm2pgrouting <https://github.com/pgRouting/osm2pgrouting>`__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop <https://workshop.pgrouting.org/latest/en/basic/data.html>`__."
msgstr "Los datos procedentes de OSM y utilizando ``osm2pgrouting <https://github.com/pgRouting/osm2pgrouting>`__ como herramienta de importación, vienen con la topología de ruteo. Ver un ejemplo de uso de ``osm2pgrouting`` en el `workshop <https://workshop.pgrouting.org/latest/en/basic/data.html>`__."

msgid "Adjust costs"
msgstr "Ajustar los costes"

msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry."
msgstr "Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el doble de la longitud de la geometría."

msgid "Update costs to length of geometry"
msgstr "Actualizar los costes a la longitud de la geometría"

msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:"
msgstr "Suponer que las columnas ``cost`` y ``reverse_cost`` de los datos de la muestra representan:"

msgid ":math:`1` when the edge exists in the graph"
msgstr ":math:`1` cuando la arista existe en el grafo"

msgid ":math:`-1` when the edge does not exist in the graph"
msgstr ":math:`-1` cuando la arista no existe en el grafo"

msgid "Using that information updating to the length of the geometries:"
msgstr "Utilizando esa información de actualización a la longitud de las geometrías:"

msgid "Which gives the following results:"
msgstr "Lo que da los siguientes resultados:"

msgid "Note that to be able to follow the documentation examples, everything is based on the original graph."
msgstr "Tener en cuenta que para poder seguir los ejemplos de la documentación, todo se basa en el grafo original."

msgid "Returning to the original data:"
msgstr "Volviendo a los datos originales:"

msgid "Update costs based on codes"
msgstr "Actualizar los costes en función de los códigos"

msgid "Other datasets, can have a column with values like"
msgstr "Otros conjuntos de datos, pueden tener una columna con valores como"

msgid "``FT`` vehicle flow on the direction of the geometry"
msgstr "``FT`` flujo de vehículos en la dirección de la geometría"

msgid "``TF`` vehicle flow opposite of the direction of the geometry"
msgstr "``TF`` flujo del vehículo opuesto a la dirección de la geometría"

msgid "``B`` vehicle flow on both directions"
msgstr "``B`` flujo de vehículos en ambas direcciones"

msgid "Preparing a code column for the example:"
msgstr "Preparar una columna de códigos para el ejemplo:"

msgid "Adjusting the costs based on the codes:"
msgstr "Ajuste de los costes en función de los códigos:"

msgid "Check the Routing Topology"
msgstr "Compruebe la Topología de Ruteo"

msgid "There are lots of possible problems in a graph."
msgstr "Hay muchos problemas posibles en un grafo."

msgid "The data used may not have been designed with routing in mind."
msgstr "Es posible que los datos utilizados no se hayan diseñado teniendo en cuenta el ruteo."

msgid "A graph has some very specific requirements."
msgstr "Un grafo tiene unos requisitos muy específicos."

msgid "The graph is disconnected."
msgstr "El grafo está desconectado."

msgid "There are unwanted intersections."
msgstr "Hay intersecciones no deseadas."

msgid "The graph is too large and needs to be contracted."
msgstr "El grafo es demasiado grande y hay que contraerlo."

msgid "A sub graph is needed for the application."
msgstr "Se necesita un subgrafo para la aplicación."

msgid "and many other problems that the pgRouting user, that is the application developer might encounter."
msgstr "y muchos otros problemas que el usuario de pgRouting, es decir, el desarrollador de aplicaciones, puede encontrar."

msgid "Crossing edges"
msgstr "Aristas que se cruzan"

msgid "To get the crossing edges:"
msgstr "Para obtener las aristas que se cruzan:"

msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road."
msgstr "Esa información es correcta, por ejemplo, cuando en términos de vehículos, es un túnel o puente cruczando sobre otra carretera."

msgid "It might be incorrect, for example:"
msgstr "Puede ser incorrecto, por ejemplo:"

msgid "When it is actually an intersection of roads, where vehicles can make turns."
msgstr "Cuando en realidad es una intersección de carreteras, donde los vehículos pueden hacer giros."

msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge."
msgstr "En cuanto a las líneas eléctricas, son capaces de cambiar de carretera incluso en un túnel o puente."

msgid "When it is incorrect, it needs fixing:"
msgstr "Cuando es incorrecta, hay que arreglarla:"

msgid "For vehicles and pedestrians"
msgstr "Para vehículos y peatones"

msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal <https://www.openstreetmap.org>`__ and the data imported again."
msgstr "Si los datos provienen de OSM y fueron importados a la base de datos utilizando ``osm2pgrouting``, la corrección debe hacerse en el `OSM portal <https://www.openstreetmap.org>`__ y los datos ser importados de nuevo."

msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier"
msgstr "En general, cuando los datos proceden de un proveedor que tiene los datos preparados para el ruteo de vehículos, y hay un problema, los datos deben ser fijados por el proveedor"

msgid "For very specific applications"
msgstr "Para aplicaciones muy específicas"

msgid "The data is correct when from the point of view of routing vehicles or pedestrians."
msgstr "Los datos son correctos desde el punto de vista de la circulación de vehículos o peatones."

msgid "The data needs a local fix for the specific application."
msgstr "Los datos necesitan un arreglo local para la aplicación específica."

msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split <https://postgis.net/docs/ST_Split.html>`__."
msgstr "Una vez analizados uno a uno los cruces, para los que necesitan un arreglo local, hay que `dividir las aristas <https://postgis.net/docs/ST_Split.html>`__."

msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated."
msgstr "Hay que añadir las nuevas aristas a la tabla de aristas, actualizar el resto de atributos en las nuevas aristas, eliminar las aristas antiguas y actualizar la topología de encaminamiento."

msgid "Fixing an intersection"
msgstr "Encontrando una intersección"

msgid "In this example the original edge table will be used to store the additional geometries."
msgstr ""

msgid "An example use without results"
msgstr ""

msgid "Routing from :math:`1` to :math:`18` gives no solution."
msgstr "La ruta de :math:`1` a :math:`18` no da ninguna solución."

msgid "Analyze the network for intersections."
msgstr ""

msgid "The analysis tell us that the network has an intersection."
msgstr "El análisis nos dice que la red tiene una intersección."

msgid "Prepare tables"
msgstr "Preparar tablas"

msgid "Additional columns to control the origin of the segments."
msgstr ""

msgid "Adding new segments."
msgstr "Añadiendo nuevos segmentos."

msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table."
msgstr ""

msgid "Update other values"
msgstr "Actualizar otros valores"

msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function."
msgstr "En este ejemplo sólo se actualizan ``cost`` y ``reverse_cost``, donde se basan en la longitud de la geometría y se mantiene la direccionalidad mediante la función ``sign``."

msgid "Update the topology"
msgstr "Actualizar la topología"

msgid "Insert the new vertices if any."
msgstr "Insertar nuevos vértices si existen."

msgid "Update source and target information on the edges table."
msgstr "Actualizar la salida y el destino en la tabla de aristas."

msgid "The example has results"
msgstr ""

msgid "Routing from :math:`1` to :math:`18` gives a solution."
msgstr "La ruta de :math:`1` a :math:`18` da una solución."

msgid "Touching edges"
msgstr "Bordes que se tocan"

msgid "Visually the edges seem to be connected, but internally they are not."
msgstr ""

msgid "The validity of the information is application dependent."
msgstr ""

msgid "Maybe there is a small barrier for vehicles but not for pedestrians."
msgstr ""

msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split <https://postgis.net/docs/ST_Split.html>`__."
msgstr "Una vez analizados uno a uno los toques, para los que necesiten un arreglo local, hay que separar las aristas con `split <https://postgis.net/docs/ST_Split.html>`__."

msgid "Fixing a gap"
msgstr ""

msgid "Routing from :math:`1` to :math:`2` gives no solution."
msgstr "La ruta de :math:`1` a :math:`2` no da ninguna solución."

msgid "Analyze the network for gaps."
msgstr "Analizar la red por espacios."

msgid "The analysis tell us that the network has a gap."
msgstr "El análisis nos dice que la red tiene una brecha."

msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table."
msgstr ""

msgid "Routing from :math:`1` to :math:`2` gives a solution."
msgstr "La ruta de :math:`1` a :math:`2` da una solución."

msgid "Connecting components"
msgstr "Conectando componentes"

msgid "To get the graph connectivity:"
msgstr "Para obtener la conectividad del grafo:"

msgid "There are three basic ways to connect components:"
msgstr "Existen tres formas básicas de conectar los componentes:"

msgid "From the vertex to the starting point of the edge"
msgstr "Del vértice al punto inicial de la arista"

msgid "From the vertex to the ending point of the edge"
msgstr "Desde el vértice hasta el punto final de la arista"

msgid "From the vertex to the closest vertex on the edge"
msgstr "Del vértice al vértice más cercano de la arista"

msgid "This solution requires the edge to be split."
msgstr "Esta solución requiere dividir el borde."

msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used."
msgstr ""

msgid "Get the connectivity"
msgstr "Obtener la conectividad"

msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely."
msgstr ""

msgid "Insert new edges"
msgstr "Insertar nuevas aristas"

msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table."
msgstr ""

msgid "Create the vertices table"
msgstr "Crear la tabla de vértices"

msgid "Using :doc:`pgr_extractVertices` create the table."
msgstr "Usar :doc:`pgr_extractVertices` para crear la tabla."

msgid "Contraction of a graph"
msgstr "Contracción de un grafo"

msgid "The graph can be reduced in size using :doc:`contraction-family`"
msgstr "El grafo puede reducirse de tamaño utilizando :doc:`contraction-family`"

msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned."
msgstr "El cuando contraer dependerá del tamaño del gráfico, de los tiempos de procesamiento, de la corrección de los datos, de la aplicación final o de cualquier otro factor no mencionado."

msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges."
msgstr "Un método bastante bueno para saber si la contracción puede ser útil es por el número de callejones sin salida y/o el número de aristas lineales."

msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`"
msgstr "En :doc:`contraction-family` se describe un método completo sobre cómo contraer y cómo utilizar el grafo contraído"

msgid "To get the dead ends:"
msgstr "Para obtener los callejones sin salida:"

msgid "A dead end happens when"
msgstr "Un callejón sin salida se produce cuando"

msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road."
msgstr "El vértice es el límite de un callejón sin salida, una vía de no paso o una vía de no salida."

msgid "The vertex is on the limit of the imported graph."
msgstr "El vértice esta en el limite del grafo importado."

msgid "If a larger graph is imported then the vertex might not be a dead end"
msgstr "Si se importa un grafo más grande, puede que el vértice no sea un callejón sin salida"

msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges."
msgstr "El nodo :math:`4`, es un callejón sin salida en la consulta, aunque visualmente parezca un punto final de 3 aristas."

msgid "Is node :math:`4` a dead end or not?"
msgstr "¿Es el nodo :math:`4` un callejón sin salida o no?"

msgid "The answer to that question will depend on the application."
msgstr "La respuesta a esta pregunta dependerá de la aplicación."

msgid "Is there such a small curb:"
msgstr "Hay un bordillo tan pequeño:"

msgid "That does not allow a vehicle to use that visual intersection?"
msgstr "¿Eso no permite a un vehículo utilizar esa intersección visual?"

msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?"
msgstr "¿Es la aplicación para peatones y por lo tanto el peatón puede caminar fácilmente en una acera pequeña?"

msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?"
msgstr "¿Es la aplicación para la electricidad y las líneas eléctricas que se puede extender fácilmente en la parte superior de la acera pequeña?"

msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?"
msgstr "¿Hay un gran acantilado y desde la vista de las águilas parece que el callejón sin salida está cerca del segmento?"

msgid "Depending on the answer, modification of the data might be needed."
msgstr "Dependiendo de la respuesta, será necesario la modificación de datos."

msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph."
msgstr "Cuando hay muchos callejones sin salida, para acelerar el procesamiento, se pueden utilizar las funciones de :doc:`contraction-family` para contraer el grafo."

msgid "Linear edges"
msgstr "Bordes lineales"

msgid "To get the linear edges:"
msgstr "Para obtener las aristas lineales:"

msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account."
msgstr "Estos vértices lineales son correctos, por ejemplo, cuando esos vértices son badenes, señales de alto y la aplicación los tiene en cuenta."

msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem."
msgstr "Cuando hay muchas aristas lineales, que no necesitan tomarse en cuenta, para acelerar el procesamiento se pueden utilizar las funciones :doc:`contraction-family` para contraer el grafo."

msgid "Function's structure"
msgstr "Estructura de la función"

msgid "Once the graph preparation work has been done above, it is time to use a"
msgstr "Una vez realizado el trabajo de preparación del grafo anterior, es el momento de utilizar un"

msgid "The general form of a pgRouting function call is:"
msgstr "La forma general de una llamada a una función de pgRouting es:"

msgid "\\ \\"
msgstr "\\ \\"

msgid "pgr_<name>(`Inner queries`_, **parameters**, [ ``Optional parameters``)"
msgstr "pgr_<nombre>(`Consultas internas`_, **parámetros**, [ ``Parámetros opcionales``)"

msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries."
msgstr "`Consultas internas`_: Son parámetros obligatorios que son ``TEXT`` que contienen consultas SQL."

msgid "**parameters**: Additional compulsory parameters needed by the function."
msgstr "**Parámetros**: Parámetros obligatorios adicionales que necesita la función."

msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted."
msgstr "``Parámetros opcionales``: Son parámetros **nombrados** no obligatorios que tienen un valor por defecto cuando se omiten."

msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters."
msgstr "Los parámetros obligatorios son parámetros de posición, los parámetros opcionales son parámetros nombrados."

msgid "For example, for this :doc:`pgr_dijkstra` signature:"
msgstr "Por ejemplo, para esta firma :doc:`pgr_dijkstra`:"

msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "`Edges SQL`_:"
msgstr "`SQL de aristas`_:"

msgid "Is the first parameter."
msgstr "Es el primer parámetro."

msgid "It is compulsory."
msgstr "Es obligatorio."

msgid "It is an inner query."
msgstr "Es una consulta interna."

msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used"
msgstr "No tiene nombre, por lo que **SQL de aristas** da una idea del tipo de consulta interna que hay que utilizar"

msgid "**start vid**:"
msgstr "**vid inical**:"

msgid "Is the second parameter."
msgstr "Es el segundo parámetro."

msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain."
msgstr "No tiene nombre, por lo que **salida** da una idea de lo que debe contener el valor del segundo parámetro."

msgid "Is the third parameter."
msgstr "Es el tercer parámetro."

msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain"
msgstr "No tiene nombre, por lo que **destino** da una idea de lo que debe contener el valor del tercer parámetro"

msgid "Is the fourth parameter."
msgstr "Es el cuarto parámetro."

msgid "It is optional."
msgstr "Es opcional."

msgid "It has a name."
msgstr "Tiene un nombre."

msgid "The full description of the parameters are found on the `Parameters`_ section of each function."
msgstr "La descripción completa de los parámetros se encuentra en la sección `Parámetros`_ de cada función."

msgid "Function's overloads"
msgstr "Sobrecargas de funciones"

msgid "A function might have different overloads. The most common are called:"
msgstr "Una función puede tener diferentes sobrecargas. Las más comunes se llaman:"

msgid "`One to One`_"
msgstr "`Uno a Uno`_"

msgid "`One to Many`_"
msgstr "`Uno a Muchos`_"

msgid "`Many to One`_"
msgstr "`Muchos a Uno`_"

msgid "`Many to Many`_"
msgstr "`Muchos a Muchos`_"

msgid "`Combinations`_"
msgstr "`Combinaciones`_"

msgid "Depending on the overload the parameters types change."
msgstr "Dependiendo de la sobrecarga, los tipos de los parámetros cambian."

msgid "**One**: **ANY-INTEGER**"
msgstr "**Uno**: **CUALQUIER-ENTERO**"

msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]"
msgstr "**Muchos**: ``ARRAY`` [**CUALQUIER-ENTERO**]"

msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same."
msgstr "Dependiendo de la función, las sobrecargas pueden variar. Pero el concepto de cambio de tipo de parámetro sigue siendo el mismo."

msgid "When routing from:"
msgstr "Cuando se rutea desde:"

msgid "From **one** starting vertex"
msgstr "Desde **un** vértice inicial"

msgid "to **one** ending vertex"
msgstr "al **un** vértice final"

msgid "to **many** ending vertices"
msgstr "a los vértices finales **many**"

msgid "From **many** starting vertices"
msgstr "Desde **muchos** vértices iniciales"

msgid "From **many** different starting vertices"
msgstr "A partir de **muchos** diferentes vértices de inicio"

msgid "to **many** different ending vertices"
msgstr "a **muchos** diferentes vértices finales"

msgid "Every tuple specifies a pair of a start vertex and an end vertex"
msgstr "Cada tupla especifica un par de vértices iniciales y un vértice final"

msgid "Users can define the combinations as desired."
msgstr "Los usuarios pueden definir las combinaciones como deseen."

msgid "Needs a `Combinations SQL`_"
msgstr "Necesita una `SQL de combinaciones`_"

msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used."
msgstr "Existen varios tipos de consultas internas válidas y también las columnas devueltas dependen de la función. El tipo de consulta interna dependerá de los requisitos de la función. Para simplificar la variedad de tipos, se utiliza **ANY-INTEGER** y **ANY-NUMERICAL**."

msgid "Edges SQL for"
msgstr "SQL de aristas para"

msgid "Some uncategorised functions"
msgstr "Algunas funciones no categorizadas"

msgid "General without ``id``"
msgstr "General sin ``id``"

msgid "General with (X,Y)"
msgstr "General con (X,Y)"

msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph."
msgstr "Cuando es negativo: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo."

msgid "Weight of the edge (``target``, ``source``),"
msgstr "Peso de la arista (``target``, ``source``),"

msgid "``x1``"
msgstr "``x1``"

msgid "X coordinate of ``source`` vertex."
msgstr "Coordenada X del vértice ``source``."

msgid "``y1``"
msgstr "``y1``"

msgid "Y coordinate of ``source`` vertex."
msgstr "Coordenada Y del vértice ``source``."

msgid "``x2``"
msgstr "``x2``"

msgid "X coordinate of ``target`` vertex."
msgstr "Coordenada X del vértice ``target``."

msgid "``y2``"
msgstr "``y2``"

msgid "Y coordinate of ``target`` vertex."
msgstr "Coordenada Y del vértice ``target``."

msgid "Flow"
msgstr "Flujo"

msgid "Edges SQL for :doc:`flow-family`"
msgstr "SQL de aristas para :doc:`flow-family`"

msgid "Edges SQL for the following functions of :doc:`flow-family`"
msgstr "SQL de aristas para las siguientes funciones de :doc:`flow-family`"

msgid "Used in combination signatures"
msgstr "Utilizado en combinación firmas"

msgid "Points SQL for"
msgstr "SQL de puntos para"

msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph."
msgstr "El parámetro principal de la mayoría de las funciones pgRouting es una consulta que selecciona las aristas del grafo."

msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional."
msgstr "Dependiendo de la familia o categoría de una función tendrá parámetros adicionales, algunos de ellos son obligatorios y otros opcionales."

msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value."
msgstr "Los parámetros obligatorios no tienen nombre y deben indicarse en el orden requerido. Los parámetros opcionales son parámetros con nombre y tendrán un valor por defecto."

msgid "Parameters for the Via functions"
msgstr "Párametros para las funciones Via"

msgid "SQL query as described."
msgstr "Consulta SQL como se describe."

msgid "When ``true`` Graph is considered `Directed`"
msgstr "Cuando ``true`` el gráfo se considera `Dirigido`"

msgid "When ``false`` the graph is considered as Undirected."
msgstr "Cuando ``false`` el gráfico se considera como No Dirigido."

msgid "``strict``"
msgstr "``strict``"

msgid "``false``"
msgstr "``false``"

msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**"
msgstr "Cuando ``true`` si un camino le faltan paradas y regresa **EMPTY SET**"

msgid "When ``false`` ignores missing paths returning all paths found"
msgstr "Cuando ``false``, ignora las rutas faltantes y devuelve todas las rutas encontradas"

msgid "``U_turn_on_edge``"
msgstr "``U_turn_on_edge``"

msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed."
msgstr "Cuando ``true`` saliendo de un vértice visitado no intentará evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se permite la vuelta en U usando la arista con el mismo identificador."

msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found."
msgstr "Cuando ``false`` al salir de un vértice visitado intenta evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se utiliza la vuelta en U utilizando la arista con el mismo identificador cuando no se encuentra ninguna otra ruta."

msgid "For the TRSP functions"
msgstr "Para las funciones de TRSP"

msgid "Array of identifiers of destination vertices."
msgstr "Arreglo de identificadores de vértices destino."

msgid "There are several kinds of columns returned are depending of the function."
msgstr "Hay varios tipos de columnas devueltas que dependen de la función."

msgid "Result columns for single path functions"
msgstr "Columnas de resultados para funciones de ruta única"

msgid "Used in functions that return one path solution per departure and destination."
msgstr "Se utiliza en funciones que devuelven solo una solución de ruta por salida y destino."

msgid ":doc:`pgr_dijkstraNear`"
msgstr ":doc:`pgr_dijkstraNear`"

msgid "Returns |short-generic-result|"
msgstr "Devuelve |short-generic-result|"

msgid "``path_seq``"
msgstr "``path_seq``"

msgid "Relative position in the path. Has value **1** for the beginning of a path."
msgstr "Posición relativa en la ruta. Tiene el valor **1** para el inicio de una ruta."

msgid "Identifier of the starting vertex of the current path."
msgstr "Identificador del vértice inicial de la ruta actual."

msgid "Identifier of the ending vertex of the current path."
msgstr "Identificador del vértice final de la ruta actual."

msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``."
msgstr "Identificador del nodo en la ruta de ``start_vid`` a ``end_vid``."

msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path."
msgstr "Identificador de la arista utilizado para ir del ``node`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta."

msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence."
msgstr "Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo en la secuencia de la ruta."

msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point."
msgstr "Cuando las columnas ``start_vid`` o ``end_vid`` tienen valores negativos, el identificador corresponde a un Punto."

msgid "Result columns for multiple paths functions"
msgstr "Columnas de resultados para funciones de rutas múltiples"

msgid "Used in functions that return many paths solutions per departure and destination."
msgstr "Se utiliza en funciones que devuelven muchas soluciones de rutas por salida y destino."

msgid ":doc:`pgr_KSP`"
msgstr ":doc:`pgr_KSP`"

msgid ":doc:`pgr_withPointsKSP`"
msgstr ":doc:`pgr_withPointsKSP`"

msgid "Returns set of |generic-result|"
msgstr "Regresa el conjunto de |generic-result|"

msgid "``path_id``"
msgstr "``path_id``"

msgid "Path identifier."
msgstr "Identificador del camino."

msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``."
msgstr "Tiene valor **1** para el primero de la ruta de ``start_vid`` a ``end_vid``."

msgid "Result columns for cost functions"
msgstr "Columnas de resultados de las funciones de costes"

msgid "Used by:"
msgstr "Utilizado por:"

msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point."
msgstr "Cuando las columnas del vértice inicial o del destino continen valores negativos, el identificador es para un Punto."

msgid "Result columns for flow functions"
msgstr "Columnas de resultados para funciones de flujo"

msgid "Result columns for spanning tree functions"
msgstr "Columnas de resultados para funciones de árbol de expansión"

msgid "Used in functions that return a tree solution per departure."
msgstr "Se utiliza en funciones que devuelven una solución de árbol por salida."

msgid "Result columns for simple spanning tree functions"
msgstr "Columnas de resultados para funciones de árbol de expansión simple"

msgid "Returns set of ``(edge, cost)``"
msgstr "Regresa el conjunto de ``(edge, cost)``"

msgid "Cost to traverse the edge."
msgstr "Coste para atravezar el borde."

msgid "Performance Tips"
msgstr "Consejos de Rendimiento"

msgid "For the Routing functions"
msgstr "Para las funciones de Ruteo"

msgid "To get faster results bound the queries to an area of interest of routing."
msgstr "Para obtener resultados más rápidos, delimitar las consultas a un área de interés para el ruteo."

msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results."
msgstr "En este ejemplo, usar una consulta SQL interna que no incluya algunas aristas en la función de ruteo y dentro del área de los resultados."

msgid "Given this area:"
msgstr "Dada esta área:"

msgid "Calculate a route:"
msgstr "Calcular una ruta:"

msgid "How to contribute"
msgstr "Cómo contribuir"

msgid "Wiki"
msgstr "Wiki"

msgid "Edit an existing `pgRouting Wiki <https://github.com/pgRouting/pgrouting/wiki>`__ page."
msgstr "Edita una página existente `Wiki de pgRouting <https://github.com/pgRouting/pgrouting/wiki>`_."

msgid "Or create a new Wiki page"
msgstr "O crea una nueva página Wiki"

msgid "Create a page on the `pgRouting Wiki <https://github.com/pgRouting/pgrouting/wiki>`__"
msgstr "Crear una página en el `Wiki de pgRouting <https://github.com/pgRouting/pgrouting/wiki>`_"

msgid "Give the title an appropriate name"
msgstr "Asigne al título un nombre apropiado"

msgid "`Example <https://github.com/pgRouting/pgrouting/wiki/How-to:-Handle-parallel-edges-(KSP)>`__"
msgstr "`Ejemplo <https://github.com/pgRouting/pgrouting/wiki/How-to:-Handle-parallel-edges-(KSP)>`__"

msgid "Adding Functionality to pgRouting"
msgstr "Agregando Funcionalidad a pgRouting"

msgid "Consult the `developer's documentation <https://docs.pgrouting.org/doxy/2.4/index.html>`__"
msgstr "Consultar la `documentation de desarrolladores <https://docs.pgrouting.org/doxygen/>`__"

msgid "Installation"
msgstr "Instalación"

msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki <https://github.com/pgRouting/pgrouting/wiki/Notes-on-Download%2C-Installation-and-building-pgRouting>`__"
msgstr "Las instrucciones para descargar e instalar los binarios para diferentes sistemas operativos, notas adicionales y correcciones no incluidas en esta documentación se pueden encontrar en `Installation wiki <https://github.com/pgRouting/pgrouting/wiki/Notes-on-Download%2C-Installation-and-building-pgRouting>`__"

msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide <https://www.postgis.us/presentations/postgis_install_guide_22.html>`__"
msgstr "Para utilizar pgRouting, PostGIS necesita ser instalado, por favor lea la información sobre la instalación en esta `Guía de Instalación <https://www.postgis.us/presentations/postgis_install_guide_22.html>`__"

msgid "Short Version"
msgstr "Versión corta"

msgid "Extracting the tar ball"
msgstr "Extraer la bola de alquitrán"

msgid "To compile assuming you have all the dependencies in your search path:"
msgstr "Para compilar suponiendo que tiene todas las dependencias en su ruta de búsqueda:"

msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in."
msgstr "Una vez que pgRouting está instalado, debe habilitarse en cada base de datos individual en la que desee utilizarlo."

msgid "Get the sources"
msgstr "Obtener las fuentes"

msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest"
msgstr "La última versión de pgRouting se puede encontrar en https://github.com/pgRouting/pgrouting/releases/latest"

msgid "To download this release:"
msgstr "Para descargar esta versión:"

msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting."
msgstr "Ir a :ref:`install-short` para más instrucciones sobre la extraccion de la bola tar y la compilación de pgRouting."

msgid "git"
msgstr "git"

msgid "To download the repository"
msgstr "Para descargar el repositorio"

msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)."
msgstr "Ir a :ref:`install-short` para más instrucciones sobre la compilación de pgRouting (no hay bola tar involucrada al descargar el repositorio pgRouting desde GitHub)."

msgid "Enabling and upgrading in the database"
msgstr "Habilitación y actualización en la base de datos"

msgid "Enabling the database"
msgstr "Habilitación de la base de datos"

msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database."
msgstr "pgRouting es una extensión de PostgreSQL y depende de PostGIS para proporcionar funcionalidades al usuario final. A continuación se muestra el código demuestra que permite PostGIS y pgRouting en la base de datos."

msgid "Checking PostGIS and pgRouting version after enabling them in the database."
msgstr "Comprobación de la versión de PostGIS y pgRouting después de habilitarlos en la base de datos."

msgid "Upgrading the database"
msgstr "Actualización de la base de datos"

msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:"
msgstr "Para actualizar pgRouting en la base de datos a la versión 4.1.0 utilice el siguiente comando:"

msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html"
msgstr "Puede hallar más información en https://www.postgresql.org/docs/current/sql-createextension.html"

msgid "Dependencies"
msgstr "Dependencias"

msgid "Compilation Dependencies"
msgstr "Dependencias de Compilación"

msgid "To be able to compile pgRouting, make sure that the following dependencies are met:"
msgstr "Para poder compilar pgRouting, asegúrese de que se cumplen las siguientes dependencias:"

msgid "C and C++0x compilers"
msgstr "Compiladores C y C++0x"

msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support"
msgstr "Compilar con Boost 1.56 hasta Boost 1.74 requiere un compilador C++ con soporte estandard para C++03 o C++11"

msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support"
msgstr "La compilación con Boost 1.75 requiere un compilador de C++ compatible con el estándar C++14"

msgid "Postgresql version >= 13"
msgstr "Postgresql version >= 13"

msgid "The Boost Graph Library (BGL) >= 1.56.0"
msgstr "La Librería de Grafos Boost (BGL) >= 1.56.0"

msgid "CMake >= 3.12"
msgstr "CMake >= 3.12"

msgid "For user's documentation"
msgstr "Para la documentación del usuario"

msgid "Sphinx >= 4.0"
msgstr "Sphinx >= 4.0"

msgid "For developer's documentation"
msgstr "Para la documentación del desarrollador"

msgid "Doxygen >= 1.7"
msgstr "Doxygen >= 1.7"

msgid "For testing"
msgstr "Para pruebas"

msgid "pgtap"
msgstr "pgtap"

msgid "pg_prove"
msgstr "pg_prove"

msgid "For using:"
msgstr "Para uso:"

msgid "PostGIS version >= 3.0.0"
msgstr "PostGIS versión >= 3.0.0"

msgid "Example: Installing dependencies on linux"
msgstr "Ejemplo: Instalación de dependencias en linux"

msgid "Installing the compilation dependencies"
msgstr "Instalación de las dependencias de compilación"

msgid "Build dependencies"
msgstr "Construir dependencias"

msgid "Optional dependencies"
msgstr "Dependencias opcionales"

msgid "For documentation"
msgstr "Para la documentación"

msgid "Configuring"
msgstr "Configuración"

msgid "pgRouting uses the `cmake` system to do the configuration."
msgstr "pgRouting utiliza el sistema 'cmake' para realizar la configuración."

msgid "Configurable variables"
msgstr "Variables configurables"

msgid "To see the variables that can be configured"
msgstr "Para ver las variables que se pueden configurar"

msgid "The build directory is different from the source directory"
msgstr "El directorio de compilación es diferente del directorio de origen"

msgid "Configuring The Documentation"
msgstr "Configurar la documentación"

msgid "User and developers documentation are not build if prerequisites are not found."
msgstr ""

msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:"
msgstr "La mayor parte del esfuerzo de la documentación ha estado en los archivos HTML. Algunas variables para construir la documentación:"

msgid "Variable"
msgstr "Variable"

msgid "Comment"
msgstr "Comentario"

msgid "BUILD_HTML"
msgstr "BUILD_HTML"

msgid "BOOL=ON"
msgstr "BOOL=ON"

msgid "If ON, turn on/off building HTML for user's documentation"
msgstr "Si está activado, active/desactive la creación de HTML para la documentación del usuario"

msgid "BUILD_DOXY"
msgstr "BUILD_DOXY"

msgid "If ON, turn on/off building HTML for developer's documentation"
msgstr "Si está activado, active o desactive la creación de HTML para la documentación del desarrollador"

msgid "BUILD_LATEX"
msgstr "BUILD_LATEX"

msgid "BOOL=OFF"
msgstr "BOOL=OFF"

msgid "If ON, turn on/off building PDF"
msgstr "Si está activado, active/desactive la creación de PDF"

msgid "BUILD_MAN"
msgstr "BUILD_MAN"

msgid "If ON, turn on/off building MAN pages"
msgstr "Si está activado, active/desactive las páginas MAN de construcción"

msgid "DOC_USE_BOOTSTRAP"
msgstr "DOC_USE_BOOTSTRAP"

msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation"
msgstr "Si está activado, utilice sphinx-bootstrap para las páginas HTML de la documentación de los usuarios"

msgid "EN"
msgstr ""

msgid "if OFF the English documentation will no be built"
msgstr "si está en OFF no se creará la documentación en inglés"

msgid "ES"
msgstr ""

msgid "if OFF the Spanish documentation will no be built"
msgstr "si OFF la documentación en español no se construirá"

msgid "SV"
msgstr ""

msgid "if OFF the Swedish documentation will no be built"
msgstr "si OFF la documentación en sueco no se construirá"

msgid "ZH_HANS"
msgstr ""

msgid "if OFF the Chinese simplified documentation will no be built"
msgstr ""

msgid "Building"
msgstr "Compilando"

msgid "Using ``make`` to build the code and the documentation"
msgstr "Uso de ``make`` para compilar el código y la documentación"

msgid "The following instructions start from ``path/to/pgrouting/build``"
msgstr "Las siguientes instrucciones parten de ``path/to/pgrouting/build``"

msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed."
msgstr "Hemos probado en varias plataformas, Para instalar o reinstalar todos los pasos son necesarios."

msgid "Linux"
msgstr "Linux"

msgid "The following instructions start from ``path/to/pgrouting``"
msgstr "Las siguientes instrucciones parten de ``path/to/pgrouting``"

msgid "Testing"
msgstr "Pruebas"

msgid "Currently there is no :code:`make test` and testing is done as follows"
msgstr "Actualmente no hay :code:`make test` y las pruebas se realizan de la siguiente manera"

msgid "pgRouting is an extension of `PostGIS <https://postgis.net>`__ and `PostgreSQL <https://www.postgresql.org>`__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp <https://camptocamp.com>`__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic <https://georepublic.info>`__, `Paragon Corporation <https://www.paragoncorporation.com/>`__ and a broad user community."
msgstr "pgRouting es una extensión de la base de datos geoespacial `PostGIS <https://postgis.net>`__ y `PostgreSQL <https://www.postgresql.org>`__ y agrega ruteo y otras funciones de análisis de redes. Un predecesor de pgRouting – pgDijkstra, escrito por Sylvain Pasche de `Camptocamp <https://camptocamp.com>`__, fue más tarde extendido por Orkney y renombrado a pgRouting. El proyecto ahora es apoyado y mantenido por Georepublic <https://georepublic.info>`__, `Paragon Corporation <https://www.paragoncorporation.com/>`__ y una amplia comunidad de usuarios."

msgid "pgRouting is part of `OSGeo Community Projects <https://wiki.osgeo.org/wiki/OSGeo_Community_Projects>`__ from the `OSGeo Foundation <https://www.osgeo.org>`__ and included on `OSGeoLive <http://live.osgeo.org/>`__."
msgstr "pgRouting es parte de la `Comunidad de Proyectos de OSGeo <https://wiki.osgeo.org/wiki/OSGeo_Community_Projects>` __ de la `Fundación OSGeo <https://www.osgeo.org>` __ y se incluye en`OSGeoLive <http://live.osgeo.org/>`__."

msgid "Licensing"
msgstr "Licencias"

msgid "The following licenses can be found in pgRouting:"
msgstr "Las siguientes licencias pueden ser encontradas en pgRouting:"

msgid "**License**"
msgstr "**Licencia**"

msgid "GNU General Public License v2.0 or later"
msgstr "Licencia Pública General GNU v2.0 o posterior"

msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later <https://spdx.org/licenses/GPL-2.0-or-later.html>`_."
msgstr "La mayoría de las características de pgRouting están disponibles en `Licencia Pública General v2.0 o posterior <https://spdx.org/licenses/GPL-2.0-or-later.html>`_."

msgid "Boost Software License - Version 1.0"
msgstr "Licencia de Software Boost - Version 1.0"

msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 <https://www.boost.org/LICENSE_1_0.txt>`_."
msgstr "Algunas extensiones de Boost están disponibles bajo `Boost Software License - Version 1.0 <https://www.boost.org/LICENSE_1_0.txt>`_."

msgid "MIT-X License"
msgstr "Licencia MIT-X"

msgid "Some code contributed by iMaptools.com is available under MIT-X license."
msgstr "Parte del código es contribución de iMaptools.com y está disponibe bajo la licencia MIT-X."

msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_."
msgstr "El Manual de pgRouting está disponible bajo una licencia `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_."

msgid "In general license information should be included in the header of each source file."
msgstr "En general, la información de las licencias debe estar incluida en la cabecera de cada archivo de origen."

msgid "Contributors"
msgstr "Colaboradores"

msgid "This Release Contributors"
msgstr "Colaboradores de esta Versión"

#, fuzzy
msgid "Individuals in this release |release| (in alphabetical order)"
msgstr "Personas en esta versión v4.0.0 (por orden alfabético)"

#, fuzzy
msgid "Mohit Rawat, Regina Obe, Vicky Vergara"
msgstr "Regina Obe, Vicky Vergara"

msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop."
msgstr "Y a toda la gente que nos regala un poco de su tiempo haciendo comentarios, encontrando problemas, haciendo pull requests etc. en cualquiera de nuestros productos: osm2pgrouting, pgRouting, pgRoutingLayer, workshop."

msgid "Translators (in alphabetical order)"
msgstr "Traductores (en orden alfabético)"

msgid "Chinese:"
msgstr ""

msgid "Dapeng Wang"
msgstr ""

msgid "Spanish:"
msgstr ""

msgid "Vicky Vergara"
msgstr "Vicky Vergara"

msgid "Swedish:"
msgstr ""

msgid "Daniel Nylander"
msgstr ""

msgid "Corporate Sponsors in this release (in alphabetical order)"
msgstr "Patrocinadores corporativos de este lanzamiento (en orden alfabético)"

msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:"
msgstr "Estas son las entidades corporativas que han contribuido con tiempo de desarrollo, alojamiento, o financiamiento monetario directo al proyecto de pgRouting:"

msgid "`OSGeo <https://www.osgeo.org>`__"
msgstr "`OSGeo <https://www.osgeo.org>`__"

msgid "`OSGeo UK <https://uk.osgeo.org>`__"
msgstr "`OSGeo UK <https://uk.osgeo.org>`__"

msgid "`Google Summer of Code <https://summerofcode.withgoogle.com>`__"
msgstr "`Google Summer of Code <https://summerofcode.withgoogle.com>`__"

msgid "`HighGo Software <https://www.highgo.com/>`__"
msgstr "`HighGo Software <https://www.highgo.com/>`__"

msgid "`Paragon Corporation <https://www.paragoncorporation.com/>`__"
msgstr "`Paragon Corporation <https://www.paragoncorporation.com/>`__"

msgid "Contributors Past & Present:"
msgstr "Colaboradores, Pasado y Presente:"

msgid "Individuals (in alphabetical order)"
msgstr "Personas (en orden alfabético)"

#, fuzzy
msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

msgid "Corporate Sponsors (in alphabetical order)"
msgstr "Patrocinadores corporativos (en orden alfabético)"

msgid "Camptocamp"
msgstr "Camptocamp"

msgid "CSIS (University of Tokyo)"
msgstr "CSIS (University of Tokyo)"

msgid "Georepublic"
msgstr "Georepublic"

msgid "Google Summer of Code"
msgstr "Google Summer of Code"

msgid "HighGo Software"
msgstr ""

msgid "iMaptools"
msgstr "iMaptools"

msgid "Leopark"
msgstr "Leopark"

msgid "Orkney"
msgstr "Orkney"

msgid "OSGeo"
msgstr "OSGeo"

msgid "OSGeo UK"
msgstr "OSGeo UK"

msgid "Paragon Corporation"
msgstr "Paragon Corporation"

msgid "Versaterm Inc."
msgstr "Versaterm Inc."

msgid "More Information"
msgstr "Más Información"

msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org."
msgstr "Lo último en software, documentación y noticias, se encuentra disponible en el sitio web de pgRouting https://pgrouting.org."

msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org."
msgstr "Servidor de base de datos PostgreSQL en el sitio principal de PostgreSQL https://www.postgresql.org."

msgid "PostGIS extension at the PostGIS project web site https://postgis.net."
msgstr "PostGIS extension en el sitio web del projecto PostGIS https://postgis.net."

msgid "Boost C++ source libraries at https://www.boost.org."
msgstr "Bibliotecas de código Boost C++ en https://www.boost.org."

msgid ":doc:`migration`"
msgstr ":doc:`migration`"

msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra."
msgstr "``pgr_KSP`` — Devuelve las K rutas más cortas usando Dijkstra ."

msgid "Availability"
msgstr "Disponibilidad"

msgid "Version 4.0.0"
msgstr "Versión 4.0.0"

msgid "Version 3.6.0"
msgstr "Versión 3.6.0"

msgid "Standardizing output columns to |nksp-result|"
msgstr "Estandarización de columnas de resultados a |nksp-result|"

msgid "pgr_ksp(One to One)"
msgstr "pgr_ksp(Uno a Uno)"

msgid "Added ``start_vid`` and ``end_vid`` result columns."
msgstr "Añadidas las columnas de resultados ``start_vid`` y ``end_vid``."

msgid "New proposed signatures:"
msgstr "Nuevas firmas propuestas:"

msgid "pgr_ksp(One to Many)"
msgstr "pgr_ksp(Uno a muchos)"

msgid "pgr_ksp(Many to One)"
msgstr "pgr_ksp(Muchos a uno)"

msgid "pgr_ksp(Many to Many)"
msgstr "pgr_ksp(Muchos a muchos)"

msgid "pgr_ksp(Combinations)"
msgstr "pgr_ksp(Combinaciones)"

msgid "Version 2.1.0"
msgstr "Versión 2.1.0"

msgid "Signature change"
msgstr "Cambio de firma"

msgid "Old signature no longer supported"
msgstr "Firma antigua ya no soportada"

msgid "Version 2.0.0"
msgstr "Versión 2.0.0"

msgid "Official function."
msgstr "Función oficial."

msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired."
msgstr "El algoritmo de ruteo para obtener la ruta más corta K basado en el algoritmo de Yen . \"K\" es el número de rutas más cortas deseadas."

msgid "|Boost| Boost Graph Inside"
msgstr "|Boost| Adentro: Boost Graph"

msgid "Boost Graph inside"
msgstr "Adentro: Boost Graph"

msgid "Signatures"
msgstr "Firmas"

msgid "Summary"
msgstr "Resumen"

msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])"
msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])"

msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])"
msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])"

msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])"
msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])"

msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])"
msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])"

msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])"
msgstr "pgr_KSP(`SQL de aristas`_, `SQL de combinaciones`_, **K**, [**opciones**])"

msgid "**options:** ``[directed, heap_paths]``"
msgstr "**opcionales:** ``[directed, heap_paths]``"

msgid "Returns set of |nksp-result|"
msgstr "Regresa conjunto de |nksp-result|"

msgid "OR EMPTY SET"
msgstr "O CONJUNTO VACÍO"

msgid "Example"
msgstr "Ejemplo"

msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph."
msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo dirigido."

msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph."
msgstr "Obtener 2 rutas del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido."

msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph."
msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido."

msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph."
msgstr "Obtener 2 rutas los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido."

msgid "Using a combinations table on an directed graph"
msgstr "Usando una tabla de combinaciones en un grafo dirigido"

msgid "The combinations table:"
msgstr "La tabla de combinaciones:"

msgid "The query:"
msgstr "La consulta:"

msgid "Identifier of the destination vertex."
msgstr "Identificador del vértice destino."

msgid "**K**"
msgstr "**K**"

msgid "Number of required paths."
msgstr "Cantidad de rutas requeridas."

msgid "KSP Optional parameters"
msgstr "Parámetros opcionales de KSP"

msgid "``heap_paths``"
msgstr "``heap_paths``"

msgid "When ``false`` Returns at most K paths."
msgstr "Cuando ``false`` Regresa a lo más K caminos."

msgid "When ``true`` all the calculated paths while processing are returned."
msgstr "Cuando ``true`` se regresan todos los caminos calulados mientras se procesa."

msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``."
msgstr "Aproximadamente, si la ruta más corta tiene ``N`` aristas, las procesadas contendrán aproximadamente ``N * K`` rutas para valores pequeños de ``K`` y ``K > 5``."

msgid "Additional Examples"
msgstr "Ejemplos Adicionales"

msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph"
msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo no dirigido"

msgid "Also get the paths in the heap."
msgstr "También obtener los caminos procesados."

msgid "Get 2 paths using combinations table on an undirected graph"
msgstr "Obtener dos rutas usando una tabla de combinaciones en un grafo no dirigido"

msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph."
msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo no dirigido."

msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing"
msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing"

msgid "``pgr_TSP``"
msgstr "``pgr_TSP``"

msgid "``pgr_TSP`` - Approximation using *metric* algorithm."
msgstr "``pgr_TSP`` - Aproximación usando el algoritmo *métrico*."

msgid "Availability:"
msgstr "Disponibilidad:"

msgid "Version 3.2.1"
msgstr "Versión 3.2.1"

msgid "Metric Algorithm from `Boost library <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
msgstr "Algoritmo Metrico de la `Librería Boost <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"

msgid "Simulated Annealing Algorithm no longer supported"
msgstr "El algoritmo de recocido simulado ya no es utilizado"

msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`"
msgstr "Se ignoran los parámetros relacionados con el algoritmo de recocido simulado: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`"

msgid "Version 2.3.0"
msgstr "Versión 2.3.0"

msgid "Results change depending on input order of the `Matrix SQL`_"
msgstr ""

msgid "Negative costs are ignored."
msgstr "Costos negativos son ignorados."

msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`."
msgstr "Se puede utilizar con funciones :doc:`costMatrix-category` preferiblemente con `directed => false`."

msgid "With ``directed => false``"
msgstr "Con ``directed => false``"

msgid "Will generate a graph that:"
msgstr "Generará un grafo que:"

msgid "is undirected"
msgstr "es no dirigido"

msgid "is fully connected (As long as the graph has one component)"
msgstr "está completamente conectado (siempre que el grafo tenga un componente)"

msgid "all traveling costs on edges obey the triangle inequality."
msgstr "todos los costos de viaje en los segmentos vumplen con la desigualdad del triángulo."

msgid "When ``start_vid = 0 OR end_vid = 0``"
msgstr "Cuando ``start_vid = 0 Ó end_vid = 0``"

msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*"
msgstr "Se garantiza que las soluciones generadas sean *en el peor de los casos el doble de largas que el recorrido óptimo*"

msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``"
msgstr "Cuando ``start_vid != 0 Y end_vid != 0 Y start_vid != end_vid``"

msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position."
msgstr "No está **garantizado** que la solución sea, en el peor de los casos, el doble de larga que el recorrido óptimo, debido a que `end_vid` está forzado a estar en una posición fija."

msgid "With ``directed => true``"
msgstr "Con ``directed => true``"

msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour"
msgstr "No está **garantizado** que la solución sea, en el peor de los casos, dos veces más larga que el recorrido óptimo"

msgid "is directed"
msgstr "es dirigido"

msgid "some (or all) traveling costs on edges might not obey the triangle inequality."
msgstr "algunos (o todos) los costos de viaje en los segmentos podrían no obedecer a la desigualdad del triángulo."

msgid "As an undirected graph is required, the directed graph is transformed as follows:"
msgstr "Como se requiere un grafo no dirigido, el grafo dirigido se transforma de la siguiente manera:"

msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`"
msgstr "los segmentos `(u, v)` y `(v, u)` se consideran el mismo segmentos (denotado `(u, v)`"

msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`"
msgstr "Si '``agg_cost`` difiere entre una o más instancias del segmento `(u, v)`"

msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`"
msgstr "El valor mínimo de ``agg_cost`` en todas las instancias de la arista `(u, v)` se considera como el ``agg_cost`` de la arista `(u, v)`"

msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality."
msgstr "Algunos (o todos) los costos de viaje en los segmentos aún podrían no obedecer a la desigualdad del triángulo."

msgid "When the data does not come from an undirected graph or its not fully connected:"
msgstr ""

msgid "Missing values will be calculated with dijkstra algorithm."
msgstr "Los valores perdidos se calcularán con el algoritmo de Dijkstra."

msgid "When the graph has more than one component:"
msgstr "Cuando el grafo tiene más de un componente:"

msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component."
msgstr ""

msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated."
msgstr ""

msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component."
msgstr ""

msgid "One cycle attempt to remove crossing edges is done to the TSP results."
msgstr ""

msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)"
msgstr "pgr_TSP(`SQL de martiz`_, ``[start_id, end_id]``)"

msgid "Returns set of |tsp-result|"
msgstr "Regresa el conjunto de |nksp-result|"

msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information"
msgstr "Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la matriz"

msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected."
msgstr "**Línea 5** Los vértices :math:`\\{2, 4, 13, 14\\}` no están incluidos porque no están conectados."

msgid "`Matrix SQL`_ as described below"
msgstr "`SQL de matriz`_ como se describe más adelante"

msgid "``ANY-INTEGER``"
msgstr "``ANY-INTEGER``"

msgid "``ANY-NUMERICAL``"
msgstr "``ANY-NUMERICAL``"

msgid "Cost for going from start_vid to end_vid"
msgstr "Costo para pasar de start_vid a end_vid"

msgid "Returns SET OF ``(seq, node, cost, agg_cost)``"
msgstr "Devuelve el CONJUNTO DE ``(seq, node, cost, agg_cost)``"

msgid "Row sequence."
msgstr "Secuencia de filas."

msgid "**node**"
msgstr "**node**"

msgid "Identifier of the node/coordinate/point."
msgstr "Identificador del nodo/coordenada/punto."

msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence."
msgstr "Coste que se debe recorrer desde el ``nodo`` al siguiente ``nodo`` en la secuencia de ruta."

msgid "``0`` for the last row in the tour sequence."
msgstr "``0`` para la última fila en la secuencia del recorrido."

msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node."
msgstr "Costo agregado del ``nodo`` en ``seq = 1`` hacia el nodo actual."

msgid "``0`` for the first row in the tour sequence."
msgstr "``0`` para la primera fila en la secuencia del recorrido."

msgid "Start from vertex :math:`1`"
msgstr "Inicio en el vértice :math:`1`"

msgid "**Line 6** ``start_vid => 1``"
msgstr "**Linea 6** ``start_vid => 1``"

msgid "Using points of interest to generate an asymmetric matrix."
msgstr "Usar los puntos de interés para generar una matriz asimétrica."

msgid "To generate an asymmetric matrix:"
msgstr "Para generar una matriz asimétrica:"

msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query"
msgstr "**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no incluirla en la consulta"

msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``"
msgstr "**Línea 6** Generación de una matriz asimétrica con ``directed => true``"

msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``"
msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` se considera como el ``agg_cost``"

msgid "The solution that can be larger than *twice as long as the optimal tour* because:"
msgstr "La solución que puede ser mayor que *el doble de larga que el tour óptimo* porque:"

msgid "Triangle inequality might not be satisfied."
msgstr "La desigualdad del triángulo podría no estar satisfecha."

msgid "``start_id != 0 AND end_id != 0``"
msgstr "``start_id != 0 Y end_id != 0``"

msgid "Connected incomplete data"
msgstr "Datos incompletos conectados"

msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete."
msgstr "Usando aristas seleccionadas :math:`\\{2, 4, 5, 8, 9, 15\\}` la matriz no es completa."

msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`."
msgstr "Valor del cost para :math:`17 \\rightarrow 10` no existe en la matriz, pero el valor se toma de :math:`10 \\rightarrow 17`."

msgid "``pgr_TSPeuclidean``"
msgstr "``pgr_TSPeuclidean``"

msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm."
msgstr "``pgr_TSPeuclidean`` - Aproximación usando el algoritmo *métrico*."

msgid "Using `Boost: metric TSP approx <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
msgstr "Usando `Boost: Algoritmo de aproximación Métrica de TSP <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"

msgid "Name change from pgr_eucledianTSP"
msgstr "Cambio de nombre de pgr_eucledianTSP"

msgid "New official function."
msgstr "Nueva función oficial."

msgid "Results change depending on input order of the `Coordinates SQL`_"
msgstr ""

msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily."
msgstr "Cualquier identificador duplicado será ignorado. Las coordenadas que se mantendrán son arbitrarias."

msgid "The coordinates are quite similar for the same identifier, for example ::"
msgstr "Las coordenadas son bastante similares para el mismo identificador, por ejemplo:"

msgid "The coordinates are quite different for the same identifier, for example ::"
msgstr "Las coordenadas son bastante diferentes para el mismo identificador, por ejemplo:"

msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)"
msgstr "pgr_TSPeuclidean(`SQL de Coordenadas`_, ``[start_id, end_id]``)"

msgid "With default values"
msgstr "Con valores predeterminados"

msgid "`Coordinates SQL`_"
msgstr "`SQL coordenadas`_"

msgid "`Coordinates SQL`_ as described below"
msgstr "`SQL de coordenadas`_ descritas más adelante"

msgid "Coordinates SQL"
msgstr "Coordenadas SQL"

msgid "``x``"
msgstr "``x``"

msgid "X value of the coordinate."
msgstr "Valor X de la coordenada."

msgid "``y``"
msgstr "``y``"

msgid "Y value of the coordinate."
msgstr "Valor Y de la coordenada."

msgid "Test 29 cities of Western Sahara"
msgstr "Prueba 29 ciudades del Sáhara Occidental"

msgid "This example shows how to make performance tests using University of Waterloo's `example data <https://www.math.uwaterloo.ca/tsp/world/countries.html>`__ using the 29 cities of `Western Sahara dataset <https://www.math.uwaterloo.ca/tsp/world/wi29.tsp>`__"
msgstr "Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los `datos de ejemplo <https://www.math.uwaterloo.ca/tsp/world/countries.html>`__ de la Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades del `Sáhara Occidental <https://www.math.uwaterloo.ca/tsp/world/wi29.tsp>`__"

msgid "Creating a table for the data and storing the data"
msgstr "Creación de una tabla para datos y almacenamiento de los datos"

msgid "Adding a geometry (for visual purposes)"
msgstr "Agregar una geometría (con fines visuales)"

msgid "Total tour cost"
msgstr "Costo total del tour"

msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset"
msgstr "Al obtener un costo total del recorrido, comparar el valor con la duración de un recorrido óptimo, que es 27603, dado en el conjunto de datos"

msgid "Getting a geometry of the tour"
msgstr "Obtener una geometría del recorrido"

msgid "Visual results"
msgstr "Resultados visuales"

msgid "Visually, The first image is the `optimal solution <https://www.math.uwaterloo.ca/tsp/world/witour.html>`__ and the second image is the solution obtained with ``pgr_TSPeuclidean``."
msgstr "Visualmente, la primera imagen es la `solución óptima <https://www.math.uwaterloo.ca/tsp/world/witour.html>`__ y la segunda imagen es la solución obtenida con ``pgr_TSPeuclidean``."

msgid "``pgr_aStar`` — Shortest path using the A* algorithm."
msgstr "``pgr_aStar`` — La ruta más corta utilizando el algoritmo A*."

msgid "Standardizing output columns to |short-generic-result|"
msgstr "Estandarización de las columnas de salida a |short-generic-result|"

msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns."
msgstr "pgr_aStar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``."

msgid "pgr_aStar(One to Many) added ``end_vid`` column."
msgstr "pgr_aStar(Uno a Muchos) ha añadido la columna ``end_vid``."

msgid "pgr_aStar(Many to One) added ``start_vid`` column."
msgstr "pgr_aStar(Muchos a Uno) ha añadido la columna ``start_vid``."

msgid "New proposed signature:"
msgstr "Nuevas firmas propuesta:"

msgid "pgr_aStar(Combinations)"
msgstr "pgr_aStar(Combinaciones)"

msgid "Version 2.4.0"
msgstr "Versión 2.4.0"

msgid "pgr_aStar(One to Many)"
msgstr "pgr_aStar(Uno a Muchos)"

msgid "pgr_aStar(Many to One)"
msgstr "pgr_aStar(Muchos a Uno)"

msgid "pgr_aStar(Many to Many)"
msgstr "pgr_aStar(Muchos a Muchos)"

msgid "Signature change on pgr_aStar(One to One)"
msgstr "Cambio de firma en pgr_aStar(Uno a Uno)"

msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:"
msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_aStar( `Uno a Uno`_ ) en:"

msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])"

msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])"

msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])"

msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])"

msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_aStar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])"

msgid "**options:** ``[directed, heuristic, factor, epsilon]``"
msgstr "**opcionales:** ``[directed, heuristic, factor, epsilon]``"

msgid "Returns set of |short-generic-result|"
msgstr "Regresa el conjunto de |short-generic-result|"

msgid "Optional parameters are `named parameters` and have a default value."
msgstr "Los parámetros opcionales son `parámetros con nombre` y tienen un valor predeterminado."

msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`"
msgstr "De vértice :math:`6` a vértice :math:`12` en un grafo **dirigido** usando la heurística :math:`2`"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`"
msgstr "Desde el vértice :math:`6` a los vértices :math:`\\{12, 10\\}` en un grafo **dirigido** usando la heurística :math:`3` con factor :math:`3.5`"

msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`"
msgstr "De los vértices :math:`\\{6, 8\\}` al vértice :math:`10` en un grafo **no dirigido** usando la heurística :math:`4`"

msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`"
msgstr "De los vértices :math:`\\{6, 8\\}` a los vértices :math:`\\{10, 12\\}` en un gráfico **dirigido** con factor :math:`0.5`"

msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`."
msgstr "Usando una tabla de combinaciones en un grafo **dirigido** con factor :math:`0.5`."

msgid "Example 1"
msgstr "Ejemplo 1"

msgid "Demonstration of repeated values are ignored, and result is sorted."
msgstr "Demostración de ignorar los valores repertidos, y resultado ordenado."

msgid "Example 2"
msgstr "Ejemplo 2"

msgid "Making **start vids** the same as **end vids**."
msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**."

msgid "Example 3"
msgstr "Ejemplo 3"

msgid "Manually assigned vertex combinations."
msgstr "Manualmente asignar combinaciones de vértices."

msgid "``pgr_aStarCost``"
msgstr "``pgr_aStarCost``"

msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm."
msgstr "``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo A*."

msgid "pgr_aStarCost(Combinations)"
msgstr "pgr_aStarCost(Combinaciones)"

msgid "New proposed function."
msgstr "Nueva función propuesta."

msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm."
msgstr "La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando el algoritmo A*."

msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`"
msgstr "Sea el caso de que los resultados se almacenen en una tabla, el índice unico lo conformarían el par `(start_vid, end_vid)`"

msgid "For undirected graphs, the results are symmetric."
msgstr "Para grafos no dirigidos, los resultados son simétricos."

msgid "The returned values are ordered in ascending order:"
msgstr "Loas valores regresandos son ordenados en orden ascendente:"

msgid "`start_vid` ascending"
msgstr "`start_vid` ascendente"

msgid "`end_vid` ascending"
msgstr "`end_vid` ascendente"

msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])"

msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])"

msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])"

msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])"

msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_aStarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])"

msgid "Returns set of |matrix-result|"
msgstr "Regresa el conjunto de |matrix-result|"

msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])"
msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [opciones])"

msgid "``pgr_aStarCostMatrix``"
msgstr "``pgr_aStarCostMatrix``"

msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`."
msgstr "``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_aStar`."

msgid "Using internally the :doc:`pgr_aStar` algorithm"
msgstr "Uso interno del algoritmo :doc:`pgr_aStar`"

msgid "Returns a cost matrix."
msgstr "Devuelve una matriz de costes."

msgid "No ordering is performed"
msgstr "No se realiza ningún pedido"

msgid "let `v` and `u` are nodes on the graph:"
msgstr "Sean `v` y `u` nodos en el grafo:"

msgid "when there is no path from `v` to `u`:"
msgstr "cuando no hay ruta de `v` a `u`:"

msgid "cost from `v` to `u` is :math:`\\inf`"
msgstr "costo de `v` a `u` es :math:`\\inf`"

msgid "when :math:`v = u` then"
msgstr "cuando :math:`v = u` entonces"

msgid "cost from `v` to `u` is :math:`0`"
msgstr "costo de `v` a `u` es :math:`0`"

msgid "When the graph is **undirected** the cost matrix is symmetric"
msgstr "Cuando el grafo es **no dirigido**, la matriz de costes es simétrica"

msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
msgstr "pgr_aStarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])"

msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`"
msgstr "Matriz simétrica de costes para los vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido** usando la heurística :math:`2`"

msgid "Use with :doc:`pgr_TSP`"
msgstr "Uso con :doc:`pgr_TSP`"

msgid "``pgr_articulationPoints``"
msgstr "``pgr_articulationPoints``"

msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph."
msgstr "``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo no dirigido."

msgid "Result columns change: ``seq`` is removed"
msgstr "Cambio de columnas de resultados: ``seq`` se elimina"

msgid "Version 2.5.0"
msgstr "Versión 2.5.0"

msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph."
msgstr "Los vértices que pertenecen a más de un componente biconectado se denominan puntos de articulación o, equivalentemente, corte de vértices. Los puntos de articulación son vértices cuya eliminación aumentaría el número de componentes conectados en el grafo. Esta implementación solo se puede utilizar con un grafo no dirigido."

msgid "Works for **undirected** graphs."
msgstr "Funciona para grafos **no dirigidos**."

msgid "``node`` ascending"
msgstr "``node`` ascendente"

msgid "Running time: :math:`O(V + E)`"
msgstr "Tiempo de ejecución: :math:`O(V + E)`"

msgid "pgr_articulationPoints(`Edges SQL`_)"
msgstr "pgr_articulationPoints(`SQL de aristas`_)"

msgid "Returns set of |result-node|"
msgstr "Regresa conjunto de |result-node|"

msgid "The articulation points of the graph"
msgstr "Los puntos de articulación del grafo"

msgid "Nodes in red are the articulation points."
msgstr "Nodos en rojo son los puntos de articulación."

msgid "Identifier of the vertex."
msgstr "Identificador del vértice."

msgid "`Boost: Biconnected components & articulation points <https://www.boost.org/libs/graph/doc/biconnected_components.html>`__"
msgstr "`Boost: Componentes biconectados y puntos de articulación <https://www.boost.org/libs/graph/doc/biconnected_components.html>`__"

msgid "wikipedia: `Biconnected component <https://en.wikipedia.org/wiki/Biconnected_component>`__"
msgstr "wikipedia: `Componentes biconnectados <https://en.wikipedia.org/wiki/Biconnected_component>`__"

msgid "``pgr_bandwidth`` - Experimental"
msgstr "``pgr_bandwidth`` - Experimental"

msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph"
msgstr ""

msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)."
msgstr ""

msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects"
msgstr ""

msgid "The bandwidth is the maximum of all these distances"
msgstr ""

msgid "The implementation is for undirected graphs"
msgstr "La implementación es para grafos no dirigidos"

msgid "Run time is 0.160789 seconds"
msgstr ""

msgid "pgr_bandwidth(`Edges SQL`_)"
msgstr "pgr_bandwidth(`SQL de aristas`_)"

msgid "Returns ``BIGINT``"
msgstr "Devuelve ``BIGINT``"

msgid "For an undirected graph with edges."
msgstr "Para un grafo no dirigido con aristas."

msgid "Returns a bigint ``(pgr_bandwidth)``"
msgstr "Devuelve un bigint ``(pgr_bandwidth)``"

msgid "``pgr_bandwidth``"
msgstr "``pgr_bandwidth``"

msgid "gives the bandwidth of the graph."
msgstr "da el ancho de banda del grafo."

msgid "Undirected graph with edges before optimization."
msgstr "Grafo no dirigido con aristas antes de la optimización."

msgid "Undirected graph with edges after optimization."
msgstr "Grafo no dirigido con aristas tras la optimización."

msgid "`Boost: bandwidth <https://www.boost.org/libs/graph/doc/bandwidth.html>`_"
msgstr "`Boost: bandwidth <https://www.boost.org/libs/graph/doc/bandwidth.html>`_"

msgid "``pgr_bdAstar``"
msgstr "``pgr_bdAstar``"

msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm."
msgstr "``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo Bidireccional A*."

msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns."
msgstr "pgr_bdAstar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``."

msgid "pgr_bdAstar(One to Many) added ``end_vid`` column."
msgstr "pgr_bdAstar(Uno a Muchos) ha añadido la columna ``end_vid``."

msgid "pgr_bdAstar(Many to One) added ``start_vid`` column."
msgstr "pgr_bdAstar(Muchos a Uno) ha añadido la columna ``start_vid``."

msgid "pgr_bdAstar(Combinations)"
msgstr "pgr_bdAstar(Combinaciones)"

msgid "pgr_bdAstar(One to Many)"
msgstr "pgr_bdAstar(Uno a Muchos)"

msgid "pgr_bdAstar(Many to One)"
msgstr "pgr_bdAstar(Muchos a Uno)"

msgid "pgr_bdAstar(Many to Many)"
msgstr "pgr_bdAstar(Muchos a Muchos)"

msgid "Signature change on pgr_bdAstar(One to One)"
msgstr "Cambio de firma en pgr_bdAstar(Uno a Uno)"

msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:"
msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_bdAStar(Uno a Uno) en el:"

msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])"

msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])"

msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])"

msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])"

msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])"

msgid "``pgr_bdAstarCost``"
msgstr "``pgr_bdAstarCost``"

msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm."
msgstr "``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el algoritmo bidireccional A*."

msgid "pgr_bdAstarCost(Combinations)"
msgstr "pgr_bdAstarCost(Combinaciones)"

msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm."
msgstr "La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando el algoritmo bidireccional A*."

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])"

msgid "``pgr_bdAstarCostMatrix``"
msgstr "``pgr_bdAstarCostMatrix``"

msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`."
msgstr "``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdAstar`."

msgid "Internally uses the :doc:`pgr_bdAstar` algorithm."
msgstr "Internamente utiliza el algoritmo :doc:`pgr_bdAstar`."

msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])"

msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm."
msgstr "``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo Bidireccional de Dijkstra."

msgid "pgr_bdDijkstra(Combinations)"
msgstr "pgr_bdDijkstra(Combinaciones)"

msgid "pgr_bdDijkstra(One to Many)"
msgstr "pgr_bdDijkstra(Uno a Muchos)"

msgid "pgr_bdDijkstra(Many to One)"
msgstr "pgr_bdDijkstra(Muchos a Uno)"

msgid "pgr_bdDijkstra(Many to Many)"
msgstr "pgr_bdDijkstra(Muchos a Muchos)"

msgid "Signature change on pgr_bdDijkstra(One to One)"
msgstr "Cambio de firma en pgr_bdDijsktra(Uno a Uno)"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph"
msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo **dirigido**"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph"
msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **dirigido**"

msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph"
msgstr "De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo **dirigido**"

msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph"
msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**"

msgid "Using a combinations table on an **undirected** graph"
msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**"

msgid "https://en.wikipedia.org/wiki/Bidirectional_search"
msgstr "https://en.wikipedia.org/wiki/Bidirectional_search"

msgid "``pgr_bdDijkstraCost``"
msgstr "``pgr_bdDijkstraCost``"

msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm."
msgstr "``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando el algoritmo Bidireccional de Dijkstra."

msgid "pgr_bdDijkstraCost(Combinations)"
msgstr "pgr_bdDijkstraCost(Combinaciones)"

msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm."
msgstr "La función ``pgr_bdDijkstraCost`` suma el costo de la ruta más corta utilizando el algoritmo de bidirecional de Dijkstra."

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])"
msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])"
msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])"
msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [ ``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "``pgr_bdDijkstraCostMatrix``"
msgstr "``pgr_bdDijkstraCostMatrix``"

msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`."
msgstr "``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdDijkstra`."

msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix."
msgstr "Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una matriz de costos."

msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])"
msgstr "pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])"

msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph"
msgstr "Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido**"

msgid "Use with :doc:`pgr_TSP`."
msgstr "Usar con :doc:`pgr_TSP`."

msgid "``pgr_bellmanFord`` - Experimental"
msgstr "``pgr_bellmanFord`` - Experimental"

msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm."
msgstr "``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-Ford."

msgid "pgr_bellmanFord(Combinations)"
msgstr "pgr_bellmanFord(Combinaciones)"

msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph."
msgstr "El algoritmo de Bellman-Ford, lleva el nombre de Richard Bellman y Lester Ford, quienes lo publicaron por primera vez en 1958 y 1956, respectivamente. Es un algoritmo de búsqueda de grafos que calcula las rutas más cortas desde un vértice inicial (``start_vid``) hasta un vértice final (``end_vid``) en un grafo donde algunos de los pesos de borde pueden ser números negativos. Aunque es más versátil, es más lento que el algoritmo de Dijkstra/ Esta implementación se puede utilizar con un grafo dirigido y un grafo no dirigido."

msgid "Process is valid for edges with both positive and negative edge weights."
msgstr "El proceso es válido para aristas con grosores de arista positivos y negativos."

msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`."
msgstr "Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El agg_cost sería :math:`0`."

msgid "When the start vertex and the end vertex are different, and there exists a path between them without having a *negative cycle*. The agg_cost would be some finite value denoting the shortest distance between them."
msgstr "Cuando el vértice inicial y el vértice final son diferentes, y existe una ruta entre ellos sin tener un *ciclo negativo*. El agg_cost sería un valor finito que indica la distancia más corta entre ellos."

msgid "When the start vertex and the end vertex are different, and there exists a path between them, but it contains a *negative cycle*. In such case, agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost can’t be defined for them."
msgstr "Cuando el vértice inicial y el vértice final son diferentes y existe una ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se puede definir para ellos."

msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`."
msgstr "Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. El agg_cost es :math:`\\infty`."

msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored."
msgstr "Para fines de optimización, se ignora cualquier valor duplicado en `start_vids` o `end_vids`."

msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`"
msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph"
msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido"

msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph"
msgstr "De los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido"

msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph"
msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo no dirigido"

msgid "Using a combinations table on an undirected graph"
msgstr "Usando una tabla de combinaciones en un grafo no dirigido"

msgid "`Boost: Bellman Ford <https://www.boost.org/libs/graph/doc/bellman_ford_shortest.html>`__"
msgstr "`Boost: Bellman Ford <https://www.boost.org/libs/graph/doc/bellman_ford_shortest.html>`__"

msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"

msgid "``pgr_betweennessCentrality`` - Experimental"
msgstr "``pgr_betweennessCentrality`` - Experimental"

msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm"
msgstr "``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes"

msgid "Version 3.7.0"
msgstr "Versión 3.7.0"

msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices."
msgstr "El algoritmo Brandes aprovecha los grafos dispersos para evaluar la puntuación de centralidad intermedia de todos los vértices."

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 "La centralidad de interrelación mide hasta qué punto un vértice se encuentra en las rutas más cortas entre todos los demás pares de vértices. Los vértices con una alta centralidad entre pares pueden tener una influencia considerable en una red gracias a su control sobre los caminos más cortos que pasan entre ellos."

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 "La eliminación de estos vértices afectará a la red al perturbarla, ya que la mayoría de los caminos más cortos entre vértices pasan por ellos."

msgid "This implementation work for both directed and undirected graphs."
msgstr "Esta implementación funciona tanto para grafos dirigidos como no dirigidos."

msgid "Running time:  :math:`\\Theta(VE)`"
msgstr "Tiempo de ejecución: :math:`\\Theta(VE)`"

msgid "Running space: :math:`\\Theta(VE)`"
msgstr "Espacio de ejecución: :math:`\\Theta(VE)`"

msgid "Throws when there are no edges in the graph"
msgstr "Lanza cuando no hay aristas en el grafo"

msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])"
msgstr "pgr_betweennessCentrality(`SQL de aristas`_, [``directed``])"

msgid "Returns set of ``(vid, centrality)``"
msgstr "Regresa el conjunto de ``(vid, centrality)``"

msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`."
msgstr "Para un grafo dirigido con aristas :math:`\\{1, 2, 3, 4\\}`."

msgid "Explanation"
msgstr "Explicación"

msgid "The betweenness centrality are between parenthesis."
msgstr "La centralidad intermedia está entre paréntesis."

msgid "The leaf vertices have betweenness centrality :math:`0`."
msgstr "Los vértices de las hojas tienen una centralidad intermedia :math:`0`."

msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`."
msgstr "La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del vértice :math:`10`."

msgid "Removing vertex :math:`6` will create three graph components."
msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes."

msgid "Removing vertex :math:`10` will create two graph components."
msgstr "Al eliminar el vértice :math:`10` se crearán dos componentes del grafo."

msgid "``vid``"
msgstr "``vid``"

msgid "``centrality``"
msgstr "``centrality``"

msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])"
msgstr "Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])"

msgid "`Boost: betweenness centrality <https://www.boost.org/libs/graph/doc/betweenness_centrality.html>`_"
msgstr "`Boost: Centralidad de intermediación <https://www.boost.org/libs/graph/doc/betweenness_centrality.html>`__"

msgid "``pgr_biconnectedComponents``"
msgstr "``pgr_biconnectedComponents``"

msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph."
msgstr "``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no dirigido."

msgid "Result columns change:"
msgstr "Las columnas de resultados cambian:"

msgid "``n_seq`` is removed"
msgstr "``n_seq`` se elimina"

msgid "``seq`` changed type to ``BIGINT``"
msgstr "``seq`` cambió el tipo a ``BIGINT``'"

msgid "The biconnected components of an undirected graph are the maximal subsets of vertices such that the removal of a vertex from particular component will not disconnect the component. Unlike connected components, vertices may belong to multiple biconnected components. Vertices can be present in multiple biconnected components, but each edge can only be contained in a single biconnected component."
msgstr "Los componentes biconectados de un grafo no dirigido son los subconjuntos máximos de vértices de modo que la eliminación de un vértice de un componente determinado no desconectará el mismo. A diferencia de los componentes conectados, los vértices pueden pertenecer a varios componentes biconectados. Los vértices pueden estar presentes en varios componentes biconectados, pero cada arista solo puede estar contenida en un único componente biconectado."

msgid "Components are described by edges."
msgstr "Los componentes se describen mediante aristas."

msgid "``component`` ascending."
msgstr "``componente`` ascendente."

msgid "``edge`` ascending."
msgstr "``edge`` ascendente."

msgid "pgr_biconnectedComponents(`Edges SQL`_)"
msgstr "pgr_biconnectedComponents(`SQL de aristas`_)"

msgid "Returns set of |result-component-E|"
msgstr "Regresa conjunto de |result-component-E|"

msgid "The biconnected components of the graph"
msgstr "Los componentes biconectados del grafo"

msgid "``component``"
msgstr "``component``"

msgid "Component identifier."
msgstr "Identificador de componente."

msgid "Has the value of the minimum edge identifier in the component."
msgstr "Contiene el identificador mínimo de arista en el componente."

msgid "Identifier of the edge that belongs to the ``component``."
msgstr "Identificador de arista que pertenece a ``component``."

msgid "``pgr_binaryBreadthFirstSearch`` - Experimental"
msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental"

msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph."
msgstr "``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo binario."

msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'."
msgstr "Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' es un entero no negativo, se le llama 'grafo binario'."

msgid "pgr_binaryBreadthFirstSearch(Combinations)"
msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)"

msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time."
msgstr "Es bien sabido que los caminos más cortos entre un único origen y todos los demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. También se puede interpretar este grafo como un grafo ponderado, en el que cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo tienen el mismo peso, se necesita un algoritmo más general, como el Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`."

msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer."
msgstr "Sin embargo, si los pesos están más restringidos, podemos usar un algoritmo más rápido. Este algoritmo, llamado 'búsqueda binaria de primero profundidad' así como '0-1 BFS', es una variación del problema estándar de búsqueda de primero profundidad para resolver el problema SSSP (ruta más corta de una sola fuente) en :math:`O(|E|)`, si los pesos de cada arista pertenecen al conjunto de caracteres de {0,X}, donde 'X' es cualquier entero no negativo."

msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)"
msgstr "El proceso se realiza sólo en 'grafos binarios'. ('Grafo binario': Cualquier grafo cuyos pesos de aristas pertenezcan al conjunto {0, X}, donde 'X' es cualquier entero real no negativo.)"

msgid "Running time: :math:`O(| start\\_vids | * |E|)`"
msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * |E|)`"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)"
msgstr "**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los mismos (i.e :math:`1``)"

msgid "`Boost: Breadth First Search <https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"
msgstr "`Boost: Primera búsqueda en amplitud <https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"

msgid "https://cp-algorithms.com/graph/01_bfs.html"
msgstr "https://cp-algorithms.com/graph/01_bfs.html"

msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants"
msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants"

msgid "``pgr_bipartite`` - Experimental"
msgstr "``pgr_bipartite`` - Experimental"

msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent."
msgstr "``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el mismo conjunto son adjacentes."

msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color."
msgstr "Un grafo bipartito es un grafo con dos conjuntos de vértices que están conectados entre sí, pero no dentro de sí mismos. Un gráfico bipartito es posible si el color del gráfico es posible utilizando dos colores, de modo que los vértices de un conjunto se colorean con el mismo color."

msgid "The algorithm works in undirected graph only."
msgstr "El algoritmo solo funciona en un grafo no dirigido."

msgid "The returned values are not ordered."
msgstr "Los valores devueltos no están ordenados."

msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets."
msgstr "El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito entonces devuelve el nodo junto con dos colores `0` y `1` que representan dos conjuntos diferentes."

msgid "If graph is not bipartite then algorithm returns empty set."
msgstr "Si el grafo no es bipartito, el algoritmo devuelve un conjunto vacío."

msgid "pgr_bipartite(`Edges SQL`_)"
msgstr "pgr_bipartite(`SQL de aristas`_)"

msgid "When the graph is bipartite"
msgstr "Cuando el grafo es bi-partido"

msgid "Additional Example"
msgstr "Ejemplo Adicional"

msgid "The odd length cyclic graph can not be bipartite."
msgstr "El gráfico cíclico de longitud impar no puede ser bipartito."

msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices."
msgstr "La arista :math:`5 \\rightarrow 1` hace que el sub-grafo con vértices:math:`\\{1, 3, 7, 6, 5\\}` se un grafo de ciclo impar, ya que ciclo tiene 5 vértices."

msgid "Edges in blue represent odd length cycle subgraph."
msgstr "Aristas en azul representan un grafo de ciclo impar."

msgid "`Boost: is_bipartite <https://www.boost.org/libs/graph/doc/is_bipartite.html>`__"
msgstr "`Boost: es bipartido <https://www.boost.org/libs/graph/doc/is_bipartite.html>`__"

msgid "`Wikipedia: bipartite graph <https://en.wikipedia.org/wiki/Bipartite_graph>`__"
msgstr "`Wikipedia: grafo bipartito <https://en.wikipedia.org/wiki/Bipartite_graph>`__"

msgid "``pgr_boykovKolmogorov``"
msgstr "``pgr_boykovKolmogorov``"

msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm."
msgstr "``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo Boykov Kolmogorov."

msgid "pgr_boykovKolmogorov(Combinations)"
msgstr "pgr_boykovKolmogorov(Combinaciones)"

msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``"
msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``"

msgid "Function promoted to proposed."
msgstr "Función promovida a propuesta."

msgid "Running time: Polynomial"
msgstr "Tiempo de ejecución: Polinomio"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destino**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destinos**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destino**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destinos**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "Returns set of |result-flow|"
msgstr "Regresa el conjunto de |result-flow|"

msgid "From vertex :math:`11` to vertex :math:`12`"
msgstr "Del vértice :math:`11` al vértice :math:`12`"

msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`"
msgstr "Desde el vértice :math:`11` a los vértices :math:`\\{5, 10, 12\\}`"

msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`"
msgstr "De los vértices vertices :math:`\\{11, 3, 17\\}` al vértice :math:`12`"

msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`"
msgstr "De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}`"

msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`."
msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}`."

msgid "`Boost: Boykov Kolmogorov max flow <https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html>`__"
msgstr "`Boost: Flujo máximo Boykov Kolmogorov <https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html>`__"

msgid "``pgr_breadthFirstSearch`` - Experimental"
msgstr "``pgr_breadthFirstSearch`` - Experimental"

msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm."
msgstr "``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante el algoritmo Breadth First Search."

msgid "Version 4.0.0:"
msgstr "Versión 4.0.0:"

msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth."
msgstr "Proporciona el orden transversal de Primera Búsqueda de Amplitud desde un vértice raíz hasta una profundidad particular."

msgid "The implementation will work on any type of graph."
msgstr "La implementación funcionará en cualquier tipo de grafo."

msgid "Provides the Breadth First Search traversal order from a source node to a target depth level."
msgstr "Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un nodo de origen a un nivel de profundidad objetivo."

msgid "Running time: :math:`O(E + V)`"
msgstr "Tiempo de ejecución: :math:`O(E + V)`"

msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])"
msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raíz**, [**options**])"

msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])"
msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])"

msgid "**options:** ``[max_depth, directed]``"
msgstr "**opcionales:** ``[max_depth, directed]``"

msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``"
msgstr "Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en orden ascendente de ``id``"

msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``"
msgstr "A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas ascendentemente in términos de ``id``"

msgid "DFS optional parameters"
msgstr "Parámetros opcionales de DFS"

msgid "Same as `Single vertex`_ with edges in ascending order of ``id``."
msgstr "Igual que `Vértice único`_ con aritas en orden ascendente de ``id``."

msgid "Same as `Single vertex`_ with edges in descending order of ``id``."
msgstr "Igual que `Vértice único`_ con aritas en orden descendente de ``id``."

msgid "The resulting traversal is different."
msgstr "El recorrido resultante es diferente."

msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers."
msgstr "La imagen izquierda muestra el resultado con el orden ascendente de los ids y la imagen derecha muestra con el orden descendente de los identificadores de aristas."

msgid "|ascending| |descending|"
msgstr "|ascending| |descending|"

msgid "ascending"
msgstr "ascendente"

msgid "descending"
msgstr "descendente"

msgid "`Wikipedia: Breadth First Search algorithm <https://en.wikipedia.org/wiki/Breadth-first_search>`__"
msgstr "`Wikipedia: Breadth First Search <https://en.wikipedia.org/wiki/Breadth-first_search>`__"

msgid "``pgr_bridges``"
msgstr "``pgr_bridges``"

msgid "``pgr_bridges`` - Return the bridges of an undirected graph."
msgstr "``pgr_bridges`` - Calcula los puentes de un grafo no dirigido."

msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph."
msgstr "Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su número de componentes conectados. Esta implementación solo se puede utilizar con un grafo no dirigido."

msgid "``edge`` ascending"
msgstr "``edge`` ascendente"

msgid "Running time: :math:`O(E * (V + E))`"
msgstr "Tiempo de ejecución: :math:`O(E * (V + E))`"

msgid "pgr_bridges(`Edges SQL`_)"
msgstr "pgr_bridges(`SQL de aristas`_)"

msgid "Returns set of |result-edge|"
msgstr "Regresa conjunto de |result-edge|"

msgid "The bridges of the graph"
msgstr "Los puentes del grafo"

msgid "Identifier of the edge that is a bridge."
msgstr "Identificador del borde que es un puente."

msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29"
msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29"

msgid "`Boost: Connected components <https://www.boost.org/libs/graph/doc/connected_components.html>`__"
msgstr "`Boost: Componentes conectados <https://www.boost.org/libs/graph/doc/connected_components.html>`__"

msgid "``pgr_chinesePostman`` - Experimental"
msgstr "``pgr_chinesePostman`` - Experimental"

msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex."
msgstr "``pgr_chinesePostman`` — Calcula la ruta de circuito más corta que contiene cada arista en un grafo dirigido y comienza y termina en el mismo vértice."

msgid "Returns ``EMPTY SET`` on a disconnected graph"
msgstr "Devuelve ``EMPTY SET`` en un grafo desconectado"

msgid "pgr_chinesePostman(`Edges SQL`_)"
msgstr "pgr_chinesePostman(`SQL de aristas`_)"

msgid "Returns set of |result-1-1-no-seq|"
msgstr "Regresa el conjunto de |result-1-1-no-seq|"

msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``"
msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``"

msgid "Sequential value starting from ``1``"
msgstr "Valor secuencial a partir de ``1``"

msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path."
msgstr "Identificador del borde utilizado para ir del ``nodo`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta."

msgid "Aggregate cost from ``start_v`` to ``node``."
msgstr "Coste agregado de ``start_v`` to ``node``."

msgid "``pgr_chinesePostmanCost`` - Experimental"
msgstr "``pgr_chinesePostmanCost`` - Experimental"

msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex."
msgstr "``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de circuito que contiene cada arista de un grafo dirigido y comienza y termina en el mismo vértice."

msgid "Return value when the graph if disconnected"
msgstr "Valor devuelto cuando el grafo está desconectado"

msgid "pgr_chinesePostmanCost(`Edges SQL`_)"
msgstr "pgr_chinesePostmanCost(`SQL de aristas`_)"

msgid "RETURNS ``FLOAT``"
msgstr "DEVUELVE ``FLOAT``"

msgid "``pgr_chinesepostmancost``"
msgstr "``pgr_chinesepostmancost``"

msgid "Minimum costs of a circuit path."
msgstr "Costes mínimos de una trayectoria de circuito."

msgid "``pgr_connectedComponents``"
msgstr "``pgr_connectedComponents``"

msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach."
msgstr "``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido mediante un enfoque basado en DFS."

msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other."
msgstr "Un componente conectado de un gráfico no direccionado es un conjunto de vértices que son todos accesibles entre sí."

msgid "Components are described by vertices"
msgstr "Los componentes se describen mediante vértices"

msgid "``component`` ascending"
msgstr "``component`` ascendente"

msgid "pgr_connectedComponents(`Edges SQL`_)"
msgstr "pgr_connectedComponents(`SQL de aristas`_)"

msgid "Returns set of |result-component-V|"
msgstr "Regresa conjunto de |result-component-V|"

msgid "The connected components of the graph"
msgstr "Los componentes conectados del grafo"

msgid "Has the value of the minimum node identifier in the component."
msgstr "Continene le valor mínimo de identificador de nodo en el componente."

msgid "Identifier of the vertex that belongs to the ``component``."
msgstr "Identificador del vértice que pertenece al ``component``."

msgid "Connecting disconnected components"
msgstr "Conectando componentes desconectados"

msgid "wikipedia: `Connected component <https://en.wikipedia.org/wiki/Connected_component_(graph_theory)>`__"
msgstr "wikipedia: `Componente conectado <https://en.wikipedia.org/wiki/Connected_component_(graph_theory)>`__"

msgid "``pgr_contraction``"
msgstr "``pgr_contraction``"

msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges."
msgstr "``pgr_contraction`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.."

msgid "Version 3.8.0"
msgstr "Versión 3.8.0"

msgid "New signature:"
msgstr "Nueva firma:"

msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``."
msgstr "El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional con el nombre ``methods``."

msgid "New name and order of optional parameters."
msgstr "Nuevo nombre y orden de parámetros opcionales."

msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)"
msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)"

msgid "Name change from ``pgr_contractGraph``"
msgstr "Cambio de nombre de ``pgr_contractGraph``"

msgid "Bug fixes"
msgstr "Correcciones"

msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms."
msgstr "La contracción reduce el tamaño del grafo eliminando algunos de los vértices y aristas, también por ejemplo, podría agregar aristas que representan una secuencia de aristas originales disminuyendo el tiempo total y el espacio utilizados en los algoritmos de grafo."

msgid "Does not return the full contracted graph."
msgstr "No devuelve el grafo contraído completo."

msgid "Only changes on the graph are returned."
msgstr "Solo se devuelven los cambios en el grafo."

msgid "The returned values include:"
msgstr "Los valores devueltos incluyen:"

msgid "The new edges generated by linear contraction."
msgstr "Las nuevas aristas generadas por la contracción lineal."

msgid "The modified vertices generated by dead end contraction."
msgstr "Los vértices modificados por contracción sin salida."

msgid "The returned values are ordered as follows:"
msgstr "Los valores devueltos se ordenan de la siguiente manera:"

msgid "column ``id`` ascending when its a modified vertex."
msgstr "columna ``id`` ascendente cuando es un vértice modificado."

msgid "column ``id`` with negative numbers descending when its a new edge."
msgstr "columna ``id`` con números negativos descendentes cuando es una nueva arista."

msgid "Currently there are two types of contraction methods included in this function:"
msgstr "Actualmente hay dos tipos de métodos de contracción incluidos en esta función:"

msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`."
msgstr "Contracción sin salida. Véase :doc:`pgr_contractionDeadEnd`."

msgid "Linear Contraction. See :doc:`pgr_contractionLinear`."
msgstr ""

msgid "pgr_contraction(`Edges SQL`_, [**options**])"
msgstr "pgr_contraction(`SQL de aristas`_, [**opciones**])"

msgid "**options:** ``[directed, methods, cycles, forbidden]``"
msgstr "**opciones:** ``[directed, methods, cycles, forbidden]``"

msgid "Returns set of |result-contract|"
msgstr "Regresa conjunto de |result-contract|"

msgid "Dead end and linear contraction in that order on an undirected graph."
msgstr "Hacer una contracción de callejón sin salida y una contracción lineal en ese orden en un grafo no dirigido."

msgid "Contraction optional parameters"
msgstr "Parámetros opcionales de Contracción"

msgid "``methods``"
msgstr "``methods``"

msgid "``INTEGER[]``"
msgstr "``INTEGER[]``"

msgid "``ARRAY[1,2]``"
msgstr "``ARRAY[1,2]``"

msgid "Ordered contraction operations."
msgstr "Operaciones de contracción ordenadas."

msgid "1 = Dead end contraction"
msgstr "1 = Contracción sin salida"

msgid "2 = Linear contraction"
msgstr "2 - Contracción lineal"

msgid "``cycles``"
msgstr "``cycles``"

msgid ":math:`1`"
msgstr ":math:`1`"

msgid "Number of times the contraction methods will be performed."
msgstr "Número de veces que se realizarán las operaciones de contracción."

msgid "``forbidden``"
msgstr "``forbidden``"

msgid "``BIGINT[]``"
msgstr "``BIGINT[]``"

msgid "``ARRAY[]::BIGINT[]``"
msgstr "``ARRAY[]::BIGINT[]``"

msgid "Identifiers of vertices forbidden for contraction."
msgstr "Identificadores de vértices prohibidos para contracción."

msgid "The function returns a single row. The columns of the row are:"
msgstr "La función devuelve una sola fila. Las columnas de la fila son:"

msgid "``type``"
msgstr "``type``"

msgid "Type of the row."
msgstr "Tipo de la fila."

msgid "``v`` when the row is a vertex."
msgstr "``v`` cuando la fila es un vértice."

msgid "Column ``id`` has a positive value."
msgstr "Columna ``id`` tiene valor positivo."

msgid "``e`` when the row is an edge."
msgstr "``e`` cuando la fila es una arista."

msgid "Column ``id`` has a negative value."
msgstr "Columna ``id`` tiene valor negativo."

msgid "All numbers on this column are ``DISTINCT``"
msgstr "Todos los números de esta columna son ''DISTINTOS''"

msgid "When ``type`` = **'v'**."
msgstr "En caso de ``type`` = **'v'**."

msgid "Identifier of the modified vertex."
msgstr "Identificador del vértice modificado."

msgid "When ``type`` = **'e'**."
msgstr "En caso de ``type`` = **'e'**."

msgid "Decreasing sequence starting from **-1**."
msgstr "Disminución de la secuencia a partir de **-1**."

msgid "Representing a pseudo `id` as is not incorporated in the set of original edges."
msgstr "Representando un pseudo `id` como no incorporado en el conjunto de aristas originales."

msgid "``contracted_vertices``"
msgstr "``contracted_vertices``"

msgid "Array of contracted vertex identifiers."
msgstr "Arreglo de identificadores de vértices contraídos."

msgid "When ``type`` = **'v'**: :math:`-1`"
msgstr "En caso de ``type`` = **'v'**: :math:`-1`"

msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)."
msgstr "En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual (``source``, ``target``)."

msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)."
msgstr "En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la arista actual (``source``, ``target``)."

msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)."
msgstr "En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, ``target``)."

msgid "Only dead end contraction"
msgstr "Sólo contracción sin salida"

msgid "Only linear contraction"
msgstr "Sólo contracción lineal"

msgid "The cycle"
msgstr "El ciclo"

msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes."
msgstr "Contraer un grafo se puede hacer con más de una operación. El orden de las operaciones afecta al grafo contraído resultante, después de aplicar una operación, el conjunto de vértices que se pueden contraer con otra operación cambia."

msgid "This implementation cycles ``cycles`` times through the ``methods`` ."
msgstr "Esta implementación cicla `` cycles`` veces a través de los ``methods``."

msgid "Contracting sample data"
msgstr "Contracción de los datos de muestra"

msgid "In this section, building and using a contracted graph will be shown by example."
msgstr "En esta sección, la creación y el uso de un grafo contraído se mostrarán en el ejemplo."

msgid "The :doc:`sampledata` for an undirected graph is used"
msgstr "Se usa :doc:`sampledata` para un grafo no dirigido"

msgid "a dead end operation first followed by a linear operation."
msgstr "una operación sin salida primero seguida de una operación lineal."

msgid "Construction of the graph in the database"
msgstr "Construcción del grafo en la base de datos"

msgid "The original graph:"
msgstr "El grafo original:"

msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods."
msgstr "Los resultados no representan al grafo contraído. Representan los cambios que necesitan hacerse en el grafo después de aplicar los métodos de contracción."

msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm."
msgstr "Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los resultados porque no se vieron afectados por el algoritmo de contracción."

msgid "After doing the dead end contraction operation:"
msgstr "Después de realizar la operación de contracción sin salida:"

msgid "After doing the linear contraction operation to the graph above:"
msgstr "Después de hacer la operación de contracción lineal al grafo anterior:"

msgid "The process to create the contraction graph on the database:"
msgstr "El proceso para crear el grafo de contracción en la base de datos:"

msgid "Add additional columns"
msgstr "Añadir columnas adicionales"

msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:"
msgstr ""

msgid "Column."
msgstr "Columna."

msgid "The vertices set belonging to the vertex/edge"
msgstr "El conjunto de vértices que pertenecen al vértice/arista"

msgid "``is_contracted``"
msgstr "``is_contracted``"

msgid "On the vertex table"
msgstr "En la tabla de vértices"

msgid "when ``true`` the vertex is contracted, its not part of the contracted graph."
msgstr "En caso de ''true'' se contrae el vértice, no forma parte del grafo contraído."

msgid "when ``false`` the vertex is not contracted, its part of the contracted graph."
msgstr "En caso de ''false'' el vértice no se contrae, su parte del grafo contraído."

msgid "``is_new``"
msgstr "``is_new``"

msgid "On the edge table"
msgstr "En la tabla de aristas"

msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph."
msgstr "En caso de `` true``, la arista se generó por el algoritmo de contracción. Es parte del grafo contraído."

msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph."
msgstr "En caso de ``false`` , la arista es una arista original, podría ser o no parte del grafo contraído."

msgid "Store contraction information"
msgstr "Almacenar información de contracción"

msgid "Store the contraction results in a table."
msgstr "Almacenar los resultados de la contracción en una tabla."

msgid "Update the edges and vertices tables"
msgstr "Actualizar las tablas de aristas y vértices"

msgid "Use ``is_contracted`` column to indicate the vertices that are contracted."
msgstr "Usar la columna ``is_contracted`` para indicar los vértices contraídos."

msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices."
msgstr "Llenar ``contracted_vertices`` con la información de los resultados que pertenecen a los vértices."

msgid "Insert the new edges generated by pgr_contraction."
msgstr "Inserte las nuevas aristas generadas por pgr_contraction."

msgid "The contracted graph"
msgstr "El grafo contraído"

msgid "Vertices that belong to the contracted graph."
msgstr "Vértices que pertenecen al grafo contraído."

msgid "Edges that belong to the contracted graph."
msgstr "Aristas que pertenecen al grafo contraído."

msgid "Visually:"
msgstr "Visualmente:"

msgid "Using the contracted graph"
msgstr "Usando el grafo contraído"

msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``"
msgstr ""

msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:"
msgstr "Hay tres casos al calcular la ruta más corta entre un origen y un destino determinados en un grafo contraído:"

msgid "Case 1: Both source and target belong to the contracted graph."
msgstr "Caso 1: Tanto el origen como el destino pertenecen al grafo contraído."

msgid "Case 2: Source and/or target belong to an edge subgraph."
msgstr "Caso 2: El origen y/o el destino pertenecen a un subgrafo de aristas."

msgid "Case 3: Source and/or target belong to a vertex."
msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice."

msgid "The final application should consider all of those cases."
msgstr ""

msgid "Create a view (or table) of the contracted graph:"
msgstr "Crear una vista (o tabla) del grafo Contraído:"

msgid "Create the function that will use the contracted graph."
msgstr "Crear la función que va a utilizar el grafo contraído."

msgid "Case 2: Source and/or target belong to an edge that has contracted vertices."
msgstr "Caso 2: El origen y/o el destino pertenecen a una arista que ha contraído vertices."

msgid "Case 3: Source and/or target belong to a vertex that has been contracted."
msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice que ha sido contraído."

msgid "``pgr_contractionDeadEnd`` - Proposed"
msgstr "``pgr_contractionDeadEnd`` - Propuesto"

msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges."
msgstr "``pgr_contractionDeadEnd`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.."

msgid "A node is considered a dead end node when:"
msgstr "Un nodo se considera sin salida cuando:"

msgid "On undirected graphs:"
msgstr "En grafos no dirigidos:"

msgid "The number of adjacent vertices is 1."
msgstr "El número de vértices adyacentes es 1."

msgid "On directed graphs:"
msgstr "En grafos dirigidos:"

msgid "When there is only one adjacent vertex or"
msgstr "Cuando hay solo un vértice adyacente o"

msgid "When all edges are incoming regardless of the number of adjacent vertices."
msgstr ""

msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])"
msgstr "pgr_contractionDeadEnd(`SQL de aristas`_, [**opciones**])"

msgid "**options:** ``[directed, forbidden]``"
msgstr "**opciones:** ``[directed, forbidden]``"

msgid "Dead end contraction on an undirected graph."
msgstr "Contracción de vértice sin salida en un grafo no dirigido."

msgid "The green nodes are dead end nodes."
msgstr "Los nodos verdes son nodos sin salida."

msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted."
msgstr "El nodo :math:`3` es sin salida después de haberse contraído el nodo :math:`1`."

msgid "``ARRAY[`` |ANY-INTEGER| ``]``"
msgstr "``ARRAY[`` |ANY-INTEGER| ``]``"

msgid "**Empty**"
msgstr "**vacío**"

msgid "Value = ``e`` indicating the row is an edge."
msgstr "Valor = ``e`` cuando la fila es una arista."

msgid "A pseudo `id` of the edge."
msgstr "Un pseudo `identificador` de la arista."

msgid "Identifier of the source vertex of the current edge."
msgstr "Identificador del vértice de origen de la arista actual."

msgid "Identifier of the target vertex of the current edge."
msgstr "Identificador del vértice destino de la arista actual."

msgid "Weight of the current edge."
msgstr "Peso de la arista actual."

msgid "Dead end vertex on undirected graph"
msgstr "Vértice sin salida en un grafo sin dirigir"

msgid "They have only one adjacent node."
msgstr ""

msgid "Dead end vertex on directed graph"
msgstr "Vértice sin salida en un grafo dirigido"

msgid "The green nodes are dead end nodes"
msgstr "Los nodos verdes son nodos sin salida"

msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges."
msgstr "Los nodos azules tienen un número ilimitado de aristas entrantes y/o salientes."

msgid "Node"
msgstr "Nodo"

msgid "Adjacent nodes"
msgstr "Nodos adyacentes"

msgid "Dead end"
msgstr "Sin salida"

msgid "Reason"
msgstr ""

msgid ":math:`6`"
msgstr ":math:`6`"

msgid ":math:`\\{1\\}`"
msgstr ":math:`\\{1\\}`"

msgid "Yes"
msgstr "Si"

msgid "Has only one adjacent node."
msgstr "Solo tiene un nodo adyacente."

msgid ":math:`7`"
msgstr ":math:`7`"

msgid ":math:`\\{2\\}`"
msgstr ":math:`\\{2\\}`"

msgid ":math:`8`"
msgstr ":math:`8`"

msgid ":math:`\\{2, 3\\}`"
msgstr ":math:`\\{2, 3\\}`"

msgid "Has more than one adjacent node and all edges are incoming."
msgstr ""

msgid ":math:`\\{4\\}`"
msgstr ":math:`\\{4\\}`"

msgid ":math:`10`"
msgstr ":math:`10`"

msgid ":math:`\\{4, 5\\}`"
msgstr ":math:`\\{4, 5\\}`"

msgid "No"
msgstr "No"

msgid "Has more than one adjacent node and all edges are outgoing."
msgstr ""

msgid ":math:`1,2,3,4,5`"
msgstr ":math:`1,2,3,4,5`"

msgid "Many adjacent nodes."
msgstr "Muchos nodos adyacentes."

msgid "Has more than one adjacent node and some edges are incoming and some are outgoing."
msgstr ""

msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one."
msgstr "De arriba, nodes :math:`\\{6, 7, 9\\}` son sin salida por que el número de vértices adyacentes es 1."

msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end."
msgstr ""

msgid "Step by step dead end contraction"
msgstr "Paso a paso contracción sin salida"

msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:"
msgstr "La contracción sin salida se detendrá hasta que no haya más nodos sin salida. Por ejemplo, del siguiente grafo donde :math:`3` es el nodo sin salida:"

msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:"
msgstr "Después de contraer :math:`3`, el nodo ` :math:`2` es ahora un nodo sin salida y es contraído:"

msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted."
msgstr "Después de contraer :math:`2`, detener. El nodo :math:`1` tiene la información de los nodos que se contraen."

msgid "Creating the contracted graph"
msgstr "Creando el grafo contraído"

msgid "Steps for the creation of the contracted graph"
msgstr "Pasos para la creación del grafo contraído"

msgid "Add additional columns."
msgstr "Añadir columnas adicionales."

msgid "Save results into a table."
msgstr "Almacenar los resultados en una tabla."

msgid "The contracted vertices are not part of the contracted graph."
msgstr "Los vértices contraído no forman parte del grafo contraído."

msgid "Using when departure and destination are in the contracted graph"
msgstr "Usando cuando la salida como el destino pertenecen al grafo contraído"

msgid "Using when departure/destination is not in the contracted graph"
msgstr "Usando cuando la salida /destino no pertenecen al grafo contraído"

msgid "Using when departure and destination are not in the contracted graph"
msgstr "Usando cuando la salida y el destino no están en el grafo contraído"

msgid "``pgr_contractionHierarchies`` - Experimental"
msgstr "``pgr_contractionHierarchies`` - Experimental"

msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created."
msgstr "``pgr_contractionHierarchies`` - Realiza la contracción del grafo según el método de jerarquías de contracción y devuelve los vértices contraídos y las aristas de acceso directo creadas."

msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure."
msgstr ""

msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)."
msgstr ""

msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy."
msgstr ""

msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)."
msgstr ""

msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality."
msgstr ""

msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value."
msgstr ""

msgid "The process is done on graphs having only edges with positive costs."
msgstr "El proceso se realiza en grafos que sólo tienen aristas con costos positivos."

msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered."
msgstr ""

msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:"
msgstr ""

msgid "added shortcut edges, with negative identifiers;"
msgstr ""

msgid "contracted nodes with an order."
msgstr ""

msgid "The ``pgr_contractionHierarchies`` function has the following signature:"
msgstr "La función ``pgr_contractionHierarchies`` tiene la siguiente firma:"

msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])"
msgstr "pgr_contractionHierarchies(`SQL de aristas`_, [**opciones**])"

msgid "Returns set of |result-contraction-hierarchies|"
msgstr "Devuelve el conjunto de |result-contraction-hierarchies|"

msgid "Contraction hierarchies optional parameters"
msgstr "Parámetros opcionales de las jerarquías de contracción"

msgid "True if the graph is directed, False otherwise."
msgstr "True si el grafo es dirigido, False en caso contrario."

msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:"
msgstr "La función devuelve muchas filas (una por vértice y una por cada atajo de arista creada). Las columnas de las filas son:"

msgid "Type of the ``id``."
msgstr "Tipo del ``id``."

msgid "Column ``id`` has a positive value"
msgstr "Columna ``id`` tiene valor positivo"

msgid "Column ``id`` has a negative value"
msgstr "Columna ``id`` tiene valor negativo"

msgid "``metric``"
msgstr "``metric``"

msgid "``vertex_order``"
msgstr "``vertex_order``"

msgid "On an undirected graph"
msgstr "En un grafo no dirigido"

msgid "The following query shows the original data involved in the contraction operation on an undirected graph."
msgstr ""

msgid "building contraction hierarchies on the whole graph"
msgstr ""

msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result."
msgstr ""

msgid "After computing the contraction hierarchies, an order is now given to the vertices,"
msgstr ""

msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search."
msgstr ""

msgid "We obtain the contracted graph above:"
msgstr "Se obtiene el grafo contraído anterior:"

msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order."
msgstr ""

msgid "On an undirected graph with forbidden vertices"
msgstr "En un grafo no dirigido con vértices prohibidos"

msgid "building contraction with a set of forbidden vertices"
msgstr "construir la contracción en un conjunto de nodos prohibidos"

msgid "Contraction process steps details"
msgstr "Detalles de los pasos del proceso de contracción"

msgid "Shortcut building process"
msgstr "Proceso de construcción de atajos"

msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``."
msgstr ""

msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph."
msgstr ""

msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*."
msgstr ""

msgid "Initialize the queue with a first vertices order"
msgstr ""

msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:"
msgstr ""

msgid ":math:`v`"
msgstr ":math:`v`"

msgid ":math:`\\{p, r, u\\}`"
msgstr ":math:`\\{p, r, u\\}`"

msgid ":math:`p`"
msgstr ":math:`p`"

msgid ":math:`\\{u, v\\}`"
msgstr ":math:`\\{u, v\\}`"

msgid ":math:`u`"
msgstr ":math:`u`"

msgid ":math:`\\{p, v, w\\}`"
msgstr ":math:`\\{p, v, w\\}`"

msgid ":math:`r`"
msgstr ":math:`r`"

msgid ":math:`\\{v, w\\}`"
msgstr ":math:`\\{v, w\\}`"

msgid ":math:`w`"
msgstr ":math:`w`"

msgid ":math:`\\{r, u\\}`"
msgstr ":math:`\\{r, u\\}`"

msgid "Adjacent edges are removed."
msgstr ""

msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2."
msgstr ""

msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process."
msgstr ""

msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order."
msgstr ""

msgid "A hierarchy will now be constructed by contracting again the vertices in this order."
msgstr ""

msgid "Build the final vertex order"
msgstr "Construir el orden final de los vértices"

msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently."
msgstr ""

#, fuzzy
msgid "Add shortcuts to the initial graph"
msgstr "corte mínimo de el subgrafo principal"

msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy."
msgstr ""

#, fuzzy
msgid "Use the contraction"
msgstr "Contracción sin salida"

#, fuzzy
msgid "Build the contraction"
msgstr "Contracción sin salida"

msgid "Add shortcuts and hierarchy in the existing tables"
msgstr ""

msgid "Add new columns in the `vertices` and `edges` tables to store the results:"
msgstr ""

msgid "Update and insert the results in the two tables."
msgstr ""

msgid "Use a Dijkstra shortest path algorithm on it"
msgstr "Aplicarle el algoritmo Dijkstra del camino más corto"

msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:"
msgstr ""

msgid "``pgr_contractionLinear`` - Proposed"
msgstr "``pgr_contractionLinear`` - Propuesto"

msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges."
msgstr "``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.."

msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])"
msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])"

msgid "Linear contraction on an undirected graph."
msgstr "Contracción lineal en un grafo no dirigido."

msgid "The green nodes are linear nodes and will not be part of the contracted graph."
msgstr "Los nodos verdes son lineales y no forman parte del grafo contraído."

msgid "All edges adjacent will not be part of the contracted graph."
msgstr "Aristas adyacentes no forman parte del grafo contraído."

msgid "The red lines will be new edges of the contracted graph."
msgstr "Las lineas verdes son aristas que pertenecen al grafo contraído."

msgid "**contraction Order**"
msgstr "**Orden de contracciones**"

msgid "Number of times the contraction operations on ``contraction_order`` will be performed."
msgstr "Número de veces que se realizarán las operaciones de contracción en el orden ``contraction_order``."

msgid "A node connects two (or more) `linear` edges when"
msgstr ""

msgid "The number of adjacent vertices is 2."
msgstr "El número de vértices adyacentes es 2."

msgid "In case of a directed graph, a node is considered a `linear` node when"
msgstr "En el caso de un grafo dirigido, un nodo se considera `lineal` cuando"

msgid "Linearity is symmetrical."
msgstr "La linealidad es simétrica."

msgid "Linearity is not symmetrical"
msgstr "La linealidad no es simétrica"

msgid "Graph where linearity is not symmetrical."
msgstr "Grafo cuando la linealidad no es simétrica."

msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted."
msgstr ""

msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted."
msgstr ""

msgid "The three edges can be replaced by one undirected edge"
msgstr "Las tres aristas pueden ser reemplazadas por una arista no dirigida"

msgid "Edge :math:`1 - 3`."
msgstr "Arista :math:`1 - 3`."

msgid "With cost: :math:`4`."
msgstr "Con costo: :math:`4`."

msgid "Contracted vertices in the edge: :math:`\\{2\\}`."
msgstr "Vértices contraídos en la arista: :math:`\\{2\\}`."

msgid "Linearity is symmetrical"
msgstr "La linealidad es simétrica"

msgid "Graph where linearity is symmetrical."
msgstr "Grafo donde la linealidad es simétrica."

msgid "The four edges can be replaced by two directed edges."
msgstr "Las cuatro aristas pueden ser reemplazadas con dos aristas dirigidas."

msgid "Edge :math:`3 - 1`."
msgstr "Arista :math:`3 - 1`."

msgid "With cost: :math:`6`."
msgstr "Con costo: :math:`6`."

msgid "The four edges can be replaced by one undirected edge."
msgstr "Las cuatro aristas pueden ser reemplazadas con una arista no dirigida."

msgid "Step by step linear contraction"
msgstr "Contracción lineal, paso a paso"

msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges"
msgstr "La contracción lineal se detendrá hasta que no hayan más aristas lineales. Por ejemplo, en el siguiente grafo hay aristas lineales"

msgid "Contracting vertex :math:`3`,"
msgstr "Contrayendo el vértice :math:`3`,"

msgid "The vertex :math:`3` is removed from the graph"
msgstr "El vértice :math:`3` se elimina del grafo"

msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph."
msgstr "Los aristas :math:`2 \\rightarrow 3` y :math:`w \\rightarrow z` fueron eliminados del grafo."

msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color."
msgstr "Se inserta una nuevo arista :math:`2 \\rightarrow 4` y se representa con color rojo."

msgid "Contracting vertex :math:`2`:"
msgstr "Contrayendo el vértice :math:`2`:"

msgid "The vertex :math:`2` is removed from the graph"
msgstr "El vértice :math:`2` se elimina del grafo"

msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph."
msgstr "Los aristas :math:`1 \\rightarrow 2` y :math:`2 \\rightarrow 3` son eliminados del grafo."

msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color."
msgstr "Se inserta una nuevo arista :math:`1 \\rightarrow 3` y se representa con color rojo."

msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted."
msgstr "El arista :math:`1 \\rightarrow 3` tiene la información de los costos y nodos que fueron contraídos."

msgid "Create the contracted graph."
msgstr "Crear el grafo contraído."

msgid "``pgr_cuthillMckeeOrdering`` - Experimental"
msgstr "``pgr_cuthillMckeeOrdering`` - Experimental"

msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs"
msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos"

msgid "Version 3.4.0"
msgstr "Versión 3.4.0"

msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth."
msgstr "En álgebra lineal numérica, el algoritmo Cuthill-McKee (CM), llamado así por Elizabeth Cuthill y James McKee, es un algoritmo para permutar una matriz dispersa que tiene un patrón de dispersidad simétrico en una forma de matriz de banda con un ancho de banda pequeño."

msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree."
msgstr "Básicamente, se asigna a los vértices un orden de búsqueda breadth-first, con la salvedad de que, en cada paso, los vértices adyacentes se colocan en la cola por orden creciente de grado."

msgid "The implementation is for **undirected** graphs."
msgstr "La implementación es para grafos **no dirigidos**."

msgid "The bandwidth minimization problems are considered NP-complete problems."
msgstr "Los problemas de minimización del ancho de banda se consideran problemas NP-completos."

msgid "The running time complexity is: :math:`O(m log(m)|V|)`"
msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`"

msgid "where :math:`|V|` is the number of vertices,"
msgstr "donde :math:`|V|` es el número de vértices,"

msgid ":math:`m` is the maximum degree of the vertices in the graph."
msgstr ":math:`m` es el grado máximo de los vértices en el grafo."

msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)"
msgstr "pgr_cuthillMckeeOrdering(`SQL de aristas`_)"

msgid "Returns set of |result_node_order|"
msgstr "Regresa el conjunto de |result_node_order|"

msgid "Graph ordering of pgRouting :doc:`sampledata`"
msgstr "Ordenamiento del grafo de los :doc:`sampledata` de pgRouting"

msgid "Returns set of ``(seq, node)``"
msgstr "Regresa el conjunto de ``(seq, node)``"

msgid "Sequence of the order starting from 1."
msgstr "Valor secuencial a partir de 1."

msgid "New ordering in reverse order."
msgstr "Nuevo ordenamiento es en orden inverso."

msgid "`Boost: Cuthill-McKee Ordering <https://www.boost.org/libs/graph/doc/cuthill_mckee_ordering.html>`__"
msgstr "`Boost: Ordernamiento Cuthill-McKee <https://www.boost.org/libs/graph/doc/cuthill_mckee_ordering.html>`__"

msgid "`Wikipedia: Cuthill-McKee Ordering <https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm>`__"
msgstr "`Wikipedia: Ordenamiento Cuthill-McKee <https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm>`__"

msgid "``pgr_dagShortestPath`` - Experimental"
msgstr "``pgr_dagShortestPath`` - Experimental"

msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph."
msgstr "``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de caminos más cortos DAG implementado por Boost.Graph."

msgid "pgr_dagShortestPath(Combinations)"
msgstr "pgr_dagShortestPath(Combinaciones)"

msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)."
msgstr "Ruta Más Corta para grafos acíclicos dirigidos (DAG) es un algoritmo de búsqueda de grafos que resuelve el problema de ruta más corta para el grafo acíclico dirigido ponderado, produciendo una ruta más corta desde un vértice inicial (``start_vid``) a un vértice final (``end_vid``)."

msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph."
msgstr "Esta implementación solo se puede utilizar con un grafo **dirigido** sin ciclos i.e., es decir, un grafo acíclico dirigido."

msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm."
msgstr "El algoritmo se basa en la ordenación topológica del dag para imponer un orden lineal en los vértices, y por lo tanto es más eficaz para DAG que el algoritmo Dijkstra o Bellman-Ford."

msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings."
msgstr "El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo contrario lanzará advertencias."

msgid "The `agg_cost` the non included values `(v, v)` is `0`"
msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es `0`"

msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`"
msgstr "El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`"

msgid "Running time: :math:`O(| start\\_vids | * (V + E))`"
msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V + E))`"

msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destino**)"

msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destinos**)"

msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destino**)"

msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destinos**)"

msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph"
msgstr "Del vértice :math:`5` al vértice :math:`11` en un grafo **dirigido**"

msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`"
msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`"

msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`"
msgstr "Desde los vértices :math:`\\{5, 10\\}` al vértice :math:`11`"

msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph"
msgstr "Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` en un grafo **no dirigido**"

msgid "Return columns"
msgstr "Columnas de Resultados"

msgid "Making **start_vids** the same as **end_vids**"
msgstr "Haciendo **vértices de salida** igual que **vértices destino**"

msgid "`Boost: DAG shortest paths <https://www.boost.org/libs/graph/doc/dag_shortest_paths.html>`__"
msgstr "`Boost: Caminos mas cortos en DAG <https://www.boost.org/libs/graph/doc/dag_shortest_paths.html>`__"

msgid "https://en.wikipedia.org/wiki/Topological_sorting"
msgstr "https://en.wikipedia.org/wiki/Topological_sorting"

msgid "``pgr_degree``"
msgstr "``pgr_degree``"

msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex."
msgstr "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el número de aristas incidentes en el vértice."

msgid "Error messages adjustment."
msgstr ""

msgid "New signature with only Edges SQL."
msgstr ""

msgid "Calculates the degree of the vertices of an undirected graph"
msgstr "Calcula el grado de los vértices de un grafo no dirigido"

msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex."
msgstr "El grado (o valencia) de un vértice de un grafo es el número de aristas incidentes al vértice."

msgid "A loop contributes 2 to a vertex's degree."
msgstr ""

msgid "A vertex with degree 0 is called an isolated vertex."
msgstr ""

msgid "Isolated vertex is not part of the result"
msgstr "Vértice aislado no forma parte del resultado"

msgid "Vertex not participating on the subgraph is considered and isolated vertex."
msgstr ""

msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``."
msgstr "Dado que se trata de una ejecución ``dryrun``, el código de todos los cálculos se muestra en el ``NOTICE`` de PostgreSQL."

msgid "The code can be used as base code for the particular application requirements."
msgstr ""

msgid "No ordering is performed."
msgstr "No se realiza ningún ordenamiento."

msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])"
msgstr "pgr_degree(`Edges SQL`_ , [``dryrun``])"

msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])"
msgstr "pgr_degree(`SQL de aristas`_ , `SQL de vértices`_, [``dryrun``])"

msgid "RETURNS SETOF |result-degree|"
msgstr "REGRESA CONJUNTO DE |result-degree|"

msgid "Edges"
msgstr ""

msgid "example"
msgstr "ejemplo"

msgid "Get the degree of the vertices defined on the edges table"
msgstr "Obtener el grado de los vértices definidos en la tabla de aristas"

msgid "Edges and Vertices"
msgstr "Aristas y Vértices"

msgid "Extracting the vertex information"
msgstr "Extraer la información del vértice"

msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call."
msgstr ""

msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)"
msgstr ""

msgid "Calculate the degree of the nodes:"
msgstr "Calcula el grado de los vértices:"

msgid "`Vertex SQL`_"
msgstr "`SQL de vértices`_"

msgid "`Vertex SQL`_ as described below"
msgstr "`Vertex SQL`_ como se describe abajo"

msgid "``dryrun``"
msgstr "``dryrun``"

msgid "When true do not process and get in a NOTICE the resulting query."
msgstr "Cuando verdadero, no procesar y recibir un AVISO de la consulta resultante."

msgid "For the `Edges and Vertices`_ signature:"
msgstr "Para la firma `Aristas y Vértices`_:"

msgid "For the `Edges`_ signature:"
msgstr "Para la firma `Aristas`_:"

msgid "Vertex SQL"
msgstr "SQL de vértices"

msgid "``in_edges``"
msgstr "``in_edges``"

msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*."
msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *primer punto final*."

msgid "When missing, ``out_edges`` must exist."
msgstr "Si falta, ``out_edges`` debe existir."

msgid "``out_edges``"
msgstr "``out_edges``"

msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*."
msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *segundo punto final*."

msgid "When missing, ``in_edges`` must exist."
msgstr "Si falta, ``in_edges`` debe existir."

msgid "Vertex identifier"
msgstr "Identificador de vértice"

msgid "``degree``"
msgstr "``degree``"

msgid "Number of edges that are incident to the vertex ``id``"
msgstr "Número de aristas incidentes al vértice ``id``"

msgid "Degree of a loop"
msgstr "Grado de un bucle"

msgid "Using the `Edges`_ signature."
msgstr "Usando la firma `Aristas`_."

msgid "Using the `Edges and Vertices`_ signature."
msgstr ""

msgid "Degree of a sub graph"
msgstr "Grado de un subgrafo"

msgid "For the following is a subgraph of the :doc:`sampledata`:"
msgstr "Para el siguiente sub-grafo de :doc:`sampledata`:"

msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`"
msgstr ""

msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`"
msgstr ""

msgid "The vertices not participating on the edge are considered isolated"
msgstr ""

msgid "their degree is 0 in the subgraph and"
msgstr ""

msgid "their degree is not shown in the output."
msgstr ""

msgid "Using a vertex table"
msgstr "Usando una tabla de vértices"

msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls."
msgstr "Para un tamaño de red razonable, es mejor preparar previamente una tabla de vértices y utilizarla en las llamadas a ``pgr_degree``."

msgid "Extract the vertex information and save into a table:"
msgstr "Extraer la información del vértice y almacenar en una tabla:"

msgid "Dry run execution"
msgstr "Ejecución de prueba"

msgid "To get the query generated used to get the vertex information, use ``dryrun => true``."
msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilizar ``dryrun := true``."

msgid "The results can be used as base code to make a refinement based on the backend development needs."
msgstr "Los resultados se pueden usar como código base para realizar un refinamiento basado en las necesidades de desarrollo de back-end."

msgid "Finding dead ends"
msgstr "Encontrando callejones sin salida"

msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly."
msgstr "Si se tiene una tabla de vértices ya construida usando ``pgr_extractVertices`` y se quiere el grado de todo el grafo en lugar de un subconjunto, se puede trabajar con las columnas ``in_edges`` y ``out_edges`` directamente."

msgid "The degree of a dead end is 1."
msgstr "El grado de un sin salida es 1."

msgid "Finding linear vertices"
msgstr "Encontrando vértices lineales"

msgid "The degree of a linear vertex is 2."
msgstr "El grado de un vértice lineal es 2."

msgid "If there is a vertices table already built using the ``pgr_extractVertices``"
msgstr "Cuando hay una tabla de vértices construida usando ``pgr_extractVertices``"

msgid ":doc:`pgr_extractVertices`"
msgstr ":doc:`pgr_extractVertices`"

msgid "``pgr_depthFirstSearch`` - Proposed"
msgstr "``pgr_depthFirstSearch`` - Propusto"

msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected."
msgstr "``pgr_depthFirstSearch`` — Devuelve un recorrido de búsqueda de profundidad del grafo. El grafo puede ser dirigido o no dirigido."

msgid "Version 3.3.0"
msgstr "Versión 3.3.0"

msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited."
msgstr "El algoritmo de Primera Búsqueda de Profundidad es un algoritmo de recorrido que comienza desde un vértice raíz, va lo más profundo posible y retrocede una vez que se alcanza un vértice sin vértices adyacentes o con todos los vértices adyacentes visitados. El recorrido continúa hasta que se visitan todos los vértices accesibles desde el vértice raíz."

msgid "The implementation works for both **directed** and **undirected** graphs."
msgstr "La implementación funciona para los grafos **dirigidos** y **no dirigidos**."

msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices."
msgstr "Proporciona el recorrido de Búsqueda de Primero Profundidad desde un vértice raíz o desde un conjunto de vértices raíz."

msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth."
msgstr "Un parámetro opcional de profundidad máxima no negativo para limitar los resultados hasta una profundidad particular."

msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored."
msgstr "Para fines de optimización, se omiten los valores duplicados en los `Root vids`."

msgid "It does not produce the shortest path from a root vertex to a target vertex."
msgstr "No produce la ruta más corta desde un vértice de origen a un vértice de destino."

msgid "The aggregate cost of traversal is not guaranteed to be minimal."
msgstr "No se garantiza que el coste agregado del recorrido sea mínimo."

msgid "The returned values are ordered in ascending order of `start_vid`."
msgstr "Los valores devueltos se ordenan en orden ascendente de `start_vid`."

msgid "Depth First Search Running time: :math:`O(E + V)`"
msgstr "Tiempo de ejecución de la Primera Búsqueda de Profundidad: :math:`O(E + V)`"

msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])"
msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raíz**, [**opciones**])"

msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])"
msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raices**, [**opciones**])"

msgid "**options:** ``[directed, max_depth]``"
msgstr "**opcionales:** ``[directed, max_depth]``"

msgid "Same as `Single vertex`_ but with edges in descending order of ``id``."
msgstr "Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``."

msgid "`Boost: Depth First Search <https://www.boost.org/libs/graph/doc/depth_first_search.html>`__"
msgstr "`Boost: Primera Búsqueda de Profundidad <https://www.boost.org/libs/graph/doc/depth_first_search.html>`__"

msgid "`Boost: Undirected DFS <https://www.boost.org/libs/graph/doc/undirected_dfs.html>`__"
msgstr "`Boost: DFS No dirigido <https://www.boost.org/libs/graph/doc/undirected_dfs.html>`__"

msgid "`Wikipedia: Depth First Search algorithm <https://en.wikipedia.org/wiki/Depth-first_search>`__"
msgstr "'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad <https://en.wikipedia.org/wiki/Depth-first_search>`__"

msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm."
msgstr "``pgr_dijkstra`` - Camino más corto utilizando el algoritmo de Dijkstra."

msgid "Version 3.5.0"
msgstr "Versión 3.5.0"

msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns."
msgstr "pgr_dijkstra(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``."

msgid "pgr_dijkstra(One to Many) added ``end_vid`` column."
msgstr "pgr_dijkstra(Uno a Muchos) ha añadido la columna ``end_vid``."

msgid "pgr_dijkstra(Many to One) added ``start_vid`` column."
msgstr "pgr_dijkstra(Muchos a Uno) ha añadido la columna ``start_vid``."

msgid "Version 3.1.0"
msgstr "Versión 3.1.0"

msgid "pgr_dijkstra(Combinations)"
msgstr "pgr_dijkstra(Combinaciones)"

msgid "Version 2.2.0"
msgstr "Version 2.2.0"

msgid "pgr_dijkstra(One to Many)"
msgstr "pgr_dijkstra(Uno a Muchos)"

msgid "pgr_dijkstra(Many to One)"
msgstr "pgr_dijkstra(Muchos a Uno)"

msgid "pgr_dijkstra(Many to Many)"
msgstr "pgr_dijkstra(Muchos a Muchos)"

msgid "Signature change on pgr_dijkstra(One to One)"
msgstr "Cambio de firma en pgr_dijkstra(Uno a Uno)"

msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**"
msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**"

msgid "The examples of this section are based on the :doc:`sampledata` network."
msgstr "Los ejemplos de esta sección se basan en la red :doc:`sampledata`."

msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns"
msgstr "Para grafos **dirigidos** con columnas ``cost`` and ``reverse_cost``"

msgid "Directed graph with cost and reverse cost columns"
msgstr "Grafo dirigido con columnas de costo y costo de regreso"

msgid "1) Path from :math:`6` to :math:`10`"
msgstr "1) Ruta de :math:`6` a :math:`10`"

msgid "2) Path from :math:`6` to :math:`7`"
msgstr "2) Ruta de :math:`6` a :math:`7`"

msgid "3) Path from :math:`12` to :math:`10`"
msgstr "3) Ruta de :math:`12` a :math:`10`"

msgid "4) Path from :math:`12` to :math:`7`"
msgstr "4) Ruta de :math:`12` a :math:`7`"

msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2"
msgstr "5) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 1 y 2"

msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`"
msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}`"

msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4"
msgstr "6) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 2 y 4"

msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`"
msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{7\\}`"

msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4"
msgstr "7) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 1 y 4"

msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`"
msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`"

msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3"
msgstr "8) Usando `Combinaciones`_ para obtener la solución de los ejemplos 1 a 3"

msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`"
msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`"

msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns"
msgstr "Para grafos **no dirigidos** con columnas ``cost`` y ``reverse_cost``"

msgid "Undirected graph with cost and reverse cost columns"
msgstr "Grafo no dirigido con columnas de costo y costo de regreso"

msgid "9) Path from :math:`6` to :math:`10`"
msgstr "9) Ruta de :math:`6` a :math:`10`"

msgid "10) Path from :math:`6` to :math:`7`"
msgstr "10) Ruta de :math:`6` a :math:`7`"

msgid "11) Path from :math:`12` to :math:`10`"
msgstr "11) Ruta de :math:`12` a :math:`10`"

msgid "12) Path from :math:`12` to :math:`7`"
msgstr "12) Ruta de :math:`12` a :math:`7`"

msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10"
msgstr "13) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 9 y 10"

msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12"
msgstr "14) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 10 y 12"

msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12"
msgstr "15) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 9 y 12"

msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11"
msgstr "16) Usando `Combinaciones`_ para obtener la solución de los ejemplos 9 a 13"

msgid "For **directed** graphs only with ``cost`` column"
msgstr "Para grafos **dirigidos** con columna``cost``"

msgid "Directed graph only with cost column"
msgstr "Grafo dirigido con solo la columna costo"

msgid "17) Path from :math:`6` to :math:`10`"
msgstr "17) Ruta de :math:`6` a :math:`10`"

msgid "18) Path from :math:`6` to :math:`7`"
msgstr "18) Ruta de :math:`6` a :math:`7`"

msgid "19) Path from :math:`12` to :math:`10`"
msgstr "19) Ruta de :math:`12` a :math:`10`"

msgid "20) Path from :math:`12` to :math:`7`"
msgstr "20) Ruta de :math:`12` a :math:`7`"

msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18"
msgstr "21) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 17 y 18"

msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20"
msgstr "22) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 18 y 20"

msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20"
msgstr "23) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 17 y 20"

msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19"
msgstr "24) Usando `Combinaciones`_ para obtener la solución de los ejemplos 17 a 19"

msgid "For **undirected** graphs only with ``cost`` column"
msgstr "Para grafos **no dirigidos** con columna``cost``"

msgid "Undirected graph only with cost column"
msgstr "Grafo no dirigido con solo la columna costo"

msgid "25) Path from :math:`6` to :math:`10`"
msgstr "25) Ruta de :math:`6` a :math:`10`"

msgid "26) Path from :math:`6` to :math:`7`"
msgstr "26) Ruta de :math:`6` a :math:`7`"

msgid "27) Path from :math:`12` to :math:`10`"
msgstr "27) Ruta de :math:`12` a :math:`10`"

msgid "28) Path from :math:`12` to :math:`7`"
msgstr "28) Ruta de :math:`12` a :math:`7`"

msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26"
msgstr "29) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 25 y 26"

msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28"
msgstr "30) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 26 y 28"

msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28"
msgstr "31) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 25 y 28"

msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27"
msgstr "32) Usando `Combinaciones`_ para obtener la solución de los ejemplos 25 a 27"

msgid "Equvalences between signatures"
msgstr "Equivalencias entre firmas"

msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`"
msgstr "Los siguientes ejemplos son para la ruta :math:`\\{6\\}\\rightarrow\\{10\\}`"

msgid "33) Using `One to One`_"
msgstr "33) Usando `Uno a Uno`_"

msgid "34) Using `One to Many`_"
msgstr "34) Usando `Uno a Muchos`_"

msgid "35) Using `Many to One`_"
msgstr "35) Usando `Muchos a Uno`_"

msgid "36) Using `Many to Many`_"
msgstr "36) Usando `Muchos a Muchos`_"

msgid "37) Using `Combinations`_"
msgstr "37) Usando `Combinaciones`_"

msgid "`Boost: Dijkstra shortest paths <https://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html>`__"
msgstr "`Boost: Camino mas corto Dijkstra <https://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html>`__"

msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"

msgid "``pgr_dijkstraCost``"
msgstr "``pgr_dijkstraCost``"

msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm."
msgstr "``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el algoritmo de Dijkstra."

msgid "pgr_dijkstraCost(Combinations)"
msgstr "pgr_dijkstraCost(Combinaciones)"

#, fuzzy
msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm."
msgstr "La función ``pgr_dijkstraCost`` suma el coste del camino más corto utilizando el Algoritmo de Dijkstra."

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_dijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "``pgr_dijkstraCostMatrix``"
msgstr "``pgr_dijkstraCostMatrix``"

msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`."
msgstr "``pgr_dijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_dijkstra`."

msgid "Using Dijkstra algorithm, calculate and return a cost matrix."
msgstr "Utilizando el algoritmo Dijkstra, calcula y devuelve una matriz de costes."

msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])"
msgstr "pgr_dijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])"

msgid "``pgr_dijkstraNear``"
msgstr "``pgr_dijkstraNear``"

msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex."
msgstr "``pgr_dijkstraNear`` — Utilizando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano."

msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex."
msgstr "Dado un grafo, un vértice inicial y un conjunto de vértices finales, esta función encuentra la ruta más corta desde el vértice inicial hasta el vértice final más cercano."

msgid "Uses Dijkstra algorithm."
msgstr "Utiliza el algoritmo Dijkstra."

msgid "Works for **directed** and **undirected** graphs."
msgstr "Funciona para grafos **dirigidos** y **no dirigidos**."

msgid "When there are more than one path to the same vertex with same cost:"
msgstr "Cuando hay más de una ruta al mismo vértice con el mismo coste:"

msgid "The algorithm will return just one path"
msgstr "El algoritmo devolverá solo una ruta"

msgid "Optionally allows to find more than one path."
msgstr "Opcionalmente permite encontrar más de una ruta."

msgid "When more than one path is to be returned:"
msgstr "Cuando se va a devolver más de una ruta:"

msgid "Results are sorted in increasing order of:"
msgstr "Los resultados se ordenan en orden creciente de:"

msgid "aggregate cost"
msgstr "costo agregado"

msgid "Within the same value of aggregate costs:"
msgstr "Dentro del mismo valor de los costes agregados:"

msgid "results are sorted by (source, target)"
msgstr "los resultados se ordenan por (fuente, destino)"

msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`"
msgstr "Tiempo de ejecución: Dijkstra tiempo de ejecución: :math:`drt = O((|E| + |V|)log|V|)`"

msgid "One to Many; :math:`drt`"
msgstr "Uno a Muchos; :math:`drt`"

msgid "Many to One: :math:`drt`"
msgstr "Muchos a Uno: :math:`drt`"

msgid "Many to Many: :math:`drt * |Starting vids|`"
msgstr "Muchos a Muchos: :math:`drt * |Starting vids|`"

msgid "Combinations: :math:`drt * |Starting vids|`"
msgstr "Combinaciones: :math:`drt * |Starting vids|`"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])"

msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])"

msgid "**options A:** ``[directed, cap]``"
msgstr "**opciones A:** ``[directed, cap]``"

msgid "**options B:** ``[directed, cap, global]``"
msgstr "**opciones B:** ``[directed, cap, global]``"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])"

msgid "**options:** ``[directed, cap]``"
msgstr "**opcionales:** ``[directed, cap]``"

msgid "Departing on car from vertex :math:`6` find the nearest subway station."
msgstr "Saliendo en coche desde el vértice :math:`6` encontrar la estación de metro más cercana."

msgid "Using a **directed** graph for car routing."
msgstr "Usando un grafo **dirigido** para el ruteo de automóviles."

msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`"
msgstr "Las estaciones de metro se encuentran en los siguientes vértices :math:`\\{1, 10, 11\\}`"

msgid "The defaults used:"
msgstr "Los valores predeterminados utilizados:"

msgid "`directed => true`"
msgstr "`directed => true`"

msgid "`cap => 1`"
msgstr "`cap => 1`"

msgid "The result shows that station at vertex :math:`11` is the nearest."
msgstr "El resultado muestra que la estación en el vértice :math:`11` es la más cercana."

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])"

msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`"
msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`2`"

msgid "On line `4`: using the positional parameter: `directed` set to ``true``"
msgstr "En la línea `4`: utilizando el parámetro posicional: `directed` configurado en ``true``"

msgid "In line `5`: using named parameter `cap => 2`"
msgstr "En la línea `5`: usando el parámetro con nombre `cap => 2`"

msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`."
msgstr "El resultado muestra que la estación en el vértice :math:`10` es la más cercana y la siguiente mejor es :math:`11`."

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])"

msgid "**options:** ``[directed, cap, global]``"
msgstr "**opcionales:** ``[directed, cap, global]``"

msgid "Find the best pedestrian connection between two lines of buses"
msgstr "Encuentra la mejor conexión peatonal entre dos líneas de autobuses"

#, fuzzy
msgid "Using an **undirected** graph for pedestrian routing"
msgstr "Usando un grafo **no dirigido** para el ruteo de peatones"

msgid "The first subway line stations are at :math:`\\{15, 16\\}`"
msgstr "Las estaciones de la primera línea de metro están en :math:`\\{15, 16\\}`"

msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`"
msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{1, 10, 11\\}`"

msgid "On line `4`: using the named parameter: `directed => false`"
msgstr "En la línea `4`: utilizando el parámetro con nombre: `directed => false`"

msgid "`global => true`"
msgstr "`global => true`"

msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line."
msgstr "Para un peatón la mejor conexión es subir/bajar en el vértice :math:`15` de la primera línea de metro y en el vértice :math:`10` de la segunda línea de metro."

msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``"
msgstr "Solo se devuelve `una` ruta porque `global` es ``true`` y `cap` es ``1``"

msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])"

msgid "Find the best car connection between all the stations of two subway lines"
msgstr "Encuentra la mejor conexión de coche entre todas las estaciones de dos líneas de metro"

msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`"
msgstr "Las estaciones de la primera línea de metro están en :math:`\\{1, 10, 11\\}`"

msgid "The second subway line stations are at :math:`\\{15, 16\\}`"
msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{15, 16\\}`"

msgid "The combinations contents:"
msgstr "El contenido de las combinaciones:"

msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line"
msgstr "líneas `3~4` establece los vértices de inicio de la primera línea de metro y los vértices finales de la segunda línea de metro"

msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line"
msgstr "la línea `6~7` establecen los vértices de inicio de la primera línea de metro y los vértices finales de la primera línea de metro"

msgid "On line `8`: using the named parameter is `global => false`"
msgstr "En la línea `8`: usando el parámetro con nombre `global => false`"

msgid "From the results:"
msgstr "A partir de los resultados:"

msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:"
msgstr "haciendo una conexión desde la primera línea de metro :math:`\\{1, 10, 11\\}` a la segunda :math:`\\{15, 16\\}`:"

msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`"
msgstr "Las mejores conecciones de todas las estaciones desde la primera línea son: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`"

msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)"
msgstr "La mejor es:math:`(11 \\rightarrow 16)` con un costo de :math:`1` (líneas: `11` y `12`)"

msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:"
msgstr "haciendo una conexión desde la segunda línea de metro :math:`\\{15, 16\\}` a la primera :math:`\\{1, 10, 11\\}`:"

msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`"
msgstr "Las mejores conecciones de todas las estaciones desde la segunda línea son: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`"

#, fuzzy
msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)"
msgstr "Ambas son igualmente buenas, como también tienen el mismo costo. (lines: `13` and `14` and lines: `15` and `16`)"

msgid "Dijkstra optional parameters"
msgstr "Parámetros opcionales de Dijkstra"

msgid "Near optional parameters"
msgstr "Parámetros opcionales de Cercanía"

msgid "``cap``"
msgstr "``cap``"

msgid "Find at most ``cap`` number of nearest shortest paths"
msgstr "Encuentra como máximo el número ``cap`` de los caminos más cortos y más cercanos"

msgid "``global``"
msgstr "``global``"

msgid "When ``true``: only ``cap`` limit results will be returned"
msgstr "Cuando ``true``: solo se devolverán los resultados del límite ``cap``"

msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned"
msgstr "Cuando ``false``: ``cap`` límite por ``Start vid`` será devuelto"

msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"

msgid "``pgr_dijkstraNearCost``"
msgstr "``pgr_dijkstraNearCost``"

msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex."
msgstr "``pgr_dijkstraNearCost`` — Usando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano."

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos*, [**opciones**])"

msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`"
msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`6`"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])"

msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)"
msgstr "La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: `1`)"

#, fuzzy
msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)"
msgstr "Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and `13`)"

msgid "``pgr_dijkstraVia``"
msgstr "``pgr_dijkstraVia``"

msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices."
msgstr "``pgr_dijkstraVia`` - Ruta que recorre una lista de vértices."

msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`."
msgstr "Dada una lista de vértices y un grafo, esta función equivale a encontrar el camino más corto entre :math:`vértice_i` y :math:`vértice_{i+1}` para todo :math:`i < tamaño\\_de(vía\\;vértices)`."

msgid "Route"
msgstr "Ruta"

msgid "is a sequence of paths."
msgstr "es una secuencia de trayectorias."

msgid "Path"
msgstr "Ruta"

msgid "is a section of the route."
msgstr "es una sección de la ruta."

msgid "One Via"
msgstr "Una Vía"

msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])"
msgstr "pgr_dijkstraVia(`SQL de aristas`_, **vértices**, [**opciones**])"

msgid "**options:** ``[directed, strict, U_turn_on_edge]``"
msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``"

msgid "Returns set of |via-result|"
msgstr "Regresa el conjunto de |via-result|"

msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph."
msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido."

msgid "Via optional parameters"
msgstr "Parámetros opcionales Vía"

msgid "When ``true`` departing from a visited vertex will not try to avoid"
msgstr "Cuando ``true`` saliendo desde un vértice visitado no intentara esquivarlo"

msgid "Identifier of a path. Has value **1** for the first path."
msgstr "Identificador del camino. Tiene valor **1** para el primer camino."

msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence."
msgstr "Identificador de la arsita utilizada para ir del ``node`` al siguiente nodo de la secuencia de ruta."

msgid "-1 for the last node of the path."
msgstr "-1 para el último nodo de la ruta."

msgid "-2 for the last node of the route."
msgstr "-2 para el último nodo de la ruta."

msgid "``route_agg_cost``"
msgstr "``route_agg_cost``"

msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``."
msgstr "Costo total desde ``start_vid`` en ``seq = 1`` hasta ``end_vid`` del ``seq`` actual."

msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph."
msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo **dirigido**."

msgid "The main query"
msgstr "La consulta principal"

msgid "Aggregate cost of the third path."
msgstr "Costo agregado de la tercera ruta."

msgid "Route's aggregate cost of the route at the end of the third path."
msgstr "Costo agregado al final de la tercera ruta."

msgid "Nodes visited in the route."
msgstr "Nodos visitados en la ruta."

msgid "The aggregate costs of the route when the visited vertices are reached."
msgstr "Costo agregado de la ruta al llegar a los vértices visitados."

msgid "Status of \"passes in front\" or \"visits\" of the nodes."
msgstr "Estado de \"pasa enfrente\" o \"visita\" los nodos."

msgid ":doc:`via-category`."
msgstr ":doc:`via-category`."

msgid ":doc:`dijkstra-family`."
msgstr ":doc:`dijkstra-family`."

msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node."
msgstr "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de inicio."

msgid "pgr_drivingDistance(Single vertex)"
msgstr "pgr_drivingDistance(Vértice único)"

msgid "Added ``depth`` and ``start_vid`` result columns."
msgstr "Agregado las columnas de resultados``depth`` y ``start_vid``."

msgid "pgr_drivingDistance(Multiple vertices)"
msgstr "pgr_drivingDistance(Múltiples vértices)"

msgid "Result column name change: ``from_v`` to ``start_vid``."
msgstr "Cambio de nombre en la columna de resultados: ``from_v`` a ``start_vid``."

msgid "Added ``depth`` and ``pred`` result columns."
msgstr "Agregado las columnas de resultados``depth`` y ``pred``."

msgid "Signature change:"
msgstr "Cambio de firma:"

msgid "pgr_drivingDistance(single vertex)"
msgstr "pgr_drivingDistance(vértice único)"

msgid "New official signature:"
msgstr "Nueva firma oficial:"

msgid "pgr_drivingDistance(multiple vertices)"
msgstr "pgr_drivingDistance(múltiples vértices)"

#, fuzzy
msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree."
msgstr "Usando el algoritmo Dijkstra, se extraen todos los nodos que tienen costes menores o iguales al valor ``distance``. Los bordes extraídos se ajustarán al árbol de expansión correspondiente."

msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])"
msgstr "pgr_drivingDistance(`SQL de aristas`_, **Raíz**, **distancia**, [``directed``])"

msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])"
msgstr "pgr_drivingDistance(`SQL de aristas`_, **raices**, **distancia**, [**opciones**])"

msgid "**options:** [directed, equicost]"
msgstr "**opcionales:** [directed, equicost]"

msgid "Single Vertex"
msgstr "Vértice Único"

msgid "From vertex :math:`11` for a distance of :math:`3.0`"
msgstr "Desde el vértice :math:`11` por una distancia de :math:`3.0`"

msgid "Multiple Vertices"
msgstr "Múltiples Vértices"

msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph"
msgstr "Desde los vertices :math:`\\{11, 16\\}` por una distancia de :math:`3.0` con equi-cost en un grafo dirigido"

msgid "Driving distance optional parameters"
msgstr "Parámetros opcionales de distancia de manejo"

msgid "``equicost``"
msgstr "``equicost``"

msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary."
msgstr "Cuando ``true`` el nodo solo aparece en la lista más cercana a ``start_vid``. Empates son rotos arbitrareamente."

msgid "When ``false`` which resembles several calls using the single vertex signature."
msgstr "Cuando ``false`` se asemeja a varias llamadas usando la firma de vértice único."

msgid "end-before"
msgstr ""

msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph"
msgstr "Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un grafo no dirigido"

msgid "``pgr_edgeColoring`` - Experimental"
msgstr "``pgr_edgeColoring`` - Experimental"

msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs"
msgstr "``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos acíclicos"

msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color."
msgstr "Coloración de arístas es un algoritmo utilizado para colorear aristas para los vértices de un grafo. Es una asignación de colores a las aristas del grafo de tal manera que dos aristas adjacentes no tengan el mismo color."

msgid "The implementation is for **undirected** and **loop-free** graphs"
msgstr "La implementación es para grafos **no dirigidos** sin **auto-ciclos**"

msgid "loop free"
msgstr "Sin auto ciclos"

msgid "no self-loops and no parallel edges."
msgstr "Sin auto ciclos ni aristas paralelas."

msgid "Provides the color to be assigned to all the edges present in the graph."
msgstr "Provee el color asignado a todas las aristas existentes en el grafo."

msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph."
msgstr "A lo más :math:`\\Delta + 1` colores son usados, donde :math:`\\Delta` is el grado del grafo."

msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others."
msgstr "Esto es óptimo para algunos gráfos. y por el teorema de Vizing, utiliza a lo más un color extra que el óptimo para todos los demás."

msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)"
msgstr "el número cromático :math:`x'(G)` (número mínimo de colores necesarios para colorear correctamente las aristas del grafo) es igual al grado :math:`\\Delta + 1` del grafo, (:math:`x'(G) = \\Delta`)"

msgid "The algorithm tries to assign the least possible color to every edge."
msgstr "El algoritmo trata de asignar el menor color a cada arista."

msgid "Does not always produce optimal coloring."
msgstr "No produce siempre produce la coloración ótpima."

msgid "The returned rows are ordered in ascending order of the edge identifier."
msgstr "Las filas de resultados son ordenados ascendentemente respecto al identificador de la arista."

msgid "Efficient graph coloring is an NP-Hard problem, and therefore:"
msgstr "Coloración eficiente de un grafo es un problema NP-Duro, por lo que:"

msgid "In this implelentation the running time: :math:`O(|E|*|V|)`"
msgstr "El tiempo de ejecución de esta implementación es: :math:`O(|E|*|V|)`"

msgid "where :math:`|E|` is the number of edges in the graph,"
msgstr "donde :math:`|E|` es la cantidad de arístas en el grafo,"

msgid ":math:`|V|` is the number of vertices in the graph."
msgstr ":math:`|V|` es la cantidad de vertices del grafo."

msgid "pgr_edgeColoring(`Edges SQL`_)"
msgstr "pgr_edgeColoring(`SQL de aristas`_)"

msgid "Graph coloring of pgRouting :doc:`sampledata`"
msgstr "Coloración de grafos de pgRouting :doc:`sampledata`"

msgid "`Boost: Edge Coloring <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"
msgstr "`Boost: Coloración de Segmentos <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"

msgid "`Wikipedia: Graph coloring <https://en.wikipedia.org/wiki/Graph_coloring>`__"
msgstr "`Wikipedia: Coloración de grafos <https://en.wikipedia.org/wiki/Graph_coloring>`__"

msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices."
msgstr "``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas entre dos grupos de vértices."

msgid "pgr_edgeDisjointPaths(Combinations)"
msgstr "pgr_edgeDisjointPaths(Combinaciones)"

msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths."
msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices. Utiliza algoritmos de flujo máximo subyacentes para calcular las rutas."

msgid "The main characterics are:"
msgstr "Los principales características son:"

msgid "Calculates the edge disjoint paths between any two groups of vertices."
msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices cualquiera."

msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached."
msgstr "Devuelve un conjunto vacío EMPTY SET cuando el origen y el destino son los mismos o no se puede llegar."

msgid "The graph can be directed or undirected."
msgstr "El gráfico puede dirigido o no."

msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths."
msgstr "Utiliza :doc:`pgr_boykovKolmogorov` para calcular las rutas."

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph."
msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}` en un grafo no dirigido."

msgid "Manually assigned vertex combinations on an undirected graph."
msgstr "Asignando manualmente las combinaciones de vértices en un grafo no dirigido."

msgid "``pgr_edmondsKarp``"
msgstr "``pgr_edmondsKarp``"

msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm."
msgstr "``pgr_edmondsKarp`` — Calcula el flujo en las aristas del grafo que maximizan el flujo de las fuentes a los destinos usando el algoritmo de Edmonds Karp."

msgid "pgr_edmondsKarp(Combinations)"
msgstr "pgr_edmondsKarp(Combinaciones)"

msgid "Renamed from ``pgr_maxFlowEdmondsKarp``"
msgstr "Renombrado desde ``pgr_maxFlowEdmondsKarp``"

msgid "Running time: :math:`O( V * E ^ 2)`"
msgstr "Tiempo de ejecución: :math:`O( V * E ^ 2)`"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destino**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destinos**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destino**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "`Boost: Edmonds Karp max flow <https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html>`__"
msgstr "`Boost: Edmonds Karp max flow <https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html>`__"

msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm"
msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm"

msgid "``pgr_edwardMoore`` - Experimental"
msgstr "``pgr_edwardMoore`` - Experimental"

msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm."
msgstr "``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-Moore."

msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time."
msgstr "Algoritmo de Edward Moore es una mejora del algoritmo Bellman-Ford. Puede calcular las rutas más cortas desde un único vértice de origen a todos los demás vértices de un grafo dirigido ponderado. La principal diferencia entre algoritmo de Edward Moore y algoritmo de Bellman Ford radica en el tiempo de ejecución."

msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed."
msgstr "El peor de los casos de funcionamiento del algoritmo es :math:`O(| V | * | E |)` similar a la complejidad temporal del algoritmo Bellman-Ford. Sin embargo, los experimentos sugieren que este algoritmo tiene una complejidad de tiempo de ejecución promedio de :math:`O( | E | )` para grafos aleatorios. Esto es significativamente más rápido en términos de velocidad de cálculo."

msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm"
msgstr "Por lo tanto, el algoritmo es, en el mejor de los casos, significativamente más rápido que el algoritmo Bellman-Ford y es en el peor de los casos, tan bueno como el algoritmo Bellman-Ford"

msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`"
msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es :math:`0`"

msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored."
msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`."

msgid "Running time:"
msgstr "Tiempo de ejecución:"

msgid "Worst case: :math:`O(| V | * | E |)`"
msgstr "Peor caso: :math:`O(| V | * | E |)`"

msgid "Average case: :math:`O( | E | )`"
msgstr "Caso promedio: :math:`O( | E | )`"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destino**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])"

msgid "Using a combinations table on an **undirected** graph."
msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**."

msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm"
msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm"

msgid "``pgr_extractVertices``"
msgstr "``pgr_extractVertices``"

msgid "``pgr_extractVertices`` — Extracts the vertices information"
msgstr "``pgr_extractVertices`` — Extrae la información de los vértices"

msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph."
msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo."

msgid "When the edge identifier is given, then it will also calculate the in and out edges"
msgstr "Cuando se proporciona el identificador de arista, también se calcularán las aristas de entrada y salida"

msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])"
msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])"

msgid "RETURNS SETOF |result-extract|"
msgstr "REGRESA CONJUNTO DE |result-extract|"

msgid "When line geometry is known"
msgstr "Cuando se conoce la geometría de línea"

msgid "(Optional) identifier of the edge."
msgstr "(Opcional) identificador de la arista."

msgid "``geom``"
msgstr "``geom``"

msgid "``LINESTRING``"
msgstr "``LINESTRING``"

msgid "Geometry of the edge."
msgstr "Geometría de la arista."

msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears."
msgstr "Esta consulta interna tiene prioridad sobre las dos consultas internas siguientes, por lo que se omiten otras columnas cuando aparece la columna ''geom''."

msgid "Ignored columns:"
msgstr "Columnas ignoradas:"

msgid "``startpoint``"
msgstr "``startpoint``"

msgid "``endpoint``"
msgstr "``endpoint``"

msgid "When vertex geometry is known"
msgstr "Cuando se conoce la geometría de vértices"

msgid "To use this inner query the column ``geom`` should not be part of the set of columns."
msgstr "Para utilizar esta consulta interna, la columna ``geom`` no debe formar parte del conjunto de columnas."

msgid "``POINT``"
msgstr "``POINT``"

msgid "POINT geometry of the starting vertex."
msgstr "Geometría POINT del vértice inicial."

msgid "POINT geometry of the ending vertex."
msgstr "Geometría POINT del vértice final."

msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears."
msgstr "Esta consulta interna tiene prioridad sobre la siguiente consulta interna, por lo que otras columnas son ignoradas cuando aparecen las columnas ``startpoint`` y ``endpoint``."

msgid "When identifiers of vertices are known"
msgstr "Cuando se conocen identificadores de vértices"

msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns."
msgstr "Para utilizar esta consulta interna, las columnas ``geom``, ``startpoint`` y ``endpoint`` no deben formar parte del conjunto de columnas."

msgid "``NULL`` When the ``id`` is not part of the inner query"
msgstr "``NULL`` When the ``id`` no forma parte de la consulta interna"

msgid "X value of the point geometry"
msgstr "Valor X de la geometría del punto"

msgid "``NULL`` When no geometry is provided"
msgstr "``NULL`` Cuando no se proporciona geometría"

msgid "Geometry of the point"
msgstr "Geometría del punto"

msgid "To get the query generated used to get the vertex information, use ``dryrun := true``."
msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilice ``dryrun := true``."

msgid "Create a routing topology"
msgstr "Creación de una topología de ruteo"

msgid "Make sure the database does not have the ``vertices_table``"
msgstr "Asegurarse de que la base de datos no tiene ``vertices_table``"

msgid "Clean up the columns of the routing topology to be created"
msgstr "Limpieza de las columnas de la topología de ruteo que se creará"

msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, <SRID>)``"
msgstr "Cuando ``LINESTRING`` tiene un SRID entonces usa ``geom::geometry(POINT, <SRID>)``"

msgid "For big edge tables that are been prepared,"
msgstr "Para grandes tablas de aristas que han sido preparadas,"

msgid "Create it as ``UNLOGGED`` and"
msgstr "Crearlo como ``UNLOGGED`` y"

msgid "After the table is created ``ALTER TABLE .. SET LOGGED``"
msgstr "Después de crear la tabla ``ALTER TABLE .. SET LOGGED``"

msgid "Inspect the vertices table"
msgstr "Inspeccionar la tabla de vértices"

msgid "Create the routing topology on the edge table"
msgstr "Creación de la topología de ruteo en la tabla de aristas"

msgid "Updating the ``source`` information"
msgstr "Actualizar de la información de ``source``"

msgid "Updating the ``target`` information"
msgstr "Actualización de la información de ``target``"

msgid "Inspect the routing topology"
msgstr "Inspección de la topología de ruteo"

msgid "**Generated topology**"
msgstr "**Topología generada**"

msgid "``pgr_findCloseEdges``"
msgstr "``pgr_findCloseEdges``"

msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry."
msgstr "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría puntual."

msgid "``partial`` option is removed."
msgstr "Opción ``partial`` se elimina."

msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry."
msgstr "``pgr_findCloseEdges`` - Función de utilidad que encuentra la arista más cercana a una geometría de puntos."

msgid "The geometries must be in the same coordinate system (have the same SRID)."
msgstr "Las geometrías deben estar en el mismo sistema de coordenadas (tener el mismo SRID)."

msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application."
msgstr "El código para realizar los cálculos puede obtenerse para realizar los ajustes específicos que necesite la aplicación."

msgid "``EMPTY SET`` is returned on dryrun executions"
msgstr "``EMPTY SET`` se devuelve en ejecuciones en seco"

msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])"
msgstr "pgr_findCloseEdges(`Edges SQL`_, **punto**, **tolerancia**, [**options**])"

msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])"
msgstr "pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])"

msgid "**options:** ``[cap, dryrun]``"
msgstr "**opciones:** ``[cap, dryrun]``"

msgid "Returns set of |result-find|"
msgstr "Regresa conjunto de |result-find|"

msgid "One point"
msgstr "Un punto"

msgid "Get two close edges to points of interest with :math:`pid = 5`"
msgstr ""

msgid "``cap => 2``"
msgstr "``cap => 2``"

msgid "Many points"
msgstr "Muchos puntos"

msgid "For each points of interests, find the closest edge."
msgstr ""

msgid "**point**"
msgstr "**punto**"

msgid "The point geometry"
msgstr "La geometría del punto"

msgid "**points**"
msgstr "**puntos**"

msgid "``POINT[]``"
msgstr "``POINT``"

msgid "An array of point geometries"
msgstr "Una matriz de geometrías de puntos"

msgid "**tolerance**"
msgstr "**tolerancia**"

msgid "Max distance between geometries"
msgstr "Distancia máxima entre geometrías"

msgid "Limit output rows"
msgstr "Limitar las filas de salida"

msgid "When ``false`` calculations are performed."
msgstr "Cuando ``false`` se realizan los cálculos."

msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``."
msgstr "Cuando ``true`` los cálculos no se realizan y la consulta para hacer los cálculos se expone en un ``NOTICE`` de PostgreSQL."

msgid "``geometry``"
msgstr "``geometry``"

msgid "The ``LINESTRING`` geometry of the edge."
msgstr "La geometría ``LINESTRING`` de la arista."

msgid "When :math:`cap = 1`, it is the closest edge."
msgstr "Cuando :math:`cap = 1`, es la arista más cercana."

msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge."
msgstr "Valor entre <0,1> indica la posición relativa desde el primer punto de la arista."

msgid "Value in ``[r, l]`` indicating if the point is:"
msgstr "Valor en ``[r, l]`` que indica si el punto es:"

msgid "At the right ``r`` of the segment."
msgstr "A la derecha ``r`` del segmento."

msgid "When the point is on the line it is considered to be on the right."
msgstr "Cuando el punto está en la línea se considera que está a la derecha."

msgid "At the left ``l`` of the segment."
msgstr "A la izquierda ``l`` del segmento."

msgid "``distance``"
msgstr "``distance``"

msgid "Distance from the point to the edge."
msgstr "Distancia del punto a la arista."

msgid "Original ``POINT`` geometry."
msgstr "Geometría original ``POINT``."

msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``"
msgstr "Geometría ``LINESTRING`` desde el **punto** original hasta el punto más cercano de la arista con identificador ``edge_id``"

msgid "One point in an edge"
msgstr "Un punto en la arista"

msgid "The green node is the original point."
msgstr "El nodo verde es el punto original."

msgid "``geom`` has the value of the original point."
msgstr "``geom`` Tiene el valor del punto original."

msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge."
msgstr "La geometría ``edge``, es una línea que conecta al punto original con el punto más cercano de la arista :math:`sp \\rightarrow ep`."

msgid "The point is located at the left of the edge."
msgstr "El punto original está situado a la izquierda de la arista."

msgid "One point dry run execution"
msgstr "Ejecución en seco de un punto"

msgid "Using the query from the previous example:"
msgstr "Usando la consulta del ejemplo anterior:"

msgid "Returns ``EMPTY SET``."
msgstr "Devuelve ``CONJUNTO VACÍO``."

msgid "``dryrun => true``"
msgstr "``dryrun => true``"

msgid "Generates a PostgreSQL ``NOTICE`` with the code used."
msgstr "Genera un ``NOTICE`` de PostgreSQL con el código utilizado."

msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID."
msgstr ""

msgid "Many points in an edge"
msgstr "Ejemplos de muchos puntos en una arista"

msgid "The green nodes are the **original points**"
msgstr "Los nodos verdes son los **puntos originales**"

msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**"
msgstr "La geometría ``geom``, marcada como **g1** y **g2** son los **puntos originales**"

msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge."
msgstr "La geometría ``edge``, marcada como **edge1** y **edge2** es una línea que conecta el **punto original** con el punto más cercano de la arista :math:`sp \\rightarrow ep`."

msgid "Many points dry run execution"
msgstr "Ejecución en seco de muchos puntos"

msgid "Do not process query"
msgstr "No procesar la consulta"

msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns"
msgstr "Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular todas las columnas"

msgid "Find at most two routes to a given point"
msgstr "Encontrar como máximo dos rutas a un punto dado"

msgid "Using :doc:`pgr_withPoints`"
msgstr "Usando :doc:`pgr_withPoints`"

msgid "A point of interest table"
msgstr "Una tabla de puntos de interés"

msgid "Handling points outside the graph."
msgstr "Manejo de puntos fuera del gráfico."

msgid "Points of interest"
msgstr "Puntos de interés"

msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest."
msgstr "Algunas veces las aplicaciones trabajan \"sobre la marcha\" comenzando desde una localización que no es un vértice en el grafo. Esas localizaciones, en pgRrouting se llaman puntos de interés."

msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``."
msgstr "La información necesaria en los puntos de interés es ``pid``, ``edge_id``, ``side``, ``fraction``."

msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table."
msgstr "En esta documentación habrá unos 6 puntos de interés fijos y se almacenarán en una tabla."

msgid "A unique identifier."
msgstr "Un identificador único."

msgid "Identifier of the nearest segment."
msgstr "Identificador del segmento mas próximo."

msgid "Is it on the left, right or both sides of the segment ``edge_id``."
msgstr "Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``."

msgid "Where in the segment is the point located."
msgstr "En qué parte del segmento se encuentra el punto."

msgid "The geometry of the points."
msgstr "La geometría de los puntos."

msgid "The distance between ``geom`` and the segment ``edge_id``."
msgstr "La distancia entre ``geom`` y el segmento ``edge_id``."

msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``."
msgstr "Un segmento que conecta la ``geom`` del punto al punto mas cercano al segmento ``edge_id``."

msgid "``newPoint``"
msgstr "``newPoint``"

msgid "A point on segment ``edge_id`` that is the closest to ``geom``."
msgstr ""

msgid "Points of interest fill up"
msgstr "Llenado de puntos de interés"

msgid "Inserting the points of interest."
msgstr "Insertando los puntos de interés."

msgid "Filling the rest of the table."
msgstr "Llenando el resto de la tabla."

msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides."
msgstr ""

msgid "The points of interest:"
msgstr "Los puntos de interés:"

msgid "``pgr_floydWarshall``"
msgstr "``pgr_floydWarshall``"

msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm."
msgstr "``pgr_floydWarshall`` - Devuelve la suma de los costos de la ruta más corta para cada par de nodos en el grafo mediante el algoritmo Floyd-Warshall."

msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time,"
msgstr "El algoritmo Floyd-Warshall, también conocido como algoritmo de Floyd, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos densos*. Usamos la implementación de Boost que se ejecuta en :math:`\\Theta(V^3)` tiempo,"

msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])"
msgstr "pgr_floydWarshall(`SQL de aristas`_, [``directed``])"

msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`."
msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`."

#, fuzzy
msgid "Boost `Floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"
msgstr "Boost `Algoritmo floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"

msgid "``pgr_full_version``"
msgstr "``pgr_full_version``"

msgid "``pgr_full_version`` — Get the details of pgRouting version information."
msgstr "``pgr_full_version`` — Obtener los detalles de la información de la versión de pgRouting."

msgid "Get complete details of pgRouting version information"
msgstr "Obtener los detalles de la información de la versión de pgRouting"

msgid "pgr_full_version()"
msgstr "pgr_full_version()"

msgid "RETURNS |result-version|"
msgstr "REGRESA |result-version|"

msgid "Information about when this documentation was built"
msgstr "Información sobre cuándo se construyó esta documentación"

msgid "``version``"
msgstr "``version``"

msgid "pgRouting version"
msgstr "Versión de pgRouting"

msgid "``build_type``"
msgstr "``build_type``"

msgid "The Build type"
msgstr "El tipo de Compilación"

msgid "``compile_date``"
msgstr "``compile_date``"

msgid "Compilation date"
msgstr "Fecha de compilación"

msgid "``library``"
msgstr "``library``"

msgid "Library name and version"
msgstr "Nombre y versión de la biblioteca"

msgid "``system``"
msgstr "``system``"

msgid "Operative system"
msgstr "Sistema operativo"

msgid "``postgreSQL``"
msgstr "``postgreSQL``"

msgid "pgsql used"
msgstr "pgsql utilizado"

msgid "``compiler``"
msgstr "``compiler``"

msgid "Compiler and version"
msgstr "Compilador y versión"

msgid "``boost``"
msgstr "``boost``"

msgid "Boost version"
msgstr "Versión de Boost"

msgid "``hash``"
msgstr "``hash``"

msgid "Git hash of pgRouting build"
msgstr "Hash de Git de pgRouting"

msgid "``pgr_hawickCircuits`` - Experimental"
msgstr "``pgr_hawickCircuits`` - Experimental"

#, fuzzy
msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm."
msgstr "``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de circutos de Hawick."

msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph."
msgstr "El algoritmo Hawick Circuit fue publicado en 2008 por Ken Hawick y Health A. James. Este algoritmo resuelve el problema de detectar y enumerar circuitos en grafos. Es capaz de enumerar circuitos en grafos con arcos dirigidos, arcos múltiples y autoarcos con una implementación eficiente en memoria y de alto rendimiento. Es una extensión del Algoritmo de Johnson para encontrar todos los circuitos elementales de un grafo dirigido."

msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation."
msgstr "Hay 2 variaciones definidas en la librería Boost Graph. Aquí hemos implementado sólo la segunda, ya que es la más adecuada y práctica. En esta variación obtenemos los circuitos después de filtrar los circuitos causados por aristas paralelas. Los circuitos de aristas paralelas tienen más casos de uso cuando se quiere contar el número de circuitos."

msgid "The algorithm implementation works only for directed graph"
msgstr "La implementación del algoritmo sirve solo para grafos dirigidos"

msgid "It is a variation of Johnson's algorithm for circuit enumeration."
msgstr "Es una variación del algoritmo de Johnson para la enumeración de circuitos."

msgid "The algorithm outputs the distinct circuits present in the graph."
msgstr "El algoritmo da como resultado los distintos circuitos presentes en el grafo."

msgid "Time Complexity: :math:`O((V + E) (c + 1))`"
msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`"

msgid ":math:`|c|` is the number of circuits in the graph."
msgstr ":math:`|c|` es la cantidad de circuitos en el grafo."

msgid "pgr_hawickCircuits(`Edges SQL`_)"
msgstr "pgr_hawickCircuits(`SQL de aristas`_)"

msgid "Circuits present in the pgRouting :doc:`sampledata`"
msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting"

msgid "Id of the circuit starting from ``1``"
msgstr "Identificador del circuito comenzando con ``1``"

#, fuzzy
msgid "Relative position in the path. Has value ``0`` for beginning of the path"
msgstr "Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la ruta"

msgid "Identifier of the starting vertex of the circuit."
msgstr "Identificador del vértice inicial del circuito."

msgid "Identifier of the ending vertex of the circuit."
msgstr "Identificador del vértice final del circuito."

msgid "Identifier of the node in the path from a vid to next vid."
msgstr "Identificador del nodo en la ruta de un vértice al siguiente vértice."

msgid "`Boost: Hawick Circuit Algorithm <https://www.boost.org/doc/libs/1_78_0/libs/graph/doc/hawick_circuits.html>`__"
msgstr "`Boost: Algoritmo de Circutios de Hawick <https://www.boost.org/doc/libs/1_78_0/libs/graph/doc/hawick_circuits.html>`__"

msgid "``pgr_isPlanar`` - Experimental"
msgstr "``pgr_isPlanar`` - Experimental"

msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph."
msgstr "``pgr_isPlanar`` — Devuelve un valor boolean dependiendo de la planaridad del grafo."

msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar."
msgstr "Un grafo es planar si se puede dibujar en un espacio bidimensional sin que se crucen dos de sus aristas. Este dibujo de un grafo planaro es llamado dibujo de plano. Cada grafo planar también admite un dibujo de línea recta, que es un dibujo de plano donde cada arista está representada por un segmento de línea. Cuando un grafo tiene :math:`K_5` or :math:`K_{3,3}` como subgrafo, entonces el grafo no es planar."

msgid "This implementation use the Boyer-Myrvold Planarity Testing."
msgstr "Esta implementación utiliza la Prueba de Planaridad de Boyer-Myrvold."

msgid "It will return a boolean value depending upon the planarity of the graph."
msgstr "Devolverá un valor boolean dependiendo de la planaridad del grrafo."

msgid "Applicable only for **undirected** graphs."
msgstr "Aplicable solo para grafos **no dirigidos**."

msgid "The algorithm does not considers traversal costs in the calculations."
msgstr "El algoritmo no considera los costos transversales en los cálculos."

msgid "Running time: :math:`O(|V|)`"
msgstr "Tiempo de ejecución: :math:`O(|V|)`"

msgid "pgr_isPlanar(`Edges SQL`)"
msgstr "pgr_isPlanar(`SQL de aristas`)"

msgid "RETURNS ``BOOLEAN``"
msgstr "DEVUELVE ``BOOLEAN``"

msgid "Returns a boolean ``(pgr_isplanar)``"
msgstr "Devuelve un valor boolean ``(pgr_isplanar)``"

msgid "``pgr_isplanar``"
msgstr "``pgr_isplanar``"

msgid "`true` when the graph is planar."
msgstr "`true` cuando el grafo es planar."

msgid "`false` when the graph is not planar."
msgstr "`false` cuando el grafo no es planar."

msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph."
msgstr "Las siguientes aristas harán de el subgrafo con los vértices {10, 15, 11, 16, 13} un grafo :math:`K_5`."

msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph."
msgstr "El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las aristas en azul representan el subgrafo :math:`K_5`."

msgid "`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold.html>`__"
msgstr "`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold.html>`__"

msgid "``pgr_johnson``"
msgstr "``pgr_johnson``"

#, fuzzy
msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm."
msgstr "``pgr_johnson`` - Devuelve la suma de los costes de la ruta más corta para cada par de nodos del grafo mediante el algoritmo Floyd-Warshall."

#, fuzzy
msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time,"
msgstr "El algoritmo Johnson, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos dispersos*. Utiliza la implementación del Boost que se ejecuta en :math:`O(V E \\log V)` tiempo,"

msgid "pgr johnson(`Edges SQL`_, [``directed``])"
msgstr "johnson(`SQL de aristas`_ , [``dryrun``])"

msgid "Boost `Johnson <https://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html>`_"
msgstr "Boost `Algoritmo de Johnson <https://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html>`_"

#, fuzzy
msgid "``pgr_kingOrdering`` - Experimental"
msgstr "``pgr_edgeColoring`` - Experimental"

msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph."
msgstr "``pgr_kingOrdering`` - Regresa el ordenamiento King de un grafo no dirigido."

msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth."
msgstr ""

msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings."
msgstr ""

#, fuzzy
msgid "The implementation targets undirected graphs."
msgstr "La implementación es para grafos **no dirigidos**."

msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach."
msgstr ""

#, fuzzy
msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`"
msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`"

#, fuzzy
msgid "where :math:`|E|` is the number of edges,"
msgstr "donde :math:`|V|` es el número de vértices,"

#, fuzzy
msgid ":math:`m` is the maximum degree among all vertices."
msgstr ":math:`m` es el grado máximo de los vértices en el grafo."

#, fuzzy
msgid "pgr_kingOrdering(`Edges SQL`_)"
msgstr "pgr_edgeColoring(`SQL de aristas`_)"

#, fuzzy
msgid "`Boost: King Ordering <https://www.boost.org/libs/graph/doc/king_ordering.html>`__"
msgstr "`Boost: Coloración de Segmentos <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"

msgid "``pgr_kruskal``"
msgstr "``pgr_kruskal``"

msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm."
msgstr "``pgr_kruskal`` — Devuelve el árbol de expansión mínimo del grafo utilizando el algoritmo Kruskal."

msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm."
msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Kruskal."

msgid "EMPTY SET is returned when there are no edges in the graph."
msgstr "EMPTY SET es regresado cuando no hay aristas en el grafo."

msgid "pgr_kruskal(`Edges SQL`_)"
msgstr "pgr_kruskal(`SQL de aristas`_)"

msgid "Returns set of |result-mst|"
msgstr "Regresa el conjunto de |result-mst|"

msgid "Minimum spanning forest"
msgstr "Bosque de expansión mínimo"

msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering."
msgstr "``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo con orden de Primera Búsqueda en Anchura."

msgid "Added ``pred`` result columns."
msgstr "Agregado columna de resultados ``pred``."

msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm."
msgstr "Visita y extrae la información de los nodos en la orden de Primera Búsqueda en Anchura del Árbol de Expansión Mínimo creado con el algoritmo de Kruskal."

msgid "Returned tree nodes from a root vertex are on Breath First Search order"
msgstr "Los nodos de árbol devueltos desde un vértice raíz están en orden de la Primera Búsqueda de Anchura"

msgid "Breath First Search Running time: :math:`O(E + V)`"
msgstr "Tiempo de ejecución de la Primera Búsqueda de Anchura: :math:`O(E + V)`"

msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_kruskalBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])"

msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_kruskalBFS(`SQL de aristas`_, **raices**, [``max_depth``])"

msgid "The Minimum Spanning Tree having as root vertex :math:`6`"
msgstr "El Árbol de Expansión Mínimo que tiene como vértice raíz :math:`6`"

msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`"
msgstr "El Árbol de Expansión Mínimo que comienza en los vértices :math:`\\{9, 6\\}` con ::math:`depth \\leq 3`"

msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm."
msgstr "``pgr_kruskalDD`` — Nodos de captación utilizando el algoritmo de Kruskal."

msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree."
msgstr "Usando el algoritmo de Kruskal, extraerá los nodos que tienen costos agregados menores o iguales a la **distancia** desde un vértice (o vértices) **raíz** dentro del árbol de expansión mínimo calculado."

msgid "Returned tree nodes from a root vertex are on Depth First Search order."
msgstr "Los nodos de árbol devueltos de un vértice raíz están en el orden de Primera Búsqueda de Profundidad."

msgid "Depth First Search running time: :math:`O(E + V)`"
msgstr "Primera Búsqueda de Profundidad, tiempo de ejecución: :math:`O(E + V)`"

msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)"
msgstr "pgr_kruskalDD(`SQL de aristas`_, **raíz**, **distancia**)"

msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)"
msgstr "pgr_kruskalDD(`SQL de aristas`_, **raices**, **distancia**)"

msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`"
msgstr "El mínimo árbol de expansión que comienza en el vértice:math:`6` con :math:`distance \\leq 3.5`"

msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`"
msgstr "El árbol de expansión mínimo que comienza en los vértices :math:`\\{9, 6\\}` con :math:`distance \\leq 3.5`"

msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering."
msgstr "``pgr_kruskalDFS`` — Algoritmo Kruskal para el Árbol de Expansión Mínima con orden de Búsqueda Primero en Profundidad."

msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm."
msgstr "Visita y extrae la información de los nodos en el orden de Búsqueda en Primera Profundidad del Árbol de Expansión Mínima creado con el algoritmo de Kruskal."

msgid "Returned tree nodes from a root vertex are on Depth First Search order"
msgstr "Los nodos de árbol devueltos desde un vértice raíz están en el orden de Primera Búsqueda de Profundidad"

msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])"

msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])"

msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental"
msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimental"

msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices."
msgstr "``pgr_lengauerTarjanDominatorTree`` — Devuelve el dominador inmediato de todos los vértices."

#, fuzzy
msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built."
msgstr "El algoritmo calcula el *dominador inmediato* de cada vértice llamado **idom**, una vez que se calcula la **idom** de cada vértice y, a continuación, haciendo que cada **idom** de cada vértice como su elemento primario, se pueda construir el árbol del dominador."

msgid "The algorithm works in directed graph only."
msgstr "El algoritmo solo funciona en el grafo dirigido."

msgid "The algorithm returns *idom* of each vertex."
msgstr "El algoritmo devuelve *idom* de cada vértice."

msgid "If the *root vertex* not present in the graph then it returns empty set."
msgstr "Si el *vértice raíz* no está presente en el grafo, devuelve un conjunto vacío."

msgid "Running time: :math:`O((V+E)log(V+E))`"
msgstr "Tiempo de ejecución: :math:`O((V+E)log(V+E))`"

msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)"
msgstr "pgr_lengauerTarjanDominatorTree(`SQL de aristas`_, **raíz**)"

msgid "Returns set of |result-idom|"
msgstr "Regresa el conjunto de |result-idom|"

msgid "The dominator tree with root vertex :math:`5`"
msgstr "El árbol dominante con vértice raíz :math:`5`"

msgid "SQL query as described above."
msgstr "Consulta SQL como se describió anteriormente."

msgid "**root vertex**"
msgstr "**vértice raíz**"

msgid "Returns set of ``(seq, vertex_id, idom)``"
msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``"

msgid "``vertex_id``"
msgstr "``vertex_id``"

msgid "Identifier of vertex ."
msgstr "Identificador de vértice."

msgid "``idom``"
msgstr "``idom``"

msgid "Immediate dominator of vertex."
msgstr "Dominador inmediato del vértice."

msgid "Dominator tree of another component."
msgstr "Árbnol dominante de otro componente."

msgid "`Boost: Lengauer-Tarjan dominator <https://www.boost.org/libs/graph/doc/lengauer_tarjan_dominator.htm>`__"
msgstr "`Boost: Árbol dominante Lengauer-Tarjan <https://www.boost.org/libs/graph/doc/lengauer_tarjan_dominator.htm>`__"

msgid "`Wikipedia: dominator tree <https://en.wikipedia.org/wiki/Dominator_(graph_theory)>`__"
msgstr "'Wikipedia: árbol de dominador' <https://en.wikipedia.org/wiki/Dominator_(graph_theory)>`__"

msgid "``pgr_lineGraph`` - Proposed"
msgstr "``pgr_lineGraph`` - Propuesto"

msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph."
msgstr "``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente basado en aristas."

msgid "Works for directed and undirected graphs."
msgstr "Funciona para grafos dirigidos y no dirigidos."

msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:"
msgstr "Dado un grafo :math:`G`, su grafo lineal :math:`L(G)` es un grafo tal que:"

msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`."
msgstr "Cada vértice de :math:`L(G)` representa una arista de :math:`G`."

msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`"
msgstr "Dos vértices de :math:`L(G)` son adyacentes si y sólo si sus aristas correspondientes comparten un punto final común en :math:`G`"

msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge."
msgstr "Las columnas ``cost`` y ``reverse_cost`` del resultado representan la existencia de la arista."

msgid "When the graph is directed the result is directed."
msgstr "Cuando el grafo es dirigido el resultado es dirigido."

msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)."
msgstr "Para obtener el Grafo lineal completo utilizar identificadores únicos en las aristas de doble sentido (Ver `Ejemplos Adicionales`_)."

msgid "When the graph is undirected the result is undirected."
msgstr "Cuando el grafo es no dirigido el resultado es no dirigido."

msgid "The ``reverse_cost`` is always :math:`-1`."
msgstr "El ``reverse_cost`` es siempre :math:`-1`."

msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])"
msgstr "pgr_lineGraph(`SQL de aristas`_, [``directed``])"

msgid "Returns set of |result-lineg|"
msgstr "Regresa el conjunto de |result-lineg|"

msgid "For an undirected graph with edges :math:'{2,4,5,8}'"
msgstr "Para un grafo no dirigido con aristas :math:'{2,4,5,8}'"

msgid "Gives a local identifier for the edge"
msgstr "Da un identificador local de la arista"

msgid "When `negative`: the source is the reverse edge in the original graph."
msgstr "Cuando es 'negativo': el origen es la arista inversa en el grafo original."

msgid "When `negative`: the target is the reverse edge in the original graph."
msgstr "Cuando es `negativo`: el destino es la arista inversa en el grafo original."

msgid "Weight of the edge (``source``, ``target``)."
msgstr "Peso de la arista (``source``, ``target``)."

msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph."
msgstr "Cuando `negative`: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo."

msgid "Weight of the edge (``target``, ``source``)."
msgstr "Peso de la arista (``target``, ``source``)."

msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph."
msgstr "Cuando `negative`: la arista (``target``, ``source``) no existe, por lo tanto no es parte del grafo."

msgid "Given the following directed graph"
msgstr "Dado el siguente grafo dirigido"

msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`"
msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3})`"

msgid "Representation as directed with shared edge identifiers"
msgstr "Representación como dirigida con identificadores de arista compartidos"

msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:"
msgstr ""

msgid "hundreds"
msgstr "cientos"

msgid "the source vertex"
msgstr "el vértice de origen"

msgid "tens"
msgstr "decenas"

msgid "always 0, acts as a separator"
msgstr "siempre 0, actúa como separador"

msgid "units"
msgstr "unidades"

msgid "the target vertex"
msgstr "el vértice de destino"

msgid "In this image,"
msgstr "En esta imagen,"

msgid "Single or double head arrows represent one edge (row) on the edges table."
msgstr "Las puntas de flechas simples o dobles representan una arista (fila) en la tabla de aristas."

msgid "The numbers in the yellow shadow are the edge identifiers."
msgstr "Los números en la sombra amarilla son los identificadores de las aristas."

msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used."
msgstr "Dos pares de aristas comparten el mismo identificador cuando se utiliza la columna ``reverse_cost``."

msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`."
msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con una fila de aristas con :math:`id=203`."

msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`."
msgstr "Las aristas :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` se representan con una fila de aristas con :math:`id=304`."

msgid "The graph can be created as follows:"
msgstr "El grafo puede crearse del siguiente modo:"

msgid "Line Graph of a directed graph represented with shared edges"
msgstr "Grafo lineal de un grafo dirigido representado con aristas compartidas"

msgid "The result is a directed graph."
msgstr "El resultado es un grafo dirigido."

msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges"
msgstr "Para :math:`seq=4` desde :math:`203 \\leftrightarrow 304` representa dos arsitas"

msgid "For all the other values of ``seq`` represent one edge."
msgstr "Todos los demás valores de ``seq`` representan una arista."

msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge."
msgstr "Los valores ``cost`` y ``reverse_cost`` representan la existencia de la arista."

msgid "When positive: the edge exists."
msgstr "Cuando es positivo: la arista existe."

msgid "When negative: the edge does not exist."
msgstr "Cuando es negativo: la arista no existe."

msgid "Representation as directed with unique edge identifiers"
msgstr "Representación dirigida con identificadores de arista únicos"

msgid "Single head arrows represent one edge (row) on the edges table."
msgstr "Las flechas de una cabeza representan una arista (fila) en la tabla de aristas."

msgid "There are no double head arrows"
msgstr "No hay flechas de doble punta"

msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used."
msgstr "Dos pares de aristas comparten los mismos nodos finales y no se utiliza la columna ``reverse_cost``."

msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively."
msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con dos aristas :math:`id=203` y :math:`id=302` respectivamente."

msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively."
msgstr ""

msgid "Line Graph of a directed graph represented with unique edges"
msgstr "Gráfico lineal de un grafo dirigido representado con aristas únicas"

msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges."
msgstr "Para :math:`seq=7` desde :math:`203 \\leftrightarrow 302` representan dos aristas."

msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges."
msgstr "Para :math:`seq=8` desde :math:`304 \\leftrightarrow 403` representan dos aristas."

msgid "wikipedia: `Line Graph <https://en.wikipedia.org/wiki/Line_graph>`__"
msgstr "wikipedia: `Grafo lineal <https://en.wikipedia.org/wiki/Line_graph>`__"

msgid "mathworld: `Line Graph <https://mathworld.wolfram.com/LineGraph.html>`__"
msgstr ""

msgid "``pgr_lineGraphFull`` - Experimental"
msgstr "``pgr_lineGraphFull`` - Experimental"

msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs."
msgstr "``pgr_lineGraphFull`` — Transforma un grafo dado en uno nuevo donde todos los vértices del grafo original se convierten en grafos de líneas."

msgid "Version 2.6.0"
msgstr "Versión 2.6.0"

msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality."
msgstr "``pgr_lineGraphFull``, convierte un grafo dirigido a un grafo dirigido lineal, convirtiendo cada vértice en un grafo completo y manteniendo todas las aristas originales. Las nuevas aristas de conexión tienen un costo de 0 y van entre las aristas originales adyacentes, respetando la direccionalidad."

msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:"
msgstr "Una posible aplicación del grafo resultante es **\"ruteo con restricciones en dos aristas\"**:"

msgid "Setting a cost of using the vertex when routing between edges on the connecting edge"
msgstr "Establecer un coste de uso del vértice al enrutar entre aristas en la arista de conexión"

msgid "Forbid the routing between two edges by removing the connecting edge"
msgstr "Prohibir el ruteo entre dos aristas al quitar el arista de conexión"

msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection."
msgstr "Esto es posible porque cada una de las intersecciones (vértices) en el grafo original ahora son grafos completos que tienen una nueva arista para cada posible giro a través de esa intersección."

msgid "This function is for **directed** graphs."
msgstr "Esta función es para grafos **dirigidos**."

msgid "Results are undefined when a negative vertex id is used in the input graph."
msgstr "Los resultados son indefinidos cuando se utiliza un identificador de vértice negativo en el grafo de entrada."

msgid "Results are undefined when a duplicated edge id is used in the input graph."
msgstr "Los resultados son indefinidos cuando se utiliza un identificador de borde duplicado en el grafo de entrada."

msgid "Running time: TBD"
msgstr "Tiempo de ejecución: TBD"

msgid "pgr_lineGraphFull(`Edges SQL`_)"
msgstr "pgr_lineGraphFull(`SQL de aristas`_)"

msgid "Returns set of |result-linegf|"
msgstr "Regresa el conjunto de |result-linegf|"

msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`"
msgstr "Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`"

msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``."
msgstr "Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con ``reverse_cost``."

msgid "The data"
msgstr "Los datos"

msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph."
msgstr "En este ejemplo se muestra cómo funciona esta transformación de grafo para crear aristas adicionales para cada giro posible en un grafoáfico."

msgid "|first|"
msgstr "|first|"

msgid "first"
msgstr "primero"

msgid "The transformation"
msgstr "La transformación"

msgid "|second|"
msgstr "|second|"

msgid "second"
msgstr "segundo"

msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)."
msgstr "En el grafo transformado, todas las aristas del grafo original siguen presentes (amarillos), pero ahora hay aristas adicionales para cada giro que se podría hacer a través del vértice 7 (naranja)."

msgid "Creating table that identifies transformed vertices"
msgstr "Crear una tabla que identifica los vértices transformados"

msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids."
msgstr "Los vértices del grafo transformado se crean dividiendo los vértices en el grafo original. A menos que un vértice en el grafo original sea un vértice hoja, generará más de un vértice en el grafo transformado. A uno de los vértices recién creados en el grafo transformado se le dará el mismo identificador del vértice desde el cual se creó en el grafo original, pero el resto de los vértices recién creados tendrán identificadores de vértices negativos."

msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from"
msgstr ""

msgid "Store edge results"
msgstr "Almacenar resultados de aristas"

msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table"
msgstr ""

msgid "Create the mapping table"
msgstr ""

msgid "From the original graph's vertex information"
msgstr ""

msgid "Add the new vertices"
msgstr "Agregar nuevos vértices"

msgid "Filling the mapping table"
msgstr ""

msgid "The positive vertex identifiers are the original identifiers"
msgstr ""

msgid "Inspecting the vertices map"
msgstr ""

msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value."
msgstr ""

msgid "Updating values from self loops"
msgstr ""

msgid "Inspecting the vertices table"
msgstr "Inspeccionando la tabla de vértices"

msgid "Updating from inner self loops"
msgstr ""

msgid "Adding a soft restriction"
msgstr ""

msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted."
msgstr ""

#, fuzzy
msgid "Identifying the restriction"
msgstr "Agregando las restricciones"

msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased"
msgstr ""

msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:"
msgstr ""

msgid "Adding a value to the restriction"
msgstr ""

msgid "Updating the cost to the edge:"
msgstr ""

msgid "Routing from :math:`6` to :math:`3`"
msgstr ""

msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex."
msgstr ""

msgid "Simplifying leaf vertices"
msgstr ""

msgid "In this example, there is no additional cost for traversing a leaf vertex."
msgstr ""

msgid "Using the vertex map give the leaf verices their original value."
msgstr ""

msgid "On the source column"
msgstr ""

msgid "On the target column"
msgstr ""

msgid "Removing self loops on leaf nodes"
msgstr ""

msgid "The self loops of the leaf nodes are"
msgstr ""

msgid "Which can be removed"
msgstr ""

msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`"
msgstr ""

msgid "Complete routing graph"
msgstr ""

msgid "Add edges from the original graph"
msgstr ""

msgid "Add all the edges that are not involved in the line graph process to the new table"
msgstr ""

msgid "Some administrative tasks to get new identifiers for the edges"
msgstr ""

msgid "Add the newly calculated edges"
msgstr ""

msgid "Using the routing graph"
msgstr ""

msgid "When using this method for routing with soft restrictions there will be uturns"
msgstr ""

msgid "Routing from :math:`5` to :math:`1`"
msgstr ""

msgid "https://en.wikipedia.org/wiki/Line_graph"
msgstr "https://en.wikipedia.org/wiki/Line_graph"

msgid "https://en.wikipedia.org/wiki/Complete_graph"
msgstr "https://en.wikipedia.org/wiki/Complete_graph"

msgid "``pgr_makeConnected`` - Experimental"
msgstr "``pgr_makeConnected`` - Experimental"

msgid "``pgr_makeConnected`` — Set of edges that will connect the graph."
msgstr "``pgr_makeConnected`` — Conjunto de aristas que conectan el grafo."

msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C."
msgstr "Agrega el número mínimo de bordes necesarios para conectar el gráfico de entrada. El algoritmo primero identifica todos los componentes conectados en el gráfico, luego agrega bordes para conectar esos componentes en una ruta. Por ejemplo, si un gráfico contiene tres componentes conectados A, B y C, make_connected agregará dos bordes. Las dos aristas agregadas podrían consistir en una que conecta un vértice en A con un vértice en B y otra que conecta un vértice en B con un vértice en C."

msgid "It will give a minimum list of all edges which are needed in the graph to make connect it."
msgstr "Dará la lista mínima de los bordes que se necesitan en el grafo para conectarlo."

msgid "The algorithm does not considers geometric topology in the calculations."
msgstr "El algoritmo no considera la topología geométrica en los cálculos."

msgid "pgr_makeConnected(`Edges SQL`_)"
msgstr "pgr_makeConnected(`SQL de aristas`_)"

msgid "Returns set of |result-component-make|"
msgstr "Regresa conjunto de |result-component-make|"

msgid "List of edges that are needed to connect the graph."
msgstr "Lista de aristas que se necesitan para conectar el grafo."

msgid "`Boost: make connected <https://www.boost.org/libs/graph/doc/make_connected.html>`__"
msgstr "`Boost: conectar <https://www.boost.org/libs/graph/doc/make_connected.html>`__"

msgid "``pgr_maxCardinalityMatch``"
msgstr "``pgr_maxCardinalityMatch``"

msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph."
msgstr "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad máxima en un grafo."

msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column."
msgstr "pgr_maxCardinalityMatch(text) regresa solamente la columna ``edge``."

msgid "Deprecated signature"
msgstr ""

msgid "directed => ``false`` when used."
msgstr "Con directed => `` false`` cuando se usa."

msgid "Renamed from ``pgr_maximumCardinalityMatching``"
msgstr "Renombrado de ``pgr_maximumCardinalityMatching``"

msgid "A matching or independent edge set in a graph is a set of edges without common vertices."
msgstr "Un conjunto de aristas coincidente o independiente en un grafo es un conjunto de aristas sin vértices comunes."

msgid "A maximum matching is a matching that contains the largest possible number of edges."
msgstr "Una coincidencia máxima es una coincidencia que contiene el mayor número posible de aristas."

msgid "There may be many maximum matchings."
msgstr "Puede haber muchas coincidencias máximas."

msgid "Calculates one possible maximum cardinality matching in a graph."
msgstr "Calcula una posible coincidencia máxima de cardinalidad en un grafo."

msgid "Running time: :math:`O( E*V * \\alpha(E,V))`"
msgstr "Tiempo de ejecución: :math:`O( E*V * \\alpha(E,V))`"

msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_."
msgstr ":math:`\\alpha(E,V)` es inverso a `Ackermann function`_."

msgid "pgr_maxCardinalityMatch(`Edges SQL`_)"
msgstr "pgr_maxCardinalityMatch(`SQL de aristas`_)"

msgid "Using all edges."
msgstr ""

msgid "SQL query, which should return a set of rows with the following columns:"
msgstr "Una consulta SQL, que debe regresar un conjunto de filas con las siguientes columnas:"

msgid "A positive value represents the existence of the edge (``source``, ``target``)."
msgstr "Un valor positivo representa la existencia de la arista (``source``, ``target``)."

msgid "A positive value represents the existence of the edge (``target``, ``source``)"
msgstr "Un valor positivo representa la existencia de la arista (``target``, ``source``)"

msgid "Identifier of the edge in the original query."
msgstr "Identificador de la arista en la consulta original."

msgid "`Boost: maximum_matching <https://www.boost.org/libs/graph/doc/maximum_matching.html>`__"
msgstr "`Boost: Coincidencia máxima <https://www.boost.org/libs/graph/doc/maximum_matching.html>`__"

msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29"
msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29"

msgid "https://en.wikipedia.org/wiki/Ackermann_function"
msgstr "https://en.wikipedia.org/wiki/Ackermann_function"

msgid "``pgr_maxFlow``"
msgstr "``pgr_maxFlow``"

msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm."
msgstr "``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los orígene(s) a los destino(s) mediante el algoritmo Push Relabel."

msgid "pgr_maxFlow(Combinations)"
msgstr "pgr_maxFlow(Combinaciones)"

msgid "Calculates the maximum flow from the sources to the targets."
msgstr "Calcula el flujo máximo de las fuentes a los objetivos."

msgid "When the maximum flow is **0** then there is no flow and **0** is returned."
msgstr "Cuando el flujo máximo es **0**, entonces no hay flujo y se devuelve **0**."

msgid "Uses the :doc:`pgr_pushRelabel <pgr_pushRelabel>` algorithm."
msgstr "Use el algoritmo :doc:`pgr_pushRelabel <pgr_pushRelabel>` ."

msgid "Running time: :math:`O( V ^ 3)`"
msgstr "Tiempo de ejecución: :math:`O( V ^ 3)`"

msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destino**)"

msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destinos**)"

msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destino**)"

msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destinos**)"

msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_maxFlow(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "RETURNS ``BIGINT``"
msgstr ""

msgid "Maximum flow possible from the source(s) to the target(s)"
msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)"

msgid "`Boost: push relabel max flow <https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html>`__"
msgstr "`Boost: Flujo máximo empujar reetiquetar <https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html>`__"

msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm"
msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm"

msgid "``pgr_maxFlowMinCost`` - Experimental"
msgstr "``pgr_maxFlowMinCost`` - Experimental"

msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph"
msgstr "``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo maximo en un grafo"

msgid "pgr_maxFlowMinCost(Combinations)"
msgstr "pgr_maxFlowMinCost(Combinaciones)"

msgid "|Boost| Boost Graph Inside."
msgstr "|Boost| Boost Graph Adentro."

msgid "**TODO** check which statement is true:"
msgstr "**Por hacer** comprobar qué declaración es verdadera:"

msgid "The cost value of all input edges must be nonnegative."
msgstr "El valor de coste de todas las aristas de entrada debe ser no negativo."

msgid "Process is done when the cost value of all input edges is nonnegative."
msgstr "El proceso se realiza cuando el valor de coste de todas las aristas de entrada no es negativo."

msgid "Process is done on edges with nonnegative cost."
msgstr "El proceso se realiza en aristas con coste no negativo."

msgid "Running time: :math:`O(U * (E + V * logV))`"
msgstr "Tiempo de ejecución: :math:`O(U * (E + V * log V))`"

msgid "where :math:`U` is the value of the max flow."
msgstr "donde :math:`U` es el valor de flujo máximo."

msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`."
msgstr ":math:`U` es el límite superior de la cantidad de iteraciones. En muchos casos de la vida reales, la cantidad de iteraciones es mucho menor que :math:`U`."

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destino**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destinos**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destino**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destinos**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "Returns set of |result-flow-mincost|"
msgstr "Regresa el conjunto de |result-flow-mincost|"

msgid "``pgr_maxFlowMinCost_Cost`` - Experimental"
msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental"

msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph"
msgstr "``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo en un grafo"

msgid "pgr_maxFlowMinCost_Cost(Combinations)"
msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)"

msgid "**The cost value of all input edges must be nonnegative.**"
msgstr "**El valor de coste de todas las aristas de entrada debe ser no negativo.**"

msgid "When the maximum flow is 0 then there is no flow and **0** is returned."
msgstr "Cuando el flujo máximo es 0 entonces no hay flujo y se devuelve un **0** ."

msgid "Uses :doc:`pgr_maxFlowMinCost`."
msgstr "Usa :doc:`pgr_maxFlowMinCost`."

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destino**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destinos**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destino**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destinos**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "RETURNS FLOAT"
msgstr ""

msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)"
msgstr "Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los objetivo(s)"

msgid "``pgr_pickDeliver`` - Experimental"
msgstr "``pgr_pickDeliver`` - Experimental"

msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem"
msgstr "``pgr_pickDeliver`` - Problema de enrutamiento del vehículo de recogida y entrega"

msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles."
msgstr "Problema: Distribuya y optimice los pares de recogida-entrega en una flota de vehículos."

msgid "Optimization problem is NP-hard."
msgstr "El problema de optimización es NP-hard."

msgid "pickup and Delivery with time windows."
msgstr "recogida y Entrega con ventanas de tiempo."

msgid "All vehicles are equal."
msgstr "Todos los vehículos son iguales."

msgid "Same Starting location."
msgstr "La misma ubicación de Inicio."

msgid "Same Ending location which is the same as Starting location."
msgstr "La misma ubicación Final que es la misma que la ubicación de Inicio."

msgid "All vehicles travel at the same speed."
msgstr "Todos los vehículos viajan a la misma velocidad."

msgid "A customer is for doing a pickup or doing a deliver."
msgstr "Un cliente es para hacer una recogida o hacer una entrega."

msgid "has an open time."
msgstr "tiene un tiempo abierto."

msgid "has a closing time."
msgstr "tiene tiempo de cierre."

msgid "has a service time."
msgstr "tiene un tiempo de servicio."

msgid "has an (x, y) location."
msgstr "tiene una ubicación (x, y)."

msgid "There is a customer where to deliver a pickup."
msgstr "Hay un cliente donde entregar una recogida."

msgid "travel time between customers is distance / speed"
msgstr "tiempo de viaje entre los clientes es distancia / velocidad"

msgid "pickup and delivery pair is done with the same vehicle."
msgstr "La recogida y entrega se realizan con el mismo vehículo."

msgid "All trucks depart at time 0."
msgstr "Todos los camiones salen en el momento 0."

msgid "the algorithm will raise an exception when"
msgstr "el algoritmo generará una excepción cuando"

msgid "If there is a pickup-deliver pair than violates time window"
msgstr "Si hay un par de recogida-entrega que viola la ventana de tiempo"

msgid "The speed, max_cycles, ma_capacity have illegal values"
msgstr "La velocidad, max_cycles, max_capacity tienen valores ilegales"

msgid "Six different initial will be optimized - the best solution found will be result"
msgstr "Seoptimizarán seis iniciales diferentes - la mejor solución encontrada será el resultado"

msgid "Signature"
msgstr "Firma"

msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])"
msgstr "pgr_pickDeliver(`SQL de ordenes`_, `SQL de vehículos`_, `SQL de matriz`_, [**opciones**])"

msgid "**options:** ``[factor, max_cycles, initial_sol]``"
msgstr "**opcionales:** ``[factor, max_cycles, initial_sol]``"

msgid "Returns set of |result-pickdrop|"
msgstr "Regresa el conjunto de |result-pickdrop|"

msgid "Solve the following problem"
msgstr ""

msgid "Given the vehicles:"
msgstr "Dados los vehículos:"

msgid "and the orders:"
msgstr ""

msgid "The parameters are:"
msgstr "Los parámetros son:"

msgid "A `SELECT` statement that returns the following columns:"
msgstr "Una instrucción `SELECT` que devuelve las siguientes columnas:"

msgid "id, demand"
msgstr "id, demand"

msgid "p_node_id, p_open, p_close, [p_service,]"
msgstr ""

msgid "d_node_id, d_open, d_close, [d_service,]"
msgstr ""

msgid "id, capacity"
msgstr "id, capacity"

msgid "start_node_id, start_open, start_close [, start_service,]"
msgstr ""

msgid "[end_node_id, end_open, end_close, end_service]"
msgstr ""

msgid "``pgr_pickDeliverEuclidean`` - Experimental"
msgstr "``pgr_pickDeliverEuclidean`` - Experimental"

msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem"
msgstr "``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida y Entrega"

msgid "Replaces ``pgr_gsoc_vrppdtw``"
msgstr "Reemplaza ``pgr_gsoc_vrppdtw``"

msgid "Pickup and Delivery:"
msgstr "Recogida y Entrega:"

msgid "capacitated"
msgstr "capacitado"

msgid "with time windows."
msgstr "con ventanas de tiempo."

msgid "have (x, y) start and ending locations."
msgstr "tienen (x, y) ubicaciones de inicio y finalización."

msgid "have a start and ending service times."
msgstr "tener un inicio y un final de los tiempos de servicio."

msgid "An order is for doing a pickup and a a deliver."
msgstr "Un pedido es para hacer una recogida y una entrega."

msgid "has (x, y) pickup and delivery locations."
msgstr "tiene (x, y) ubicaciones de recogida y entrega."

msgid "has opening and closing times for the pickup and delivery locations."
msgstr "tiene horarios de apertura y cierre para los lugares de recogida y entrega."

msgid "has a pickup and deliver service times."
msgstr "tiene una recogida y entrega de tiempos de servicio."

msgid "Six different optional different initial solutions"
msgstr "Seis diferentes soluciones iniciales opcionales"

msgid "the best solution found will be result"
msgstr "la mejor solución encontrada será el resultado"

msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])"
msgstr "pgr_pickDeliverEuclidean(`SQL de órdenes`_, `SQL de vehículos`_, [**opciones**])"

msgid "p_x, p_y, p_open, p_close, [p_service,]"
msgstr ""

msgid "d_x, d_y, d_open, d_close, [d_service]"
msgstr ""

msgid "start_x, start_y, start_open, start_close [, start_service, ]"
msgstr ""

msgid "[ end_x, end_y, end_open, end_close, end_service ]"
msgstr ""

msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/"
msgstr ""

msgid "There are 25 vehicles in the problem all with the same characteristics."
msgstr ""

msgid "The original orders"
msgstr ""

msgid "The data comes in different rows for the pickup and the delivery of the same order."
msgstr ""

msgid "The original data needs to be converted to an appropriate table:"
msgstr ""

msgid "The query"
msgstr ""

msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/"
msgstr ""

msgid "The best solution found for **lc101** is a travel time: 828.94"
msgstr ""

msgid "This implementation's travel time: 854.54"
msgstr ""

msgid "``pgr_prim``"
msgstr "``pgr_prim``"

msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm."
msgstr "``pgr_prim`` — Mínimo bosque de expansión de un grafo, utilizando el algoritmo de Prim."

msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm."
msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Prim."

msgid "Prim's running time: :math:`O(E * log V)`"
msgstr "Tiempo de ejecución de Prim: :math:`O(E*log V)`"

msgid "pgr_prim(`Edges SQL`_)"
msgstr "pgr_prim(`SQL de aristas`_)"

msgid "Minimum spanning forest of a subgraph"
msgstr "Bosque de Expansión Mínimo de un subgrafo"

msgid "`Boost: Prim's algorithm documentation <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
msgstr "`Boost: algoritmo de Prim <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"

msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering."
msgstr "``pgr_primBFS`` — Algoritmo de Prim para el árbol de expansión mínimo con orden de primera búsqueda de profundidad."

msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm."
msgstr "Visita y extrae la información de los nodos en el ordenamiento de la primera búsqueda de amplitud del árbol de expansión mínima creado mediante el algoritmo de Prim."

msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_primBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])"

msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_primBFS(`SQL de aristas`_, **Raíces**, [``max_depth``])"

msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm."
msgstr "``pgr_primDD`` — Nodos de captación mediante el algoritmo de Prim."

msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree."
msgstr "Mediante el algoritmo de Prim, extrae los nodos que tienen costes agregados inferiores o iguales a una distancia desde un vértice raíz (o vértices) dentro del árbol de expansión mínimo calculado."

msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)"
msgstr "pgr_primDD(`SQL de aristas`_, **raíz**, **distancia**)"

msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)"
msgstr "pgr_primDD(`SQL de aristas`_, **raices**, **distancia**)"

msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering."
msgstr "''pgr_primDFS'' — Algoritmo Prim para el Árbol de Expansión Mínima con orden de la Primera Búsqueda de Profundidad."

msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm."
msgstr "Visita y extrae la información de los nodos en el orden de la Primera Búsqueda de Profundidad del Árbol de Expansión Mínima creado utilizando el algoritmo de Prim."

msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_primDFS(`SQL de aristas`_, **Raíz**, [``max_depth``])"

msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_primDFS(`SQL de aristas`_, **Raíces**, [``max_depth``])"

msgid "``pgr_pushRelabel``"
msgstr "``pgr_pushRelabel``"

msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm."
msgstr "``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel."

msgid "pgr_pushRelabel(Combinations)"
msgstr "pgr_pushRelabel(Combinaciones)"

msgid "Renamed from ``pgr_maxFlowPushRelabel``"
msgstr "Renombrado de ``pgr_maxFlowPushRelabel``"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destino**)"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destinos**)"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destino**)"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destinos**)"

msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)"

msgid "``pgr_separateCrossing``"
msgstr "``pgr_separateCrossing``"

msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross."
msgstr ""

msgid "Proposed function."
msgstr "Función propuesta."

#, fuzzy
msgid "This is an auxiliary function for separating crossing edges."
msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo."

#, fuzzy
msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])"
msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])"

#, fuzzy
msgid "RETURNS |result-separate|"
msgstr "REGRESA |result-version|"

msgid "Get the segments of the crossing geometries"
msgstr "Obtener los segmentos de las geometrías que se cruzan"

msgid "``tolerance``"
msgstr "``tolerance``"

#, fuzzy
msgid "0.01"
msgstr "0.010"

msgid "Used in ST_Snap before ST_Split"
msgstr ""

#, fuzzy
msgid "Get the code for further refinement."
msgstr "En cualquier lado del segmento."

msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag."
msgstr ""

msgid "``pgr_separateTouching``"
msgstr "``pgr_separateTouching``"

msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints"
msgstr ""

msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity."
msgstr ""

#, fuzzy
msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])"
msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])"

msgid "``pgr_sequentialVertexColoring`` - Proposed"
msgstr "``pgr_sequentialVertexColoring`` - Propuesto"

msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach."
msgstr "``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo no dirigido, utilizando un enfoque codicioso."

msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices."
msgstr "El algoritmo de Coloración de Vértices Secuenciales es un algoritmo de coloración de grafos en el que se asignan identificadores de color a los vértices de un grafo de forma secuencial, de modo que ninguna arista conecte dos vértices de colores idénticos."

msgid "The implementation is applicable only for **undirected** graphs."
msgstr "La implementación solo es aplicable a los grafos **no dirigidos**."

msgid "Provides the color to be assigned to all the vertices present in the graph."
msgstr "Proporciona el color que se asignará a todos los vértices presentes en el grafo."

msgid "Color identifiers values are in the Range :math:`[1, |V|]`"
msgstr "Los valores de los identificadores de color se encuentran en el rango :math:`[1, |V|]`"

msgid "The algorithm tries to assign the least possible color to every vertex."
msgstr "El algoritmo intenta asignar el menor color posible a cada vértice."

msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex."
msgstr "El color de grafos eficientes es un problema NP-Hard, y por lo tanto, este algoritmo no siempre produce un coloración óptima. Sigue una estrategia expansiva recorriendo en iteración todos los vértices secuencialmente y asignando el color más pequeño posible que no sea utilizado por sus vecinos, a cada vértice."

msgid "The returned rows are ordered in ascending order of the vertex value."
msgstr "Las filas devueltas se ordenan en orden ascendente del valor de vértice."

msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`"
msgstr "Tiempo de Ejecución de Coloración de Vértices Secuenciales: :math:`O(|V|*(d + k))`"

msgid ":math:`d` is the maximum degree of the vertices in the graph,"
msgstr ":math:`d` es el grado máximo de los vértices en el grafo,"

msgid ":math:`k` is the number of colors used."
msgstr ":math:`k` es el número de colores utilizados."

msgid "pgr_sequentialVertexColoring(`Edges SQL`_)"
msgstr "pgr_sequentialVertexColoring(`SQL de aristas`_)"

msgid "`Boost: Sequential Vertex Coloring <https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__"
msgstr "`Boost: Coloración Secuencial de Vértices <https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__"

#, fuzzy
msgid "``pgr_sloanOrdering`` - Experimental"
msgstr "``pgr_edgeColoring`` - Experimental"

#, fuzzy
msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph"
msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos"

msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis."
msgstr ""

msgid "Finds a pseudoperipheral vertex pair to determine good starting points"
msgstr ""

msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex."
msgstr ""

msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices."
msgstr ""

msgid "Typically produces better orderings than simple breadth-first approaches."
msgstr ""

msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges."
msgstr ""

#, fuzzy
msgid "pgr_sloanOrdering(`Edges SQL`_)"
msgstr "pgr_edgeColoring(`SQL de aristas`_)"

msgid ":Example : Sloan ordering without specifying start vertex"
msgstr ""

#, fuzzy
msgid "New sloan ordering order."
msgstr "Nuevo ordenamiento es en orden inverso."

msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)."
msgstr ""

#, fuzzy
msgid "`Boost: Sloan Ordering <https://www.boost.org/doc/libs/latest/libs/graph/doc/sloan_ordering.htm>`__"
msgstr "`Boost: Coloración de Segmentos <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"

msgid "``pgr_stoerWagner`` - Experimental"
msgstr "``pgr_stoerWagner`` - Experimental"

msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm."
msgstr "``pgr_stoerWagner`` — El corte mínimo del grafo usando el algoritmo Stoer-Wagner."

msgid "Version 3.0"
msgstr "Versión 3.0"

msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph."
msgstr "En teoría de grafos, el algoritmo Stoer-Wagner es un algoritmo recursivo para resolver el problema de corte mínimo en gráficos ponderados no dirigidos con pesos no negativos. La idea esencial de este algoritmo es encoger el grafo mediante la fusión de los vértices más intensivos, hasta que el grafo sólo contiene dos conjuntos de vértices combinados. En cada fase, el algoritmo encuentra el corte s-t mínimo para dos vértices s y t elegidos a su voluntad. A continuación, el algoritmo encoge la arista entre s y t para buscar cortes no s-t. El corte mínimo encontrado en todas las fases será el corte ponderado mínimo del grafo."

msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut."
msgstr "Un corte es una partición de los vértices de un grafo en dos subconjuntos separados. Un corte mínimo es un corte para el que el tamaño o peso del corte no es mayor que el tamaño de cualquier otro corte. Para un grafo no ponderado, el corte mínimo sería simplemente el corte con menos aristas. Para un grafo ponderado, la suma del peso de todas las aristas en el corte determina si se trata de un corte mínimo."

msgid "Sum of the weights of all edges between the two sets is mincut."
msgstr "La suma de los pesos de todas las aristas entre los dos conjuntos es mincut."

msgid "A **mincut** is a cut having the least weight."
msgstr "Un **mincut** es un corte que tiene el menor peso."

msgid "Values are returned when graph is connected."
msgstr "Los valores se devuelven cuando se conecta el grafo."

msgid "When there is no edge in graph then EMPTY SET is return."
msgstr "Cuando no hay arista en el grafo se devuelve EMPTY SET."

msgid "When the graph is unconnected then EMPTY SET is return."
msgstr "Cuando el gráfico está desconectado, se devuelve un conjunto vacío o EMPTY SET."

msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight."
msgstr "A veces un grafo tiene varios cortes mínimos, pero todos tienen el mismo peso. Esta función determina exactamente uno de los cortes mínimos, así como su peso."

msgid "Running time: :math:`O(V*E + V^2*log V)`."
msgstr "Tiempo de ejecución: :math:`O(V*E + V^2*log V)`."

msgid "pgr_stoerWagner(`Edges SQL`_)"
msgstr "pgr_stoerWagner(`SQL de aristas`_)"

msgid "Returns set of |result-mincut|"
msgstr "Regresa el conjunto de |result-mincut|"

msgid "min cut of the main subgraph"
msgstr "corte mínimo de el subgrafo principal"

msgid "Returns set of ``(seq, edge, cost, mincut)``"
msgstr "Devuelve conjunto de ``(seq, edge, cost, mincut)``"

msgid "Edges which divides the set of vertices into two."
msgstr "Aristas que dividen el conjunto de vértices en dos."

msgid "Cost to traverse of edge."
msgstr "Costo para atravesar la arista."

msgid "**mincut**"
msgstr "**mincut**"

msgid "Min-cut weight of a undirected graph."
msgstr "Peso de corte mínimo de un grafo no dirigido."

msgid "Additional Example:"
msgstr "Ejemplo Adicional:"

msgid "min cut of an edge"
msgstr "corte mínimo de una arista"

msgid "Using :doc:`pgr_connectedComponents`"
msgstr "Usando :doc:`pgr_connectedComponents`"

msgid "`Boost: Stoer Wagner min cut <https://www.boost.org/libs/graph/doc/stoer_wagner_min_cut.html>`__"
msgstr "`Boost: Corte mínimo Stoer Wagner <https://www.boost.org/libs/graph/doc/stoer_wagner_min_cut.html>`__"

msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm"
msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm"

msgid "``pgr_strongComponents``"
msgstr "``pgr_strongComponents``"

msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS."
msgstr "``pgr_strongComponents`` — Componentes fuertemente conectados de un grafo dirigido utilizando el algoritmo de Tarjan basado en DFS."

msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other."
msgstr "Un componente fuertemente conectado de un gráfico dirigido es un conjunto de vértices que son todos accesibles entre sí."

msgid "Works for **directed** graphs."
msgstr "Funciona paragrafos **dirigidos**."

msgid "Components are described by vertices identifiers."
msgstr "Los componentes se describen mediante identificadores de vértices."

msgid "pgr_strongComponents(`Edges SQL`_)"
msgstr "pgr_strongComponents(`SQL de aristas`_)"

msgid "The strong components of the graph"
msgstr "Los componentes fuertes del grafo"

msgid "`Boost: Strong components <https://www.boost.org/libs/graph/doc/strong_components.html>`__"
msgstr "`Boost: Componentes fuertemente conectados <https://www.boost.org/libs/graph/doc/strong_components.html>`__"

msgid "wikipedia: `Strongly connected component <https://en.wikipedia.org/wiki/Strongly_connected_component>`__"
msgstr "Wikipedia: `Componentes fuertemente conectados <https://en.wikipedia.org/wiki/Strongly_connected_component>`__"

msgid "``pgr_topologicalSort`` - Experimental"
msgstr "``pgr_topologicalSort`` - Experimental"

msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)."
msgstr "``pgr_topologicalSort`` — Devuelve el orden lineal de los vértices para los grafos acíclicos dirigidos ponderados (DAG)."

msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering."
msgstr "El algoritmo de ordenación topológica crea un orden lineal de los vértices de tal manera que si la arista :math:`(u,v)` aparece en el grafo, entonces :math:`v` viene antes de :math:`u` en el orden."

msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings."
msgstr "El proceso solo es válido para grafos acíclicos dirigidos. de lo contrario lanzará advertencias."

msgid "For optimization purposes, if there are more than one answer, the function"
msgstr "Para fines de optimización, si hay más de una respuesta, la función"

msgid "will return one of them."
msgstr ""

msgid "The returned values are ordered in topological order:"
msgstr "Los valores devueltos se ordenan en orden topológico:"

msgid "pgr_topologicalSort(`Edges SQL`_)"
msgstr "pgr_topologicalSort(`SQL de aristas`_)"

msgid "Topologically sorting the graph"
msgstr ""

msgid "Sequential value starting from :math:`1`"
msgstr "Valor secuencial a partir de :math:`1`"

msgid "Linear topological ordering of the vertices"
msgstr ""

msgid "Additional examples"
msgstr ""

msgid "Topologically sorting the one way segments"
msgstr ""

msgid "Graph is not a DAG"
msgstr ""

msgid "`Boost: topological sort <https://www.boost.org/libs/graph/doc/topological_sort.html>`__"
msgstr "`Boost: Ordenamiento topológico <https://www.boost.org/libs/graph/doc/topological_sort.html>`__"

msgid "``pgr_transitiveClosure`` - Experimental"
msgstr "``pgr_transitiveClosure`` - Experimental"

msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph."
msgstr ""

msgid "Transforms the input directed graph into the transitive closure of the graph."
msgstr "Transforma el grafo de entrada en grafo de cierre transitivo."

msgid "Process is valid for directed graphs."
msgstr ""

msgid "The transitive closure of an undirected graph produces a cluster graph"
msgstr ""

msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)"
msgstr ""

msgid "The returned values are not ordered"
msgstr "Los valores devueltos no se ordenan"

#, fuzzy
msgid "The returned graph is compressed"
msgstr "Cuando el grafo es conectado"

msgid "Running time: :math:`O(|V||E|)`"
msgstr "Tiempo de ejecución: :math:`O(|V||E|)`"

msgid "The pgr_transitiveClosure function has the following signature:"
msgstr "La función pgr_transitiveClosure tiene la siguiente firma:"

msgid "pgr_transitiveClosure(`Edges SQL`_)"
msgstr "pgr_transitiveClosure(`SQL de aristas`_)"

msgid "Returns set of |result-closure|"
msgstr "Regresa el conjunto de |result-closure|"

msgid "Rechability of a subgraph"
msgstr ""

msgid "Identifier of the source of the edges"
msgstr "Identificador del nodo inicial de las aristas"

msgid "``target_array``"
msgstr "``target_array``"

msgid "Identifiers of the targets of the edges"
msgstr "Identificador del nodo final de las aristas"

msgid "Identifiers of the vertices that are reachable from vertex v."
msgstr "Identificadores de los vértices que son alcanzables desde el vértice v."

msgid "`Boost: transitive closure <https://www.boost.org/libs/graph/doc/transitive_closure.html>`__"
msgstr "`Boost: Cierre transitivo <https://www.boost.org/libs/graph/doc/transitive_closure.html>`__"

msgid "https://en.wikipedia.org/wiki/Transitive_closure"
msgstr "https://en.wikipedia.org/wiki/Transitive_closure"

msgid "``pgr_trsp``"
msgstr "``pgr_trsp``"

msgid "``pgr_trsp`` - routing vertices with restrictions."
msgstr "``pgr_trsp`` - Ruteo con restricciones."

msgid "pgr_trsp(One to One)"
msgstr "pgr_trsp(Uno a Uno)"

msgid "pgr_trsp(One to Many)"
msgstr "pgr_trsp(Uno a Muchos)"

msgid "pgr_trsp(Many to One)"
msgstr "pgr_trsp(Muchos a Uno)"

msgid "pgr_trsp(Many to Many)"
msgstr "pgr_trsp(Muchos a Muchos)"

msgid "pgr_trsp(Combinations)"
msgstr "pgr_trsp(Combinaciones)"

msgid "Deprecated signatures"
msgstr "Firmas obsoletas"

msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"
msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"

msgid "New prototypes"
msgstr "Nuevos prototipos"

msgid "pgr_trspViaVertices"
msgstr "pgr_trspViaVertices"

msgid "pgr_trspViaEdges"
msgstr "pgr_trspViaEdges"

msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks."
msgstr ""

msgid "It does no guarantee the shortest path as it might contain restriction paths."
msgstr ""

msgid "The general algorithm is as follows:"
msgstr ""

msgid "Execute a Dijkstra."
msgstr ""

msgid "If the solution passes thru a restriction then."
msgstr ""

msgid "Execute the **TRSP** algorithm with restrictions."
msgstr ""

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destinos**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destino**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destinos**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, [``directed``])"

msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph."
msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo no dirigido."

msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph."
msgstr ""

msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph."
msgstr ""

msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph."
msgstr ""

msgid "Using a combinations table on an undirected graph."
msgstr "Usando una tabla de combinaciones en un grafo no dirigido."

msgid "`Deprecated documentation <https://docs.pgrouting.org/3.3/en/pgr_trsp.html>`_"
msgstr "`Documentación obsoleta <https://docs.pgrouting.org/3.3/en/pgr_trsp.html>`_"

msgid "``pgr_trspVia``"
msgstr "``pgr_trspVia``"

msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions."
msgstr ""

msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths."
msgstr ""

msgid "The paths represents the sections of the route."
msgstr "Las trayectorias representan los tramos de la ruta."

msgid "Execute a :doc:`pgr_dijkstraVia`."
msgstr "Ejecutar un :doc:`pgr_dijkstraVia`."

msgid "For the set of sub paths of the solution that pass through a restriction then"
msgstr ""

msgid "Execute the **TRSP** algorithm with restrictions for the paths."
msgstr ""

msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored."
msgstr ""

msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])"
msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_,**vértices**, [``directed``])"

msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph."
msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo dirigido."

msgid "Simulation of how algorithm works."
msgstr "Sumulación del functionamiento del algoritmo."

msgid "The algorithm performs a :doc:`pgr_dijkstraVia`"
msgstr ""

msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted."
msgstr ""

msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths."
msgstr ""

msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:"
msgstr ""

msgid "Getting the same result as ``pgr_trspVia``:"
msgstr ""

msgid "Example 8"
msgstr "Ejemplo 8"

msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``."
msgstr ""

msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it."
msgstr ""

msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag."
msgstr ""

msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``."
msgstr ""

msgid ":doc:`via-category`"
msgstr ":doc:`via-category`"

msgid "``pgr_trspVia_withPoints``"
msgstr "``pgr_trspVia_withPoints``"

msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions."
msgstr ""

msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths."
msgstr ""

msgid "is a sequence of paths"
msgstr ""

msgid "Build the Graph with the new points."
msgstr ""

msgid "The points identifiers will be converted to negative values."
msgstr ""

msgid "The vertices identifiers will remain positive."
msgstr ""

msgid "Execute a :doc:`pgr_withPointsVia`."
msgstr ""

msgid "For the set of paths of the solution that pass through a restriction then"
msgstr ""

msgid "Execute the **TRSP** algorithm with restrictions for the path."
msgstr ""

msgid "Do not use negative values on identifiers of the inner queries."
msgstr ""

#, fuzzy
msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])"
msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])"

#, fuzzy
msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``"
msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``"

msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph."
msgstr ""

msgid "When positive it is considered a vertex identifier"
msgstr "Cuando sea positivo se considera como un identificador de vértice"

msgid "When negative it is considered a point identifier"
msgstr "Cuando sea negativo se considera como un identificador de punto"

#, fuzzy
msgid "[**driving side**]"
msgstr "**Lado de manejo**"

msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:"
msgstr "Valor en [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicando si el lado de manejo es:"

msgid "For directed graph:"
msgstr "Para un grafo dirigido:"

msgid "[``r``, ``R``] for right driving side"
msgstr "[``r``, ``R``] para el lado derecho de conducción"

msgid "[``l``, ``L``] for left driving side"
msgstr "[``l``, ``L``] para lado izquierdo de conducción"

msgid "For undirected graph:"
msgstr "Para grafo no dirigido:"

msgid "[``b``, ``B``] for both driving sides"
msgstr "[``b``, ``B``] para ambos lados de conducción"

msgid "Default values when parameter is missing:"
msgstr ""

#, fuzzy
msgid "[``r``, ``R``] for directed graph"
msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)"

#, fuzzy
msgid "[``l``, ``L``] for undirected graph"
msgstr "Solo para grafos no dirigidos"

msgid "With points optional parameters"
msgstr "Parámetros opcionales para Con puntos"

msgid "``details``"
msgstr "``details``"

msgid "For showing points stops."
msgstr ""

msgid "When ``true`` the results will include the points that are in the path."
msgstr "Cuando ``true`` los resultados incluyen los puntos que están en el camino."

msgid "When ``false`` the results will not include the points that are in the path."
msgstr "Cuando ``false`` los resultados no incluyen los puntos que están en el camino."

msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point."
msgstr "Cuando las columnas ``start_vid``, ``end_vid`` y``node`` tengan valores negativos, el identificador es para un Punto."

msgid "Use ``pgr_findCloseEdges`` for points on the fly"
msgstr ""

msgid "Using :doc:`pgr_findCloseEdges`:"
msgstr "Usando :doc:`pgr_findCloseEdges`:"

msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph."
msgstr ""

msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`."
msgstr "Punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`."

msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`."
msgstr "Punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`."

msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)."
msgstr ""

msgid "Usage variations"
msgstr "Variaciones de uso"

msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph."
msgstr ""

msgid "Status of \"passes in front\" or \"visits\" of the nodes and points."
msgstr ""

msgid "The algorithm performs a :doc:`pgr_withPointsVia`"
msgstr "El algoritmo realiza una :doc:`pgr_withPointsVia`"

msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted."
msgstr ""

msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths."
msgstr ""

msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:"
msgstr ""

msgid "Getting the same result as ``pgr_trspVia_withPoints``:"
msgstr ""

msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it."
msgstr ""

msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag."
msgstr ""

msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge."
msgstr ""

msgid "``pgr_trsp_withPoints``"
msgstr "``pgr_trsp_withPoints``"

msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions."
msgstr ""

msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path."
msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Considerar las rutas inválidas en `Restrictions SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto."

msgid "Vertices of the graph are:"
msgstr "Los vértices del grafo son:"

msgid "**positive** when it belongs to the `Edges SQL`_"
msgstr ""

msgid "**negative** when it belongs to the `Points SQL`_"
msgstr "**negative** cuando pertence al `SQL de puntos`_"

msgid "The `agg_cost` in the non included values `(v, v)` is `0`"
msgstr "El `agg_cost` en los valores no incluidos `(v, v)` es `0`"

msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`"
msgstr "El `agg_cost` en los valores no incluidos `(u, v)` es :math:`\\infty`"

#, fuzzy
msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored."
msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`."

msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`"
msgstr "Tiempo de ejecución: :math:`O(|start\\_vids|\\times(V \\log V + E))`"

#, fuzzy
msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])"

#, fuzzy
msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])"

#, fuzzy
msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])"

#, fuzzy
msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])"

#, fuzzy
msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])"
msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])"

msgid "**options:** ``[directed, details]``"
msgstr "**opcionales:** ``[directed, details]``"

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)"
msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido. (con detalles)"

msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph"
msgstr "Desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido"

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)"
msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido. (sin detalles)"

# | msgid "From point :math:`1` to point :math:`3` and vertex :math:`5`."
#, fuzzy
msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving."
msgstr "Desde el punto :math:`1` y vértice :math:`6` al punto :math:`3` y vértice :math:`1`."

msgid "Two combinations"
msgstr "Dos combinaciones"

msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)"
msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con najando del lado derecho (con detalles)"

msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_."
msgstr "Usar :doc:`pgr_findCloseEdges` en el `SQL de puntos`_."

msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Wncontrar las rutas desde el vértice :math:`1` a las dos ubicaciones más cercanas en el grafo al punto`(2.9, 1.8)`."

#, fuzzy
msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions"
msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`"

msgid "Passes in front or visits with right side driving."
msgstr "Pasa enfrente o visita con lado derecho de manejo."

msgid "For point :math:`6` and vertex :math:`11`."
msgstr "Del punto :math:`6` al vértice :math:`11`."

msgid "Passes in front or visits with left side driving."
msgstr "Pasa enfrente o visita con lado izquierdo de manejo."

msgid "``pgr_turnRestrictedPath`` - Experimental"
msgstr "``pgr_turnRestrictedPath`` - Experimental"

msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions"
msgstr "``pgr_turnRestrictedPath`` Usando el algoritmo vértice -vértice de Yen para ruteo con restricciones"

msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions"
msgstr ""

msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])"
msgstr "pgr_turnRestrictedPath(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, **K**, [**opciones**])"

msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``"
msgstr "**opcionales:** ``[directed, heap_paths, stop_on_first, strict]``"

msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph"
msgstr "Del vértice :math:`3` al vértice :math:`8` en un grafo dirigido"

msgid "Special optional parameters"
msgstr ""

msgid "``stop_on_first``"
msgstr "``stop_on_first``"

msgid "When ``true`` stops on first path found that dos not violate restrictions"
msgstr ""

msgid "When ``false`` returns at most K paths"
msgstr ""

msgid "When ``true`` returns only paths that do not violate restrictions"
msgstr ""

msgid "When ``false`` returns the paths found"
msgstr ""

msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on."
msgstr ""

msgid "No results because the only path available follows a restriction."
msgstr ""

msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph"
msgstr "Del vértice :math:`3` al vértice :math:`8` en un grafo no dirigido"

msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives"
msgstr "Del vértice :math:`3` al vértice :math:`8` con más alternativas"

msgid "``pgr_version``"
msgstr "``pgr_version``"

msgid "``pgr_version`` — Query for pgRouting version information."
msgstr "``pgr_version`` — consulta de información sobre la versión de pgRouting."

msgid "Breaking change on result columns"
msgstr "Cambio estructural en las columnas de resultados"

msgid "Support for old signature ends"
msgstr "Soporte termina para antigua firma"

msgid "Returns pgRouting version information."
msgstr "Devuelve la información de la versión de pgRouting."

msgid "pgr_version()"
msgstr "pgr_version()"

msgid "RETURNS ``TEXT``"
msgstr "DEVUELVE ``TEXT``"

msgid "pgRouting Version for this documentation"
msgstr "Versión de pgRouting para esta documentación"

msgid "``pgr_vrpOneDepot`` - Experimental"
msgstr "``pgr_vrpOneDepot`` - Experimental"

msgid "**No documentation available**"
msgstr "**No hay documentación disponible**"

msgid "**TBD**"
msgstr "**TBD**"

msgid "TBD"
msgstr "Por Definirse"

msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices."
msgstr "``pgr_withPoints`` - Devuelve la ruta más corta de un grafo con vértices temporales adicionales."

msgid "pgr_withPoints(Combinations)"
msgstr "pgr_withPoints(Combinaciones)"

msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path."
msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto."

#, fuzzy
msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "**options:** ``[directed, details])``"
msgstr "**opcionales:** ``[directed, details]``"

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)"
msgstr "Desde el punto :math:`1` al vértice :math:`10` manjando del lado derecho en un grafo dirigido, (sin detalles)"

msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier."
msgstr "Identificador del vértice inicial de la ruta. Valor negativo es para identificador de punto."

msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers."
msgstr "Arreglo de identificadores de vértices iniciales. Valores negativos son para identificadores de puntos."

msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier."
msgstr "Identificador del vértice final de la ruta. Valor negativo es para identificador de punto."

msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers."
msgstr "Arreglo de identificadores de vértices finales. Valores negativos son para identificadores de puntos."

msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`"
msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`"

msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given."
msgstr "``pgr_withPointsCost`` - Calcula el camino más corto y devuelve sólo el coste agregado del camino más corto encontrado, para la combinación de puntos dada."

msgid "pgr_withPointsCost(Combinations)"
msgstr "pgr_withPointsCost(Combinaciones)"

msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found."
msgstr "Modificar el grafo para incluir los puntos definidos por points_sql. Utilizando el algoritmo de Dijkstra, devolver sólo el coste agregado del camino más corto encontrado."

msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph."
msgstr "Devuelve la suma de los costes de la ruta más corta para la combinación de pares de vértices en el grafo modificado."

#, fuzzy
msgid "The returned values are in the form of a set of |matrix-result|."
msgstr "Los valores devueltos tienen la forma de un conjunto de `(start_vid, end_vid, agg_cost)`."

msgid "**positive** when it belongs to the edges_sql"
msgstr "**positivo** cuando pertenece a edges_sql"

msgid "**negative** when it belongs to the points_sql"
msgstr "**negativo** cuando pertenece a points_sql"

msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`."
msgstr "Si los valores devueltos se almacenan en una tabla, el índice único sería el par: `(start_vid, end_vid)`."

msgid "For **undirected** graphs, the results are **symmetric**."
msgstr "Para los grafos **no dirigidos**, los resultados son **simétricos**."

#, fuzzy
msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "**options:** ``[directed]``"
msgstr "**opcionales:** ``[directed, cap]``"

msgid "There is no **details** flag, unlike the other members of the withPoints family of functions."
msgstr "No hay identificador de **details**, a diferencia de los otros miembros de la familia de funciones withPoints."

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
#, fuzzy
msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph."
msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido con detalles."

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
#, fuzzy
msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph."
msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido, con detalles."

#, fuzzy
msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving."
msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con lado de manejo **derecho**."

msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Encontrar el costo de las rutas desde el vértice :math:`1` a las dos ubicaciones mpas cercanas en el grafo desde el punto `(2.9, 1.8)`."

msgid "Being close to the graph does not mean have a shorter route."
msgstr "Estar cercano al grafo no significa tener la ruta más corta."

msgid "Right side driving topology"
msgstr "Topología de manejo del lado derecho"

msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`"
msgstr "Desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}`y vértices :math:`\\{10, 11\\}`"

msgid "Left side driving topology"
msgstr "Topología de manejo del lado izquierdo"

msgid "Does not matter driving side driving topology"
msgstr "No importa el lado de manejo"

msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`."
msgstr "``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando :doc:`pgr_withPoints`."

#, fuzzy
msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])"

msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph"
msgstr "Matriz de costos para puntos :math:`\\{1, 6\\}` y vértices :math:`\\{10, 11\\}` en un grafo **no dirigido**"

msgid "Returning a **symmetrical** cost matrix"
msgstr "Devolver una matriz de costes **simétrica**"

msgid "Using the default ``side`` value on the **points_sql** query"
msgstr "Uso del valor predeterminado ``side`` en la consulta **SQL de puntos**"

#, fuzzy
msgid "Using the default ``driving side`` value"
msgstr "Usando el valor predeterminado ``driving_side``"

msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`."

msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point."
msgstr "``pgr_withPointsDD`` - Devuelve la **distancia** de conducción desde un punto de partida."

#, fuzzy
msgid "Output columns standardized to |result-spantree|"
msgstr "Las nuevas columnas de salida son |result-spantree|"

msgid "When ``details`` is ``false``:"
msgstr "Cuando ``details`` es ``false``:"

msgid "Points reached within the distance are not included."
msgstr ""

msgid "Deprecated signatures:"
msgstr "Firmas obsoletas:"

msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree."
msgstr "Modifica el grafo para incluir puntos y utilizando el algoritmo Dijkstra, extrae todos los nodos y puntos que tienen costes menores o iguales que el valor de ``**distance**`` desde el punto inicial. Las aristas extraídas conformarán el árbol de expansión correspondiente."

#, fuzzy
msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])"
msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])"

#, fuzzy
msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])"
msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])"

msgid "**options A:** ``[directed, details]``"
msgstr "**opciones A:** ``[directed, details]``"

msgid "**options B:** ``[directed, details, equicost]``"
msgstr "**opciones B:** ``[directed, details, equicost]``"

#, fuzzy
msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])"
msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])"

msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details."
msgstr "Topología de manejo por el lado derecho desde el punto :math:`1` con una distancia :math:`3.3`, detallada."

#, fuzzy
msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])"
msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])"

msgid "**options:** ``[directed, details, equicost]``"
msgstr "**opcionales:** ``[directed, details, equicost]``"

msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph"
msgstr "Desde el punto :math:`1` y el vértice :math:`16` dentro de una distancia de :math:`3.3` con ``equicost`` en un grafo dirigido"

msgid "Negative values represent a point"
msgstr "Valores negativos representan un punto"

msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Encontrar la distancia de manejo de las dos ubicaciones más cercanas al grafo del punto `(2.8, 1.8)`."

msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`."
msgstr "El punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`."

msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`."
msgstr "El punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`."

msgid "Driving side does not matter"
msgstr "Lado de manejo no importa"

msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details."
msgstr "Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin importar el lado de manejo, detallada."

msgid "``pgr_withPointsKSP``"
msgstr "``pgr_withPointsKSP``"

msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra."
msgstr "``pgr_withPointsKSP`` - Encuentra las rutas más cortas de K usando el algoritmo de Yen."

msgid "pgr_withPointsKSP(One to Many)"
msgstr "pgr_withPointsKSP(Uno a Muchos)"

msgid "pgr_withPointsKSP(Many to One)"
msgstr "pgr_withPointsKSP(Muchos a Uno)"

msgid "pgr_withPointsKSP(Many to Many)"
msgstr "pgr_withPointsKSP(Muchos a Muchos)"

msgid "pgr_withPointsKSP(Combinations)"
msgstr "pgr_withPointsKSP(Combinaciones)"

msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths."
msgstr "Modifica el grafo para incluir los puntos definidos en el `SQL de puntos`_ y utilizando el algoritmo Yen, encuentra las :math:`K` rutas más cortas."

#, fuzzy
msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])"

msgid "**options:** ``[directed, heap_paths, details]``"
msgstr "**opciones:** ``[directed, heap_paths, details]``"

msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving."
msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`2` en un grafo dirigido con lado de manejo **izquierdo**."

msgid "For a directed graph."
msgstr "Para un grafo dirigido."

msgid "No details are given about distance of other points of the query."
msgstr "No se proporcionan detalles sobre la distancia de otros puntos de la consulta."

msgid "No heap paths are returned."
msgstr "No se devuelven rutas pre-calculadas."

msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph"
msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido"

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**"
msgstr "Obtener una ruta desde el punto :math:`1` y del vértice :math:`6` al punto :math:`3` en un grafo **dirigido**, con lado de manejo a la **derecha** y con ``details`` puesto en ``true``"

# | msgid ""
# | "From point :math:`1` to vertex :math:`3` with details on a **left** "
# | "driving side configuration on a **directed** graph with **details**."
msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**"
msgstr "Obtener una ruta desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y al vértice :math:`1` en un grafo **dirigido** con lado de manejo **izquierda**, con ``heap_paths`` puesto en ``true``"

msgid "Using a combinations table on an **directed** graph"
msgstr "Usando una tabla de combinaciones en un grafo **dirigido**"

msgid "Number of required paths"
msgstr "Cantidad de rutas requeridas"

msgid "withPointsKSP optional parameters"
msgstr "Parámetros opcionales para withPointsKSP"

msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`."
msgstr "Obtener :math:`2` caminos usando el lado izquierdo de manejo, desde el vértice :math:`1` a la ubicación mpas cercana en el grafo al punto `(2.9, 1.8)`."

msgid "Left driving side"
msgstr "Lado de manejo izquierdo"

msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details."
msgstr "Obtener :math:`2` rutas, usando topología de manejo por la izquierda, desde el punto :math:`1` al punto :math:`3`, detallado."

msgid "Right driving side"
msgstr "Lado de manejo derecho"

msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details."
msgstr "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas."

msgid "``pgr_withPointsVia``"
msgstr "``pgr_withPointsVia``"

msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points."
msgstr "``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos."

msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`."
msgstr ""

#, fuzzy
msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])"
msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])"

#, fuzzy
msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.."
msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido."

msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_"
msgstr ""

msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph."
msgstr ""

msgid "Prim - Family of functions"
msgstr "Prim - Familia de funciones"

msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex."
msgstr "El algoritmo prim fue desarrollado en 1930 por el matemático checo Vojtěch Jarník. Es un algoritmo ambicioso que encuentra un árbol de expansión mínimo para un grafo ponderado no dirigido. Esto significa que encuentra un subconjunto de los bordes que forma un árbol que incluye cada vértice, donde se minimiza el peso total de todos los bordes del árbol. El algoritmo funciona creando este árbol un vértice a la vez, desde un vértice inicial arbitrario, paso a paso agregando la conexión más barata posible desde el árbol a otro vértice."

msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest."
msgstr "Estos algoritmos encuentran el bosque de expansión mínimo en un grafo posiblemente desconectado; en cambio, la forma más básica del algoritmo de Prim sólo encuentra árboles de expansión mínimos en los grafos conectados. Sin embargo, al ejecutar el algoritmo de Prim por separado para cada componente conectado del grafo, se denomina bosque de expansión mínimo."

msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\""
msgstr "De boost Graph: \"El algoritmo tal como se aplica en el Boost.Graph no produce resultados correctos en grafos con segmentos paralelos.\""

msgid "Boost: `Prim's algorithm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
msgstr "Boost: `Algoritmo de Prim <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"

msgid "Wikipedia: `Prim's algorithm <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"
msgstr "Wikipedia: `Algoritmo de Prim <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"

msgid "Proposed Functions"
msgstr "Funciones propuestas"

msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph."
msgstr ":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de líneas."

msgid "Reference"
msgstr "Referencia"

msgid "Release Notes"
msgstr "Notas de versión"

msgid "To see the full list of changes check the list of `Git commits <https://github.com/pgRouting/pgrouting/commits>`_ on Github."
msgstr "Para ver la lista completa de cambios, consulte la lista de `Git commits <https://github.com/pgRouting/pgrouting/commits>`_ en Github."

msgid "Mayors"
msgstr ""

msgid "pgRouting 4"
msgstr "pgRouting 4"

msgid "Minors 4.x"
msgstr ""

#, fuzzy
msgid "pgRouting 4.1"
msgstr "pgRouting 4.0"

#, fuzzy
msgid "pgRouting 4.1.0 Release Notes"
msgstr "Notas de la Versión pgRouting 3.1.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.1.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "Bug Fixes"
msgstr "Corrección de errores"

#, fuzzy
msgid "`#2966 <https://github.com/pgRouting/pgrouting/issues/2966>`__: pgr_withPoints does not pick optimal route when fraction = 1"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCostMatrix"

msgid "Code enhancement"
msgstr "Mejora del código"

#, fuzzy
msgid "`#3025 <https://github.com/pgRouting/pgrouting/issues/3025>`__: Ordering functions standardized"
msgstr "`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: pgr_kingOrdering"

msgid "pgRouting 3"
msgstr "pgRouting 3"

msgid "Minors 3.x"
msgstr ""

msgid "pgRouting 3.8"
msgstr "pgRouting 3.8"

msgid "pgRouting 3.8.0 Release Notes"
msgstr "Notas de la versión de pgRouting 3.8.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`_"

msgid "Promotion to official function of pgRouting."
msgstr "Promoción a función oficial de pgRouting."

#, fuzzy
msgid "Metric"
msgstr "Métricas"

#, fuzzy
msgid "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: Promoted to official pgr_degree in version 3.8"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: pgr_degree"

msgid "Utilities"
msgstr "Utilidades"

#, fuzzy
msgid "`#2772 <https://github.com/pgRouting/pgrouting/issues/2772>`__: Promoted to official pgr_extractVertices in version 3.8"
msgstr "`#2772 <https://github.com/pgRouting/pgrouting/issues/2772>`__: pgr_extractVertices"

#, fuzzy
msgid "`#2774 <https://github.com/pgRouting/pgrouting/issues/2774>`__: Promoted to official pgr_findCloseEdges in version 3.8"
msgstr "`#2774 <https://github.com/pgRouting/pgrouting/issues/2774>`__: pgr_findCloseEdges"

#, fuzzy
msgid "`#2873 <https://github.com/pgRouting/pgrouting/issues/2873>`__: Promoted to official pgr_separateCrossing in version 3.8"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: pgr_degree"

#, fuzzy
msgid "`#2874 <https://github.com/pgRouting/pgrouting/issues/2874>`__: Promoted to official pgr_separateTouching in version 3.8"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: pgr_degree"

#, fuzzy
msgid "Proposed functions"
msgstr "Funciones propuestas"

msgid "Contraction"
msgstr "Contracción"

#, fuzzy
msgid "`#2790 <https://github.com/pgRouting/pgrouting/issues/2790>`__: pgr_contractionDeadEnd new contraction function"
msgstr "`#2790 <https://github.com/pgRouting/pgrouting/issues/2790>`__: pgr_contractionDeadEnd"

#, fuzzy
msgid "`#2791 <https://github.com/pgRouting/pgrouting/issues/2791>`__: pgr_contractionLinear new contraction function"
msgstr "`#2791 <https://github.com/pgRouting/pgrouting/issues/2791>`__: pgr_contractionLinear"

#, fuzzy
msgid "`#2536 <https://github.com/pgRouting/pgrouting/issues/2536>`__: Support for contraction hierarchies (pgr_contractionHierarchies)"
msgstr "`#2791 <https://github.com/pgRouting/pgrouting/issues/2791>`__: pgr_contractionLinear"

#, fuzzy
msgid "`#2848 <https://github.com/pgRouting/pgrouting/issues/2848>`__: Create pgr_separateCrossing new utility function"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: pgr_degree"

#, fuzzy
msgid "`#2849 <https://github.com/pgRouting/pgrouting/issues/2849>`__: Create of pgr_separateTouching new utility function"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: pgr_degree"

msgid "Official functions changes"
msgstr "Cambios en las funciones oficiales"

#, fuzzy
msgid "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) new signature"
msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction"

msgid "C/C++ code enhancements"
msgstr "Mejora de código C/C++"

#, fuzzy
msgid "`#2802 <https://github.com/pgRouting/pgrouting/issues/2802>`__: Code reorganization on pgr_contraction"
msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction"

msgid "Other enhancements:"
msgstr "Otras mejoras:"

msgid "`#2869 <https://github.com/pgRouting/pgrouting/issues/2869>`__:"
msgstr "`#2869 <https://github.com/pgRouting/pgrouting/issues/2869>`__:"

msgid "SQL code enhancements"
msgstr "Mejora del código SQL"

#, fuzzy
msgid "`#2850 <https://github.com/pgRouting/pgrouting/issues/2850>`__: Rewrite pgr_nodeNetwork"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: pgr_degree"

msgid "Deprecation of SQL functions"
msgstr "Funciones obsoletas SQL"

#, fuzzy
msgid "`#2749 <https://github.com/pgRouting/pgrouting/issues/2749>`__: Deprecate pgr_AlphaShape in 3.8"
msgstr "`#2754 <https://github.com/pgRouting/pgrouting/issues/2754>`__: pgr_analyzeOneWay"

#, fuzzy
msgid "`#2750 <https://github.com/pgRouting/pgrouting/issues/2750>`__: Deprecate pgr_CreateTopology in 3.8"
msgstr "`#2750 <https://github.com/pgRouting/pgrouting/issues/2750>`__: pgr_createTopology"

#, fuzzy
msgid "`#2753 <https://github.com/pgRouting/pgrouting/issues/2753>`__: Deprecate pgr_analyzeGraph in 3.8"
msgstr "`#2753 <https://github.com/pgRouting/pgrouting/issues/2753>`__: pgr_analyzeGraph"

#, fuzzy
msgid "`#2754 <https://github.com/pgRouting/pgrouting/issues/2754>`__: Deprecate pgr_analyzeOneWay in 3.8"
msgstr "`#2754 <https://github.com/pgRouting/pgrouting/issues/2754>`__: pgr_analyzeOneWay"

#, fuzzy
msgid "`#2826 <https://github.com/pgRouting/pgrouting/issues/2826>`__: Deprecate pgr_createVerticesTable in 3.8"
msgstr "`#2826 <https://github.com/pgRouting/pgrouting/issues/2826>`__: pgr_createVerticesTable"

msgid "In the deprecated functions:"
msgstr "En las funciones obsoletas:"

msgid "Migration section is created."
msgstr "sección de migración es creada."

#, fuzzy
msgid "The use of the functions is removed in the documentation."
msgstr "La respuesta a esta pregunta dependerá de la aplicación."

msgid "pgRouting 3.7"
msgstr "pgRouting 3.7"

msgid "pgRouting 3.7.3 Release Notes"
msgstr "Notas de la versión de pgRouting 3.7.3"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

#, fuzzy
msgid "`#2731 <https://github.com/pgRouting/pgrouting/issues/2731>`__: Build Failure on Ubuntu 22"
msgstr "`#2731 <https://github.com/pgRouting/pgrouting/pull/2731>`__ Construcción falla en Ubuntu 22"

msgid "pgRouting 3.7.2 Release Notes"
msgstr "Notas de la versión de pgRouting 3.7.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

#, fuzzy
msgid "`#2713 <https://github.com/pgRouting/pgrouting/issues/2713>`__: cmake missing some policies and min version"
msgstr "`#2713 <https://github.com/pgRouting/pgrouting/pull/2713>`__ cmake le falta algunas políticas y versión minima"

msgid "Using OLD policies: CMP0148, CMP0144, CMP0167"
msgstr ""

msgid "Minimum cmake version 3.12"
msgstr ""

#, fuzzy
msgid "`#2707 <https://github.com/pgRouting/pgrouting/issues/2707>`__: Build failure in pgRouting 3.7.1 on Alpine"
msgstr "`#2707 <https://github.com/pgRouting/pgrouting/pull/2707>`__ Falla de construcción en Alpine para pgRouting 3.7.1"

#, fuzzy
msgid "`#2706 <https://github.com/pgRouting/pgrouting/issues/2706>`__: winnie crashing on pgr_betweennessCentrality"
msgstr "`#2706 <https://github.com/pgRouting/pgrouting/pull/2706>`__ winnie falla en pgr_betweennessCentrality"

msgid "pgRouting 3.7.1 Release Notes"
msgstr "Notas de la versión de pgRouting 3.7.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

#, fuzzy
msgid "`#2680 <https://github.com/pgRouting/pgrouting/issues/2680>`__: fails to compile under mingw64 gcc 13.2"
msgstr "`#2680 <https://github.com/pgRouting/pgrouting/pull/2680>`__ Compilación falla bajo mingw64 gcc 13.2"

#, fuzzy
msgid "`#2689 <https://github.com/pgRouting/pgrouting/issues/2689>`__: When point is a vertex, the withPoints family do not return results."
msgstr "`#2689 <https://github.com/pgRouting/pgrouting/pull/2689>`__ Cuando el punto es un vértice, la familia withPoints no devuelve resultados."

msgid "C/C++ code enhancemet"
msgstr "Mejora del código C/C++"

msgid "TRSP family"
msgstr "Familia TRSP"

msgid "pgRouting 3.7.0 Release Notes"
msgstr "Notas de la versión de pgRouting 3.7.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`_"

msgid "Support"
msgstr "Soporte"

#, fuzzy
msgid "`#2656 <https://github.com/pgRouting/pgrouting/issues/2656>`__: Stop support of PostgreSQL12 on pgrouting v3.7"
msgstr "`#2656 <https://github.com/pgRouting/pgrouting/pull/2656>`__ PostgreSQL 12 no se apya en pgrouting v3.7"

msgid "Stopping support of PostgreSQL 12"
msgstr "PostgreSQL 12 ya no es soportado"

msgid "CI does not test for PostgreSQL 12"
msgstr "CI no hace pruebas con PostgreSQL 12"

msgid "pgr_betweennessCentrality"
msgstr "pgr_betweennessCentrality"

#, fuzzy
msgid "`#2605 <https://github.com/pgRouting/pgrouting/issues/2605>`__: Standardize spanning tree functions output"
msgstr "`#2605 <https://github.com/pgRouting/pgrouting/pull/2605>`__ Estandarización de resultados de las funciones de árbol de expansión"

msgid "Functions:"
msgstr "Funciones:"

msgid "Experimental promoted to proposed."
msgstr "Experimental promovido a propuesto."

#, fuzzy
msgid "`#2635 <https://github.com/pgRouting/pgrouting/issues/2635>`__: pgr_LineGraph ignores directed flag and use negative values for identifiers."
msgstr "`#2635 <https://github.com/pgRouting/pgrouting/pull/2635>`__ pgr_LineGraph ignora la bandera directed y usa valores negatives para identificadores."

msgid "``pgr_lineGraph``"
msgstr "``pgr_lineGraph``"

#, fuzzy
msgid "`#2599 <https://github.com/pgRouting/pgrouting/issues/2599>`__: Driving distance cleanup"
msgstr "`#2599 <https://github.com/pgRouting/pgrouting/pull/2599>`__ Limpieza de la distancia de conducción"

#, fuzzy
msgid "`#2607 <https://github.com/pgRouting/pgrouting/issues/2607>`__: Read postgresql data on C++"
msgstr "`#2607 <https://github.com/pgRouting/pgrouting/pull/2607>`__ Leer datos postgresql en C++"

#, fuzzy
msgid "`#2614 <https://github.com/pgRouting/pgrouting/issues/2614>`__: Clang tidy does not work"
msgstr "`#2614 <https://github.com/pgRouting/pgrouting/pull/2614>`__ Clang tidy no funciona"

msgid "pgRouting 3.6"
msgstr "pgRouting 3.6"

msgid "pgRouting 3.6.3 Release Notes"
msgstr "Notas de la versión de pgRouting 3.6.3"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"
msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"

msgid "Explicit minimum requirements:"
msgstr ""

msgid "postgres 11.0.0"
msgstr ""

msgid "postgis 3.0.0"
msgstr "postgis 3.0.0"

msgid "g++ 13+ is supported"
msgstr ""

msgid "Code fixes"
msgstr "Corrección de código"

msgid "Fix warnings from cpplint."
msgstr ""

msgid "Fix warnings from clang 18."
msgstr ""

msgid "CI tests"
msgstr "Pruebas CI"

msgid "Add a clang tidy test on changed files."
msgstr ""

msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2"
msgstr ""

msgid "Documentation"
msgstr "Documentación"

msgid "Results of documentation queries adujsted to boost 1.83.0 version:"
msgstr ""

msgid "pgr_stoerWagner"
msgstr "pgr_stoerWagner"

msgid "pgtap tests"
msgstr "Pruebas pgtap"

msgid "bug fixes"
msgstr "corrección de errores"

msgid "pgRouting 3.6.2 Release Notes"
msgstr "Notas de la versión de pgRouting 3.6.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"
msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"

msgid "Upgrade fix"
msgstr ""

msgid "The upgrade was failing for same minor"
msgstr ""

msgid "Fix warnings from cpplint"
msgstr ""

msgid "Others"
msgstr "Otros"

msgid "Adjust NEWS generator"
msgstr "Ajustar el generador NEWS"

msgid "Name change to `NEWS.md` for better visualization on GitHub"
msgstr "Cambio de nombre a `NEWS.md` para una mejor visualización en GitHub"

msgid "pgRouting 3.6.1 Release Notes"
msgstr "Notas de la versión 3.6.1 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`_"

#, fuzzy
msgid "`#2588 <https://github.com/pgRouting/pgrouting/issues/2588>`__: pgrouting 3.6.0 fails to build on OSX"
msgstr "`#2588 <https://github.com/pgRouting/pgrouting/pull/2588>`__ pgrouting 3.6.0 no construye en OSX"

msgid "pgRouting 3.6.0 Release Notes"
msgstr "Notas de la versión 3.6.0 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`_"

#, fuzzy
msgid "`#2516 <https://github.com/pgRouting/pgrouting/issues/2516>`__: Standardize output pgr_aStar"
msgstr "`#2516 <https://github.com/pgRouting/pgrouting/pull/2516>`__ Estandarización de resultados de pgr_aStar"

msgid "Standardize output columns to |short-generic-result|"
msgstr "Estandard de las columnas de salida a |short-generic-result|"

#, fuzzy
msgid "`#2523 <https://github.com/pgRouting/pgrouting/issues/2523>`__: Standardize output pgr_bdAstar"
msgstr "`#2523 <https://github.com/pgRouting/pgrouting/pull/2523>`__ Estandarización de resultados de pgr_bdAstar"

#, fuzzy
msgid "`#2547 <https://github.com/pgRouting/pgrouting/issues/2547>`__: Standardize output and modifying signature pgr_KSP"
msgstr "`#2547 <https://github.com/pgRouting/pgrouting/pull/2547>`__ Estandarización de resultados y modificación de firmas de pgr_KSP"

#, fuzzy
msgid "`#2548 <https://github.com/pgRouting/pgrouting/issues/2548>`__: Standardize output pgr_drivingDistance"
msgstr "`#2548 <https://github.com/pgRouting/pgrouting/pull/2548>`__ Estandarización de resultados de pgr_drivingDistance"

msgid "Proposed functions changes"
msgstr "Cambios en funciones propuestas"

#, fuzzy
msgid "`#2544 <https://github.com/pgRouting/pgrouting/issues/2544>`__: Standardize output and modifying signature pgr_withPointsDD"
msgstr "`#2544 <https://github.com/pgRouting/pgrouting/pull/2544>`__ Estandarización de resultados y modificación de firmas de pgr_withPointsDD"

#, fuzzy
msgid "`#2546 <https://github.com/pgRouting/pgrouting/issues/2546>`__: Standardize output and modifying signature pgr_withPointsKSP"
msgstr "`#2546 <https://github.com/pgRouting/pgrouting/pull/2546>`__ Estandarización de resultados y modificación de firmas de pgr_withPointsKSP"

#, fuzzy
msgid "`#2504 <https://github.com/pgRouting/pgrouting/issues/2504>`__: To C++ pg data get, fetch and check."
msgstr "`#2504 <https://github.com/pgRouting/pgrouting/pull/2504>`__ A C++ pg data obtener, cachar y checar."

msgid "Stopping support for compilation with MSVC."
msgstr ""

#, fuzzy
msgid "`#2505 <https://github.com/pgRouting/pgrouting/issues/2505>`__: Using namespace."
msgstr "`#2505 <https://github.com/pgRouting/pgrouting/pull/2505>`__ Usando namespace."

#, fuzzy
msgid "`#2512 <https://github.com/pgRouting/pgrouting/issues/2512>`__: [Dijkstra] Removing duplicate code on Dijkstra."
msgstr "`#2512 <https://github.com/pgRouting/pgrouting/pull/2512>`__ [Dijkstra] Elimiar código duplicado en Dijkstra."

#, fuzzy
msgid "`#2517 <https://github.com/pgRouting/pgrouting/issues/2517>`__: Astar code simplification."
msgstr "`#2517 <https://github.com/pgRouting/pgrouting/pull/2517>`__ Simplificación del código de Astar."

#, fuzzy
msgid "`#2521 <https://github.com/pgRouting/pgrouting/issues/2521>`__: Dijkstra code simplification."
msgstr "`#2521 <https://github.com/pgRouting/pgrouting/pull/2521>`__ Simplificación del código de Dijkstra."

#, fuzzy
msgid "`#2522 <https://github.com/pgRouting/pgrouting/issues/2522>`__: bdAstar code simplification."
msgstr "`#2522 <https://github.com/pgRouting/pgrouting/pull/2522>`__ Simplificación del código de bdAstar."

#, fuzzy
msgid "`#2490 <https://github.com/pgRouting/pgrouting/issues/2490>`__: Automatic page history links."
msgstr "`#2490 <https://github.com/pgRouting/pgrouting/pull/2490>`__ Lígas automáticas historiales."

msgid "..rubric:: Standardize SQL"
msgstr ""

#, fuzzy
msgid "`#2555 <https://github.com/pgRouting/pgrouting/issues/2555>`__: Standardize deprecated messages"
msgstr "`#2555 <https://github.com/pgRouting/pgrouting/pull/2555>`__ Estandarización de mensajes de depreciación"

msgid "On new internal function: do not use named parameters and default parameters."
msgstr ""

msgid "pgRouting 3.5"
msgstr "pgRouting 3.5"

msgid "pgRouting 3.5.1 Release Notes"
msgstr "Notas de la versión 3.5.1 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`_"

msgid "Documentation fixes"
msgstr "Arreglos a la documentación"

msgid "Changes on the documentation to the following:"
msgstr ""

msgid "pgr_degree"
msgstr "pgr_degree"

msgid "pgr_ksp"
msgstr "pgr_ksp"

msgid "Automatic page history links"
msgstr ""

msgid "using bootstrap_version 2 because 3+ does not do dropdowns"
msgstr ""

msgid "Issue fixes"
msgstr "Corrección de problema"

#, fuzzy
msgid "`#2565 <https://github.com/pgRouting/pgrouting/issues/2565>`__: pgr_lengauerTarjanDominatorTree triggers an assertion"
msgstr "`#2565 <https://github.com/pgRouting/pgrouting/issues/2565>`__ pgr_lengauerTarjanDominatorTree genera un error de afirmación"

msgid "SQL enhancements"
msgstr "Mejoras SQL"

#, fuzzy
msgid "`#2561 <https://github.com/pgRouting/pgrouting/issues/2561>`__: Not use wildcards on SQL"
msgstr "`#2561 <https://github.com/pgRouting/pgrouting/issues/2561>`__ No usar comodines en SQL"

#, fuzzy
msgid "`#2559 <https://github.com/pgRouting/pgrouting/issues/2559>`__: pgtap test using sampledata"
msgstr "`#2559 <https://github.com/pgRouting/pgrouting/issues/2559>`__ pruebas pgtap test usando datos muestra"

msgid "Build fixes"
msgstr "Correcciones de construcción"

msgid "Fix winnie build"
msgstr ""

msgid "Fix clang warnings"
msgstr ""

msgid "Grouping headers of postgres readers"
msgstr ""

msgid "pgRouting 3.5.0 Release Notes"
msgstr "Notas de la versión 3.5.0 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`_"

msgid "Dijkstra"
msgstr "Dijkstra"

msgid "pgRouting 3.4"
msgstr "pgRouting 3.4"

msgid "pgRouting 3.4.2 Release Notes"
msgstr "Notas de la versión 3.4.2 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para esta versión, consulte la `meta cerrada 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%2>`_"

msgid "`#2394 <https://github.com/pgRouting/pgrouting/issues/2394>`__: pgr_bdAstar accumulates heuristic cost in visited node cost."
msgstr "`#2394 <https://github.com/pgRouting/pgrouting/issues/2394>`__: pgr_bdAstar acumulata el costo de la heuristic en el costo del nodo visitado."

msgid "`#2427 <https://github.com/pgRouting/pgrouting/issues/2427>`__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record."
msgstr "`#2427 <https://github.com/pgRouting/pgrouting/issues/2427>`__: pgr_createVerticesTable & pgr_createTopology, variable debe ser de tipo Record."

msgid "pgRouting 3.4.1 Release Notes"
msgstr "Notas de la versión 3.4.1 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%21>`_"

msgid "`#2401 <https://github.com/pgRouting/pgrouting/issues/2401>`__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing"
msgstr "`#2401 <https://github.com/pgRouting/pgrouting/issues/2401>`__: pgRouting 3.4.0 no construye la documentación cuando Sphinx es muy bajo o falta"

msgid "`#2398 <https://github.com/pgRouting/pgrouting/issues/2398>`__: v3.4.0 does not upgrade from 3.3.3"
msgstr "`#2398 <https://github.com/pgRouting/pgrouting/issues/2398>`__: v3.4.0 does no actualiza desde 3.3.3"

msgid "pgRouting 3.4.0 Release Notes"
msgstr "Notas de la versión 3.4.0 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`_"

msgid "`#1891 <https://github.com/pgRouting/pgrouting/issues/1891>`__: pgr_ksp doesn't give all correct shortest path"
msgstr ""

msgid "New proposed functions."
msgstr "Nuevas funciones propuestas."

msgid "With points"
msgstr "Con puntos"

msgid "pgr_withPointsVia(One Via)"
msgstr "pgr_withPointsVia(Una Vía)"

msgid "Turn Restrictions"
msgstr "Restricciones de giro"

msgid "Via with turn restrictions"
msgstr "Trayectoria con restricciones de giro"

msgid "pgr_trspVia(One Via)"
msgstr "pgr_trspVia(Una Vía)"

msgid "pgr_trspVia_withPoints(One Via)"
msgstr "pgr_trspVia_withPoints(Una Vía)"

msgid "pgr_trsp_withPoints(One to One)"
msgstr "pgr_trsp_withPoints(Uno a Uno)"

msgid "pgr_trsp_withPoints(One to Many)"
msgstr "pgr_trsp_withPoints(Uno a Muchos)"

msgid "pgr_trsp_withPoints(Many to One)"
msgstr "pgr_trsp_withPoints(Muchos a Uno)"

msgid "pgr_trsp_withPoints(Many to Many)"
msgstr "pgr_trsp_withPoints(Muchos a Muchos)"

msgid "pgr_trsp_withPoints(Combinations)"
msgstr "pgr_trsp_withPoints(Combinaciones)"

msgid "Topology"
msgstr "Topología"

msgid "pgr_findCloseEdges(One point)"
msgstr "pgr_findCloseEdges(Un punto)"

msgid "pgr_findCloseEdges(Many points)"
msgstr "pgr_findCloseEdges(Muchos puntos)"

msgid "pgr_cuthillMckeeOrdering"
msgstr "pgr_cuthillMckeeOrdering"

msgid "Unclassified"
msgstr "No clasificado"

msgid "pgr_hawickCircuits"
msgstr "pgr_hawickCircuits"

msgid "Flow functions"
msgstr "Funciones de flujo"

msgid "pgr_maxCardinalityMatch(text)"
msgstr "pgr_maxCardinalityMatch(text)"

msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)"
msgstr "Ossoleto: pgr_maxCardinalityMatch(text,boolean)"

msgid "Deprecated Functions"
msgstr "Funciones obsoletas"

msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)"
msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)"

msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)"
msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)"

msgid "pgRouting 3.3"
msgstr "pgRouting 3.3"

msgid "pgRouting 3.3.5 Release Notes"
msgstr "Notas de la versión 3.3.5 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.5%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

msgid "pgRouting 3.3.4 Release Notes"
msgstr "Notas de la versión 3.3.4 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

msgid "`#2400 <https://github.com/pgRouting/pgrouting/issues/2400>`__: pgRouting 3.3.3 does not build in focal"
msgstr "`#2400 <https://github.com/pgRouting/pgrouting/issues/2400>`__: pgRouting 3.3.3 no es construido en focal"

msgid "pgRouting 3.3.3 Release Notes"
msgstr "Notas de la versión 3.3.3 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.3%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada 3.3.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`_"

msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs."
msgstr "Ignorando el parametro opcional boleano, ya que el algortítmo trabaja solo para grafos dirigidos."

msgid "pgRouting 3.3.2 Release Notes"
msgstr "Notas de la versión 3.3.2 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`_"

msgid "Revised documentation"
msgstr ""

msgid "Simplifying table names and table columns, for example:"
msgstr ""

msgid "``edges`` instead of ``edge_table``"
msgstr ""

msgid "Removing unused columns ``category_id`` and ``reverse_category_id``."
msgstr ""

msgid "``combinations`` instead of ``combinations_table``"
msgstr ""

msgid "Using PostGIS standard for geometry column."
msgstr ""

msgid "``geom`` instead of ``the_geom``"
msgstr ""

msgid "Avoiding usage of functions that modify indexes, columns etc on tables."
msgstr ""

msgid "Using ``pgr_extractVertices`` to create a routing topology"
msgstr ""

msgid "Restructure of the pgRouting concepts page."
msgstr ""

msgid "`#2276 <https://github.com/pgRouting/pgrouting/issues/2276>`__: edgeDisjointPaths issues with start_vid and combinations"
msgstr ""

msgid "`#2312 <https://github.com/pgRouting/pgrouting/issues/2312>`__: pgr_extractVertices error when target is not BIGINT"
msgstr ""

msgid "`#2357 <https://github.com/pgRouting/pgrouting/issues/2357>`__: Apply clang-tidy performance-*"
msgstr "`#2357 <https://github.com/pgRouting/pgrouting/issues/2357>`__: Aplicar clang-tidy performance-*"

msgid "pgRouting 3.3.1 Release Notes"
msgstr "Notas de la versión 3.3.1 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "`#2216 <https://github.com/pgRouting/pgrouting/issues/2216>`__: Warnings when using clang"
msgstr ""

msgid "`#2266 <https://github.com/pgRouting/pgrouting/issues/2266>`__: Error processing restrictions"
msgstr ""

msgid "pgRouting 3.3.0 Release Notes"
msgstr "Notas de la versión 3.3.0 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`_"

msgid "`#2057 <https://github.com/pgRouting/pgrouting/issues/2057>`__: trspViaEdges columns in different order"
msgstr "`#2057 <https://github.com/pgRouting/pgrouting/issues/2057>`__: columnas trspViaEdges en orden diferente"

msgid "`#2087 <https://github.com/pgRouting/pgrouting/issues/2087>`__: pgr_extractVertices to proposed"
msgstr "`#2087 <https://github.com/pgRouting/pgrouting/issues/2087>`__: pgr_extractVertices a propuesto"

msgid "`#2201 <https://github.com/pgRouting/pgrouting/issues/2201>`__: pgr_depthFirstSearch to proposed"
msgstr "`#2201 <https://github.com/pgRouting/pgrouting/issues/2201>`__: pgr_depthFirstSearch a propuesto"

msgid "`#2202 <https://github.com/pgRouting/pgrouting/issues/2202>`__: pgr_sequentialVertexColoring to proposed"
msgstr "`#2202 <https://github.com/pgRouting/pgrouting/issues/2202>`__: pgr_sequentialVertexColoring a propuesto"

msgid "`#2203 <https://github.com/pgRouting/pgrouting/issues/2203>`__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed"
msgstr "`#2203 <https://github.com/pgRouting/pgrouting/issues/2203>`__: pgr_dijkstraNear y pgr_dijkstraNearCost a propuesto"

msgid "Coloring"
msgstr "Coloreo"

msgid "Experimental promoted to Proposed"
msgstr "Experimental promovido a Propuesto"

msgid "pgr_dijkstraNear(Combinations)"
msgstr "pgr_dijkstraNear(Combinaciones)"

msgid "pgr_dijkstraNear(Many to Many)"
msgstr "pgr_dijkstraNear(Muchos a Muchos)"

msgid "pgr_dijkstraNear(Many to One)"
msgstr "pgr_dijkstraNear(Muchos a Uno)"

msgid "pgr_dijkstraNear(One to Many)"
msgstr "pgr_dijkstraNear(Uno a Muchos)"

msgid "pgr_dijkstraNearCost(Combinations)"
msgstr "pgr_dijkstraNearCost(Combinaciones)"

msgid "pgr_dijkstraNearCost(Many to Many)"
msgstr "pgr_dijkstraNearCost(Muchos a Muchos)"

msgid "pgr_dijkstraNearCost(Many to One)"
msgstr "pgr_dijkstraNearCost(Muchos a Uno)"

msgid "pgr_dijkstraNearCost(One to Many)"
msgstr "pgr_dijkstraNearCost(Uno a Muchos)"

msgid "pgr_extractVertices"
msgstr "pgr_extractVertices"

msgid "Traversal"
msgstr "Travesía"

msgid "pgr_depthFirstSearch(Multiple vertices)"
msgstr "pgr_depthFirstSearch (Vértices múltiples)"

msgid "pgr_depthFirstSearch(Single vertex)"
msgstr "pgr_depthFirstSearch (Vértice único)"

msgid "pgRouting 3.2"
msgstr "pgRouting 3.2"

msgid "pgRouting 3.2.2 Release Notes"
msgstr "Notas de la Versión 3.2.2 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

msgid "`#2093 <https://github.com/pgRouting/pgrouting/issues/2093>`__: Compilation on Visual Studio"
msgstr "`#2093 <https://github.com/pgRouting/pgrouting/issues/2093>`__: Compilación con Visual Studio"

msgid "`#2189 <https://github.com/pgRouting/pgrouting/issues/2189>`__: Build error on RHEL 7"
msgstr "`#2189 <https://github.com/pgRouting/pgrouting/issues/2189>`__: Error de compilación en RHEL 7"

msgid "pgRouting 3.2.1 Release Notes"
msgstr "Notas de la Versión 3.2.1 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "`#1883 <https://github.com/pgRouting/pgrouting/issues/1883>`__: pgr_TSPEuclidean crashes connection on Windows"
msgstr "`#1883 <https://github.com/pgRouting/pgrouting/issues/1883>`__: pgr_TSPEuclidean termina la conexión en Windows"

msgid "The solution is to use Boost::graph::metric_tsp_approx"
msgstr "La solución es usar Boost::graph::metric_tsp_approx"

msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored"
msgstr "Para no romper el código del usuario, se ignoran los parámetros opcionales relacionados con el algoritmo de recocido de TSP"

msgid "The function with the annaeling optional parameters is deprecated"
msgstr "La función con los parámetros opcionales del algoritmo de recocido pasan a ser obseltos"

msgid "pgRouting 3.2.0 Release Notes"
msgstr "Notas del Lanzamiento de pgRouting 3.2.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`_"

msgid "`#1850 <https://github.com/pgRouting/pgrouting/issues/1850>`__: Change Boost min version to 1.56"
msgstr "`#1850 <https://github.com/pgRouting/pgrouting/issues/1850>`__: Cambie la versión mínima de Boost a 1.56"

msgid "Removing support for Boost v1.53, v1.54 & v1.55"
msgstr "Eliminación de soporte para Boost v1.53, v1.54 & v1.55"

msgid "Dijkstra Near"
msgstr "Dijkstra Cercano"

msgid "pgr_isPlanar"
msgstr "pgr_isPlanar"

msgid "pgr_lengauerTarjanDominatorTree"
msgstr "pgr_lengauerTarjanDominatorTree"

msgid "pgr_makeConnected"
msgstr "pgr_makeConnected"

msgid "Astar"
msgstr "Astar"

msgid "Bidirectional Astar"
msgstr "Astar Bidireccional"

msgid "Bidirectional Dijkstra"
msgstr "Dijkstra Bidireccional"

msgid "pgRouting 3.1"
msgstr "pgRouting 3.1"

msgid "pgRouting 3.1.4 Release Notes"
msgstr "Notas de la Versión 3.1.4 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.4%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

msgid "Issues fixes"
msgstr "Corrección de problemas"

msgid "pgRouting 3.1.3 Release Notes"
msgstr "pgRouting 3.1.3 Notas de la Versión"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.3%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

msgid "`#1825 <https://github.com/pgRouting/pgrouting/issues/1825>`__: Boost versions are not honored"
msgstr "`#1825 <https://github.com/pgRouting/pgrouting/issues/1825>`__: No se respetan las versiones Boost"

msgid "`#1849 <https://github.com/pgRouting/pgrouting/issues/1849>`__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment"
msgstr "`#1849 <https://github.com/pgRouting/pgrouting/issues/1849>`__: Aumente el error de compilación \"point_xy.hpp\" de la geometría 1.75.0 en el entorno macOS"

msgid "`#1861 <https://github.com/pgRouting/pgrouting/issues/1861>`__: vrp functions crash server"
msgstr "`#1861 <https://github.com/pgRouting/pgrouting/issues/1861>`__:servidor de fallas de funciones vrp"

msgid "pgRouting 3.1.2 Release Notes"
msgstr "Notas de la Versión pgRouting 3.1.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

msgid "`#1304 <https://github.com/pgRouting/pgrouting/issues/1304>`__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function"
msgstr "`#1304 <https://github.com/pgRouting/pgrouting/issues/1304>`__: FreeBSD 12 de 64 bits falla en pgr_vrOneDepot prueba la función experimental"

msgid "`#1356 <https://github.com/pgRouting/pgrouting/issues/1356>`__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed"
msgstr "`#1356 <https://github.com/pgRouting/pgrouting/issues/1356>`__: tools/testers/pg_prove_tests.sh falla cuando no pasa el puerto PostgreSQL"

msgid "`#1725 <https://github.com/pgRouting/pgrouting/issues/1725>`__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd"
msgstr "`#1725 <https://github.com/pgRouting/pgrouting/issues/1725>`__: El servidor falla en pgr_pickDeliver y pgr_vrpOneDepot en openbsd"

msgid "`#1760 <https://github.com/pgRouting/pgrouting/issues/1760>`__: TSP server crash on ubuntu 20.04 #1760"
msgstr "`#1760 <https://github.com/pgRouting/pgrouting/issues/1760>`__: el servidor TSP cae en ubuntu 20.04 #1760"

msgid "`#1770 <https://github.com/pgRouting/pgrouting/issues/1770>`__: Remove warnings when using clang compiler"
msgstr "`#1770 <https://github.com/pgRouting/pgrouting/issues/1770>`__: Eliminar advertencias cuando se utiliza el compilador clang"

msgid "pgRouting 3.1.1 Release Notes"
msgstr "pgRouting 3.1.1 Notas de la Versión"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "`#1733 <https://github.com/pgRouting/pgrouting/issues/1733>`__: pgr_bdAstar fails when source or target vertex does not exist in the graph"
msgstr "`#1733 <https://github.com/pgRouting/pgrouting/issues/1733>`__: pgr_bdAstar falla cuando el vértice de origen o de destino no existe en el gráfico"

msgid "`#1647 <https://github.com/pgRouting/pgrouting/issues/1647>`__: Linear Contraction contracts self loops"
msgstr "`#1647 <https://github.com/pgRouting/pgrouting/issues/1647>`__: La Contracción Lineal contrae bucles propios"

msgid "`#1640 <https://github.com/pgRouting/pgrouting/issues/1640>`__: pgr_withPoints fails when points_sql is empty"
msgstr "`#1640 <https://github.com/pgRouting/pgrouting/issues/1640>`__: pgr_withPoints falla cuando points_sql está vacía"

msgid "`#1616 <https://github.com/pgRouting/pgrouting/issues/1616>`__: Path evaluation on C++ not updated before the results go back to C"
msgstr "`#1616 <https://github.com/pgRouting/pgrouting/issues/1616>`__: La evaluación de la ruta en C ++ no se actualiza antes de que los resultados vuelvan a C"

msgid "`#1300 <https://github.com/pgRouting/pgrouting/issues/1300>`__: pgr_chinesePostman crash on test data"
msgstr "`#1300 <https://github.com/pgRouting/pgrouting/issues/1300>`__: pgr_chinesePostman falla en los datos de prueba"

msgid "pgRouting 3.1.0 Release Notes"
msgstr "Notas de la Versión pgRouting 3.1.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`_"

msgid "pgr_dijkstra(combinations)"
msgstr "pgr_dijkstra(combinaciones)"

msgid "pgr_dijkstraCost(combinations)"
msgstr "pgr_dijkstraCost(combinaciones)"

msgid "Build changes"
msgstr "Crear cambios"

msgid "Minimal requirement for Sphinx: version 1.8"
msgstr "Requerimientos mínimos para Sphinx: versión 1.8"

msgid "pgRouting 3.0"
msgstr "pgRouting 3.0"

msgid "pgRouting 3.0.6 Release Notes"
msgstr "Notas de la Versión 3.0.6 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.6%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`_"

msgid "pgRouting 3.0.5 Release Notes"
msgstr "pgRouting 3.0.5 Notas de la Versión"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.5%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`_"

msgid "Backport issue fixes"
msgstr "Corrección de problemas atrasados"

msgid "pgRouting 3.0.4 Release Notes"
msgstr "Notas de la Versión pgRouting 3.0.4"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.4%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

msgid "pgRouting 3.0.3 Release Notes"
msgstr "Notas de la versión de pgRouting 3.0.3"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.3%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

msgid "pgRouting 3.0.2 Release Notes"
msgstr "Notas de la Versión pgRouting 3.0.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

msgid "`#1378 <https://github.com/pgRouting/pgrouting/issues/1378>`__: Visual Studio build failing"
msgstr "`#1378 <https://github.com/pgRouting/pgrouting/issues/1378>`__: Error de compilación de Visual Studio"

msgid "pgRouting 3.0.1 Release Notes"
msgstr "Notas de la versión 3.0.1 de pgRouting"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "`#232 <https://github.com/pgRouting/pgrouting/issues/232>`__: Honor client cancel requests in C /C++ code"
msgstr "`#232 <https://github.com/pgRouting/pgrouting/issues/232>`__: Honrar cancelación de las solicitudes de código C /C++"

msgid "pgRouting 3.0.0 Release Notes"
msgstr "Notas de la versión de pgRouting 3.0.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "Fixed Issues"
msgstr "Problemas solucionados"

msgid "`#1153 <https://github.com/pgRouting/pgrouting/issues/1153>`__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean"
msgstr "`#1153 <https://github.com/pgRouting/pgrouting/issues/1153>`__: Renombrado de pgr_eucledianTSP a pgr_TSPeuclidean"

msgid "`#1188 <https://github.com/pgRouting/pgrouting/issues/1188>`__: Removed CGAL dependency"
msgstr "`#1188 <https://github.com/pgRouting/pgrouting/issues/1188>`__: Se suprimió la dependencia CGAL"

msgid "`#1002 <https://github.com/pgRouting/pgrouting/issues/1002>`__: Fixed contraction issues:"
msgstr "`#1002 <https://github.com/pgRouting/pgrouting/issues/1002>`__: Problemas de contracción solucionados:"

msgid "`#1004 <https://github.com/pgRouting/pgrouting/issues/1004>`__: Contracts when forbidden vertices do not belong to graph"
msgstr "`#1004 <https://github.com/pgRouting/pgrouting/issues/1004>`__: Se contrae cuando los vértices prohibidos no pertenecen al grafo"

msgid "`#1005 <https://github.com/pgRouting/pgrouting/issues/1005>`__: Intermideate results eliminated"
msgstr "`#1005 <https://github.com/pgRouting/pgrouting/issues/1005>`__: Resultados intermedios eliminados"

msgid "`#1006 <https://github.com/pgRouting/pgrouting/issues/1006>`__: No loss of information"
msgstr "`#1006 <https://github.com/pgRouting/pgrouting/issues/1006>`__: No hay pérdida de información2"

msgid "New Functions"
msgstr "Nuevas Funciones"

msgid "Kruskal family"
msgstr "Familia Kruskal"

msgid "pgr_kruskal"
msgstr "pgr_kruskal"

msgid "pgr_kruskalBFS"
msgstr "pgr_kruskalBFS"

msgid "pgr_kruskalDD"
msgstr "pgr_kruskalDD"

msgid "pgr_kruskalDFS"
msgstr "pgr_kruskalDFS"

msgid "Prim family"
msgstr "Familia Prim"

msgid "pgr_prim"
msgstr "pgr_prim"

msgid "pgr_primDD"
msgstr "pgr_primDD"

msgid "pgr_primDFS"
msgstr "pgr_primDFS"

msgid "pgr_primBFS"
msgstr "pgr_primBFS"

msgid "Proposed moved to official on pgRouting"
msgstr "Propuesta cambió a oficial en pgRouting"

msgid "aStar Family"
msgstr "Familia aStar"

msgid "pgr_aStarCost(One to One)"
msgstr "pgr_aStarCost(Uno a Uno)"

msgid "pgr_aStarCost(One to Many)"
msgstr "pgr_aStarCost(Uno a Muchos)"

msgid "pgr_aStarCost(Many to One)"
msgstr "pgr_aStarCost(Muchos a Uno)"

msgid "pgr_aStarCost(Many to Many)"
msgstr "pgr_aStarCost(Muchos a Muchos)"

msgid "pgr_aStarCostMatrix"
msgstr "pgr_aStarCostMatrix"

msgid "bdAstar Family"
msgstr "Familia bdAstar"

msgid "pgr_bdAstarCost(One to One)"
msgstr "pgr_bdAstarCost(Uno a Uno)"

msgid "pgr_bdAstarCost(One to Many)"
msgstr "pgr_bdAstarCost(Uno a Muchos)"

msgid "pgr_bdAstarCost(Many to One)"
msgstr "pgr_bdAstarCost(Muchos a Uno)"

msgid "pgr_bdAstarCost(Many to Many)"
msgstr "pgr_bdAstarCost(Muchos a Muchos)"

msgid "pgr_bdAstarCostMatrix"
msgstr "pgr_bdAstarCostMatrix"

msgid "bdDijkstra Family"
msgstr "bdDijkstra Familia"

msgid "pgr_bdDijkstraCost(One to One)"
msgstr "pgr_bdDijkstraCost(Uno a Uno)"

msgid "pgr_bdDijkstraCost(One to Many)"
msgstr "pgr_bdDijkstraCost(Uno a Muchos)"

msgid "pgr_bdDijkstraCost(Many to One)"
msgstr "pgr_bdDijkstraCost(Muchos a Uno)"

msgid "pgr_bdDijkstraCost(Many to Many)"
msgstr "pgr_bdDijkstraCost(Muchos a Muchos)"

msgid "pgr_bdDijkstraCostMatrix"
msgstr "pgr_bdDijkstraCostMatrix"

msgid "Flow Family"
msgstr "Familia Flow"

msgid "pgr_pushRelabel(One to One)"
msgstr "pgr_pushRelabel(Uno a Uno)"

msgid "pgr_pushRelabel(One to Many)"
msgstr "pgr_pushRelabel(Uno a Muchos)"

msgid "pgr_pushRelabel(Many to One)"
msgstr "pgr_pushRelabel(Muchos a Uno)"

msgid "pgr_pushRelabel(Many to Many)"
msgstr "pgr_pushRelabel(Muchos a Muchos)"

msgid "pgr_edmondsKarp(One to One)"
msgstr "pgr_edmondsKarp(Uno a Uno)"

msgid "pgr_edmondsKarp(One to Many)"
msgstr "pgr_edmondsKarp(Uno a Muchos)"

msgid "pgr_edmondsKarp(Many to One)"
msgstr "pgr_edmondsKarp(Muchos a Uno)"

msgid "pgr_edmondsKarp(Many to Many)"
msgstr "pgr_edmondsKarp(Muchos a Muchos)"

msgid "pgr_boykovKolmogorov (One to One)"
msgstr "pgr_boykovKolmogorov(Uno a Uno)"

msgid "pgr_boykovKolmogorov (One to Many)"
msgstr "pgr_boykovKolmogorov(Uno a Muchos)"

msgid "pgr_boykovKolmogorov (Many to One)"
msgstr "pgr_boykovKolmogorov (Muchos a Uno)"

msgid "pgr_boykovKolmogorov (Many to Many)"
msgstr "pgr_boykovKolmogorov (Muchos a Muchos)"

msgid "pgr_maxCardinalityMatching"
msgstr "pgr_maxCardinalityMatching"

msgid "pgr_edgeDisjointPaths(One to One)"
msgstr "pgr_edgeDisjointPaths(Uno a Uno)"

msgid "pgr_edgeDisjointPaths(One to Many)"
msgstr "pgr_edgeDisjointPaths(Uno a Muchos)"

msgid "pgr_edgeDisjointPaths(Many to One)"
msgstr "pgr_edgeDisjointPaths(Muchos a Uno)"

msgid "pgr_edgeDisjointPaths(Many to Many)"
msgstr "pgr_edgeDisjointPaths(Muchos a Muchos)"

msgid "Components family"
msgstr "Familia de Componentes"

msgid "pgr_connectedComponents"
msgstr "pgr_connectedComponents"

msgid "pgr_strongComponents"
msgstr "pgr_strongComponents"

msgid "pgr_biconnectedComponents"
msgstr "pgr_biconnectedComponents"

msgid "pgr_articulationPoints"
msgstr "pgr_articulationPoints"

msgid "pgr_bridges"
msgstr "pgr_bridges"

msgid "Contraction:"
msgstr "Contracción:"

msgid "Removed unnecessary column seq"
msgstr "Se ha eliminado la innecesaria columna seq"

msgid "pgr_maxFlowMinCost"
msgstr "pgr_maxFlowMinCost"

msgid "pgr_maxFlowMinCost_Cost"
msgstr "pgr_maxFlowMinCost_Cost"

msgid "pgr_dagShortestpath"
msgstr "pgr_dagShortestpath"

msgid "VRP category"
msgstr "Categoría VRP"

msgid "pgr_pickDeliverEuclidean"
msgstr "pgr_pickDeliverEuclidean"

msgid "pgr_pickDeliver"
msgstr "pgr_pickDeliver"

msgid "Chinese Postman family"
msgstr "Familia Chinese Postman"

msgid "pgr_chinesePostman"
msgstr "pgr_chinesePostman"

msgid "pgr_chinesePostmanCost"
msgstr "pgr_chinesePostmanCost"

msgid "Breadth First Search family"
msgstr "Familia Breadth First Search"

msgid "Bellman Ford family"
msgstr "Familia Bellman Ford"

msgid "Moved to legacy"
msgstr "Se trasladó al legado"

msgid "pgr_labelGraph - Use the components family of functions instead."
msgstr "pgr_labelGraph - Utilizar la familia de componentes en su lugar."

msgid "Max flow - functions were renamed on v2.5.0"
msgstr "Max flow - las funciones fueron renombradas en v2.5.0"

msgid "pgr_maxFlowPushRelabel"
msgstr "pgr_maxFlowPushRelabel"

msgid "pgr_maxFlowBoykovKolmogorov"
msgstr "pgr_maxFlowBoykovKolmogorov"

msgid "pgr_maxFlowEdmondsKarp"
msgstr "pgr_maxFlowEdmondsKarp"

msgid "pgr_maximumcardinalitymatching"
msgstr "pgr_maximumcardinalitymatching"

msgid "VRP"
msgstr "VRP"

msgid "pgr_gsoc_vrppdtw"
msgstr "pgr_gsoc_vrppdtw"

msgid "TSP old signatures"
msgstr "Firmas antiguas de TSP"

msgid "pgr_pointsAsPolygon"
msgstr "pgr_pointsAsPolygon"

msgid "pgr_alphaShape old signature"
msgstr "pgr_alphaShape firma antigua"

msgid "pgRouting 2"
msgstr "pgRouting 2"

msgid "Minors 2.x"
msgstr ""

msgid "pgRouting 2.6"
msgstr "pgRouting 2.6"

msgid "pgRouting 2.6.3 Release Notes"
msgstr "pgRouting 2.6.3 Notas de la Versión"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22>`__"
msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"

#, fuzzy
msgid "`#1219 <https://github.com/pgRouting/pgrouting/issues/1219>`__: Implicit cast for via_path integer to text"
msgstr "`#1219 <https://github.com/pgRouting/pgrouting/pull/1219>`__ Implicit cast for via_path integer to text"

#, fuzzy
msgid "`#1193 <https://github.com/pgRouting/pgrouting/issues/1193>`__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause"
msgstr "`#1640 <https://github.com/pgRouting/pgrouting/issues/1640>`__: pgr_withPoints falla cuando points_sql está vacía"

#, fuzzy
msgid "`#1185 <https://github.com/pgRouting/pgrouting/issues/1185>`__: Improve FindPostgreSQL.cmake"
msgstr "`#1188 <https://github.com/pgRouting/pgrouting/issues/1188>`__: Se suprimió la dependencia CGAL"

msgid "pgRouting 2.6.2 Release Notes"
msgstr "pgRouting 2.6.2 Notas de la versión"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22>`__"
msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"

#, fuzzy
msgid "`#1152 <https://github.com/pgRouting/pgrouting/issues/1152>`__: Fixes driving distance when vertex is not part of the graph"
msgstr "`#1152 <https://github.com/pgRouting/pgrouting/issues/1152>`__ Corrige la distancia de conducción cuando el vértice no forma parte del grafo"

#, fuzzy
msgid "`#1098 <https://github.com/pgRouting/pgrouting/issues/1098>`__: Fixes windows test"
msgstr "`#1098 <https://github.com/pgRouting/pgrouting/issues/1098>`__ Correcciones de pruebas de ventanas"

#, fuzzy
msgid "`#1165 <https://github.com/pgRouting/pgrouting/issues/1165>`__: Fixes build for python3 and perl5"
msgstr "`#1165 <https://github.com/pgRouting/pgrouting/issues/1165>`__ Correcciones de la compilación de python3 y perl5"

msgid "pgRouting 2.6.1 Release Notes"
msgstr "Notas de la versión de pgRouting 2.6.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`_"

msgid "Fixes server crash on several functions."
msgstr "Corrige el bloqueo del servidor en varias funciones."

msgid "pgr_floydWarshall"
msgstr "pgr_floydWarshall"

msgid "pgr_johnson"
msgstr "pgr_johnson"

msgid "pgr_bdDijstra"
msgstr "pgr_bdDijstra"

msgid "pgr_alphashape"
msgstr "pgr_alphashape"

msgid "pgr_dijkstraCostMatrix"
msgstr "pgr_dijkstraCostMatrix"

msgid "pgr_drivingDistance"
msgstr "pgr_drivingDistance"

msgid "pgr_dijkstraVia (proposed)"
msgstr "pgr_dijkstraVia (proposed)"

msgid "pgr_boykovKolmogorov (proposed)"
msgstr "pgr_boykovKolmogorov (proposed)"

msgid "pgr_edgeDisjointPaths (proposed)"
msgstr "pgr_edgeDisjointPaths (proposed)"

msgid "pgr_edmondsKarp (proposed)"
msgstr "pgr_edmondsKarp (proposed)"

msgid "pgr_maxCardinalityMatch (proposed)"
msgstr "pgr_maxCardinalityMatch (proposed)"

msgid "pgr_maxFlow (proposed)"
msgstr "pgr_maxFlow (proposed)"

msgid "pgr_withPoints (proposed)"
msgstr "pgr_withPoints (proposed)"

msgid "pgr_withPointsCost (proposed)"
msgstr "pgr_withPointsCost (proposed)"

msgid "pgr_withPointsKSP (proposed)"
msgstr "pgr_withPointsKSP (proposed)"

msgid "pgr_withPointsDD (proposed)"
msgstr "pgr_withPointsDD (proposed)"

msgid "pgr_withPointsCostMatrix (proposed)"
msgstr "pgr_withPointsCostMatrix (propuesto)"

msgid "pgr_contractGraph (experimental)"
msgstr "pgr_contractGraph (experimental)"

msgid "pgr_pushRelabel (experimental)"
msgstr "pgr_pushRelabel (experimental)"

msgid "pgr_vrpOneDepot (experimental)"
msgstr "pgr_vrpOneDepot (experimental)"

msgid "pgr_gsoc_vrppdtw (experimental)"
msgstr "pgr_gsoc_vrppdtw (experimental)"

msgid "Fixes for deprecated functions where also applied but not tested"
msgstr "Correcciones para funciones en desuso en las que también se aplican pero no se prueban"

msgid "Removed compilation warning for g++8"
msgstr "Se ha eliminado la advertencia de compilación para g++8"

msgid "Fixed a fallthrugh on Astar and bdAstar."
msgstr "Se ha arreglado un fallthrugh en Astar y bdAstar."

msgid "pgRouting 2.6.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.6.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`_"

msgid "pgr_lineGraphFull"
msgstr "pgr_lineGraphFull"

msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])"
msgstr "Correción pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])"

msgid "without restrictions"
msgstr "sin restricciones"

msgid "calls pgr_dijkstra when both end points have a fraction IN (0,1)"
msgstr "llama a pgr_dijkstra cuando ambos puntos finales tienen una fracción IN (0,1)"

msgid "calls pgr_withPoints when at least one fraction NOT IN (0,1)"
msgstr "llama a pgr_withPoints cuando al menos una fracción NO ESTÁ EN (0,1)"

msgid "with restrictions"
msgstr "con restricciones"

msgid "calls original trsp code"
msgstr "llama al código original trsp"

msgid "Internal code"
msgstr "Código interno"

msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])"
msgstr "Se ha limpiado el código interno de trsp(text,integer,integer,boolean,boolean [, text])"

msgid "Removed the use of pointers"
msgstr "Se eliminó el uso de punteros"

msgid "Internal code can accept BIGINT"
msgstr "El código interno puede aceptar BIGINT"

msgid "Cleaned the internal code of withPoints"
msgstr "Limpiado el código interno de withPoints"

msgid "pgRouting 2.5"
msgstr "pgRouting 2.5"

msgid "pgRouting 2.5.5 Release Notes"
msgstr "Notas de la versión de PgRouting 2.5.5"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`_"

msgid "Fixes driving distance when vertex is not part of the graph"
msgstr "Corrige la distancia de conducción cuando el vértice no forma parte del grafo"

msgid "Fixes windows test"
msgstr "Corrección de la prueba de ventanas"

msgid "Fixes build for python3 and perl5"
msgstr "Arreglos de compilación para python3 y perl5"

msgid "pgRouting 2.5.4 Release Notes"
msgstr "Notas de la versión de pgRouting 2.5.4"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

msgid "pgRouting 2.5.3 Release Notes"
msgstr "Notas de la versión de pgRouting 2.5.3"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL"
msgstr "Arreglo para postgresql 11: Se ha eliminado un error que ocurría al compilar con postgreSQL"

msgid "pgRouting 2.5.2 Release Notes"
msgstr "Notas de la versión de pgRouting 2.5.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

msgid "Fix for postgresql 10.1: Removed a compiler condition"
msgstr "Arreglo para postgresql 10.1: Se ha eliminado una condición del compilador"

msgid "pgRouting 2.5.1 Release Notes"
msgstr "Notas de la versión de pgRouting 2.5.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`_"

msgid "Fixed prerequisite minimum version of: cmake"
msgstr "Prerrequisito fijo versión mínima de: cmake"

msgid "pgRouting 2.5.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.5.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`_"

msgid "enhancement:"
msgstr "mejora:"

msgid "pgr_version is now on SQL language"
msgstr "pgr_version está ahora en lenguaje SQL"

msgid "Breaking change on:"
msgstr "Cambio de ruptura en:"

msgid "pgr_edgeDisjointPaths:"
msgstr "pgr_edgeDisjointPaths:"

msgid "Added path_id, cost and agg_cost columns on the result"
msgstr "Columnas path_id, cost y agg_cost añadidas al resultado"

msgid "Parameter names changed"
msgstr "Nombres de parámetros cambiados"

msgid "The many version results are the union of the One to One version"
msgstr "Los muchos resultados de la versión son la unión de la versión Uno a Uno"

msgid "New Signatures"
msgstr "Nuevas Firmas"

msgid "pgr_bdAstar(One to One)"
msgstr "pgr_bdAstar(Uno a Uno)"

msgid "pgr_lineGraph"
msgstr "pgr_lineGraph"

msgid "pgr_bdastar - use pgr_bdAstar instead"
msgstr "pgr_bdastar - utilice pgr_bdAstar en su lugar"

msgid "Renamed functions"
msgstr "Funciones renombradas"

msgid "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead"
msgstr "pgr_maxFlowPushRelabel - utilice pgr_pushRelabel en su lugar"

msgid "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead"
msgstr "pgr_maxFlowEdmondsKarp -utilice pgr_edmondsKarp en su lugar"

msgid "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead"
msgstr "pgr_maxFlowBoykovKolmogorov - utilice pgr_boykovKolmogorov en su lugar"

msgid "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead"
msgstr "pgr_maximumCardinalityMatching - utilice pgr_maxCardinalityMatch en su lugar"

msgid "Deprecated Function"
msgstr "Funcion Obsoleta"

msgid "pgr_pointToEdgeNode"
msgstr "pgr_pointToEdgeNode"

msgid "pgRouting 2.4"
msgstr "pgRouting 2.4"

msgid "pgRouting 2.4.2 Release Notes"
msgstr "Notas de la versión de pgRouting 2.4.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para esta versión, consulte la `meta cerrada 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%2>`_"

msgid "Improvement"
msgstr "Mejora"

msgid "Works for postgreSQL 10"
msgstr "Funciona para postgreSQL 10"

msgid "Fixed: Unexpected error column \"cname\""
msgstr "Corregido: Columna de error inesperado \"cname\""

msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions"
msgstr "Reemplace __linux__ por __GLIBC__ para cabeceras y funciones específicas de glibc"

msgid "pgRouting 2.4.1 Release Notes"
msgstr "Notas de la versión de pgRouting 2.4.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%21>`_"

msgid "Fixed compiling error on macOS"
msgstr "Corregido error de compilación en macOS"

msgid "Condition error on pgr_withPoints"
msgstr "Error de condición en pgr_withPoints"

msgid "pgRouting 2.4.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.4.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`_"

msgid "Deprecated signatures."
msgstr "Firmas obsoletas."

msgid "pgr_bddijkstra - use pgr_bdDijkstra instead"
msgstr "pgr_bddijkstra - utilizar pgr_bdDijkstra en su lugar"

msgid "pgr_pointsToVids"
msgstr "pgr_pointsToVids"

msgid "Bug fixes on proposed functions"
msgstr "Corrección de errores en las funciones propuestas"

msgid "pgr_withPointsKSP: fixed ordering"
msgstr "pgr_withPointsKSP: ordenamiento arreglado"

msgid "TRSP original code is used with no changes on the compilation warnings"
msgstr "El código original de TRSP se utiliza sin cambios en las advertencias de compilación"

msgid "pgRouting 2.3"
msgstr "pgRouting 2.3"

msgid "pgRouting 2.3.2 Release Notes"
msgstr "Notas de la versión de pgRouting 2.3.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`_"

msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck."
msgstr "Se ha corregido el bloqueo pgr_gsoc_vrppdtw cuando todos los pedidos caben en un camión."

msgid "Fixed pgr_trsp:"
msgstr "Corregido pgr_trsp:"

msgid "Alternate code is not executed when the point is in reality a vertex"
msgstr "El código alternativo no se ejecuta cuando el punto es en realidad un vértice"

msgid "Fixed ambiguity on seq"
msgstr "Corregida la ambiguedad en el seq"

msgid "pgRouting 2.3.1 Release Notes"
msgstr "Notas de la versión de pgRouting 2.3.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "Leaks on proposed max_flow functions"
msgstr "Fugas en las funciones max_flow propuestas"

msgid "Regression error on pgr_trsp"
msgstr "Error de regresión en pgr_trsp"

msgid "Types discrepancy on pgr_createVerticesTable"
msgstr "Discrepancia de tipos en pgr_createVerticesTable"

msgid "pgRouting 2.3.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.3.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "pgr_eucledianTSP"
msgstr "pgr_eucledianTSP"

msgid "pgr_maxFlowPushRelabel(One to One)"
msgstr "pgr_maxFlowPushRelabel(Uno a Uno)"

msgid "pgr_maxFlowPushRelabel(One to Many)"
msgstr "pgr_maxFlowPushRelabel(Uno a Muchos)"

msgid "pgr_maxFlowPushRelabel(Many to One)"
msgstr "pgr_maxFlowPushRelabel(Muchos a Uno)"

msgid "pgr_maxFlowPushRelabel(Many to Many)"
msgstr "pgr_maxFlowPushRelabel(Muchos a Muchos)"

msgid "pgr_maxFlowEdmondsKarp(One to One)"
msgstr "pgr_maxFlowEdmondsKarp(Uno a Uno)"

msgid "pgr_maxFlowEdmondsKarp(One to Many)"
msgstr "pgr_maxFlowEdmondsKarp(Uno a Muchos)"

msgid "pgr_maxFlowEdmondsKarp(Many to One)"
msgstr "pgr_maxFlowEdmondsKarp(Muchos a Uno)"

msgid "pgr_maxFlowEdmondsKarp(Many to Many)"
msgstr "pgr_maxFlowEdmondsKarp(Muchos a Muchos)"

msgid "pgr_maxFlowBoykovKolmogorov (One to One)"
msgstr "pgr_maxFlowBoykovKolmogorov(Uno a Uno)"

msgid "pgr_maxFlowBoykovKolmogorov (One to Many)"
msgstr "pgr_maxFlowBoykovKolmogorov (Uno a Muchos)"

msgid "pgr_maxFlowBoykovKolmogorov (Many to One)"
msgstr "pgr_maxFlowBoykovKolmogorov (Muchos a Uno)"

msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)"
msgstr "pgr_maxFlowBoykovKolmogorov (Muchos a Muchos)"

msgid "pgr_maximumCardinalityMatching"
msgstr "pgr_maximumCardinalityMatching"

msgid "pgr_contractGraph"
msgstr "pgr_contractGraph"

msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead"
msgstr "pgr_tsp - utilice pgr_TSP o pgr_eucledianTSP en su lugar"

msgid "pgr_aStar - use pgr_aStar instead"
msgstr "pgr_aStar - utilice pgr_aStar en su lugar"

msgid "pgr_flip_edges"
msgstr "pgr_flip_edges"

msgid "pgr_vidsToDmatrix"
msgstr "pgr_vidsToDmatrix"

msgid "pgr_pointsToDMatrix"
msgstr "pgr_pointsToDMatrix"

msgid "pgr_textToPoints"
msgstr "pgr_textToPoints"

msgid "pgRouting 2.2"
msgstr "pgRouting 2.2"

msgid "pgRouting 2.2.4 Release Notes"
msgstr "Notas de la versión de pgRouting 2.2.4"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.4%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

msgid "Bogus uses of extern \"C\""
msgstr "Bogus usos de extern \"C\""

msgid "Build error on Fedora 24 + GCC 6.0"
msgstr "Error de compilación en Fedora 24 + GCC 6.0"

msgid "Regression error pgr_nodeNetwork"
msgstr "Error de regresión pgr_nodeNetwork"

msgid "pgRouting 2.2.3 Release Notes"
msgstr "Notas de la versión de pgRouting 2.2.3"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.3%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

msgid "Fixed compatibility issues with PostgreSQL 9.6."
msgstr "Problemas de compatibilidad con PostgreSQL 9.6 corregidos."

msgid "pgRouting 2.2.2 Release Notes"
msgstr "Notas de la versión de pgRouting 2.2.2"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.2%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

msgid "Fixed regression error on pgr_drivingDistance"
msgstr "Corregido error de regresión en pgr_drivingDistance"

msgid "pgRouting 2.2.1 Release Notes"
msgstr "Notas de la versión de pgRouting 2.2.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "Server crash fix on pgr_alphaShape"
msgstr "Corrección de bloqueo del servidor en pgr_alphaShape"

msgid "Bug fix on With Points family of functions"
msgstr "Corrección de errores en la familia de funciones With Points"

msgid "pgRouting 2.2.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.2.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "Improvements"
msgstr "Mejoras"

msgid "pgr_nodeNetwork"
msgstr "pgr_nodeNetwork"

msgid "Adding a row_where and outall optional parameters"
msgstr "Adición de un row_where y todos los parámetros opcionales"

msgid "Signature fix"
msgstr "Corrección de firma"

msgid "pgr_dijkstra -- to match what is documented"
msgstr "pgr_dijkstra -- para que coincida con lo documentado"

msgid "pgr_Johnson"
msgstr "pgr_Johnson"

msgid "pgr_dijkstraCost(One to One)"
msgstr "pgr_dijkstraCost(Uno a Uno)"

msgid "pgr_dijkstraCost(One to Many)"
msgstr "pgr_dijkstraCost(Uno a Muchos)"

msgid "pgr_dijkstraCost(Many to One)"
msgstr "pgr_dijkstraCost(Muchos a Uno)"

msgid "pgr_dijkstraCost(Many to Many)"
msgstr "pgr_dijkstraCost(Muchos a Muchos)"

msgid "Proposed Functionality"
msgstr "Funcionalidad Propuesta"

msgid "pgr_withPoints(One to One)"
msgstr "pgr_withPoints(Uno a Uno)"

msgid "pgr_withPoints(One to Many)"
msgstr "pgr_withPoints(Uno a Muchos)"

msgid "pgr_withPoints(Many to One)"
msgstr "pgr_withPoints(Muchos a Uno)"

msgid "pgr_withPoints(Many to Many)"
msgstr "pgr_withPoints(Muchos a Muchos)"

msgid "pgr_withPointsCost(One to One)"
msgstr "pgr_withPointsCost(Uno a Uno)"

msgid "pgr_withPointsCost(One to Many)"
msgstr "pgr_withPointsCost(Uno a Muchos)"

msgid "pgr_withPointsCost(Many to One)"
msgstr "pgr_withPointsCost(Muchos a Uno)"

msgid "pgr_withPointsCost(Many to Many)"
msgstr "pgr_withPointsCost(Muchos a Muchos)"

msgid "pgr_withPointsDD(single vertex)"
msgstr "pgr_withPointsDD(vértice único)"

msgid "pgr_withPointsDD(multiple vertices)"
msgstr "pgr_withPointsDD(múltiples vértices)"

msgid "pgr_apspWarshall use pgr_floydWarshall instead"
msgstr "pgr_apspWarshall utilizar pgr_floydWarshall en su lugar"

msgid "pgr_apspJohnson use pgr_Johnson instead"
msgstr "pgr_apspJohnson utilizar pgr_Johnson en su lugar"

msgid "pgr_kDijkstraCost use pgr_dijkstraCost instead"
msgstr "pgr_kDijkstraCost utilice pgr_dijkstraCost en su lugar"

msgid "pgr_kDijkstraPath use pgr_dijkstra instead"
msgstr "pgr_kDijkstraPath utilice pgr_dijkstra en su lugar"

msgid "Renamed and Deprecated Function"
msgstr "Función Renombrada y Obsoleta"

msgid "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix"
msgstr "pgr_makeDistanceMatrix renombrado a _pgr_makeDistanceMatrix"

msgid "pgRouting 2.1"
msgstr "pgRouting 2.1"

msgid "pgRouting 2.1.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.1.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.1.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "Refactored"
msgstr "Refactorizado"

msgid "pgr_dijkstra(One to One)"
msgstr "pgr_dijkstra(Uno a Uno)"

msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter."
msgstr "La función pgr_alphaShape ahora puede generar mejores (multi)polígonos con agujeros y parámetro alfa."

msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)"
msgstr "Funciones propuestas de Steve Woodbridge, (Clasificado como Conveniencia por el autor.)"

msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge."
msgstr "pgr_pointToEdgeNode - convierta una geometría de punto en un vertex_id basado en la arista más cercana."

msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end."
msgstr "pgr_flipEdges - voltear los bordes en un arreglo de geometrías para la conexión de extremo a extremo."

msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries."
msgstr "pgr_textToPoints - convertir una cadena de x,y;x,y;... ubicaciones en geometrías de puntos."

msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids."
msgstr "pgr_pointsToVids - convertir un arreglo de geometrías de puntos en identificadores de vértices."

msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points."
msgstr "pgr_pointsToDMatrix - Crear una matriz de distancia a partir de un arreglo de puntos."

msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id."
msgstr "pgr_vidsToDMatrix - Crear una matriz de distancia a partir de un arreglo de vertex_id."

msgid "Added proposed functions from GSoc Projects:"
msgstr "Funciones propuestas de GSoc Projects añadidas:"

msgid "pgr_vrppdtw"
msgstr "pgr_vrppdtw"

msgid "pgr_vrponedepot"
msgstr "pgr_vrponedepot"

msgid "pgr_getColumnName"
msgstr "pgr_getColumnName"

msgid "pgr_getTableName"
msgstr "pgr_getTableName"

msgid "pgr_isColumnCndexed"
msgstr "pgr_isColumnCndexed"

msgid "pgr_isColumnInTable"
msgstr "pgr_isColumnInTable"

msgid "pgr_quote_ident"
msgstr "pgr_quote_ident"

msgid "pgr_versionless"
msgstr "pgr_versionless"

msgid "pgr_startPoint"
msgstr "pgr_startPoint"

msgid "pgr_endPoint"
msgstr "pgr_endPoint"

msgid "pgr_pointToId"
msgstr "pgr_pointToId"

msgid "No longer supported"
msgstr "Ya no es soportada"

msgid "Removed the 1.x legacy functions"
msgstr "Se han eliminado las funciones heredadas 1.x"

msgid "Some bug fixes in other functions"
msgstr "Algunas correcciones de errores en otras funciones"

msgid "Refactoring Internal Code"
msgstr "Refactorización del código interno"

msgid "A C and C++ library for developer was created"
msgstr "Se creó una biblioteca de C y C++ para desarrolladores"

msgid "encapsulates postgreSQL related functions"
msgstr "encapsula las funciones relacionadas con postgreSQL"

msgid "encapsulates Boost.Graph graphs"
msgstr "encapsula los gráficos Boost.Graph"

msgid "Directed Boost.Graph"
msgstr "Directed Boost.Graph"

msgid "Undirected Boost.graph."
msgstr "Boost.graph no dirigido."

msgid "allow any-integer in the id's"
msgstr "permitir any-integer (cualquier entero) en el id"

msgid "allow any-numerical on the cost/reverse_cost columns"
msgstr "permitir any-numerical (cualquier numérico) en las columnas cost/reverse_cost"

msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0"
msgstr "En lugar de generar muchas bibliotecas: - Todas las funciones están encapsuladas en una biblioteca - La biblioteca tiene el prefijo 2-1-0"

msgid "pgRouting 2.0"
msgstr "pgRouting 2.0"

msgid "pgRouting 2.0.1 Release Notes"
msgstr "Notas de la versión de pgRouting 2.0.1"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.0.1%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "Minor bug fixes."
msgstr "Corrección de errores menores."

msgid "No track of the bug fixes were kept."
msgstr "No se ha guardado ningún rastro de las correcciones de errores."

msgid "pgRouting 2.0.0 Release Notes"
msgstr "Notas de la versión de pgRouting 2.0.0"

#, fuzzy
msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.0.0%22>`__"
msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:"
msgstr "Con la versión de pgRouting 2.0.0, la biblioteca ha abandonado la compatibilidad con versiones anteriores a las versiones `pgRouting 1.0`_. Los principales objetivos de esta versión son:"

msgid "Major restructuring of pgRouting."
msgstr "Mayor reestructuración de pgRouting."

msgid "Standardization of the function naming"
msgstr "Estandarización de la nomenclatura de funciones"

msgid "Preparation of the project for future development."
msgstr "Elaboración del proyecto para el desarrollo futuro."

msgid "As a result of this effort:"
msgstr "Como resultado de este esfuerzo:"

msgid "pgRouting has a simplified structure"
msgstr "pgRouting tiene una estructura simplificada"

msgid "Significant new functionality has being added"
msgstr "Se ha añadido una nueva funcionalidad significativa"

msgid "Documentation has being integrated"
msgstr "La documentación se ha integrado"

msgid "Testing has being integrated"
msgstr "Las pruebas se han integrado"

msgid "And made it easier for multiple developers to make contributions."
msgstr "Y facilitó que varios desarrolladores hicieran contribuciones."

msgid "Important Changes"
msgstr "Cambios Importantes"

msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph"
msgstr "Análisis gráfico - herramientas para detectar y arreglar algunos problemas de conexión en un gráfico de red"

msgid "A collection of useful utility functions"
msgstr "Una colección de funciones útiles"

msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)"
msgstr "Dos nuevos algoritmos para el camino más corto de todos pares (pgr_apspJohnson, pgr_apspWarshall)"

msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)"
msgstr "Algoritmos bidireccionales para las búsquedas Dijkstra y A*(pgr_bdAstar, pgr_bdDijkstra)"

msgid "One to many nodes search (pgr_kDijkstra)"
msgstr "Búsqueda de uno a varios nodos (pgr_kDijkstra)"

msgid "K alternate paths shortest path (pgr_ksp)"
msgstr "K rutas más cortas alternas (pgr_ksp)"

msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency"
msgstr "Nuevo solucionador TSP que simplifica el código donde el proceso de compilación (pgr_tsp), ya no dependene de la biblioteca Gaul"

msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star"
msgstr "Ruta más corta con giros restringidos (pgr_trsp) que reemplaza a la Estrella Fugaz"

msgid "Dropped support for Shooting Star"
msgstr "Se deja de soportar a la Estrella fugaz"

msgid "Built a test infrastructure that is run before major code changes are checked in"
msgstr "Se construye una infraestructura de pruebas que se ejecuta antes de que se incorporen grandes cambios al código principal"

msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base."
msgstr "Se probó y se arreglaron todos los errores excepcionales registrados en la versión 1.x existente en la base del código 2.0-dev."

msgid "Improved build process for Windows"
msgstr "Proceso de compilación mejorados para Windows"

msgid "Automated testing on Linux and Windows platforms trigger by every commit"
msgstr "Automatizado de pruebas en plataformas Linux y Windows por cada cambio permanente"

msgid "Modular library design"
msgstr "Diseño modular de bibliotecas"

msgid "Compatibility with PostgreSQL 9.1 or newer"
msgstr "Compatibilidad con PostgreSQL 9.1 o posterior"

msgid "Compatibility with PostGIS 2.0 or newer"
msgstr "Compatibilidad con PostGIS 2.0 o posterior"

msgid "Installs as PostgreSQL EXTENSION"
msgstr "Se instala como EXTENSION de PostgreSQL"

msgid "Return types re factored and unified"
msgstr "Tipos de retorno refactorizados y unificados"

msgid "Support for table SCHEMA in function parameters"
msgstr "Soporte para esquema en los parámetros de las funciones"

msgid "Support for ``st_`` PostGIS function prefix"
msgstr "Soporte para el prefijo ``st_`` de las funciones de PostGIS"

msgid "Added ``pgr_`` prefix to functions and types"
msgstr "Prefijo ``pgr_`` agregado a las funciones y tipos"

msgid "Better documentation: https://docs.pgrouting.org"
msgstr "Mejor documentación: https://docs.pgrouting.org"

msgid "shooting_star is discontinued"
msgstr "shooting_star está descontinuado"

msgid "pgRouting 1"
msgstr "pgRouting 1"

msgid "pgRouting 1.0"
msgstr "pgRouting 1.0"

msgid "To see the issues closed by this release see the `Git closed issues for 1.x <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+1.x%22+is%3Aclosed>`_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference."
msgstr "Para ver los problemas cerrados por esta versión, consulte los `Git closed issues for 1.x <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+1.x%22+is%3Aclosed>`_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference."

msgid "Changes for release 1.05"
msgstr "Cambios para la versión 1.05"

msgid "Changes for release 1.03"
msgstr "Cambios para la versión 1.03"

msgid "Much faster topology creation"
msgstr "Creación de topología mucho más rápida"

msgid "Changes for release 1.02"
msgstr "Cambios para la versión 1.02"

msgid "Shooting* bug fixes"
msgstr "Corrección de errores de Disparo*"

msgid "Compilation problems solved"
msgstr "Se resolvieron problemas de compilación"

msgid "Changes for release 1.01"
msgstr "Cambios para la versión 1.01"

msgid "Changes for release 1.0"
msgstr "Cambios para la versión 1.0"

msgid "Core and extra functions are separated"
msgstr "Núcleo y funciones adicionales están separadas"

msgid "Cmake build process"
msgstr "Proceso de compilación con CMake"

msgid "Changes for release 1.0.0b"
msgstr "Cambios para la versión 1.0.0b"

msgid "Additional SQL file with more simple names for wrapper functions"
msgstr "Archivos SQL adicionales con nombres más simples para las funciones de la envolturas"

msgid "Changes for release 1.0.0a"
msgstr "Cambios para la versión 1.0.0a"

msgid "Shooting* shortest path algorithm for real road networks"
msgstr "Algoritmo de ruta más corta Shooting\\* para redes de camino reales"

msgid "Several SQL bugs were fixed"
msgstr "Se arreglaron varios errores de SQL"

msgid "Changes for release 0.9.9"
msgstr "Cambios para la versión 0.9.9"

msgid "PostgreSQL 8.2 support"
msgstr "Soporte PostgreSQL 8.2"

msgid "Shortest path functions return empty result if they could not find any path"
msgstr "Las funciones de ruta más cortas devuelven un resultado vacío si no encuentran ninguna ruta de acceso"

msgid "Changes for release 0.9.8"
msgstr "Cambios para versión 0.9.8"

msgid "Renumbering scheme was added to shortest path functions"
msgstr "Esquema de numeración ha sido añadido a las funciones de ruta más cortos"

msgid "Directed shortest path functions were added"
msgstr "Se agregaron funciones de ruta más cortos dirigidas"

msgid "routing_postgis.sql was modified to use dijkstra in TSP search"
msgstr "routing_postgis.SQL fue modificado para utilizar dijkstra en la búsqueda TSP"

msgid "Function Families"
msgstr "Familias de Funciones"

msgid "Sample Data"
msgstr "Datos Muestra"

msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below."
msgstr "La documentación proporciona consultas de ejemplo muy simples basadas en una red muestra pequeña que asemeja una ciudad. Para ser capaz de ejecutar la mayoría de los ejemplos, siga las siguientes instrucciones."

msgid "Main graph"
msgstr ""

msgid "A graph consists of a set of edges and a set of vertices."
msgstr ""

msgid "The following city is to be inserted into the database:"
msgstr ""

msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph."
msgstr ""

msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated."
msgstr ""

msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry."
msgstr ""

msgid "Identifier of the starting vertex of the geometry ``geom``."
msgstr ""

msgid "Identifier of the ending vertex of the geometry ``geom``"
msgstr ""

msgid "Cost to traverse from `source` to ``target``."
msgstr ""

msgid "Cost to traverse from `target` to ``source``."
msgstr ""

msgid "Flow capacity from `source` to ``target``."
msgstr ""

msgid "Flow capacity from `target` to ``source``."
msgstr ""

msgid "``category``"
msgstr "``category``"

msgid "``reverse_category``"
msgstr "``reverse_category``"

msgid ":math:`x` coordinate of the starting vertex of the geometry."
msgstr ""

msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``."
msgstr ""

msgid ":math:`y` coordinate of the ending vertex of the geometry."
msgstr ""

msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``."
msgstr ""

msgid "The geometry of the segments."
msgstr ""

msgid "Starting on PostgreSQL 12::"
msgstr "A partir de PostgreSQL 12::"

msgid "Optionally indexes on different columns can be created. The recommendation is to have"
msgstr ""

msgid "``id`` indexed."
msgstr ""

msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries."
msgstr ""

msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end."
msgstr ""

msgid "For this small example the indexes are skipped, except for ``id``"
msgstr ""

msgid "Edges data"
msgstr ""

msgid "Inserting into the database the information of the edges:"
msgstr ""

msgid "Negative values on the cost, capacity and category means that the edge do not exist."
msgstr ""

msgid "Vertices"
msgstr ""

msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:"
msgstr ""

msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed."
msgstr ""

msgid "The structure of the table is:"
msgstr ""

msgid "Vertices data"
msgstr "Datos de vértices"

msgid "The saved information of the vertices is:"
msgstr ""

msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application."
msgstr ""

msgid "The topology"
msgstr "La topología"

msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table."
msgstr ""

msgid "Topology data"
msgstr "Datos de topología"

msgid "Points outside the graph"
msgstr "Puntos fuera del grafo"

msgid "Support tables"
msgstr "Tablas de apoyo"

msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``."
msgstr ""

msgid "For convenience of this documentation, some combinations will be stored on a table:"
msgstr "Por conveniencia de esta documentación, algunas combinaciones se almacenan en una tabla:"

msgid "Inserting the data:"
msgstr "Insertar los datos:"

msgid "Combinations data"
msgstr ""

msgid "Some functions accept soft restrictions about the segments."
msgstr ""

msgid "Images"
msgstr "Imágenes"

msgid "Red arrows correspond when ``cost`` > 0 in the edge table."
msgstr "Las flechas rojas corresponden cuando ``cost`` > 0 en la tabla de aristas."

msgid "Blue arrows correspond when ``reverse_cost`` > 0 in the edge table."
msgstr "Las flechas azules corresponden cuando ``reverse_cost`` > 0 en la tabla de aristas."

msgid "Points are outside the graph."
msgstr "Los puntos están fuera del grafo."

msgid "Click on the graph to enlarge."
msgstr "Haga clic en el grafo para ampliarlo."

msgid "Directed graph with ``cost`` and ``reverse_cost``"
msgstr "Grafo dirigido con ``cost`` y ``reverse_cost``"

msgid "When working with city networks, this is recommended for point of view of vehicles."
msgstr "Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de vista de los vehículos."

msgid "Directed, with cost and reverse_cost"
msgstr "Dirigido, con costo y costo inverso"

msgid "Undirected graph with ``cost`` and ``reverse_cost``"
msgstr "Grafo no dirigido con ``cost`` y ``reverse_cost``"

msgid "When working with city networks, this is recommended for point of view of pedestrians."
msgstr "Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de vista de los peatones."

msgid "Undirected, with cost and reverse cost"
msgstr "No dirigido, con costo y costo inverso"

msgid "Directed graph with ``cost``"
msgstr ""

msgid "Directed, with cost"
msgstr "Dirigido, con costo"

msgid "Undirected graph with ``cost``"
msgstr ""

msgid "Undirected, with cost"
msgstr "No dirigido, con costo"

msgid "Pick & Deliver Data"
msgstr "Datos de Recogida y Entrega"

msgid "Spanning Tree - Category"
msgstr "Árbol de expansión - Categoría"

msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges."
msgstr "El árbol de expansión de un grafo no dirigido es un árbol que incluye todos los vértices de G con el número mínimo posible de aristas."

msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component."
msgstr "Para un grafo desconectado, no hay un solo árbol, sino un bosque de expansión, que consiste en un árbol de expansión de cada componente conectado."

msgid "Characteristics:"
msgstr "Características:"

msgid "pgRouting community support is available through the `pgRouting website <https://pgrouting.org/support.html>`_, `documentation <https://docs.pgrouting.org>`_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support <support_commercial>`, find below a list of companies providing pgRouting development and consulting services."
msgstr "El soporte comunitario de pgRouting está disponible a través del `Sitio de pgRouting <https://pgrouting.org/support.html>`_, `documentación <http://docs.pgrouting.org>`_, tutoriales, listas de correos y otros. Si estás buscando :ref:`Soporte Comercial <support_commercial>`, a continuación se encuentra una lista de compañias que proporcionan servicios de consultoría y desarrollo de pgRouting."

msgid "Reporting Problems"
msgstr "Reporte de Problemas"

msgid "Bugs are reported and managed in an `issue tracker <https://github.com/pgrouting/pgrouting/issues>`_. Please follow these steps:"
msgstr "Errores son registrados y manejados en un `issue tracker <https://github.com/pgrouting/pgrouting/issues>`_. Por favor siga los siguientes pasos:"

msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues."
msgstr "Buscar en las entradas para ver si ya se ha informado de su problema. Si es así, añadir cualquier contexto extra que usted haya encontrado, o al menos indicar que también está teniendo el problema. Esto nos ayudará a priorizar los problemas más comunes."

msgid "If your problem is unreported, create a `new issue <https://github.com/pgRouting/pgrouting/issues/new>`__ for it."
msgstr "Si su problema no se ha informado, cree un `nuevo asunto <https://github.com/pgRouting/pgrouting/issues/new>`__ para ello."

msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem."
msgstr "En su informe incluya instrucciones explícitas para reproducir el problema. Las mejores entradas incluyen consultas SQL exactas que se necesitan para reproducir el problema."

msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears."
msgstr "Si usted puede probar las versiones anteriores de PostGIS para su problema, por favor hágalo. En su reporte, tenga en cuenta la versión más antigua en la que aparezca el problema."

msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL."
msgstr "Para las versiones donde se puede reproducir el problema, anote el sistema operativo y la versión de pgRouting, PostGIS y PostgreSQL."

msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem."
msgstr "Se recomienda usar siguiente envoltorio en el problema para determinar el paso que está causando el problema."

#, fuzzy
msgid "Mailing List, Matrix, GIS StackExchange"
msgstr "Listas de correo y GIS StackExchange"

#, fuzzy
msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:"
msgstr "Hay dos listas de correo para pgRouting alojados en las listas de correo del Servidor de OSGeo:"

#, fuzzy
msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/"
msgstr "Lista de correo para desarrolladores: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/"

msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/"
msgstr "Lista de correo para desarrolladores: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/"

msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev"
msgstr "Suscríbase: https://discourse.osgeo.org/g/pgrouting-dev"

msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list."
msgstr "Para preguntas generales y tópicos sobre el uso pgRouting, escriba a la lista de correo para usuario."

msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel <https://matrix.to/#/#pgrouting:osgeo.org>`_."
msgstr ""

msgid "You can also ask at `GIS StackExchange <https://gis.stackexchange.com/>`_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed <https://gis.stackexchange.com/feeds/tag?tagnames=pgrouting&sort=newest>`_."
msgstr "También puede preguntar en `GIS StackExchange <https://gis.stackexchange.com/>`_ ay etiquetar la pregunta con ``pgrouting``. Encuentra todas las preguntas etiquetadas con ``pgrouting`` en https://gis.stackexchange.com/questions/tagged/pgrouting o suscríbete en `preguntas de retroalimentación de pgRouting <https://gis.stackexchange.com/feeds/tag?tagnames=pgrouting&sort=newest>`_."

msgid "Commercial Support"
msgstr "Soporte Comercial"

msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:"
msgstr "Para usuarios que requieren apoyo profesional, desarrollo y servicios de consultoría, considere ponerse en contacto con cualquiera de las siguientes organizaciones, que han contribuido significativamente al desarrollo de pgRouting:"

msgid "**Company**"
msgstr "**Empresa**"

msgid "**Offices in**"
msgstr "**Oficinas en**"

msgid "**Website**"
msgstr "**Sitio web**"

msgid "Germany, Japan"
msgstr "Alemania, Japón"

msgid "https://georepublic.info"
msgstr "https://georepublic.info"

msgid "United States"
msgstr "Estados Unidos"

msgid "https://www.paragoncorporation.com"
msgstr "https://www.paragoncorporation.com"

msgid "Netlab"
msgstr "Netlab"

msgid "Capranica, Italy"
msgstr "Capranica, Italia"

msgid "https://www.osgeo.org/service-providers/netlab/"
msgstr "https://www.osgeo.org/service-providers/netlab/"

msgid "Transformation - Family of functions"
msgstr "Transformación - Familia de funciones"

msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`."
msgstr "Esta familia de funciones se utiliza para transformar un grafo de entrada determinado :math:`G(V,E)` en un nuevo grafo :math:`G'(V',E')`."

msgid "Traversal - Family of functions"
msgstr "Traversal - Familia de funciones"

#, fuzzy
msgid "Utility functions"
msgstr "Funciones de flujo"

msgid "Via - Category"
msgstr "Via- Categoria"

msgid "This category intends to solve the general problem:"
msgstr "La intención de esta categoría es resolver el problema general:"

msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices"
msgstr "Dado un grafo y una lista de vértices, encuentra el camino mas corto entre :math:`vertex_i` and :math:`vertex_{i+1}` para todos los vértices"

msgid "In other words, find a continuous route that visits all the vertices in the order given."
msgstr "En otras palabras, encuentre la ruta continua que visite todos los vértices en el orden dado."

msgid "path"
msgstr "camino"

msgid "represents a section of a **route**."
msgstr "representa una sección de una **ruta**."

msgid "route"
msgstr "ruta"

msgid "is a sequence of **paths**"
msgstr "es una secuencia de **caminos**"

msgid "**Used in:**"
msgstr "**Usado en:**"

msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function."
msgstr "Ademas de los parámetros obligatorios que tiene cada función, hay parámetros opcionales que existen dado el tipo de función."

msgid "Used in all Via functions"
msgstr "Usado en todas las funciones Via"

msgid "Depending on the function one or more inner queries are needed."
msgstr "Dependiendo de la función, serán necesarias una o mas consultas internas."

msgid "withPoints - Category"
msgstr "withPoints- Categoría"

msgid "When points are added to the graph."
msgstr "Cuando los puntos se agregan al grafo."

msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query."
msgstr "La categoría **with points** modifica el grafo continuamente al agregar puntos en las aristas, como es requerido por la consulta `SQL de puntos`_ ."

msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph."
msgstr "Las funciones en esta categoría otorgan la habilidad de procesar entre puntos arbitrarios ubicados afuera del grafo original."

msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles."
msgstr "Esta categoría de funciones se origino para el ruteo de vehículos, pero bien puede funcionar si se aplica en algo que no incluya vehículos."

msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks."
msgstr "Cuando se da un identificador de punto ``pid`` que esta siendo mapeado a una arista con un identificador``edge_id``, con una fracción de la fuente al objetivo a lo largo de la arista ``fraction`` y existe información adicional sobre de que lado de la arista el punto está ``side``, entonces el procesos desde puntos arbitrarios se puede hacer en redes fijas."

msgid "All this functions consider as many traits from the \"real world\" as possible:"
msgstr "Todas estas funciones consideran el mayor numero características posibles del \"mundo real\":"

msgid "Kind of graph:"
msgstr "Tipo de grafo:"

msgid "**directed** graph"
msgstr "grafo **dirigido**"

msgid "**undirected** graph"
msgstr "grafo **no dirigido**"

msgid "Arriving at the point:"
msgstr "Llegando al punto:"

msgid "Compulsory arrival on the side of the segment where the point is located."
msgstr "Llegada obligatoria en el lado del segmento donde se ubica el punto."

msgid "On either side of the segment."
msgstr "En cualquier lado del segmento."

msgid "Countries with:"
msgstr "Países con:"

msgid "**Right** side driving"
msgstr "Manejando del lado **derecho**"

msgid "**Left** side driving"
msgstr "Manejando del lado **izquierdo**"

msgid "Some points are:"
msgstr "Algunos puntos son:"

msgid "**Permanent**: for example the set of points of clients stored in a table in the data base."
msgstr "**Permanente**: por ejemplo el grupo de puntos de clientes guardados en una table en la base de datos."

msgid "The graph has been modified to permanently have those points as vertices."
msgstr "El grafo fue modificado para que tenga esos puntos como vértices de manera permanente."

msgid "There is a table on the database that describes the points"
msgstr "Hay una table en la base de datos que describe los puntos"

msgid "**Temporal**: for example points given through a web application"
msgstr "**Temporal**: por ejemplo los puntos dados por una aplicación en la web"

msgid "The numbering of the points are handled with negative sign."
msgstr "La numeración de los puntos se marca con signo negativo."

msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier."
msgstr "El cambio de signo es para evitar confusión cuando hay un vértice con el mismo identificador de un identificador de punto."

msgid "Original point identifiers are to be positive."
msgstr "Identificadores del punto original deben ser positivos."

msgid "Transformation to negative is done internally."
msgstr "Transformación a un negativo se hace internamente."

msgid "Interpretation of the sign on the node information of the output"
msgstr "Interpretación del signo en la información del nodo en los resultados"

msgid "positive sign is a vertex of the original graph"
msgstr "signo positivo es un vértice en el grafo original"

msgid "negative sign is a point of the `Points SQL`_"
msgstr "signo negativo es un punto en la `SQL de puntos`_"

msgid "About points"
msgstr "Sobre los puntos"

#, fuzzy
msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example."
msgstr "Para esta sección de la siguiente ciudad (ver :doc:`sampledata`) algunos puntos de interés como restaurantes, supermercado, oficina de correo, etc. seran usadas de ejemplo."

msgid "The graph is **directed**"
msgstr "El grafo es **dirigido**"

msgid "Red arrows show the ``(source, target)`` of the edge on the edge table"
msgstr "Las flechas rojas muestran``(source, target)`` de la arista en al tabla de aristas"

msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table"
msgstr "La flechas azules muestran ``(target, source)`` la arista en la tabla de aristas"

msgid "Each point location shows where it is located with relation of the edge ``(source, target)``"
msgstr "Cada ubicación de los puntos muestra su ubicación en relación con la arista ``(source, target)``"

msgid "On the right for points **2** and **4**."
msgstr "A la derecha para los puntos **2** y **4**."

msgid "On the left for points **1**, **3** and **5**."
msgstr "A la izquierda para los puntos **1**, **3** y**5**."

msgid "On both sides for point **6**."
msgstr "En ambos lados para el punto **6**."

msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:"
msgstr "La representación de la base de datos sigue la descripción `SQL de puntos`_ , y para este ejemplo:"

msgid "Driving side"
msgstr "Lado de manejo"

#, fuzzy
msgid "In the following images:"
msgstr "En las siguientes imágenes:"

msgid "The squared vertices are the temporary vertices,"
msgstr "Los vértices cuadrados son vértices temporales,"

msgid "The temporary vertices are added according to the driving side,"
msgstr "Los vértices temporales se agregan según el lado de conducción,"

msgid "visually showing the differences on how depending on the driving side the data is interpreted."
msgstr "visualmente mostrando las diferencias dependiendo de como se interpreta la información de lado de conducción."

msgid "Point **1** located on edge ``(6, 5)``"
msgstr "Punto**1** ubicado en la arista ``(6, 5)``"

msgid "Point **2** located on edge ``(16, 17)``"
msgstr "Punto **2** ubicado en la arista``(16, 17)``"

msgid "Point **3** located on edge ``(8, 12)``"
msgstr "Punto **3** ubicado en la arista``(8, 12)``"

msgid "Point **4** located on edge ``(1, 3)``"
msgstr "Punto **4** ubicado en la arista``(1, 3)``"

msgid "Point **5** located on edge ``(10, 11)``"
msgstr "Punto **5** ubicado en la arista``(10, 11)``"

msgid "Point **6** located on edges ``(6, 7)`` and ``(7, 6)``"
msgstr "Punto **6** ubicado en las aristas ``(6, 7)`` y ``(7, 6)``"

msgid "Point **1** located on edge ``(5, 6)``"
msgstr "Punto**1** ubicado en la arista ``(5, 6)``"

msgid "Point **2** located on edge ``(17, 16)``"
msgstr "Punto **2** ubicado en la arista``(17, 16)``"

msgid "Point **4** located on edge ``(3, 1)``"
msgstr "Punto **4** ubicado en la arista``(3, 1)``"

msgid "Like having all points to be considered in both sides ``b``"
msgstr "Como si se tuvieran todos los puntos en ambos lados considerados como ``b``"

#, fuzzy
msgid "Preferred usage on **undirected** graphs"
msgstr "Uso preferido en grafos **no dirigidos**"

msgid "On the :doc:`TRSP-family` this option is not valid"
msgstr "En :doc:`TRSP-family` esta opción no es válida"

msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``"
msgstr "Punto**1** ubicado en la arista``(5, 6)`` y ``(6, 5)``"

msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``"
msgstr "Punto **2** ubicado en la arista``(17, 16)`` y ``(16, 17)``"

msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``"
msgstr ""

msgid "Creating temporary vertices"
msgstr "Creación de vértices temporales"

msgid "This section will demonstrate how a temporary vertex is created internally on the graph."
msgstr ""

msgid "Problem"
msgstr ""

msgid "For edge:"
msgstr ""

msgid "insert point:"
msgstr ""

msgid "On a right hand side driving network"
msgstr "En una red de conducción del lado derecho"

#, fuzzy
msgid "Arrival to point ``-2`` can be achieved only via vertex **16**."
msgstr "Llegada al punto ``-2`` se logra solo vía el vértice **16**."

msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept."
msgstr ""

msgid "It only affects the edge ``(16, 17)``, therefore the edge is removed."
msgstr "Sólo afecta a la arista ``(16, 17)``, por lo que la arista se elimina."

msgid "Create two new edges:"
msgstr "Crear dos aristas nuevas:"

msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)"
msgstr ""

msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)"
msgstr ""

msgid "The total cost of the additional edges is equal to the original cost."
msgstr ""

msgid "If more points are on the same edge, the process is repeated recursevly."
msgstr ""

msgid "On a left hand side driving network"
msgstr "En una red de conducción del lado izquierdo"

#, fuzzy
msgid "Arrival to point ``-2`` can be achieved only via vertex **17**."
msgstr "Llegada al punto ``-2`` se logra solo vía el vértice **17**."

msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept."
msgstr ""

msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed."
msgstr "Sólo afecta a la arista ``(17, 16)``, por lo que la arista se elimina."

msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:"
msgstr ""

msgid "Flip the Edges and add them to the graph:"
msgstr ""

msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph."
msgstr ""

msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph."
msgstr ""

msgid "When driving side does not matter"
msgstr "Cuando el lado de conducción no importa"

#, fuzzy
msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**."
msgstr "Llegada al punto ``-2`` se logra solo vía el vértice **17**."

msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed."
msgstr "Afecta las aristas ``(16, 17)`` y ``(17, 16)`` por lo que esas aristas se eliminan."

msgid "Create four new edges:"
msgstr "Crear cuatro nuevas aristas:"

msgid "Flip the Edges and add all the edges to the graph:"
msgstr ""

msgid "Edge ``(16, -2)`` is added to the graph."
msgstr ""

msgid "Edge ``(-2, 17)`` is added to the graph."
msgstr ""

msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph."
msgstr ""

msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph."
msgstr ""

msgid "withPoints - Family of functions"
msgstr "withPoints - Familia de funciones"

msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm."
msgstr ""

msgid "Depending on the name:"
msgstr ""

msgid "pgr_withPoints is pgr_dijkstra **with points**"
msgstr "pgr_withPoints es pgr_dijkstra **con puntos**"

msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**"
msgstr "pgr_withPointsCost es pgr_dijkstraCost **con puntos**"

msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**"
msgstr "pgr_withPointsCostMatrix es pgr_dijkstraCostMatrix **con puntos**"

msgid "pgr_withPointsKSP is pgr_ksp **with points**"
msgstr "pgr_withPointsKSP es pgr_ksp **con puntos**"

msgid "pgr_withPointsDD is pgr_drivingDistance **with points**"
msgstr "pgr_withPointsDD es pgr_drivingDistance **con puntos**"

msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**"
msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**"

#~ msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara"
#~ msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara"

#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

#~ msgid "See also"
#~ msgstr "Ver también"

#~ msgid "``pgr_bellmanFord - Experimental``"
#~ msgstr "``pgr_bellmanFord`` - Experimental"

#~ msgid "``pgr_dijkstraNear`` - Proposed"
#~ msgstr "``pgr_dijkstraNear`` - Propuesto"

#~ msgid "``pgr_dijkstraNearCost`` - Proposed"
#~ msgstr "``pgr_dijkstraNearCost`` - Propuesto"

#~ msgid "Additionally there are 2 categories under this family"
#~ msgstr "Adicionalmente, hay dos categorías en esta familia"

#~ msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_DAGshortestPath"
#~ msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_DAGshortestPath"

#~ msgid "_pgr_withpointsksp => _pgr_withpointsksp_v4"
#~ msgstr "_pgr_withpointsksp => _pgr_withpointsksp_v4"

#, fuzzy
#~ msgid "Validity of **driving side** parameter"
#~ msgstr "Lado de manejo derecho"

#~ msgid "**driving side** parameter is unnamed compulsory, and valid values differ for directed and undirected graphs."
#~ msgstr "El parámetro **lado de manjeo** es obligatorio sin nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos."

#~ msgid "Does not have a default value."
#~ msgstr "No tiene un valor de facto."

#~ msgid "Using an invalid value throws an ``ERROR``."
#~ msgstr "El uso de un valor inválido lanza un ``ERROR``."

#~ msgid "And ``driving side`` parameter changed from named optional to unnamed compulsory **driving side** and its validity differ for directed and undirected graphs."
#~ msgstr "Y el parámetro \"driving side\" ha cambiado de opcional con nombre a obligatorio sin nombre **driving side** y su validez difiere para grafos dirigidos y no dirigidos."

#, fuzzy
#~ msgid "if OFF the Spaish documentation will no be built"
#~ msgstr "Información sobre cuándo se construyó esta documentación"

#~ msgid "Regina Obe, Vicky Vergara"
#~ msgstr "Regina Obe, Vicky Vergara"

#, fuzzy
#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

#, fuzzy
#~ msgid "..rubric:: Version 3.0.0"
#~ msgstr "Versión 3.0.0"

#~ msgid "``pgr_dijkstraVia`` - Proposed"
#~ msgstr "``pgr_dijkstraVia`` - Propuesto"

#~ msgid "|boost| graph inside."
#~ msgstr "|boost| graph adentro."

#, fuzzy
#~ msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])"
#~ msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])"

#~ msgid "**driving side**"
#~ msgstr "**Lado de manejo**"

#~ msgid "[``r``, ``R``] for right driving side (for directed graph only)"
#~ msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)"

#~ msgid "[``l``, ``L``] for left driving side (for directed graph only)"
#~ msgstr "[``l``, ``L``] para manejo por lad izquierdo (solo gráfos dirigidos)"

#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destino**, [**opciones**])"

#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])"

#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salidas**, **destino**, [**opciones**])"

#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salidas**, **destinos**, [**opciones**])"

#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, `SQL de puntos`_, [**opciones**])"

#~ msgid "**options:** ``[directed, driving_side, details]``"
#~ msgstr "**opcionales:** ``[directed, driving_side, details]``"

#, fuzzy
#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])"

#~ msgid "Using the default ``driving_side`` value"
#~ msgstr "Usando el valor predeterminado ``driving_side``"

#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])"
#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])"

#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])"
#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])"

#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])"
#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])"

#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])"
#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])"

#~ msgid "``r``, ``R`` for right driving side,"
#~ msgstr "``r``, ``R`` para el manejo del lado derecho,"

#~ msgid "``l``, ``L`` for left driving side."
#~ msgstr "``l``, ``L`` para lado de manejo izquierdo."

#~ msgid "``b``, ``B`` for both."
#~ msgstr "``b``, ``B`` para ambos."

#~ msgid "Valid values differ for directed and undirected graphs:"
#~ msgstr "Valores válidos son differentes para grafos dirigidos y no dirigidos:"

#~ msgid "In undirected graphs: [``b``, ``B``]."
#~ msgstr "En grafos no dirigidos: [``b``, ``B``]."

#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])"

#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])"

#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])"

#, fuzzy
#~ msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])"

#, fuzzy
#~ msgid "Regina Obe, Saloni kumari, Vicky Vergara"
#~ msgstr "Regina Obe, Vicky Vergara"

#, fuzzy
#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

#, fuzzy
#~ msgid "New experimental function"
#~ msgstr "Nueva función experimental."

#, fuzzy
#~ msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph."
#~ msgstr ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no dirigido."

#, fuzzy
#~ msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara"
#~ msgstr "Regina Obe, Vicky Vergara"

#, fuzzy
#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

#~ msgid "New **experimental** function"
#~ msgstr "Nueva función **experimental**"

#, fuzzy
#~ msgid "|Boost| Boost Graph inside"
#~ msgstr "|Boost| Adentro: Boost Graph"
