diff --git a/locale/es/LC_MESSAGES/index.po b/locale/es/LC_MESSAGES/index.po index b9ec0d56e1f..91981c9b687 100644 --- a/locale/es/LC_MESSAGES/index.po +++ b/locale/es/LC_MESSAGES/index.po @@ -3,493 +3,664 @@ # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # -#, fuzzy msgid "" msgstr "" "Project-Id-Version: pgRouting v3.4.0-dev\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" -"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" -"Last-Translator: FULL NAME \n" -"Language-Team: LANGUAGE \n" +"PO-Revision-Date: 2022-09-28 19:34+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" +"Language-Team: Spanish \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 4.14.1\n" "Generated-By: Babel 2.9.1\n" #: ../../build/doc/index.rst:12 msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 " +"`__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 " +"`__ `3.2 `__ `3.1 `__ `3.0 `__" #: ../../build/doc/index.rst:19 msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " "`__" msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " +"`__" #: ../../build/doc/index.rst:30 msgid "Table of Contents" -msgstr "" +msgstr "Tabla de Contenido" #: ../../build/doc/index.rst:32 msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL " -"`__ geospatial database to provide geospatial" -" routing and other network analysis functionality." +"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " +"other network analysis functionality." msgstr "" +"pgRouting extiende la base de datos geospacial de `PostGIS `__/`PostgreSQL `__ para proporcionar " +"enrutamiento geoespacial y otras funciones de análisis de red." #: ../../build/doc/index.rst:36 msgid "This is the manual for pgRouting |release|." -msgstr "" +msgstr "Este es el manual para la version |release| de pgRouting." msgid "Creative Commons Attribution-Share Alike 3.0 License" -msgstr "" +msgstr "Licencia de Creative Commons Attribution-Share Alike 3.0" #: ../../build/doc/index.rst:42 msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-" -"Share Alike 3.0 License `_. 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 "" +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_. 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 `_. " +"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` ." #: ../../build/doc/index.rst:50 msgid "General" -msgstr "" +msgstr "General" #: ../../build/doc/index.rst:60 msgid ":doc:`sampledata` that is used in the examples of this manual." -msgstr "" +msgstr ":doc:`sampledata` es usado en los ejemplos de este manual." #: ../../build/doc/index.rst:68 msgid "Pgrouting Concepts" -msgstr "" +msgstr "Conceptos de pgRouting" #: ../../build/doc/index.rst:77 msgid ":doc:`routingFunctions`" -msgstr "" +msgstr ":doc:`routingFunctions`" #: ../../build/doc/routingFunctions.rst:4 msgid ":doc:`allpairs-family`" -msgstr "" +msgstr ":doc:`allpairs-family`" #: ../../build/doc/allpairs-family.rst:3 msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm." -msgstr "" +msgstr ":doc:`pgr_floydWarshall` - Algoritmo de Floyd-Warshall." #: ../../build/doc/allpairs-family.rst:4 msgid ":doc:`pgr_johnson` - Johnson's algorithm" -msgstr "" +msgstr ":doc:`pgr_johnson` - Algoritmo de Johnson" #: ../../build/doc/routingFunctions.rst:10 msgid ":doc:`aStar-family`" -msgstr "" +msgstr ":doc:`aStar-family`" #: ../../build/doc/aStar-family.rst:3 msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." -msgstr "" +msgstr ":doc:`pgr_aStar` - Algoritmo A* para la ruta más corta." #: ../../build/doc/aStar-family.rst:4 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." #: ../../build/doc/aStar-family.rst:5 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." #: ../../build/doc/routingFunctions.rst:17 msgid ":doc:`bdAstar-family`" -msgstr "" +msgstr ":doc:`bdAstar-family`" #: ../../build/doc/bdAstar-family.rst:3 msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." -msgstr "" +msgstr ":doc:`pgr_bdAstar` - Algoritmo bidireccional A* para obtener rutas." #: ../../build/doc/bdAstar-family.rst:4 msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost" -" of the paths." +":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." #: ../../build/doc/bdAstar-family.rst:6 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." #: ../../build/doc/routingFunctions.rst:23 msgid ":doc:`bdDijkstra-family`" -msgstr "" +msgstr ":doc:`bdDijkstra-family`" #: ../../build/doc/bdDijkstra-family.rst:3 msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest" -" paths." +":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " +"paths." msgstr "" +":doc:`pgr_bdDijkstra` - Algoritmo Dijkstra bidireccional para las rutas más " +"cortas." #: ../../build/doc/bdDijkstra-family.rst:5 msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost " -"of the shortest paths" +":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" #: ../../build/doc/bdDijkstra-family.rst:7 msgid "" ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to " "create a matrix of costs of the shortest paths." msgstr "" +":doc:`pgr_bdDijkstraCostMatrix` - Algoritmo Dijkstra bidireccional para " +"crear una matriz de costes de las rutas más cortas." #: ../../build/doc/routingFunctions.rst:29 msgid ":doc:`components-family`" -msgstr "" +msgstr ":doc:`components-family`" #: ../../build/doc/components-family.rst:3 msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected " -"graph." +":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr "" +":doc:`pgr_connectedComponents` - Componentes conectados de un grafo no " +"dirigido." #: ../../build/doc/components-family.rst:4 msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed" -" graph." +":doc:`pgr_strongComponents` - Strongly connected components of a directed " +"graph." msgstr "" +":doc:`pgr_strongComponents` - Componentes fuertemente conectados de un grafo " +"dirigido." #: ../../build/doc/components-family.rst:6 msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an " -"undirected graph." +":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " +"graph." msgstr "" +":doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo no " +"dirigido." #: ../../build/doc/components-family.rst:8 msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected " -"graph." +":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr "" +":doc:`pgr_articulationPoints` - Puntos de articulación de un grafo no " +"dirigido." #: ../../build/doc/components-family.rst:9 msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." -msgstr "" +msgstr ":doc:`pgr_bridges` - Puentes de un grafo no dirigido." #: ../../build/doc/routingFunctions.rst:35 msgid ":doc:`contraction-family`" -msgstr "" +msgstr ":doc:`contraction-family`" #: ../../build/doc/contraction-family.rst:3 msgid ":doc:`pgr_contraction`" -msgstr "" +msgstr ":doc:`pgr_contraction`" #: ../../build/doc/routingFunctions.rst:41 msgid ":doc:`dijkstra-family`" -msgstr "" +msgstr ":doc:`dijkstra-family`" #: ../../build/doc/dijkstra-family.rst:3 msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr "" +msgstr ":doc:`pgr_dijkstra` - Algoritmo de Dijkstra para las rutas más cortas." #: ../../build/doc/dijkstra-family.rst:4 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." #: ../../build/doc/dijkstra-family.rst:5 -msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +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." #: ../../build/doc/dijkstra-family.rst:6 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." #: ../../build/doc/dijkstra-family.rst:8 msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K " -"shortest paths." +":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." #: ../../build/doc/routingFunctions.rst:47 msgid ":doc:`flow-family`" -msgstr "" +msgstr ":doc:`flow-family`" #: ../../build/doc/flow-family.rst:3 msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel" -" algorithm." +":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." #: ../../build/doc/flow-family.rst:5 msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow " -"on edges." +":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." #: ../../build/doc/flow-family.rst:7 msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow " -"on edges." +":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." #: ../../build/doc/flow-family.rst:9 msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow " -"on edges." +":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." #: ../../build/doc/flow-family.rst:11 msgid "Applications" -msgstr "" +msgstr "Aplicaciones" #: ../../build/doc/flow-family.rst:13 msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two" -" groups of vertices." +":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." #: ../../build/doc/flow-family.rst:15 msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality " -"matching in a graph." +":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." #: ../../build/doc/routingFunctions.rst:53 #: ../../build/doc/spanningTree-family.rst:3 msgid ":doc:`kruskal-family`" -msgstr "" +msgstr ":doc:`kruskal-family`" #: ../../build/doc/kruskal-family.rst:3 msgid ":doc:`pgr_kruskal`" -msgstr "" +msgstr ":doc:`pgr_kruskal`" #: ../../build/doc/BFS-category.rst:3 ../../build/doc/kruskal-family.rst:4 msgid ":doc:`pgr_kruskalBFS`" -msgstr "" +msgstr ":doc:`pgr_kruskalBFS`" #: ../../build/doc/kruskal-family.rst:5 msgid ":doc:`pgr_kruskalDD`" -msgstr "" +msgstr ":doc:`pgr_kruskalDD`" #: ../../build/doc/DFS-category.rst:3 ../../build/doc/kruskal-family.rst:6 msgid ":doc:`pgr_kruskalDFS`" -msgstr "" +msgstr ":doc:`pgr_kruskalDFS`" #: ../../build/doc/routingFunctions.rst:59 #: ../../build/doc/spanningTree-family.rst:4 msgid ":doc:`prim-family`" -msgstr "" +msgstr ":doc:`prim-family`" #: ../../build/doc/prim-family.rst:3 msgid ":doc:`pgr_prim`" -msgstr "" +msgstr ":doc:`pgr_prim`" #: ../../build/doc/BFS-category.rst:4 ../../build/doc/prim-family.rst:4 msgid ":doc:`pgr_primBFS`" -msgstr "" +msgstr ":doc:`pgr_primBFS`" #: ../../build/doc/prim-family.rst:5 msgid ":doc:`pgr_primDD`" -msgstr "" +msgstr ":doc:`pgr_primDD`" #: ../../build/doc/DFS-category.rst:4 ../../build/doc/prim-family.rst:6 msgid ":doc:`pgr_primDFS`" -msgstr "" +msgstr ":doc:`pgr_primDFS`" #: ../../build/doc/routingFunctions.rst:65 msgid ":doc:`reference`" -msgstr "" +msgstr ":doc:`reference`" #: ../../build/doc/reference.rst:3 msgid ":doc:`pgr_version`" -msgstr "" +msgstr ":doc:`pgr_version`" #: ../../build/doc/reference.rst:4 msgid ":doc:`pgr_full_version`" -msgstr "" +msgstr ":doc:`pgr_full_version`" #: ../../build/doc/routingFunctions.rst:71 msgid ":doc:`topology-functions`" -msgstr "" +msgstr ":doc:`topology-functions`" #: ../../build/doc/topology-functions.rst:3 msgid "" -"The following functions modify the database directly therefore the user " -"must have special permissions given by the administrators to use them." +"The following functions modify the database directly therefore the user must " +"have special permissions given by the administrators to use them." msgstr "" +"Las siguientes funciones modifican la base de datos directamente, por lo que " +"el usuario debe tener permisos especiales otorgados por un administrador " +"para usarlos." #: ../../build/doc/topology-functions.rst:6 msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." msgstr "" +":doc:`pgr_createTopology` - para crear una topología basada en la geometría." #: ../../build/doc/topology-functions.rst:7 msgid "" -":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on " -"the source and target information." +":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " +"source and target information." msgstr "" +":doc:`pgr_createVerticesTable` - reconstruir la tabla de vértices en base a " +"la información de origen y destino." #: ../../build/doc/topology-functions.rst:9 msgid "" ":doc:`pgr_analyzeGraph` - to analyze the edges and vertices of the edge " "table." msgstr "" +":doc:`pgr_analyzeGraph` - para analizar los bordes y vértices de la tabla de " +"aristas." #: ../../build/doc/topology-functions.rst:11 msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." msgstr "" +":doc:`pgr_analyzeOneWay` - para analizar la direccionalidad de las aristas." #: ../../build/doc/topology-functions.rst:12 msgid ":doc:`pgr_nodeNetwork` -to create nodes to a not noded edge table." -msgstr "" +msgstr ":doc:`pgr_nodeNetwork` - para crear nodos en una tabla de aristas." #: ../../build/doc/routingFunctions.rst:77 msgid ":doc:`TSP-family`" -msgstr "" +msgstr ":doc:`TSP-family`" #: ../../build/doc/TSP-family.rst:3 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." #: ../../build/doc/TSP-family.rst:4 msgid ":doc:`pgr_TSPeuclidean` - When input are coordinates." -msgstr "" +msgstr ":doc:`pgr_TSPeuclidean` - Cuando la información son coordenadas." #: ../../build/doc/routingFunctions.rst:83 msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" -msgstr "" +msgstr ":doc:`pgr_trsp` - Camino más corto con restricción de giros (TRSP)" #: ../../build/doc/routingFunctions.rst:87 msgid "Functions by categories" -msgstr "" +msgstr "Funciones por categorías" #: ../../build/doc/routingFunctions.rst:89 msgid ":doc:`cost-category`" -msgstr "" +msgstr ":doc:`cost-category`" #: ../../build/doc/cost-category.rst:3 msgid ":doc:`pgr_aStarCost`" -msgstr "" +msgstr ":doc:`pgr_aStarCost`" #: ../../build/doc/cost-category.rst:4 msgid ":doc:`pgr_bdAstarCost`" -msgstr "" +msgstr ":doc:`pgr_bdAstarCost`" #: ../../build/doc/cost-category.rst:5 msgid ":doc:`pgr_dijkstraCost`" -msgstr "" +msgstr ":doc:`pgr_dijkstraCost`" #: ../../build/doc/cost-category.rst:6 msgid ":doc:`pgr_bdDijkstraCost`" -msgstr "" +msgstr ":doc:`pgr_bdDijkstraCost`" #: ../../build/doc/cost-category.rst:7 msgid ":doc:`pgr_dijkstraNearCost`" -msgstr "" +msgstr ":doc:`pgr_dijkstraNearCost`" #: ../../build/doc/routingFunctions.rst:95 msgid ":doc:`costMatrix-category`" -msgstr "" +msgstr ":doc:`costMatrix-category`" #: ../../build/doc/costMatrix-category.rst:3 msgid ":doc:`pgr_aStarCostMatrix`" -msgstr "" +msgstr ":doc:`pgr_aStarCostMatrix`" #: ../../build/doc/costMatrix-category.rst:4 msgid ":doc:`pgr_bdAstarCostMatrix`" -msgstr "" +msgstr ":doc:`pgr_bdAstarCostMatrix`" #: ../../build/doc/costMatrix-category.rst:5 #: ../../build/doc/costMatrix-category.rst:7 msgid ":doc:`pgr_bdDijkstraCostMatrix`" -msgstr "" +msgstr ":doc:`pgr_bdDijkstraCostMatrix`" #: ../../build/doc/costMatrix-category.rst:6 msgid ":doc:`pgr_dijkstraCostMatrix`" -msgstr "" +msgstr ":doc:`pgr_dijkstraCostMatrix`" #: ../../build/doc/routingFunctions.rst:102 msgid ":doc:`drivingDistance-category`" -msgstr "" +msgstr ":doc:`drivingDistance-category`" #: ../../build/doc/drivingDistance-category.rst:3 msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's " -"algorithm" +":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" +":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo de " +"Dijkstra" #: ../../build/doc/drivingDistance-category.rst:4 msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" -msgstr "" +msgstr ":doc:`pgr_primDD` - Distancia de manejo basada en el algoritmo de Prim" #: ../../build/doc/drivingDistance-category.rst:5 msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" msgstr "" +":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal" #: ../../build/doc/drivingDistance-category.rst:6 msgid "Post pocessing" -msgstr "" +msgstr "Post procesamiento" #: ../../build/doc/drivingDistance-category.rst:8 msgid ":doc:`pgr_alphaShape` - Alpha shape computation" -msgstr "" +msgstr ":doc:`pgr_alphaShape` - Cálcular la forma Alpha" #: ../../build/doc/routingFunctions.rst:108 msgid ":doc:`KSP-category`" -msgstr "" +msgstr ":doc:`KSP-category`" #: ../../build/doc/KSP-category.rst:3 msgid ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra" -msgstr "" +msgstr ":doc:`pgr_KSP` - Algoritmo de Yen basado en pgr_dijkstra" #: ../../build/doc/routingFunctions.rst:114 msgid ":doc:`spanningTree-family`" -msgstr "" +msgstr ":doc:`spanningTree-family`" #: ../../build/doc/routingFunctions.rst:120 msgid ":doc:`BFS-category`" -msgstr "" +msgstr ":doc:`BFS-category`" #: ../../build/doc/routingFunctions.rst:126 msgid ":doc:`DFS-category`" -msgstr "" +msgstr ":doc:`DFS-category`" #: ../../build/doc/index.rst:91 msgid "Available Functions but not official pgRouting functions" -msgstr "" +msgstr "Funciones disponibles pero no oficiales de pgRouting" #: ../../build/doc/index.rst:93 msgid ":doc:`proposed`" -msgstr "" +msgstr ":doc:`proposed`" #: ../../build/doc/index.rst:94 msgid ":doc:`experimental`" -msgstr "" +msgstr ":doc:`experimental`" #: ../../build/doc/index.rst:105 msgid ":doc:`release_notes`" -msgstr "" +msgstr ":doc:`release_notes`" #: ../../build/doc/index.rst:119 msgid "Indices and tables" -msgstr "" +msgstr "Índices y tablas" #: ../../build/doc/index.rst:120 msgid ":ref:`genindex`" -msgstr "" +msgstr ":ref:`genindex`" #: ../../build/doc/index.rst:121 msgid ":ref:`search`" -msgstr "" +msgstr ":ref:`search`" + +msgid "**root vid**" +msgstr "**raíz**" + +msgid "**distance**" +msgstr "**distancia**" + +msgid "**point**" +msgstr "**punto**" + +msgid "**tolerance**" +msgstr "**tolerancia**" + +msgid "`Restrictions SQL`_" +msgstr "`SQL de restricciones`_" + +msgid "`Edges SQL`_" +msgstr "`SQL de aristas`_" + +msgid "**start vids**" +msgstr "**salidas**" + +msgid "``start_close``" +msgstr "``start_close``" + +msgid "pgr_quote_ident" +msgstr "pgr_quote_ident" + +msgid "``max_depth``" +msgstr "``max_depth``" + +msgid "`Points SQL`_" +msgstr "`SQL de puntos`_" + +msgid "**start vid**" +msgstr "**salida**" + +msgid "``end_close``" +msgstr "``end_close``" + +msgid "**options**" +msgstr "**opciones**" + +msgid "**root vids**" +msgstr "**raices**" + +msgid "**end vid**" +msgstr "**destino**" + +msgid "**points**" +msgstr "**puntos**" + +msgid "**via vertices**" +msgstr "**vértices**" + +msgid "**end vids**" +msgstr "**destinos**" + +msgid "`Combinations SQL`_" +msgstr "`SQL de combinaciones`_" + +msgid "``epsilon``" +msgstr "``epsilon``" + +msgid "``directed``" +msgstr "``directed``" + +msgid "**ANY-NUMERICAL**" +msgstr "**FLOTANTES**" + +msgid "**ANY-INTEGER**" +msgstr "**ENTEROS**" + +msgid "``p_open``" +msgstr "``p_open``" + +msgid "``p_close``" +msgstr "``p_close``" + +msgid "`Matrix SQL`_" +msgstr "`SQL de martiz`_" + +msgid "RETURNS SET OF" +msgstr "REGRESA CONJUNTO DE" + +msgid "``p_service``" +msgstr "``p_service``" + +msgid "**Supported versions:**" +msgstr "**Versiones Soportadas:**" + +msgid "``d_open``" +msgstr "``d_open``" + +msgid "``d_service``" +msgstr "``d_service``" + +msgid "``p_node_id``" +msgstr "``p_node_id``" +msgid "``d_node_id``" +msgstr "``d_node_id``" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 1bc480b9278..1273d1de754 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -3,29 +3,31 @@ # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # -#, fuzzy msgid "" msgstr "" "Project-Id-Version: pgRouting v3.4.0-dev\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-09-23 16:50+0000\n" -"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"PO-Revision-Date: 2022-09-28 19:42+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" -"Language-Team: Spanish \n" +"Language: es\n" "MIME-Version: 1.0\n" -"Content-Type: text/plain; charset=utf-8\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 4.14.1\n" "Generated-By: Babel 2.10.3\n" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__)" +"**Versiones soportadas:** `Última `__ (`3.4 `__)" msgid "BFS - Category" msgstr "BFS - Categoría" @@ -73,7 +75,7 @@ msgid "Description" msgstr "Descripción" msgid "`Edges SQL`_" -msgstr "`SQL Aristas`_" +msgstr "`SQL de aristas`_" msgid "``TEXT``" msgstr "``TEXT``" @@ -81,9 +83,8 @@ msgstr "``TEXT``" msgid "`Edges SQL`_ as described below." msgstr "`SQL Aristas`_ descritas más adelante." -#, fuzzy msgid "**root vid**" -msgstr "**id raíz**" +msgstr "**raíz**" msgid "``BIGINT``" msgstr "``BIGINT``" @@ -92,18 +93,17 @@ 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." +"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." +"Cuando el valor es :math:`0` se obtiene el bosque de expansión que comienza " +"en nodos aleatorios para cada árbol del bosque." -#, fuzzy msgid "**root vids**" -msgstr "**Raíces**" +msgstr "**raices**" msgid "``ARRAY`` [ **ANY-INTEGER** ]" -msgstr "" +msgstr "``ARRAY`` [**ENTEROS** ]" msgid "Array of identifiers of the root vertices." msgstr "Arreglo de identificadores de los vértices raíz." @@ -196,11 +196,11 @@ 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." +"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." +"Cuando negativo: la arista (``target``, ``source``) no existe, por lo tanto " +"no es parte del grafo." msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -269,33 +269,32 @@ msgid "See Also" msgstr "Ver también" msgid "" -"`Boost: Prim's algorithm " -"`__" +"`Boost: Prim's algorithm `__" msgstr "" -"`Boost: Algoritmo de Prim " -"`__" +"`Boost: Algoritmo de Prim `__" msgid "" -"`Boost: Kruskal's algorithm " -"`__" +"`Boost: Kruskal's algorithm `__" msgstr "" -"`Boost: algoritmo de Kruskal " -"`__" +"`Boost: algoritmo de Kruskal `__" -#, python-format msgid "" -"`Wikipedia: Prim's algorithm " -"`__" +"`Wikipedia: Prim's algorithm `__" msgstr "" -"`Wikipedia: algoritmo de Prim " -"`__" +"`Wikipedia: algoritmo de Prim `__" msgid "" -"`Wikipedia: Kruskal's algorithm " -"`__" +"`Wikipedia: Kruskal's algorithm `__" msgstr "" -"`Wikipedia: algoritmo de Kruskal " -"`__" +"`Wikipedia: algoritmo de Kruskal `__" msgid "Indices and tables" msgstr "Índices y tablas" @@ -307,13 +306,13 @@ msgid ":ref:`search`" msgstr ":ref:`search`" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__)" +"**Versiones soportadas:** `Última `__ (`3.4 `__)" msgid "DFS - Category" msgstr "DFS - Categoría" @@ -357,41 +356,37 @@ 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." +msgid "" +":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr "" -":doc:`pgr_depthFirstSearch` - Recorrido de búsqueda en profundidad del " -"grafo." +":doc:`pgr_depthFirstSearch` - Recorrido de búsqueda en profundidad del grafo." msgid "In general:" msgstr "En general:" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__) `3.0 `__" msgid "" "**Unsupported versions:** `2.5 `__ `2.4 `__ `2.6 `__" +"category.html>`__ `2.4 `__ `2.6 `__" msgstr "" "**Versiones no soportadas:** `2.5 `__ `2.4 `__ `2.6 `__" +"category.html>`__ `2.4 `__ `2.6 `__" msgid "K shortest paths - Category" msgstr "Rutas más cortas K - Categoría" @@ -403,13 +398,13 @@ msgid ":doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints" msgstr ":doc:`pgr_withPointsKSP` - Algoritmo de Yen basado en pgr_withPoints" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones Soportadas:** `Latest `__ (`3.4 `__)" +"**Versiones Soportadas:** `Latest `__ (`3.4 `__)" msgid "TRSP - Family of functions" msgstr "TRSP - Familia de funciones" @@ -427,16 +422,16 @@ 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." +":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgstr "" +":doc:`pgr_trspVia_withPoints` - Ruteo Vía Punto/Vértice con restricciones." msgid "" "Read the :doc:`migration` about how to migrate from the deprecated TRSP " "functionality to the new signatures or replacement functions." msgstr "" -"Leer :doc:`migration` sobre como migrar de la funcionalidad obsoleta de " -"TRSP a las nuevas firmas o funciones que las reemplazan." +"Leer :doc:`migration` sobre como migrar de la funcionalidad obsoleta de TRSP " +"a las nuevas firmas o funciones que las reemplazan." msgid "Experimental" msgstr "Experimental" @@ -500,34 +495,31 @@ msgstr ":doc:`pgr_turnRestrictedPath` - Ruteo con restricciones." msgid "Introduction" msgstr "Introducción" -#, fuzzy 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." +"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 **giro a la izquierda** o **giro a la derecha**, de ahí el " -"nombre de restricciones de giro, a veces hay restricciones." +"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." +"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." +"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 "Consulta `SQL aristas`_ como se describen." @@ -539,7 +531,7 @@ msgid "`Restrictions SQL`_ query as described." msgstr "`SQL restricciones`_ consulta como se describe." msgid "**via vertices**" -msgstr "**vía vértices**" +msgstr "**vértices**" msgid "``ARRAY[`` **ANY-INTEGER** ``]``" msgstr "``ARRAY[`` **ANY-INTEGER** ``]``" @@ -554,16 +546,15 @@ 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." +"En redes de caminos, hay restricciones como vuelta a la izquierda o derecha, " +"no vuelta en U." -#, fuzzy 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 **path** y ese " -"**path** se debería evitar." +"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**" @@ -572,9 +563,9 @@ 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." +"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, lo cual pueda ser necesaria para la " "administración de las restricciones, pero el algoritmo no necesita esa " @@ -587,16 +578,16 @@ msgid "``path``" msgstr "``path``" msgid "``ARRAY`` [**ANY-INTEGER**]" -msgstr "" +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." +"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." +"permite tomar. - Arreglos vacios o ``NULL`` son ignorados. - Arreglos que " +"tienen ``NULL`` arrojan una excepción." msgid "``Cost``" msgstr "``Cost``" @@ -605,48 +596,43 @@ msgid "Cost of taking the forbidden path." msgstr "Costo de tomar el camino prohibido." msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__" msgstr "" "**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" +"family.html>`__ `2.5 `__ " +"`2.4 `__ `2.3 `__" 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 se da como información de una celda de " -"matriz." +":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 lo que entra son coordenadas." +msgstr ":doc:`pgr_TSPeuclidean` - Cuando la información son coordenadas." msgid "Table of Contents" -msgstr "Contenido" +msgstr "Tabla de Contenido" msgid "General Information" msgstr "Información general" @@ -658,13 +644,13 @@ 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?*" +"*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?*" +"*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" @@ -675,15 +661,14 @@ msgid "" "Kirkman**." msgstr "" "El problema del vendedor viajante fue estudiado en el siglo 18 por " -"matemáticos **Sir William Rowam Hamilton** y **Thomas Penyngton " -"Kirkman**." +"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)**." +"A discussion about the work of Hamilton & Kirkman can be found in the book " +"**Graph Theory (Biggs et al. 1976)**." msgstr "" -"Una discusión sobre el trabajo de Hamilton & Kirkman se puede encontrar " -"en el libro **Graph Theory (Biggs et al. 1976)**." +"Una discusión sobre el trabajo de Hamilton & Kirkman se puede encontrar en " +"el libro **Graph Theory (Biggs et al. 1976)**." msgid "ISBN-13: 978-0198539162" msgstr "ISBN-13: 978-0198539162" @@ -692,19 +677,19 @@ 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) " -"`__" +"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) `__" 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) `_" +"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) `_" msgid "To calculate the number of different tours through :math:`n` cities:" msgstr "" @@ -721,11 +706,12 @@ 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 "Multiplicando estos juntos obtenemos :math:`(n-1)! = (n-1) (n-2) . . 1`." +msgstr "" +"Multiplicando estos juntos 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:" +"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:" @@ -746,8 +732,8 @@ 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* when:" +"Implementation generates solutions that *are twice as long as the optimal " +"tour in the worst case* when:" msgstr "" "La implementación genera soluciones que *son el doble de largas que el " "recorrido óptimo en el peor de los casos* cuando:" @@ -760,8 +746,8 @@ 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." +"Grafo donde los costos de viaje en los segmentos cumplen con la desigualdad " +"del triángulo." msgid "On an undirected graph:" msgstr "En un grafo no dirigido:" @@ -770,11 +756,10 @@ 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``" +"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``" +"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" @@ -790,8 +775,7 @@ 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." +"Cuando `0` cualquier vértice puede convertirse en el primer vértice visitado." msgid "``end_id``" msgstr "``end_id``" @@ -800,49 +784,47 @@ 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``." +"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" +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" +"Cuando ``NOT 0`` y ``start_vid = 0`` entonces es el primer y último vértice" msgid "References" msgstr "Referencias" msgid "" -"`Boost's metric appro's metric approximation " -"`__" +"`Boost's metric appro's metric approximation `__" msgstr "" -"`Algoritmo Métrico de la Librería Boost " -"`__" +"`Algoritmo Métrico de la Librería Boost `__" msgid "`University of Waterloo TSP `__" msgstr "`Universided de Waterloo TSP `__" msgid "" -"`Wikipedia: Traveling Salesman Problem " -"`__" +"`Wikipedia: Traveling Salesman Problem `__" msgstr "" -"`Wikipedia: Problema del viajante " -"`__" +"`Wikipedia: Problema del viajante `__" msgid "" -"**Supported versions:** `Latest `__ (`3.2 `__ `3.1 `__) `3.0 `__" +"**Supported versions:** `Latest `__ (`3.2 `__ `3.1 `__) `3.0 " +"`__" msgstr "" -"**Versiones soportadas:** `Último `__ (`3.2 `__ `3.1 `__) `3.0 `__" +"**Versiones soportadas:** `Último `__ (`3.2 `__ `3.1 `__) `3.0 " +"`__" msgid "Vehicle Routing Functions - Category (Experimental)" msgstr "Funciones de Ruteo de Vehículos - Categoría (Experimental)" @@ -852,12 +834,10 @@ 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" +":doc:`pgr_pickDeliver` - Recogida y Entrega utilizando una Matriz de Costos" msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean " -"distances" +":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr "" ":doc:`pgr_pickDeliverEuclidean` - Recoger y Entregar con distancias " "Euclideanas" @@ -866,7 +846,8 @@ 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" +msgstr "" +":doc:`pgr_vrpOneDepot` - Desde un único depósito, distribuye los pedidos" msgid "Contents" msgstr "Contenido" @@ -888,24 +869,24 @@ 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." +"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." +"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." +"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." +"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." +"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 " @@ -930,11 +911,11 @@ msgid "Pick & Delivery" msgstr "Recogida y Entrega" msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem" -" with Time Windows" +"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" +"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`" @@ -981,7 +962,8 @@ 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." +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." @@ -990,45 +972,31 @@ msgid "Pick & deliver" msgstr "Recogida y Entrega" msgid "Used in :doc:`pgr_pickDeliverEuclidean`" -msgstr "" +msgstr "Usado en :doc:`pgr_pickDeliverEuclidean`" -#, fuzzy msgid "`Orders SQL`_" -msgstr "" -"#-#-#-#-# pgr_pickDeliverEuclidean.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**orders_sql**\n" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**orders_sql**\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" -"`Orders SQL`_" +msgstr "`SQL de órdenes`_" msgid "`Orders SQL`_ as described below." -msgstr "" +msgstr "`SQL de órdenes`_ como se describe más adelante." -#, fuzzy msgid "`Vehicles SQL`_" -msgstr "" -"#-#-#-#-# pgr_pickDeliverEuclidean.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**vehicles_sql**\n" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**vehicles_sql**\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" -"`Vehicles SQL`_" +msgstr "`SQL de Vehículos`_" msgid "`Vehicles SQL`_ as described below." -msgstr "" +msgstr "`SQL de Vehículos`_ como se describe más adelante." msgid "Used in :doc:`pgr_pickDeliver`" -msgstr "" +msgstr "Usado en :doc:`pgr_pickDeliver`" msgid "`Matrix SQL`_" -msgstr "`SQL matriz`_" +msgstr "`SQL de matriz`_" msgid "`Matrix SQL`_ as described below." -msgstr "" +msgstr "`SQL de matriz`_ como se describe más adelante." msgid "Pick-Deliver optional parameters" -msgstr "" +msgstr "Parámetros opcionales de Recoger-Entregar" msgid "``factor``" msgstr "``factor``" @@ -1054,9 +1022,8 @@ 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." -#, fuzzy msgid "``initial_sol``" -msgstr "**initial_sol**" +msgstr "``initial_sol``" msgid "4" msgstr "4" @@ -1076,29 +1043,24 @@ 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" +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 "" +"``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" -#, fuzzy msgid "Orders SQL" -msgstr "" -"#-#-#-#-# pgr_pickDeliverEuclidean.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**orders_sql**\n" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**orders_sql**\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" -"Orders SQL" +msgstr "SQL de órdenes" -#, fuzzy msgid "Common columns for the orders SQL in both implementations:" msgstr "" -"En general, las columnas para las órdenes SQL es la misma tanto en la " -"implementación de recogida como de entrega:" +"En general, las columnas para las órdenes SQL es la misma en ambas " +"implementaciones:" msgid "|ANY-INTEGER|" msgstr "|ANY-INTEGER|" @@ -1106,9 +1068,8 @@ msgstr "|ANY-INTEGER|" msgid "Identifier of the pick-delivery order pair." msgstr "Identificador del par de órdenes recogida-entrega." -#, fuzzy msgid "``demand``" -msgstr "**demanda**" +msgstr "``demand``" msgid "|ANY-NUMERICAL|" msgstr "|ANY-NUMERICAL|" @@ -1116,141 +1077,113 @@ msgstr "|ANY-NUMERICAL|" msgid "Number of units in the order" msgstr "Número de unidades en la orden" -#, fuzzy msgid "``p_open``" -msgstr "`start_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." -#, fuzzy msgid "``p_close``" -msgstr "`start_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." -#, fuzzy msgid "[``p_service``]" -msgstr "`start_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 "" +msgstr "Cuando falta: Son usadas 0 unidades de tiempo" -#, fuzzy msgid "``d_open``" -msgstr "`start_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." -#, fuzzy msgid "``d_close``" -msgstr "`start_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." -#, fuzzy msgid "[``d_service``]" -msgstr "`start_service`" +msgstr "[``d_service``]" -#, fuzzy msgid "The duration of the unloading at the delivery location." -msgstr "La duración de la carga en el lugar de entrega." +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:" -#, fuzzy msgid "``p_node_id``" -msgstr "`start_node_id`" +msgstr "``p_node_id``" -#, fuzzy msgid "" "The node identifier of the pickup, must match a vertex identifier in the " "`Matrix SQL`_." msgstr "" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"El identificador de nodo de la recogida debe coincidir con un " -"identificador de nodo en la tabla de matriz.\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" -"El identificador de nodo de la recogida debe coincidir con un " -"identificador de nodo en la `Matrix SQL`_." +"El identificador de nodo de la recogida debe coincidir con un identificador " +"de vértice en la `SQL de matriz`_." -#, fuzzy msgid "``d_node_id``" -msgstr "`start_node_id`" +msgstr "``d_node_id``" -#, fuzzy msgid "" -"The node identifier of the delivery, must match a vertex identifier in " -"the `Matrix SQL`_." +"The node identifier of the delivery, must match a vertex identifier in the " +"`Matrix SQL`_." msgstr "" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"El identificador de nodo de la entrega debe coincidir con un " -"identificador de nodo en la tabla de matriz.\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" -"El identificador de nodo de la entrega debe coincidir con un " -"identificador de nodo en la `Matrix SQL`_." +"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:" -#, fuzzy msgid "``p_x``" -msgstr "``-1``" +msgstr "``p_x``" msgid ":math:`x` value of the pick up location" msgstr ":math:`x` valor de la ubicación de recogida" -#, fuzzy msgid "``p_y``" -msgstr "``-1``" +msgstr "``p_y``" msgid ":math:`y` value of the pick up location" msgstr ":math:`y` valor de la ubicación de recogida" -#, fuzzy msgid "``d_x``" -msgstr "``-1``" +msgstr "``d_x``" msgid ":math:`x` value of the delivery location" msgstr "valor :math:`x` de la ubicación de entrega" -#, fuzzy msgid "``d_y``" -msgstr "``-1``" +msgstr "``d_y``" msgid ":math:`y` value of the delivery location" msgstr "valor :math:`y` del lugar de entrega" -#, fuzzy msgid "Vehicles SQL" -msgstr "" -"#-#-#-#-# pgr_pickDeliverEuclidean.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**vehicles_sql**\n" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"**vehicles_sql**\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" -"Vehicles SQL" +msgstr "SQL de Vehículos" -#, fuzzy msgid "Common columns for the vehicles SQL in both implementations:" msgstr "" -"En general, las columnas para vehicles_sql son las mismas tanto en la " -"implementación de recogida como en la entrega:" +"Las columnas comunas para vehículos SQL son las mismas en ambas " +"implementaciones:" -#, fuzzy msgid "Identifier of the vehicle." -msgstr "Velocidad media del vehículo." +msgstr "Identificador del vehículo." msgid "``capacity``" msgstr "``capacity``" @@ -1258,144 +1191,120 @@ msgstr "``capacity``" msgid "Maiximum capacity units" msgstr "Máxima capacidad" -#, fuzzy msgid "``start_open``" -msgstr "`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." -#, fuzzy msgid "``start_close``" -msgstr "`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." -#, fuzzy msgid "[``start_service``]" -msgstr "`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." -#, fuzzy msgid "[``end_open``]" -msgstr "**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 "" +msgstr "Cuando falte: El valor de``start_open`` se usara" -#, fuzzy msgid "[``end_close``]" -msgstr "**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 "" +msgstr "Cuando falte: Se usara el valor de ``start_close``" -#, fuzzy msgid "[``end_service``]" -msgstr "**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 "" +msgstr "Cuando falte: Se usara una duración en ``start_service``." -#, fuzzy msgid "" "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " "locations are needed:" msgstr "" -"Para la implementación :doc:`pgr_pickDeliver` se necesitan los " -"identificadores inicial y final:" +"Para :doc:`pgr_pickDeliver` se necesitan los identificadores de salida y " +"destino:" -#, fuzzy msgid "``start_node_id``" -msgstr "`start_node_id`" +msgstr "``start_node_id``" -#, fuzzy msgid "" -"The node identifier of the start location, must match a vertex identifier" -" in the `Matrix SQL`_." +"The node identifier of the start location, must match a vertex identifier in " +"the `Matrix SQL`_." msgstr "" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"El identificador de nodo de la ubicación inicial debe coincidir con un " -"identificador de nodo en la tabla de la matriz.\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" "El identificador de nodo de la ubicación inicial debe coincidir con un " -"identificador de nodo en la `Matrix SQL`_." +"identificador de vértice en la `SQL de matriz`_." -#, fuzzy msgid "[``end_node_id``]" -msgstr "**end_node_id**" +msgstr "[``end_node_id``]" -#, fuzzy msgid "" -"The node identifier of the end location, must match a vertex identifier " -"in the `Matrix SQL`_." +"The node identifier of the end location, must match a vertex identifier in " +"the `Matrix SQL`_." msgstr "" -"#-#-#-#-# pgr_pickDeliver.po (pgRouting v3.1.0) #-#-#-#-#\n" -"El identificador de nodo de la ubicación final debe coincidir con un " -"identificador de nodo en la tabla de matriz.\n" -"#-#-#-#-# VRP-category.po (pgRouting v3.1.0) #-#-#-#-#\n" "El identificador de nodo de la ubicación final debe coincidir con un " -"identificador de nodo en la `Matrix SQL`_." +"identificador de vértice en la `SQL de matriz`_." msgid "When missing: ``end_node_id`` is used." -msgstr "" +msgstr "Cuando falte: Se usara``end_node_id``." -#, fuzzy msgid "``start_x``" -msgstr "`start_x`" +msgstr "``start_x``" -#, fuzzy msgid ":math:`x` value of the starting location" -msgstr ":math:`x` valor de la ubicación de recogida" +msgstr "Valor :math:`x` de la ubicación de salida" -#, fuzzy msgid "``start_y``" -msgstr "`start_y`" +msgstr "``start_y``" -#, fuzzy msgid ":math:`y` value of the starting location" -msgstr ":math:`y` valor de la ubicación de recogida" +msgstr "Valor :math:`y` de la ubicación de salida" msgid "[``end_x``]" -msgstr "" +msgstr "[``end_x``]" -#, fuzzy msgid ":math:`x` value of the ending location" -msgstr "valor :math:`x` de la ubicación de entrega" +msgstr "Valor :math:`x` de la ubicación del destino" msgid "When missing: ``start_x`` is used." -msgstr "" +msgstr "Cuando falte: Se usará ``start_x``." msgid "[``end_y``]" -msgstr "" +msgstr "[``end_y``]" -#, fuzzy msgid ":math:`y` value of the ending location" -msgstr "valor :math:`y` del lugar de entrega" +msgstr "Valor :math:`y` del la ubicaclón del destino" msgid "When missing: ``start_y`` is used." -msgstr "" +msgstr "Cuando falte: Se usará ``start_y``." msgid "Matrix SQL" msgstr "SQL de matriz" msgid "Set of |matrix-result|" -msgstr "" +msgstr "Conjunto de |matrix-result|" msgid "Identifier of the starting vertex." msgstr "Identificador del vértice de salida." @@ -1419,11 +1328,11 @@ msgid "``vehicle_seq``" msgstr "``vehicle_seq``" msgid "" -"Sequential value starting from **1** for current vehicles. The " -":math:`n_{th}` vehicle in the solution." +"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." +"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." @@ -1438,10 +1347,13 @@ msgid "Current vehicle identifier." msgstr "Identificador del vehículo actual." msgid "Sumary row has the **total capacity violations**." -msgstr "" +msgstr "Fila de resumen tiene las **infracciones de capacidad total**." -msgid "A capacity violation happens when overloading or underloading a vehicle." +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``" @@ -1457,12 +1369,13 @@ msgstr "" "vehículo actual. La parada :math:`m_{th}` del vehículo actual." msgid "Sumary row has the **total time windows violations**." -msgstr "" +msgstr "Fila de resumen tiene las **infracciones de ventana de tiempo total**." msgid "" -"A time window violation happens when arriving after the location has " -"closed." +"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``" @@ -1471,7 +1384,7 @@ 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 "" +msgstr ":math:`-1`: en la fila de resumen de solución" msgid ":math:`1`: Starting location" msgstr "``1``: Ubicación inicial" @@ -1483,7 +1396,7 @@ msgid ":math:`3`: Delivery location" msgstr ":math:`3`: Lugar de entrega" msgid ":math:`6`: Ending location and indicates the vehicle's summary row" -msgstr "" +msgstr ":math:`6`: Ubicación final indica la fila de resumen del vehículo" msgid "``order_id``" msgstr "``order_id``" @@ -1491,30 +1404,30 @@ 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." +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." +"Valor :math:`-1`: Cuando no hay pedidos involucrados en la ubicación de la " +"parada actual." msgid "``cargo``" -msgstr "" +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 "" +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." +"Tiempo de viaje desde el ``stop_seq`` anterior hasta el ``stop_seq`` actual." msgid "Summary has the **total traveling time**:" -msgstr "" +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``." @@ -1526,7 +1439,7 @@ 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 "" +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." @@ -1535,7 +1448,7 @@ msgid "``wait_time``" msgstr "``wait_time``" msgid "Summary row has the **total waiting time**:" -msgstr "" +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``." @@ -1547,7 +1460,7 @@ 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 "" +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``." @@ -1556,35 +1469,33 @@ msgid "``departure_time``" msgstr "``departure_time``" msgid "The time at which the vehicle departs from the stop." -msgstr "" +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." +"El destino final tiene el **tiempo total** utilizado por el vehículo actual." msgid "Summary row has the **total solution time**:" -msgstr "" +msgstr "La fila de resumen tiene el **tiempo total de solución**:" msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ " -"service\\ time`." +":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " +"time`." msgstr "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ " -"service\\ time`." +":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " +"time`." msgid "Summary Row" msgstr "Fila de Resumen" -#, fuzzy msgid "Continues the sequence" -msgstr "Continúa el valor Secuencial" +msgstr "Continúa la secuencia" msgid "**total capacity violations**:" -msgstr "" +msgstr "**infracciones de capacidad total**:" msgid "**total time windows violations**:" msgstr "**Cantidad total de violaciones de ventanas de tiempo**:" @@ -1606,12 +1517,12 @@ 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." +"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." +"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`_" @@ -1635,7 +1546,8 @@ 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)." +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`." @@ -1647,45 +1559,43 @@ 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`." +"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." +"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)." +"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 (dimensión igual) cajas de manzanas y 5 " -"kg de plumas que se van a transportar (no embaladas en cajas)." +"Para manejar problemas como: 10 (dimensión igual) cajas de manzanas y 5 kg " +"de plumas que se van a transportar (no embaladas en cajas)." -#, fuzzy msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg" -" of feathers` to `number of boxes` is needed." +"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`. Si la " -"`capacidad` del vehículo se mide por `kg`, se necesita una conversión de " -"`caja de manzanas` a `número equivalente de kg`." +"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`." +#, fuzzy msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box " -"of apples` to `kg` is needed." +"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`, una conversión de `box of " +"apples` a `kg` es necesaria." msgid "Showing how the 2 possible conversions can be done" msgstr "Mostrar cómo se pueden hacer las 2 conversiones posibles" -#, fuzzy msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. " -"- :math:`a\\_weight`: weight of `1` box of apples." +"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 que se utilizarían para `1` kg" -" de plumas. - :math:`a_weight`: peso de `1` caja de manzanas." +"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" @@ -1715,12 +1625,12 @@ msgid "Locations" msgstr "Ubiaciones" msgid "When using :doc:`pgr_pickDeliverEuclidean`:" -msgstr "" +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." +"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 "" @@ -1728,7 +1638,7 @@ msgstr "" "entrega." msgid "When using :doc:`pgr_pickDeliver`:" -msgstr "" +msgstr "Cuando se use :doc:`pgr_pickDeliver`:" msgid "The vehicles have identifiers for the start and ending locations." msgstr "" @@ -1747,18 +1657,19 @@ 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." +"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." +"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." +"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" @@ -1811,35 +1722,39 @@ msgstr "7.5" msgid ":math:`7.5*60 = 540`" msgstr ":math:`7.5*60 = 540`" -#, fuzzy msgid "Factor handling" -msgstr "Manejo de Factores" +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 "" +msgstr "Los valores ya están en la unidad de tiempo deseada" msgid "``factor`` should be **1**" -msgstr "" +msgstr "``factor`` debería ser **1**" msgid "When ``factor`` > 1 the travel times are faster" -msgstr "" +msgstr "Cuando ``factor`` > 1 el tiempo de viaje es más rápido" msgid "When ``factor`` < 1 the travel times are slower" -msgstr "" +msgstr "Cuando ``factor`` > 1 el tiempo de viaje es más lento" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" -msgstr "" +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." +"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" @@ -1866,97 +1781,97 @@ msgid "4452 s" msgstr "4452 s" msgid "For the :doc:`pgr_pickDeliver`:" -msgstr "" +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 "" +msgstr "v" msgid "Velocity" -msgstr "" +msgstr "Velocidad" msgid "d" -msgstr "" +msgstr "d" msgid "Distance" -msgstr "" +msgstr "Distancia" msgid "t" -msgstr "" +msgstr "t" msgid "Time" -msgstr "" +msgstr "Tiempo" msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36" -" km/hr`" +"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 lenght 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:" -#, fuzzy msgid "Units" -msgstr "unidades de tiempo" +msgstr "Unidades" msgid "velocity" -msgstr "" +msgstr "velocidad" -#, fuzzy msgid "Result" -msgstr "Resultados" +msgstr "Resultado" msgid "seconds" -msgstr "" +msgstr "segundos" -#, fuzzy msgid ":math:`10 m/s`" -msgstr ":math:`9*60 = 54`" +msgstr ":math:`10 m/s`" msgid ":math:`\\frac{1}{10m/s}`" -msgstr "" +msgstr ":math:`\\frac{1}{10m/s}`" msgid ":math:`0.1s/m`" -msgstr "" +msgstr ":math:`0.1s/m`" msgid ":math:`1000m * 0.1s/m = 100s`" -msgstr "" +msgstr ":math:`1000m * 0.1s/m = 100s`" -#, fuzzy msgid ":math:`600 m/min`" -msgstr ":math:`9*60 = 54`" +msgstr ":math:`600 m/min`" msgid ":math:`\\frac{1}{600m/min}`" -msgstr "" +msgstr ":math:`\\frac{1}{600m/min}`" msgid ":math:`0.0016min/m`" -msgstr "" +msgstr ":math:`0.0016min/m`" msgid ":math:`1000m * 0.0016min/m = 1.6min`" -msgstr "" +msgstr ":math:`1000m * 0.0016min/m = 1.6min`" -#, fuzzy msgid "Hours" -msgstr "horas" +msgstr "Horas" -#, fuzzy msgid ":math:`36 km/hr`" -msgstr ":math:`9*60 = 54`" +msgstr ":math:`36 km/hr`" msgid ":math:`\\frac{1}{36 km/hr}`" -msgstr "" +msgstr ":math:`\\frac{1}{36 km/hr}`" msgid ":math:`0.0277hr/km`" -msgstr "" +msgstr ":math:`0.0277hr/km`" msgid ":math:`1km * 0.0277hr/km = 0.0277hr`" -msgstr "" +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" @@ -1965,39 +1880,35 @@ msgid "The queries use the :doc:`sampledata` network." msgstr "Las consultas utilizan la red :doc:`sampledata` ." msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"***Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"***Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" "**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" +"family.html>`__ `2.5 `__ `2.4 `__" msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" 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 " +"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 " @@ -2005,15 +1916,16 @@ msgstr "" "cortos evaluando sólo un subconjunto de la gráfica." msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." -msgstr ":doc:`pgr_aStar` - A* Algoritmo para la ruta más corta." +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` - Obtenga el costo agregado de las rutas más cortas." +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` - Obtenga la matriz de costos de las rutas más" -" cortas." +":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:" @@ -2053,13 +1965,12 @@ 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:" +"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)`." +"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)`" @@ -2074,7 +1985,8 @@ 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)" +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))`" @@ -2107,8 +2019,8 @@ msgid "" "See :ref:`heuristics ` available and :ref:`factor " "` handling." msgstr "" -"Ver :ref:`heuristicas ` disponibles y manupulación de " -":ref:`factor `." +"Ver :ref:`heuristicas ` disponibles y manupulación de :ref:" +"`factor `." msgid "Advanced documentation" msgstr "Documentación avanzada" @@ -2126,21 +2038,21 @@ 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)" +"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " +"= 1 (no need to change units)" msgstr "" -"Trabajando con cost/reverse_cost como longitud en grados, x / y en " -"lat/lon: Factor = 1 (sin necesidad de cambiar unidades)" +"Trabajando con cost/reverse_cost como longitud en grados, x / y en lat/lon: " +"Factor = 1 (sin necesidad de cambiar 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:" +"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 cost/reverse_cost donde la longitud es en metros, x / y es" -" lat/lon: Factor dependere de la ubicación de los puntos:" +"Trabajando con cost/reverse_cost donde la longitud es en metros, x / y es " +"lat/lon: Factor dependere de la ubicación de los puntos:" msgid "1 longitude degree is 78846.81 m" msgstr "1 grado de longitud es 78846,81 m" @@ -2158,13 +2070,13 @@ 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." +"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." +"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`" @@ -2176,46 +2088,41 @@ msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Actual `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" +msgstr "" +"**Versiones soportadas:** `Actual `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ " +"`2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" 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" +"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." @@ -2230,18 +2137,18 @@ 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." +"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." +"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." +"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, " @@ -2254,8 +2161,8 @@ 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)`." +"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." @@ -2268,8 +2175,7 @@ msgstr "En caso de `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.**" +"**Recomendación: utilice un cuadro delimitador de no más de 3500 aristas.**" msgid "Optional parameters" msgstr "Parámetros opcionales" @@ -2308,7 +2214,7 @@ msgid "4G memory" msgstr "memoria 4G" msgid "trusty" -msgstr "trusty" +msgstr "confiable" msgid "posgreSQL version 9.3" msgstr "postgreSQL versión 9.3" @@ -2333,12 +2239,12 @@ msgstr "Uno" msgid "" "This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average " -"The tested query is:" +"extremely low. For each 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 se ejecutaron 30 " -"pruebas para obtener el medio. La consulta probada es:" +"Esta prueba no se hace con cuadro delimitador. La densidad del gráfico que " +"se pasa es extremadamente baja. Para cada 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:" @@ -2680,13 +2586,13 @@ 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 30 tests were executed to get the " -"average The tested edge query is:" +"This test is with a bounding box The density of the passed graph higher than " +"of the Test One. For each 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 se ejecutaron " -"30 pruebas para obtener el medio. La consulta de arista que se prueba es:" +"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 se ejecutaron 30 " +"pruebas para obtener el medio. La consulta de arista que se prueba es:" msgid "The tested queries" msgstr "Las consultas probadas" @@ -2989,79 +2895,77 @@ msgid ":doc:`pgr_floydWarshall`" msgstr ":doc:`pgr_floydWarshall`" msgid "" -"Boost `floyd-Warshall " -"`__" +"Boost `floyd-Warshall `__" msgstr "" -"Boost `Algoritmo floyd-Warshall " -"`_" +"Boost `Algoritmo floyd-Warshall `_" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgid "" -"**Unsupported versions:** `2.5 `__ `2.6 `__" +"**Unsupported versions:** `2.5 `__ `2.6 `__" msgstr "" -"**Versiones no soportadas:** `2.5 `__ `2.6 `__" +"**Versiones no soportadas:** `2.5 `__ `2.6 `__" 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." +"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*." +"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." +":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." +":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 coste de rutas." +":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." +"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." +"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 bewtween the starting vertex and " @@ -3080,54 +2984,54 @@ msgid "Previous versions of this page" msgstr "Versiones anteriores de esta página" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "Bidirectional Dijkstra - Family of functions" msgstr "Bidirectional Dijkstra - Familia de funciones" msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest" -" paths." +":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " +"paths." msgstr "" -":doc:`pgr_bdDijkstra` - Algoritmo Dijkstra bidireccional para las rutas " -"más cortas." +":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" +":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" +":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 Dijkstra bidireccional para " -"crear una matriz de costos de las rutas más cortas." +"crear una matriz de costes de las rutas más cortas." msgid "Synopsis" msgstr "Sinopsis" @@ -3136,23 +3040,27 @@ 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." +"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." +"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:" @@ -3161,29 +3069,27 @@ 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`" +"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`" +"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:" +"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`" +"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`" +"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." +"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." @@ -3195,25 +3101,21 @@ msgid "It is expected to terminate faster than pgr_dijkstra" msgstr "Se espera que termine más rápido que pgr_dijkstra" msgid "" -"**Supported versions:** `Latest `__ (`3.4 " -"`__)" -" `3.3 `__ `3.2 `__ `3.1 " -"`__ " -"`3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 " -"`__)" -" `3.3 `__ `3.2 `__ `3.1 " -"`__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " +"`__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " +"`__" msgid "Chinese Postman Problem - Family of functions (Experimental)" msgstr "Chinese Postman Problem - Familia de funciones (Experimental)" @@ -3237,46 +3139,44 @@ msgid "Graph must be connected." msgstr "El grafo debe estar conectado." msgid "" -"An Edges SQL that represents a **directed** graph with the following " -"columns" +"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" +"Un SQL de Aristas que representa un grafo **dirigido** con las siguientes " +"columnas" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "Coloring - Family of functions" msgstr "Coloración - Familia de funciones" msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using " -"greedy approach." +":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." +":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." +":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." +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." +":doc:`pgr_edgeColoring` - Algoritmo de coloración de segmentos utilizando el " +"teorema de Vizing." msgid "Returns SET OF ``(vertex_id, color_id)``" msgstr "Devuelve SET OF ``(vertex_id, color_id)``" @@ -3306,100 +3206,96 @@ msgid "Identifier of the color of the edge." msgstr "Identificador del color del segmento." msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation " -"`__" +"`Boost: Sequential Vertex Coloring algorithm documentation `__" msgstr "" "`Boost: Documentacion de Algoritmo de Coloración Secuencial de Vertices " "`__" msgid "" -"`Wikipedia: Graph coloring " -"`__" +"`Wikipedia: Graph coloring `__" msgstr "" -"`Wikipedia: Coloración de grafos " -"`__" +"`Wikipedia: Coloración de grafos `__" msgid "" -"`Boost: is_bipartite " -"`__" +"`Boost: is_bipartite `__" msgstr "" -"`Boost: es bipartido " -"`__" +"`Boost: es bipartido `__" msgid "" -"`Wikipedia: bipartite graph " -"`__" +"`Wikipedia: bipartite graph `__" msgstr "" -"`Wikipedia: grafo bipartito " -"`__" +"`Wikipedia: grafo bipartito `__" msgid "" -"`Boost: Edge Coloring Algorithm documentation " -"`__" +"`Boost: Edge Coloring Algorithm documentation `__" msgstr "" -"`Boost: Algoritmo de Coloración de Segmentos " -"`__" +"`Boost: Algoritmo de Coloración de Segmentos `__" msgid "" -"`Wikipedia: Graph Coloring " -"`__" +"`Wikipedia: Graph Coloring `__" msgstr "" -"`Wikipedia: Coloración de grafos " -"`__" +"`Wikipedia: Coloración de grafos `__" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "Components - Family of functions" msgstr "Componentes - Familia de funciones" msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected " -"graph." +":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." +":doc:`pgr_strongComponents` - Strongly connected components of a directed " +"graph." msgstr "" -":doc:`pgr_strongComponents` - Componentes fuertemente conectados de un " -"grafo dirigido." +":doc:`pgr_strongComponents` - Componentes fuertemente conectados de un grafo " +"dirigido." msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an " -"undirected graph." +":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " +"graph." msgstr "" -":doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo " -"no dirigido." +":doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo no " +"dirigido." msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected " -"graph." +":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr "" ":doc:`pgr_articulationPoints` - Puntos de articulación de un grafo no " "dirigido." @@ -3409,42 +3305,39 @@ 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 "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" +":doc:`pgr_makeConnected` - Detalles de aristas para hacer grafos conectados." + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgid "Contraction - Family of functions" msgstr "Contraction - Familia de funciones" @@ -3459,19 +3352,19 @@ msgid "" "and, for example, might add edges that represent a sequence of original " "edges decreasing the total time and space used in graph algorithms." msgstr "" -"En grafos grandes, como los grafos de carretera o de redes eléctricas, la" -" contracción de grafos se puede utilizar para acelerar algunos " -"algoritmos. La contracción reduce el tamaño del grafo eliminando algunos " -"de los vértices y aristas, por ejemplo, podría agregar aristas que " -"representen una secuencia de las aristas originales disminuyendo el " -"tiempo total y el espacio utilizados en los algoritmos de grafos." +"En grafos grandes, como los grafos de carretera o de redes eléctricas, la " +"contracción de grafos se puede utilizar para acelerar algunos algoritmos. La " +"contracción reduce el tamaño del grafo eliminando algunos de los vértices y " +"aristas, por ejemplo, podría agregar aristas que representen una secuencia " +"de las aristas originales disminuyendo el tiempo total y el espacio " +"utilizados en los algoritmos de grafos." msgid "" "This implementation gives a flexible framework for adding contraction " "algorithms in the future, currently, it supports two algorithms:" msgstr "" -"Esta implementación proporciona un marco flexible para agregar algoritmos" -" de contracción en el futuro, actualmente, admite dos algoritmos:" +"Esta implementación proporciona 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" @@ -3486,21 +3379,20 @@ msgid "Forbid contraction on a set of nodes." msgstr "Prohíba la contracción en un conjunto de nodos." msgid "" -"Decide the order of the contraction algorithms and set the maximum number" -" of times they are to be executed." +"Decide the order of the contraction algorithms and set the maximum number of " +"times they are to be executed." msgstr "" "Decida el orden de los algoritmos de contracción y establezca el número " "máximo de veces que se van a ejecutar." msgid "Contraction of the leaf nodes of the graph." -msgstr "" +msgstr "Contracción de los nodos de hoja del grafo." msgid "Dead end" msgstr "Sin salida" -#, fuzzy msgid "A node is considered a **dead end** node when" -msgstr "En el caso de un grafo dirigido, un nodo se considera 'sin salida' cuando" +msgstr "Un nodo se considera **sin salida** cuando" msgid "On undirected graphs:" msgstr "En grafos no dirigidos:" @@ -3518,112 +3410,110 @@ msgid "There are no incoming edges and has at least one outgoing edge." msgstr "No hay aristas entrantes y tiene al menos una arista saliente." msgid "" -"When the conditions are true then the `Operation: Dead End Contraction`_ " -"can be done." +"When the conditions are true then the `Operation: Dead End Contraction`_ can " +"be done." msgstr "" "Cuando las condiciones son verdaderas, se puede hacer la `Operación: " "Contracción de callejón sin salida`_." msgid "Dead end vertex on undirected graph" -msgstr "" +msgstr "Vértice sin salida en un grafo sin dirigir" msgid "The green nodes are `dead end`_ nodes" msgstr "Los nodos verdes son nodos `dead end`_" -#, fuzzy msgid "The blue nodes have an unlimited number of edges." -msgstr "" -"Los nodos azules tienen un número ilimitado de aristas entrantes y " -"salientes." +msgstr "Los nodos azules tienen un número ilimitado de aristas." msgid "Node" -msgstr "" +msgstr "Nodo" msgid "Adjecent nodes" -msgstr "" +msgstr "Nodos adyacentes" msgid "Number of adjacent nodes" msgstr "Número de vértices adyacentes" msgid ":math:`a`" -msgstr "" +msgstr ":math:`a`" msgid ":math:`\\{u\\}`" -msgstr "" +msgstr ":math:`\\{u\\}`" msgid ":math:`b`" -msgstr "" +msgstr ":math:`b`" msgid ":math:`\\{v\\}`" -msgstr "" +msgstr ":math:`\\{v\\}`" -#, fuzzy msgid "Dead end vertex on directed graph" -msgstr "Grafo no dirigido" +msgstr "Vértice sin salida en un grafo dirigido" -#, fuzzy -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +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 " +"Los nodos azules tienen un número ilimitado de aristas entrantes y/o " "salientes." msgid "Number of incoming edges" -msgstr "" +msgstr "Número de aristas entrantes" msgid "Number of outgoing edges" -msgstr "" +msgstr "Número de aristas salientes" msgid ":math:`c`" -msgstr "" +msgstr ":math:`c`" msgid ":math:`\\{v, w\\}`" -msgstr "" +msgstr ":math:`\\{v, w\\}`" msgid "2" -msgstr "" +msgstr "2" msgid ":math:`d`" -msgstr "" +msgstr ":math:`d`" msgid ":math:`\\{x\\}`" -msgstr "" +msgstr ":math:`\\{x\\}`" msgid ":math:`e`" -msgstr "" +msgstr ":math:`e`" msgid ":math:`\\{x, y\\}`" -msgstr "" +msgstr ":math:`\\{x, y\\}`" msgid "" -"From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number " -"of adjacent vertices is 1. No further checks are needed for those nodes." +"From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number of " +"adjacent vertices is 1. No further checks are needed for those nodes." msgstr "" +"De arriba, nodes :math:`\\{a, b, d\\}` son callejones sin salida por que el " +"número de vértices adyacentes es 1. No son necesarios los checks para esos " +"nodos." msgid "" -"On the following table, nodes :math:`\\{c, e\\}` because the even that " -"the number of adjacent vertices is not 1 for" +"On the following table, nodes :math:`\\{c, e\\}` because the even that the " +"number of adjacent vertices is not 1 for" msgstr "" +"En al siguiente tabla, nodos :math:`\\{c, e\\}` por que el par del numero de " +"vértices adyacentes no es 1 para" msgid "Operation: Dead End Contraction" msgstr "Operación: Contracción sin salida" -#, fuzzy msgid "" -"The dead end contraction will stop until there are no more dead end " -"nodes. For example from the following graph where :math:`w` is the `dead " -"end`_ node:" +"The dead end contraction will stop until there are no more dead end nodes. " +"For example from the following graph where :math:`w` 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 ``w`` es el nodo `dead " +"salida. Por ejemplo, del siguiente grafo donde :math:`w` es el nodo `dead " "end`_:" -#, fuzzy msgid "" -"After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and" -" is contracted:" +"After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and is " +"contracted:" msgstr "" -"Después de contraer ``w``, el nodo ``v`` es ahora un nodo `dead end`_ y " -"es contraído:" +"Después de contraer :math:`w`, el nodo ` :math:`v` es ahora un nodo `dead " +"end`_ y es contraído:" msgid "" "After contracting :math:`v`, stop. Node :math:`u` has the information of " @@ -3632,9 +3522,9 @@ msgstr "" "Después de contraer math:`v`, detenerse El nodo math:`u` tiene la " "información de los nodos que se contraen." -#, fuzzy msgid "Node :math:`u` has the information of nodes that were contracted." -msgstr "El nodo ``u`` tiene la información de los nodos que se contrajeron." +msgstr "" +"El nodo :math:`u` tiene la información de los nodos que se contrajeron." msgid "In the algorithm, linear contraction is represented by 2." msgstr "En el algoritmo, la contracción lineal es representada con un 2." @@ -3642,10 +3532,11 @@ msgstr "En el algoritmo, la contracción lineal es representada con un 2." msgid "Linear" msgstr "Lineal" -msgid "In case of an undirected graph, a node is considered a `linear` node when" +msgid "" +"In case of an undirected graph, a node is considered a `linear` node when" msgstr "" -"En el caso de un grafo no dirigido, un nodo se considera un nodo `lineal`" -" cuando" +"En el caso de un grafo no dirigido, un nodo se considera un nodo `lineal` " +"cuando" msgid "The number of adjacent vertices is 2." msgstr "El número de vértices adyacentes es 2." @@ -3656,111 +3547,101 @@ msgstr "En el caso de un grafo dirigido, un nodo se considera `lineal` cuando" msgid "Linearity is symmetrical" msgstr "La linealidad es simétrica" -#, fuzzy msgid "Linear vertex on undirected graph" -msgstr "Usando el grafo contraído" +msgstr "Vértice lineal en grafo no dirigido" msgid "The green nodes are `linear`_ nodes" msgstr "Los nodos verdes son `lineales`_" msgid "The blue nodes have an unlimited number of incoming and outgoing edges." msgstr "" -"Los nodos azules tienen un número ilimitado de aristas entrantes y " -"salientes." +"Los nodos azules tienen un número ilimitado de aristas entrantes y salientes." msgid "Undirected" msgstr "No dirigido" msgid ":math:`v`" -msgstr "" +msgstr ":math:`v`" msgid ":math:`\\{u, w\\}`" -msgstr "" +msgstr ":math:`\\{u, w\\}`" -#, fuzzy msgid "Linear vertex on directed graph" -msgstr "Usando el grafo contraído" +msgstr "Vértice lineal en grafo dirigido" msgid "The white node is not linear because the linearity is not symetrical." -msgstr "" +msgstr "El nodo blanco no es linero por que la linealidad no es simétrica." msgid "It is possible to go :math:`y \\rightarrow c \\rightarrow z`" -msgstr "" +msgstr "Es posible ir a :math:`y \\rightarrow c \\rightarrow z`" msgid "It's not possible to go :math:`z \\rightarrow c \\rightarrow y`" -msgstr "" +msgstr "No es posible ir a :math:`z \\rightarrow c \\rightarrow y`" msgid "Is symmetrical?" msgstr "Es simétrico?" msgid ":math:`\\{u, v\\}`" -msgstr "" +msgstr ":math:`\\{u, v\\}`" msgid "yes" -msgstr "" +msgstr "sí" msgid ":math:`\\{w, x\\}`" -msgstr "" +msgstr ":math:`\\{w, x\\}`" msgid ":math:`\\{y, z\\}`" -msgstr "" +msgstr ":math:`\\{y, z\\}`" msgid "no" -msgstr "" +msgstr "no" msgid "Operation: Linear Contraction" msgstr "Operación: Contracción Lineal" -#, fuzzy msgid "" -"The linear contraction will stop when there are no more linear nodes. For" -" example from the following graph where :math:`v` and :math:`w` are " -"`linear`_ nodes:" +"The linear contraction will stop when there are no more linear nodes. For " +"example from the following graph where :math:`v` and :math:`w` are `linear`_ " +"nodes:" msgstr "" -"La contracción lineal se detendrá hasta que no haya más nodos lineales. " -"Por ejemplo, en el siguiente grafo donde ``v`` y ``w`` son nodos " +"La contracción lineal se detendrá hasta que no hayan más nodos lineales. Por " +"ejemplo, en el siguiente grafo donde ` :math:`v` y :math:`w` son nodos " "`lineales`_ :" -#, fuzzy msgid "Contracting :math:`w`," -msgstr "Después de contraer ``w``," +msgstr "Contrayendo :math:`w`," -#, fuzzy msgid "The vertex :math:`w` is removed from the graph" -msgstr "El vértice ``w`` se elimina del grafo" +msgstr "El vértice :math:`w` se elimina del grafo" msgid "" -"The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are " -"removed from the graph." +"The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are removed " +"from the graph." msgstr "" "Los aristas :math:`v \\rightarrow w` y :math:`w \\rightarrow z` fueron " "eliminados del grafo." msgid "" -"A new edge :math:`v \\rightarrow z` is inserted represented with red " -"color." +"A new edge :math:`v \\rightarrow z` is inserted represented with red color." msgstr "" "Se inserta un nuevo arista :math:`v \\rightarrow z` y se representa con " "color rojo." -#, fuzzy msgid "Contracting :math:`v`:" -msgstr "Contracción ``v``:" +msgstr "Contrayendo :math:`v`:" -#, fuzzy msgid "The vertex :math:`v` is removed from the graph" -msgstr "El vértice ``v`` se elimina del grafo" +msgstr "El vértice :math:`v` se elimina del grafo" msgid "" -"The edges :math:`u \\rightarrow v` and :math:`v \\rightarrow z` are " -"removed from the graph." +"The edges :math:`u \\rightarrow v` and :math:`v \\rightarrow z` are removed " +"from the graph." msgstr "" "Los aristas :math:`u \\rightarrow v` y :math:`v \\rightarrow z` son " "removidos del grafo." msgid "" -"A new edge :math:`u \\rightarrow z` is inserted represented with red " -"color." +"A new edge :math:`u \\rightarrow z` is inserted represented with red color." msgstr "" "Se inserta un nuevo arista :math:`u \\rightarrow z` y se representa con " "color rojo." @@ -3776,15 +3657,15 @@ 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." +"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 gráfico contraído resultante; después de " -"aplicar una operación, el conjunto de vértices que se pueden contraer con" -" otra operación cambia." +"Contraer un grafo se puede hacer con más de una operación. El orden de las " +"operaciones afecta al gráfico 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 ``max_cycles`` times through " @@ -3793,16 +3674,15 @@ msgstr "" "Esta implementación alterna los tiempos `` max_cycles`` a través de `` " "operations_order``." -#, fuzzy msgid "Contracting sample data" -msgstr "Contracción de Datos de Muestra" +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." +"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" @@ -3826,7 +3706,6 @@ msgstr "" msgid "The original graph:" msgstr "El grafo original:" -#, fuzzy msgid "Contraction results" msgstr "Resultados de la Contracción" @@ -3834,12 +3713,12 @@ msgid "" "The results do not represent the contracted graph. They represent the " "changes done to the graph after applying the contraction algorithm." msgstr "" -"Los resultados no representan al grafo contraído. Representan los cambios" -" realizados en el grafo después de aplicar el algoritmo de contracción." +"Los resultados no representan al grafo contraído. Representan los cambios " +"realizados en el grafo después de aplicar el algoritmo 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." +"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." @@ -3857,8 +3736,8 @@ msgid "Add additional columns" msgstr "Añadir columnas adicionales" msgid "" -"Adding extra columns to the ``edge_table`` and " -"``edge_table_vertices_pgr`` tables, where:" +"Adding extra columns to the ``edge_table`` and ``edge_table_vertices_pgr`` " +"tables, where:" msgstr "" "Agregar de columnas adicionales a las tablas ``edge_table`` y " "``edge_table_vertices_pgr`` donde:" @@ -3869,17 +3748,14 @@ msgstr "``contracted_vertices``" msgid "The vertices set belonging to the vertex/edge" msgstr "El conjunto de vértices que pertenecen al vértice/arista" -#, fuzzy msgid "``is_contracted``" -msgstr "**is_contracted**" +msgstr "``is_contracted``" -#, fuzzy msgid "On the vertex table" -msgstr "En la tabla `vértice`" +msgstr "En la tabla de vértices" msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted " -"graph." +"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." @@ -3888,22 +3764,20 @@ 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." +"En caso de ''false'' el vértice no se contrae, su parte del grafo contraído." -#, fuzzy msgid "``is_new``" -msgstr "**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." +"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." +"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 " @@ -3918,20 +3792,20 @@ 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" -#, fuzzy msgid "The vertex table update" -msgstr "En la tabla `vértice`" +msgstr "Actualización de la tabla de vértices" -#, fuzzy -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "" +"Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -"Use ``edge_table_vertices_pgr.is_contracted`` para indicar los vértices " -"que son contraídos." +"Usar la columna ``is_contracted`` para indicar los vértices contraídos." msgid "" "Fill ``contracted_vertices`` with the information from the results tha " "belong to the vertices." msgstr "" +"Lllena ``contracted_vertices`` con la información de los resultados que " +"pertenecen a los vértices." msgid "The modified vertices table:" msgstr "La tabla de vértices modificada:" @@ -3954,7 +3828,6 @@ 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." -#, fuzzy msgid "Contracted graph" msgstr "El grafo contraído" @@ -3968,8 +3841,8 @@ 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:" +"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." @@ -3980,20 +3853,20 @@ 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 "Using the `Edges that belong to the contracted graph.`_ on lines 10 to 19." +msgid "" +"Using the `Edges that belong to the contracted graph.`_ on lines 10 to 19." msgstr "" -"Usando las `Aristas que pertenecen al grafo contraído.`_ en las líneas 10" -" a 19." +"Usando las `Aristas que pertenecen al grafo contraído.`_ en las líneas 10 a " +"19." msgid "Case 1" msgstr "Caso 1" msgid "" -"When both source and target belong to the contracted graph, a path is " -"found." +"When both source and target belong to the contracted graph, a path is found." msgstr "" -"Cuando el origen y el destino pertenecen al grafo contraído, se encuentra" -" ruta." +"Cuando el origen y el destino pertenecen al grafo contraído, se encuentra " +"ruta." msgid "Case 2" msgstr "Caso 2" @@ -4002,15 +3875,15 @@ msgid "" "When source and/or target belong to an edge subgraph then a path is not " "found." msgstr "" -"Cuando el origen y/o el destino pertenecen a un subgrafo de aristas, no " -"se encuentra una ruta." +"Cuando el origen y/o el destino pertenecen a un subgrafo de aristas, no se " +"encuentra una ruta." msgid "" -"In this case, the contracted graph do not have an edge connecting with " -"node :math:`4`." +"In this case, the contracted graph do not have an edge connecting with node :" +"math:`4`." msgstr "" -"En este caso, el grafo contraído no tiene una arista que se conecte con " -"el nodo :math:`4`." +"En este caso, el grafo contraído no tiene una arista que se conecte con el " +"nodo :math:`4`." msgid "Case 3" msgstr "Caso 3" @@ -4021,55 +3894,55 @@ msgstr "" "ruta." msgid "" -"In this case, the contracted graph do not have an edge connecting with " -"node :math:`7` and of node :math:`4` of the second case." +"In this case, the contracted graph do not have an edge connecting with node :" +"math:`7` and of node :math:`4` of the second case." msgstr "" -"En este caso, el grafo contraído no tiene algún arista que conecte con el" -" nodo :math:`7` ni con el nodo :math:`4` del segundo caso." +"En este caso, el grafo contraído no tiene algún arista que conecte con el " +"nodo :math:`7` ni con el nodo :math:`4` del segundo caso." msgid "Refining the above function to include nodes that belong to an edge." msgstr "" -"Refinar la función anterior para incluir nodos que pertenezcan a una " -"arista." +"Refinar la función anterior para incluir nodos que pertenezcan a una arista." msgid "The vertices that need to be expanded are calculated on lines 10 to 16." msgstr "Los vértices que deben ampliarse se calculan en las líneas 10 a 16." -msgid "Adding to the contracted graph that additional section on lines 25 to 27." -msgstr "Añadiendo al grafo contraído esa sección adicional en las líneas 25 a 27." +msgid "" +"Adding to the contracted graph that additional section on lines 25 to 27." +msgstr "" +"Añadiendo al grafo contraído esa sección adicional en las líneas 25 a 27." msgid "" -"When source and/or target belong to an edge subgraph, now, a path is " -"found." +"When source and/or target belong to an edge subgraph, now, a path is found." msgstr "" -"Cuando el origen y/o el destino pertenecen a un subgrafo de arista, " -"entonces se encuentra una ruta." +"Cuando el origen y/o el destino pertenecen a un subgrafo de arista, entonces " +"se encuentra una ruta." msgid "The routing graph now has an edge connecting with node :math:`4`." msgstr "" -"El grafo de ruteo ahora tiene un arista que se conecta con el nodo " -":math:`4`." +"El grafo de ruteo ahora tiene un arista que se conecta con el nodo :math:`4`." msgid "" -"In this case, the contracted graph do not have an edge connecting with " -"node :math:`7`." +"In this case, the contracted graph do not have an edge connecting with node :" +"math:`7`." msgstr "" -"En este caso, el grafo contraído no tiene una arista que se conecte con " -"el nodo :math:`7`." +"En este caso, el grafo contraído no tiene una arista que se conecte con el " +"nodo :math:`7`." msgid "The vertices that need to be expanded are calculated on lines 18 to 23." msgstr "Los vértices que deben ampliarse se calculan en las líneas 18 a 23." -msgid "Adding to the contracted graph that additional section on lines 38 to 40." -msgstr "Añadiendo al grafo contraído esa sección adicional en las líneas 38 a 40." +msgid "" +"Adding to the contracted graph that additional section on lines 38 to 40." +msgstr "" +"Añadiendo al grafo contraído esa sección adicional en las líneas 38 a 40." msgid "" -"The code change do not affect this case so when source and/or target " -"belong to an edge subgraph, a path is still found." +"The code change do not affect this case so when source and/or target belong " +"to an edge subgraph, a path is still found." msgstr "" -"El cambio de código no afecta a este caso, por lo que cuando el origen o " -"el destino pertenecen a un subgrafo de aristas, aún se puede encontrar " -"ruta." +"El cambio de código no afecta a este caso, por lo que cuando el origen o el " +"destino pertenecen a un subgrafo de aristas, aún se puede encontrar ruta." msgid "When source and/or target belong to a vertex, now, a path is found." msgstr "" @@ -4078,45 +3951,45 @@ msgstr "" msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "" -"Ahora, el grafo de ruteo tiene un arista que se conecta con el nodo " -":math:`7`." +"Ahora, el grafo de ruteo tiene un arista que se conecta con el nodo :math:" +"`7`." msgid ":doc:`sampledata`" msgstr ":doc:`sampledata`" -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://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://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" msgstr "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ " +"`3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ " +"`3.2 `__ `3.1 `__ `3.0 `__" msgid "" "**Unsupported versions:** `2.5 `__ `2.4 `__ `2.6 `__" +"category.html>`__ `2.4 `__ `2.6 `__" msgstr "" -"**Versiones no soportadas:** `2.5 `__ `2.4 `__ `2.6 `__" +"**Versiones no soportadas:** `2.5 `__ `2.4 `__ `2.6 `__" msgid "Cost - Category" msgstr "Costo - Categoría" @@ -4143,8 +4016,8 @@ 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." +"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." @@ -4153,22 +4026,21 @@ 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)`." +"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." +"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)`." +"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr "El **costo agregado** de `(u, v)` es el mismo que para `(v, u)`." -msgid "Any duplicated value in the start or end vertex identifiers are ignored." +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." @@ -4183,32 +4055,32 @@ msgid "``end_vid`` ascending" msgstr "``end_vid`` ascendente" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" msgid "Cost Matrix - Category" msgstr "Cost Matrix - Categoría" @@ -4232,26 +4104,26 @@ 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`." +":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`." +":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." +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." +"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." +"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`." +"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." @@ -4265,46 +4137,47 @@ 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." +"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." +"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`." +"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." +"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." +"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 "" +"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." +"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`." +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`." +"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:" @@ -4316,7 +4189,7 @@ 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 **ids de veértices**." +msgstr "Se omite cualquier valor duplicado en las **salidas**." msgid "Used in:" msgstr "Usado en:" @@ -4325,7 +4198,7 @@ msgid "`Edges SQL`_ as described below" msgstr "`SQL Aristas`_ como se describe a continuación" msgid "**start vids**" -msgstr "**vid salidas**" +msgstr "**salidas**" msgid "``ARRAY[BIGINT]``" msgstr "``ARRAY[BIGINT]``" @@ -4334,13 +4207,13 @@ msgid "Array of identifiers of starting vertices." msgstr "Arreglo de identificadores de vértices iniciales." msgid "`Points SQL`_" -msgstr "`SQL puntos`_" +msgstr "`SQL de puntos`_" msgid "`Points SQL`_ as described below" -msgstr "`SQL puntos`_ como se describe abajo" +msgstr "`SQL de puntos`_ como se describe abajo" msgid "Points SQL" -msgstr "SQL puntos" +msgstr "SQL de puntos" msgid "``pid``" msgstr "``pid``" @@ -4351,10 +4224,11 @@ msgstr "**valor**" msgid "Identifier of the point." msgstr "Identificador del punto." -msgid "Use with positive value, as internally will be converted to negative value" +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" +"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." @@ -4363,8 +4237,8 @@ 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." +"Si columna no esta presente, un **valor** secuencial negativo se otorgará " +"automáticamente." msgid "Identifier of the \"closest\" edge to the point." msgstr "Identificador de la arista \"más cercana\" al punto." @@ -4376,8 +4250,8 @@ msgid "" "Value in <0,1> that indicates the relative postition from the first end " "point of the edge." msgstr "" -"El valor en <0,1> que indica la posición relativa desde el primer punto " -"de la arista." +"El valor en <0,1> que indica la posición relativa desde el primer punto de " +"la arista." msgid "``side``" msgstr "``side``" @@ -4404,38 +4278,33 @@ msgid ":doc:`TSP-family`" msgstr ":doc:`TSP-family`" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ " +"`2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgid "Dijkstra - Family of functions" msgstr "Dijkstra - Familia de funciones" @@ -4445,27 +4314,27 @@ 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` - Obtenga el costo agrgado de las rutas más " -"cortas." +":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." +msgid "" +":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." msgstr "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra para crear una matriz de" -" costos." +":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` - Use pgr_dijkstra para calcular información " -"de captación." +":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." +":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " +"paths." msgstr "" -":doc:`pgr_KSP` - Use el algoritmo Yen con pgr_dijkstra para obtener las " -"rutas más cortas K." +":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 seuence of vertices." msgstr "" @@ -4476,50 +4345,49 @@ 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." +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." +"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." +"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." +"Las funciones de la familia de Dijkstra se basan en el algoritmo de Dijkstra." msgid "`Combinations SQL`_" -msgstr "`SQL Combinaciones`_" +msgstr "`SQL de combinaciones`_" msgid "`Combinations SQL`_ as described below" -msgstr "`SQL Combinaciones`_ como se describe a abajo" +msgstr "`SQL de combinaciones`_ como se describe a abajo" msgid "**start vid**" -msgstr "**vid de salida**" +msgstr "**salida**" msgid "Identifier of the starting vertex of the path." msgstr "Identificador del vértice inicial de la ruta." msgid "**end vid**" -msgstr "**vid destino**" +msgstr "**destino**" msgid "Identifier of the ending vertex of the path." msgstr "Identificador del vértice final de la ruta." msgid "**end vids**" -msgstr "**vids destinos**" +msgstr "**destinos**" msgid "Array of identifiers of ending vertices." msgstr "Arreglo de identificadores de vértices finales." @@ -4543,11 +4411,11 @@ 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)\\}`" +"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)\\}`" +"Donde :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" +"`" msgid "and" msgstr "y" @@ -4579,19 +4447,19 @@ 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 " +"\\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}`" +"\\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}`" +"\\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" @@ -4609,23 +4477,22 @@ msgid "" "\\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}`" +"\\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}`" +"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" @@ -4640,23 +4507,21 @@ 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}`" +":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}`" +":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)\\}`" +":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)\\}`" +":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg" +"\\_cost_i)\\}`" msgid "where:" msgstr "Donde:" @@ -4677,48 +4542,46 @@ 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`" +":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`" +":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}`" +":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}`" +"\\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}`" +":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," +"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," +"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`." +":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`." +":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 "" @@ -4726,66 +4589,62 @@ msgstr "" "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." +":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 "" -"**Supported versions:** `Latest `__ (`3.4 " -"`__) " -"`3.3 `__" -" `3.2 `__ `3.1 `__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 " -"`__) " -"`3.3 `__" -" `3.2 `__ `3.1 `__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 " -"`__ `2.4" -" `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 " -"`__ `2.4" -" `__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" msgid "Driving Distance - Category" msgstr "Distancia Manejando - Categoría" msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's " -"algorithm" +":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" -":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo " -"de Dijkstra" +":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 Manejando basada en el algoritmo de Prim" +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" +":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal" msgid "Post pocessing" msgstr "Post procesamiento" msgid ":doc:`pgr_alphaShape` - Alpha shape computation" -msgstr ":doc:`pgr_alphaShape` - Cálculo de la forma Alpha" +msgstr ":doc:`pgr_alphaShape` - Cálcular la forma Alpha" msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" msgstr ":doc:`pgr_withPointsDD` - Distancia Manejando basada en pgr_withPoints" @@ -4801,7 +4660,8 @@ msgstr "" "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." +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:" @@ -4813,12 +4673,12 @@ 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." +"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." +"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." @@ -4839,44 +4699,36 @@ 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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 `__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 `__ `2.4 " -"`__ `2.3 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ `2.2 " -"`__" +"proposed-functions>`__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ `2.2 `__" msgid "Experimental Functions" msgstr "Funciones Experimentales" @@ -4888,7 +4740,8 @@ 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." +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." @@ -4903,35 +4756,32 @@ msgid ":doc:`transformation-family`" msgstr ":doc:`transformation-family`" msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line " -"Graph." +":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." +":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de " +"líneas." msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line" -" Graph out of each vertex in the input graph." +":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." +":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." +":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" -":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del " -"grafo." +":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del grafo." msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of " -"the graph." +":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " +"graph." msgstr "" -":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura " -"del grafo." +":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura del " +"grafo." msgid ":doc:`components-family`" msgstr ":doc:`components-family`" @@ -4939,13 +4789,12 @@ msgstr ":doc:`components-family`" msgid ":doc:`ordering-family`" msgstr ":doc:`ordering-family`" -#, fuzzy msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering " -"of an undirected graph." +":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " +"an undirected graph." msgstr "" -"``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos " -"acíclicos" +":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no " +"dirigido." msgid ":doc:`TRSP-family`" msgstr ":doc:`TRSP-family`" @@ -4983,87 +4832,82 @@ msgstr ":doc:`pgr_transitiveClosure`" msgid ":doc:`pgr_lengauerTarjanDominatorTree`" msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" -#, fuzzy msgid ":doc:`pgr_hawickCircuits`" -msgstr "``pgr_kruskal``" +msgstr ":doc:`pgr_hawickCircuits`" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" "**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" +"family.html>`__ `2.5 `__ " +"`2.4 `__ `2.3 `__" msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ " +"`2.4 `__ `2.3 `__" msgid "Flow - Family of functions" msgstr "Flow - Familia de funciones" msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel" -" algorithm." +":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 los " -"algoritmos Push y Relabel." +":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." +":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " +"edges." msgstr "" -":doc:`pgr_boykovKolmogorov` - Algoritmos Boykov y Kolmogorov con detalles" -" del flujo en aristas." +":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." +":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " +"edges." msgstr "" -":doc:`pgr_edmondsKarp` - Algoritmos de Edmonds y Karp con detalles de " -"flujo con detalles del flujo en aristas." +":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." +":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " +"edges." msgstr "" -":doc:`pgr_pushRelabel` - Algoritmos Push y Relabel con detalles del flujo" -" en aristas." +":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." +":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " +"groups of vertices." msgstr "" -":doc:`pgr_edgeDisjointPaths` - Calcula rutas de separación de aristas " -"entre dos grupos de vértices." +":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." +":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " +"in a graph." msgstr "" -":doc:`pgr_maxCardinalityMatch` - Calcula una cardinalidad máxima " -"coincidiendo dentro de un grafo." +":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" @@ -5082,12 +4926,13 @@ msgstr "" "SET**." msgid "There is no flow when a **source** is the same as a **target**." -msgstr "No hay ningún flujo cuando el **orígen** es el mismo que el **destino**." +msgstr "" +"No hay ningún flujo cuando el **orígen** es el mismo que el **destino**." msgid "Any duplicated value in the source(s) or target(s) are ignored." msgstr "" -"Cualquier valor duplicado en el/los orígen(es) o en el/los destino(s) " -"será ignorado." +"Cualquier valor duplicado en el/los orígen(es) o en el/los destino(s) será " +"ignorado." 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" @@ -5103,9 +4948,9 @@ msgstr "" "**súper destino** con aristas para todos los destino(s)." msgid "" -"The maximum flow through the graph is guaranteed to be the value returned" -" by :doc:`pgr_maxFlow ` when executed with the same " -"parameters and can be calculated:" +"The maximum flow through the graph is guaranteed to be the value returned " +"by :doc:`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 ` cuando es ejecutado con los mismos " @@ -5118,11 +4963,14 @@ 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." +":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" @@ -5140,7 +4988,7 @@ msgid "``reverse_capacity``" msgstr "``reverse_capacity``" msgid "Capacity-Cost edges" -msgstr "" +msgstr "Aristas Capacidad-Costo" msgid ":doc:`pgr_maxFlowMinCost`" msgstr ":doc:`pgr_maxFlowMinCost`" @@ -5161,13 +5009,13 @@ msgid "Weight of the edge (``target``, ``source``) if it exist" msgstr "Peso de la arista (``target``, ``source``) si existe" msgid "Cost edges" -msgstr "" +msgstr "Aristas de costo" msgid ":doc:`pgr_edgeDisjointPaths`" -msgstr "" +msgstr ":doc:`pgr_edgeDisjointPaths`" msgid "Used in" -msgstr "" +msgstr "Usado en" msgid "**seq**" msgstr "``seq``" @@ -5191,17 +5039,16 @@ 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``)." +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``)." +"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``)." +"Capacidad residual del arista en la dirección (``start_vid``, ``end_vid``)." msgid "For :doc:`pgr_maxFlowMinCost`" msgstr "Para :doc:`pgr_maxFlowMinCost`" @@ -5225,8 +5072,8 @@ 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)." +"El costo de enviar este flujo a través de la arista en la dirección (origen, " +"destino)." msgid "**agg_cost**" msgstr "``agg_cost``" @@ -5240,19 +5087,19 @@ 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." +"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." +"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." +"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." @@ -5261,19 +5108,19 @@ 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." +"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)\\}`" +"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)\\}`" +"donde: :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse" +"\\_capacity_i)\\}`" msgid "Graph definition" msgstr "Definición de grafo" @@ -5282,28 +5129,28 @@ 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 "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i " -"\\bigcup target_i`" +":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}`" +"\\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}`" +"\\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" @@ -5330,13 +5177,13 @@ msgstr "" 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:" +"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:" +":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`" @@ -5351,72 +5198,62 @@ msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 " +"`__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 " +"`__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " "`__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " "`__" msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL " -"`__ geospatial database to provide geospatial" -" routing and other network analysis functionality." +"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " +"other network analysis functionality." msgstr "" -"pgRouting extiende la base de datos geospacial de `PostGIS " -"`__/`PostgreSQL `__ para" -" proporcionar enrutamiento geoespacial y otras funciones de análisis de " -"red." +"pgRouting extiende la base de datos geospacial de `PostGIS `__/`PostgreSQL `__ 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 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 `_. 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." +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_. 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 `_. 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` ." +"Share Alike 3.0 License `_. " +"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" @@ -5473,44 +5310,40 @@ msgid ":doc:`topology-functions`" msgstr ":doc:`topology-functions`" msgid "" -"The following functions modify the database directly therefore the user " -"must have special permissions given by the administrators to use them." +"The following functions modify the database directly therefore the user must " +"have special permissions given by the administrators to use them." msgstr "" -"Las siguientes funciones modifican la base de datos directamente, por lo " -"que el usuario debe tener permisos especiales otorgados por un " -"administrador para usarlos." +"Las siguientes funciones modifican la base de datos directamente, por lo que " +"el usuario debe tener permisos especiales otorgados por un administrador " +"para usarlos." msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." msgstr "" -":doc:`pgr_createTopology` - para crear una topología basada en la " -"geometría." +":doc:`pgr_createTopology` - para crear una topología basada en la geometría." msgid "" -":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on " -"the source and target information." +":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " +"source and target information." msgstr "" -":doc:`pgr_createVerticesTable` - reconstruir la tabla de vértices en base" -" a la información de origen y destino." +":doc:`pgr_createVerticesTable` - reconstruir la tabla de vértices en base a " +"la información de origen y destino." msgid "" ":doc:`pgr_analyzeGraph` - to analyze the edges and vertices of the edge " "table." msgstr "" -":doc:`pgr_analyzeGraph` - para analizar los bordes y vértices de la tabla" -" de bordes." +":doc:`pgr_analyzeGraph` - para analizar los bordes y vértices de la tabla de " +"aristas." msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." -msgstr ":doc:`pgr_analyzeOneWay` - para analizar la direccionalidad de los bordes." +msgstr "" +":doc:`pgr_analyzeOneWay` - para analizar la direccionalidad de las aristas." msgid ":doc:`pgr_nodeNetwork` -to create nodes to a not noded edge table." -msgstr "" -":doc:`pgr_nodeNetwork` - para crear nodos en una tabla delimitada sin " -"nodos." +msgstr ":doc:`pgr_nodeNetwork` - para crear nodos en una tabla de aristas." msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" -msgstr "" -":doc:`pgr_trsp` - Restricción de Giro Ruta Más Corta (Turn Restriction " -"Shortest Path: TRSP)" +msgstr ":doc:`pgr_trsp` - Camino más corto con restricción de giros (TRSP)" msgid "Functions by categories" msgstr "Funciones por categorías" @@ -5537,7 +5370,7 @@ msgid ":doc:`DFS-category`" msgstr ":doc:`DFS-category`" msgid "Available Functions but not official pgRouting functions" -msgstr "Funciones disponibles pero no funciones oficiales pgRouting" +msgstr "Funciones disponibles pero no oficiales de pgRouting" msgid ":doc:`proposed`" msgstr ":doc:`proposed`" @@ -5549,21 +5382,19 @@ msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgid "Kruskal - Family of functions" msgstr "Kruskal - Familia de funciones" @@ -5572,13 +5403,13 @@ msgid "Boost Graph Inside" msgstr "Adentro: Boost Graph" 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." +"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." +"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:**" @@ -5590,87 +5421,94 @@ msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "Tiempo de ejecución de Kruskal: :math:`O(E * log E)`" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" +"**Versiones Soportadas** `Última de `__ (`3.4 `__)" msgid "Migration guide" -msgstr "" +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 "" +msgstr "Resultados pueden ser diferentes dado los cambios." msgid "Migrating functions:" -msgstr "" +msgstr "Migrando funciones:" msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, " -"therefore the ``directed`` flag has been removed." +":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 flag ``directed`` ha sido removida." msgid "" -":doc:`pgr_trsp` signatures have changed and many issues have been fixed " -"in the new signatures. This section will show how to migrate from the old" -" signatures to the new replacement functions. This also affects the " +":doc:`pgr_trsp` signatures have changed and many issues have been fixed in " +"the new signatures. This section will show how to migrate from the old " +"signatures to the new replacement functions. This also affects the " "restrictions." msgstr "" +":doc:`pgr_trsp` firmas han cambiando y varios problemas han sido arreglados " +"en las nuevas firmas. Esta sección enseñara como migrar las viejas firmas a " +"la nueva función de reemplazo. Esto también afecta las restricciones ." msgid "All deprecated functions will be removed on next mayor version 4.0.0" msgstr "" +"Todas las funciones obsoletas serán removidas en las siguiente versión mayor " +"4.0.0" msgid "Migration of ``pgr_maxCardinalityMatch``" -msgstr "" +msgstr "Migración de ``pgr_maxCardinalityMatch``" msgid "Signature to be migrated:" -msgstr "" +msgstr "Firmas que serán migradas:" msgid "Migration is needed, because:" -msgstr "" +msgstr "Migración es necesaria, porque:" msgid "Use ``cost`` and ``reverse_cost`` on the inner query" -msgstr "" +msgstr "Usa ``cost`` y ``reverse_cost`` en la consulta interna" msgid "Results are ordered" -msgstr "" +msgstr "Los resultados son ordenados" -#, fuzzy msgid "Works for undirected graphs." -msgstr "" -"#-#-#-#-# migration.po (pgRouting v3.4.0-dev) #-#-#-#-#\n" -"#-#-#-#-# pgr_maxCardinalityMatch.po (pgRouting v3.1.0) #-#-#-#-#\n" -"Para un grafo **dirigido**" +msgstr "Funciona para grafos no dirigidos." -#, fuzzy msgid "New signature" -msgstr "" -"#-#-#-#-# migration.po (pgRouting v3.4.0-dev) #-#-#-#-#\n" -"#-#-#-#-# pgr_maxCardinalityMatch.po (pgRouting v3.1.0) #-#-#-#-#\n" -"Firmas" +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 "" +msgstr "La flag opcional ``directed`` es removida." msgid "Before migration" -msgstr "" +msgstr "Antes de migración" msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of " -"an edge." +"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 "" @@ -5684,8 +5522,8 @@ msgid "Migration" msgstr "" msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence " -"of an edge." +"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " +"an edge." msgstr "" msgid "Do not use the flag ``directed``." @@ -5802,14 +5640,15 @@ msgid "Restrictions data" msgstr "Datos de restricciones" msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 " -"\\rightarrow5 \\rightarrow9`." +"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " +"\\rightarrow9`." msgstr "" msgid "By inspection the path is clear." msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "" +"To transform the old restrictions table to the new restrictions structure," msgstr "" msgid "Create a new table with the new restrictions structure." @@ -5819,8 +5658,8 @@ msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal " -"of an array ``_pgr_array_reverse`` needed for the migration." +"For this migration pgRouting supplies an auxiliary function for reversal of " +"an array ``_pgr_array_reverse`` needed for the migration." msgstr "" msgid "``_pgr_array_reverse``:" @@ -5857,8 +5696,8 @@ msgid "Does not autodetect if ``reverse_cost`` column exist." msgstr "" msgid "" -"User must be careful to match the existence of the column with the value " -"of ``has_rcost`` parameter." +"User must be careful to match the existence of the column with the value of " +"``has_rcost`` parameter." msgstr "" msgid "The restrictions inner query is optional." @@ -5919,8 +5758,8 @@ msgid "The flag has been omitted and the default is been used." msgstr "" msgid "" -"When the need of using strictly the same (meaningless) names and types of" -" the function been migrated then:" +"When the need of using strictly the same (meaningless) names and types of " +"the function been migrated then:" msgstr "" msgid "``id1`` is the node" @@ -5987,8 +5826,8 @@ msgid "On the points query do not include the ``side`` column." msgstr "" msgid "" -"When the need of using strictly the same (meaningless) names and types, " -"and node values of the function been migrated then:" +"When the need of using strictly the same (meaningless) names and types, and " +"node values of the function been migrated then:" msgstr "" msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints``" @@ -6043,8 +5882,8 @@ msgid "Migration of ``pgr_trspViaEdges``" msgstr "" msgid "" -"And will travel thru the following Via points " -":math:`4\\rightarrow3\\rightarrow6`" +"And will travel thru the following Via points :math:" +"`4\\rightarrow3\\rightarrow6`" msgstr "" msgid ":doc:`pgr_withPointsVia` when there are no restrictions," @@ -6074,52 +5913,48 @@ msgstr "" msgid ":doc:`withPoints-category`" msgstr ":doc:`withPoints-category`" -#, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones Soportadas:** `Latest `__ (`3.4 `__ (`3.4 `__)" -#, fuzzy msgid "Ordering - Family of functions" -msgstr "Coloración - Familia de funciones" - -msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ `2.2 " +msgstr "Ordenamiento - Familia de funciones" + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ `2.2 " "`__ `2.1 " "`__ `2.0 " "`__" msgstr "" -"**Versiones soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ `2.2 " +"**Versiones soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ `2.2 " "`__ `2.1 " "`__ `2.0 " "`__" @@ -6127,12 +5962,11 @@ msgstr "" msgid "pgRouting Concepts" msgstr "Conceptos de pgRouting" -#, fuzzy msgid "" -"This is a simple guide that go through some of the steps for getting " -"started with pgRouting. This guide covers:" +"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 para llevarte a través de los pasos básicos para " +"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" @@ -6165,7 +5999,8 @@ msgstr "" msgid "Directed simple graph" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "" +":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" msgid "Graphs:" @@ -6175,11 +6010,12 @@ msgid "Do not have geometries." msgstr "" msgid "" -"Some graph theory problems require graphs to have weights, called " -"**cost** in pgRouting." +"Some graph theory problems require graphs to have weights, called **cost** " +"in pgRouting." msgstr "" -msgid "In pgRouting there are several ways to represent a graph on the database:" +msgid "" +"In pgRouting there are several ways to represent a graph on the database:" msgstr "" msgid "With ``cost``" @@ -6199,31 +6035,28 @@ msgid "" "manner." msgstr "" -#, fuzzy msgid "Identifier of a vertex." -msgstr "Identificador del vértice inicial." +msgstr "Identificador de un vértice." msgid "Weight of the edge (``source``, ``target``):" msgstr "Peso de la arista (``source``, ``target``):" -#, fuzzy -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "" +"When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" -"Cuando es negativo: la arista `(source, target)` no existe, por lo tanto " -"no es parte del grafo." +"Cuando negativo: la arista (``source``, ``target``) no existe en el grafo." msgid "``cost`` must exist in the query." msgstr "" -#, fuzzy -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "" +"When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "" -"En caso negativo: la arista `(target, source)` no existe, por lo tanto no" -" es parte del grafo." +"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." +"The decision of the graph to be **directed** or **undirected** is done when " +"executing a pgRouting algorithm." msgstr "" msgid "Graph with ``cost``" @@ -6239,8 +6072,8 @@ msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } " -"cost_{id} \\ge 0 \\}`" +":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " +"\\ge 0 \\}`" msgstr "" msgid "Edges where ``cost`` is non negative are part of the graph." @@ -6253,9 +6086,8 @@ msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` has directionality: :math:`source_{id} \\rightarrow " -"target_{id}`" +"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " +"has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "For the following data:" @@ -6269,18 +6101,18 @@ msgstr "" msgid "" "In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" +"\\;\\;}{} target_{id}`" msgstr "" msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id}" -" \\leftrightarrow target_{id}`" +"In terms of a directed graph is like having two edges: :math:`source_{id} " +"\\leftrightarrow target_{id}`" msgstr "" msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of " -"the graph." +"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " +"graph." msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -6296,15 +6128,15 @@ msgid "The set of edges :math:`E`:" msgstr "" 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}`" +":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 "" msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative" -" are part of the graph." +"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " +"are part of the graph." msgstr "" msgid "" @@ -6319,8 +6151,8 @@ msgid "In a directed graph both edges have directionality" msgstr "" msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: " -":math:`source_{id} \\rightarrow target_{id}`" +"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" +"`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "" @@ -6346,8 +6178,8 @@ msgid "" msgstr "" msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is " -":math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" +"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" msgid "In terms of a directed graph is like having four edges:" @@ -6369,19 +6201,17 @@ msgid "Graphs without geometries" msgstr "" msgid "" -"Personal relationships, genealogy, file dependency problems can be solved" -" using pgRouting. Those problems, normally, do not come with geometries " +"Personal relationships, genealogy, file dependency problems can be solved " +"using pgRouting. Those problems, normally, do not come with geometries " "associated with the graph." msgstr "" -#, fuzzy msgid "Wiki example" -msgstr "Ejemplo" +msgstr "Ejemplo de Wiki" -#, python-format msgid "" -"Solve the example problem taken from `wikipedia " -"`__):" +"Solve the example problem taken from `wikipedia `__):" msgstr "" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." @@ -6391,8 +6221,7 @@ msgid "Is an undirected graph." msgstr "" msgid "" -"Although visually looks like to have geometries, the drawing is not to " -"scale." +"Although visually looks like to have geometries, the drawing is not to scale." msgstr "" msgid "No geometries associated to the vertices or edges" @@ -6405,9 +6234,9 @@ msgid "Has 9 edges:" msgstr "" 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}`" +":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 "" msgid "The graph can be represented in many ways for example:" @@ -6421,13 +6250,12 @@ msgid "" "pgRouting: ::" msgstr "" -#, fuzzy msgid "Create a table" -msgstr "Índices y tablas" +msgstr "Crear una tabla" msgid "" -"The basic elements needed to perform basic routing on an undirected graph" -" are:" +"The basic elements needed to perform basic routing on an undirected graph " +"are:" msgstr "" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -6462,15 +6290,16 @@ msgstr "" 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." +msgid "" +"The first step is to create a database and load pgRouting in the database." msgstr "" msgid "Typically create a database for each project." msgstr "" msgid "" -"Once having the database to work in, load your data and build the routing" -" application in that database." +"Once having the database to work in, load your data and build the routing " +"application in that database." msgstr "" msgid "Load Data" @@ -6489,45 +6318,39 @@ msgid ":doc:`sampledata`: a small graph used on the documentation examples" msgstr "" msgid "" -"Using `osm2pgrouting " -"`__" +"Using `osm2pgrouting `__" msgstr "" -#, fuzzy msgid "There are various open source tools that can help, like:" -msgstr "" -"Si tiene otros requisitos, puede probar varias herramientas de OpenSource" -" que pueden ayudarle, como:" +msgstr "Existen varias herramientas de codigo abierto que pueden ayudar, como:" msgid "shp2pgsql" msgstr "shp2pgsql" -#, fuzzy msgid "postgresql shapefile loader" -msgstr "Este es un cargador de archivo shape a postgresql" +msgstr "cargador a postgresql de archivos shape" msgid "ogr2ogr" msgstr "ogr2ogr" -#, fuzzy msgid "vector data conversion utility" -msgstr "Esta es una utilidad de conversión de datos vectoriales" +msgstr "herramienta de conversión de datos vectoriales" msgid "osm2pgsql" msgstr "osm2pgsql" -#, fuzzy msgid "load OSM data into postgresql" -msgstr "Esta es una herramienta para cargar los datos de OSM a postgresql" +msgstr "cargar datos de OSM a postgresql" -#, fuzzy 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 "" -"Tenga en cuenta que estas herramientas no importarán los datos en una " -"estructura compatible con pgRouting y es posible que deba adaptarlos." +"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 "" @@ -6559,20 +6382,20 @@ msgid "Prepare the graph" msgstr "" 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." +"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 "" msgid "" -"The steps to prepare the graph involve geometry operations using `PostGIS" -" `__ and some others involve graph operations like " -":doc:`pgr_contraction` to contract a graph." +"The steps to prepare the graph involve geometry operations using `PostGIS " +"`__ and some others involve graph operations like :doc:" +"`pgr_contraction` to contract a graph." msgstr "" msgid "" -"The `workshop `__ has a step by " -"step on how to prepare a graph using Open Street Map data, for a small " +"The `workshop `__ has a step by step " +"on how to prepare a graph using Open Street Map data, for a small " "application." msgstr "" @@ -6590,45 +6413,43 @@ msgid "" "documentation and the `PostGIS `__ documentation." msgstr "" -#, fuzzy msgid "Build a routing topology" -msgstr "Construir una Topología de Ruteo" +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." +"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 "" 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." +"``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 "" msgid "" -"When the data comes with geometries and there is no routing topology, " -"then this step is needed." +"When the data comes with geometries and there is no routing topology, then " +"this step is needed." msgstr "" 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." +"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 "" msgid "" -"If the columns do not exist they need to be added to the table in " -"question. (see `ALTER TABLE `__)" +"If the columns do not exist they need to be added to the table in question. " +"(see `ALTER TABLE `__)" msgstr "" 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." +"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 "" msgid "" @@ -6640,19 +6461,18 @@ msgid "See :doc:`sampledata` for an example for building a topology." msgstr "" msgid "" -"Data coming from OSM and using `osm2pgrouting " -"`__ as an import tool, comes " -"with the routing topology. See an example of using ``osm2pgrouting`` on " -"the `workshop " -"`__." +"Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an " +"example of using ``osm2pgrouting`` on the `workshop `__." msgstr "" msgid "Adjust costs" msgstr "" msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be" -" the double of the length of the geometry." +"For this example the ``cost`` and ``reverse_cost`` values are going to be " +"the double of the length of the geometry." msgstr "" msgid "Update costs to length of geometry" @@ -6740,16 +6560,15 @@ msgid "To get the crossing edges:" msgstr "" msgid "" -"That information is correct, for example, when in terms of vehicles, is " -"it a tunnel or bride crossing over another road." +"That information is correct, for example, when in terms of vehicles, is it a " +"tunnel or bride crossing over another road." msgstr "" msgid "It might be incorrect, for example:" msgstr "" msgid "" -"When it is actually an intersection of roads, where vehicles can make " -"turns." +"When it is actually an intersection of roads, where vehicles can make turns." msgstr "" msgid "" @@ -6765,14 +6584,14 @@ msgstr "" 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 " -"`__ and the data imported again." +"``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." msgstr "" 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" +"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 "" msgid "For very specific applications" @@ -6787,9 +6606,8 @@ msgid "The data needs a local fix for the specific application." msgstr "" msgid "" -"Once analyzed one by one the crossings, for the ones that need a local " -"fix, the edges need to be `split " -"`__." +"Once analyzed one by one the crossings, for the ones that need a local fix, " +"the edges need to be `split `__." msgstr "" msgid "" @@ -6821,8 +6639,8 @@ msgid "" msgstr "" msgid "" -"Capacity information, used on the :doc:`flow-family` functions does not " -"need to change when splitting edges." +"Capacity information, used on the :doc:`flow-family` functions does not need " +"to change when splitting edges." msgstr "" msgid "Adding new vertices" @@ -6868,17 +6686,16 @@ msgid "To get the graph connectivity:" msgstr "Para obtener la conectividad del grafo:" msgid "" -"In this example, the component :math:`2` consists of vertices " -":math:`\\{2, 4\\}` and both vertices are also part of the dead end result" -" set." +"In this example, the component :math:`2` consists of vertices :math:`\\{2, " +"4\\}` and both vertices are also part of the dead end result set." msgstr "" msgid "This graph needs to be connected." msgstr "" msgid "" -"With the original graph of this documentation, there would be 3 " -"components as the crossing edge in this graph is a different component." +"With the original graph of this documentation, there would be 3 components " +"as the crossing edge in this graph is a different component." msgstr "" msgid "Prepare storage for connection information" @@ -6894,15 +6711,14 @@ msgid "Get the closest vertex" msgstr "" msgid "" -"Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1`" -" is vertex :math:`4`. And the closest edge to vertex :math:`4` is edge " -":math:`14`." +"Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1` is " +"vertex :math:`4`. And the closest edge to vertex :math:`4` is edge :math:" +"`14`." msgstr "" msgid "" -"The ``edge`` can be used to connect the components, using the " -"``fraction`` information about the edge :math:`14` to split the " -"connecting edge." +"The ``edge`` can be used to connect the components, using the ``fraction`` " +"information about the edge :math:`14` to split the connecting edge." msgstr "" msgid "Connecting components" @@ -6942,18 +6758,18 @@ msgstr "" 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." +"correctness of the data, on the final application, or any other factor not " +"mentioned." msgstr "" 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." +"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 "" msgid "" -"A complete method on how to contract and how to use the contracted graph " -"is described on :doc:`contraction-family`" +"A complete method on how to contract and how to use the contracted graph is " +"described on :doc:`contraction-family`" msgstr "" msgid "Dead ends" @@ -6963,13 +6779,13 @@ msgid "To get the dead ends:" msgstr "" msgid "" -"That information is correct, for example, when the dead end is on the " -"limit of the imported graph." +"That information is correct, for example, when the dead end is on the limit " +"of the imported graph." msgstr "" msgid "" -"Visually node :math:`4` looks to be as start/ending of 3 edges, but it is" -" not." +"Visually node :math:`4` looks to be as start/ending of 3 edges, but it is " +"not." msgstr "" msgid "Is that correct?" @@ -6982,8 +6798,8 @@ msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" msgid "" -"Is the application for pedestrians and therefore the pedestrian can " -"easily walk on the small curb?" +"Is the application for pedestrians and therefore the pedestrian can easily " +"walk on the small curb?" msgstr "" msgid "" @@ -6992,13 +6808,13 @@ msgid "" msgstr "" msgid "" -"Is there a big cliff and from eagles view look like the dead end is close" -" to the segment?" +"Is there a big cliff and from eagles view look like the dead end is close to " +"the segment?" msgstr "" msgid "" -"When there are many dead ends, to speed up, the :doc:`contraction-family`" -" functions can be used to divide the problem." +"When there are many dead ends, to speed up, the :doc:`contraction-family` " +"functions can be used to divide the problem." msgstr "" msgid "Linear edges" @@ -7013,19 +6829,19 @@ msgid "" msgstr "" msgid "" -"When there are many linear edges, to speed up, the :doc:`contraction-" -"family` functions can be used to divide the problem." +"When there are many linear edges, to speed up, the :doc:`contraction-family` " +"functions can be used to divide the problem." msgstr "" msgid "Function's structure" msgstr "" -msgid "Once the graph preparation work has been done above, it is time to use a" +msgid "" +"Once the graph preparation work has been done above, it is time to use a" msgstr "" -#, fuzzy msgid "The general form of a pgRouting function call is:" -msgstr "Integración de la consulta interna a la función pgRouting:" +msgstr "La forma general de una llamada a una función de pgRouting es:" msgid "\\ \\" msgstr "" @@ -7038,25 +6854,27 @@ msgid "" "containing SQL queries." msgstr "" -msgid "**parameters**: Additional compulsory parameters needed by the function." +msgid "" +"**parameters**: Additional compulsory parameters needed by the function." msgstr "" msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that " -"have a default value when omitted." +"``Optional parameters``: Are non compulsory **named** parameters that have a " +"default value when omitted." msgstr "" msgid "" -"The compulsory parameters are positional parameters, the optional " -"parameters are named parameters." +"The compulsory parameters are positional parameters, the optional parameters " +"are named parameters." msgstr "" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** [, ``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** [, ``directed``])" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" msgid "`Edges SQL`_:" msgstr "`SQL aristas`_:" @@ -7071,8 +6889,8 @@ msgid "It is an inner query." msgstr "" msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner " -"query needs to be used" +"It has no name, so **Edges SQL** gives an idea of what kind of inner query " +"needs to be used" msgstr "" msgid "**start vid**:" @@ -7090,8 +6908,8 @@ msgid "Is the third parameter." msgstr "" msgid "" -"It has no name, so **end vid** gives an idea of what the third " -"parameter's value should contain" +"It has no name, so **end vid** gives an idea of what the third parameter's " +"value should contain" msgstr "" msgid "Is the fourth parameter." @@ -7129,11 +6947,8 @@ msgstr "`Muchos a Muchos`_" msgid "`Combinations`_" msgstr "`Combinaciones`_" -#, fuzzy msgid "Depending on the overload the parameters types change." -msgstr "" -"Dependiendo de la sobrecarga son los parámetros utilizados, manteniendo " -"la coherencia en todas las funciones." +msgstr "Dependiendo de la sobrecarga, los tipos de los parámetros cambian." msgid "**One**: **ANY-INTEGER**" msgstr "" @@ -7188,25 +7003,22 @@ 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." -#, fuzzy msgid "Needs a `Combinations SQL`_" -msgstr "`Combinaciones`_" +msgstr "Necesita una `SQL de combinaciones`_" -#, fuzzy 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 variety of types, " -"**ANY-INTEGER** and **ANY-NUMERICAL** is used." +"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 variety of types, **ANY-INTEGER** and " +"**ANY-NUMERICAL** is used." msgstr "" "Hay 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 las funcion(es). Para simplificar la variedad de " -"tipos, se utiliza ``ANY-INTEGER`` y ``ANY-NUMERICAL``." +"devueltas dependen de la función. El tipo de consulta interna dependerá de " +"los requisitos de las funcion(es). Para simplificar la variedad de tipos, se " +"utiliza **ENTEROS** y **FLOTANTES**." -#, fuzzy msgid "Edges SQL for" -msgstr "edges_sql" +msgstr "SQL de aristas para" msgid ":doc:`withPoints-family`" msgstr ":doc:`withPoints-family`" @@ -7221,8 +7033,8 @@ msgid "General with (X,Y)" msgstr "" msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore " -"it's not part of the graph." +"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." @@ -7266,9 +7078,8 @@ msgstr "" msgid "Used on combination signatures" msgstr "" -#, fuzzy msgid "Points SQL for" -msgstr "points_sql" +msgstr "SQL de puntos para" msgid "" "The main parameter of the majority of the pgRouting functions is a query " @@ -7276,19 +7087,18 @@ msgid "" msgstr "" msgid "" -"Depending on the family or category of a function it will have additional" -" parameters, some of them are compulsory and some are optional." +"Depending on the family or category of a function it will have additional " +"parameters, some of them are compulsory and some are optional." msgstr "" 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." +"order. The optional parameters are named parameters and will have a default " +"value." msgstr "" -#, fuzzy msgid "Parameters for the Via functions" -msgstr "Para las funciones de Ruteo" +msgstr "Párametros para las funciones Via" msgid ":doc:`pgr_dijkstraVia`" msgstr ":doc:`pgr_dijkstraVia`" @@ -7319,74 +7129,70 @@ msgstr "" msgid "``U_turn_on_edge``" msgstr "``U_turn_on_edge``" -#, fuzzy 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." +"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 "" -"En caso de ``true`` saliendo de un vértice visitado no intentará evitar " -"el uso de la arista utilizada para alcanzarlo. En otras palabras, se " -"permite el giro U utilizando la arista con el mismo 'id'." +"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." -#, fuzzy 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." +"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 "" -"En caso de ``false`` cuando una salida de un vértice visitado intenta " -"evitar el uso de la arista utilizada para alcanzarlo. En otras palabras," -" se utiliza el giro U utilizando el borde con el mismo `id` cuando no se " -"encuentra ninguna otra ruta." +"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" -#, fuzzy msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_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." +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." -#, fuzzy msgid "Return columns for a path" -msgstr "Valores devueltos para una ruta" +msgstr "Columnas devueltas para una trayectoria" msgid "Used on functions that return one path solution" msgstr "" msgid "" -"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, " -"cost, agg_cost)``" +"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " +"agg_cost)``" msgstr "" -"Devuelve el conjunto de ``(seq, path_seq [, start_vid] [, end_vid], node," -" edge, cost, agg_cost)``" +"Devuelve el conjunto de ``(seq, path_seq [, start_vid] [, end_vid], node, " +"edge, cost, agg_cost)``" msgid "``path_seq``" msgstr "``path_seq``" msgid "" -"Relative position in the path. Has value **1** for the beginning of a " -"path." +"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. Returned when multiple starting " -"vetrices are in the query." +"Identifier of the starting vertex. Returned when multiple starting vetrices " +"are in the query." msgstr "" -"Identificador del vértice inicial. Se devuelve cuando hay varias vetrices" -" iniciales en la consulta." +"Identificador del vértice inicial. Se devuelve cuando hay varias vetrices " +"iniciales en la consulta." msgid "" -"Identifier of the ending vertex. Returned when multiple ending vertices " -"are in the query." +"Identifier of the ending vertex. Returned when multiple ending vertices are " +"in the query." msgstr "" "Identificador del vértice final. Se devuelve cuando hay varios vértices " "finales en la consulta." @@ -7395,32 +7201,31 @@ 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." +"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." +"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." +"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." +"Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo " +"en la secuencia de la ruta." msgid "Used on functions the following:" msgstr "" -#, fuzzy msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_withPoints`" msgid "" -"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, " -"cost, agg_cost)``" +"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " +"agg_cost)``" msgstr "" -"Devuelve el conjunto de ``(seq, path_seq [, start_pid] [, end_pid], node," -" edge, cost, agg_cost)``" +"Devuelve el conjunto de ``(seq, path_seq [, start_pid] [, end_pid], node, " +"edge, cost, agg_cost)``" msgid "Relative position in the path." msgstr "Posición relativa en la ruta." @@ -7468,11 +7273,11 @@ msgid "When negative is the identifier of the a point." msgstr "Cuando es negativo, es identificador de un punto." msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the " -"path sequence." +"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." +"Identificador de la arsita utilizada para ir del ``node`` al siguiente nodo " +"de la secuencia de ruta." msgid "**-1** for the last row of the path." msgstr "**-1** para la última fila de la ruta." @@ -7484,11 +7289,9 @@ msgid ":doc:`pgr_dijkstraNear`" msgstr ":doc:`pgr_dijkstraNear`" msgid "" -"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " -"agg_cost)``" +"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" msgstr "" -"Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " -"agg_cost)``" +"Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" msgid "Identifier of the starting vertex of the current path." msgstr "Identificador del vértice inicial de la ruta actual." @@ -7509,8 +7312,8 @@ msgid "" "Set of ``(seq, path_id, path_seq [, start_vid] [, end_vid], node, edge, " "cost, agg_cost)``" msgstr "" -"Conjunto de ``(seq, path_id, path_seq [, start_vid] [, end_vid], node, " -"edge, cost, agg_cost)``" +"Conjunto de ``(seq, path_id, path_seq [, start_vid] [, end_vid], node, edge, " +"cost, agg_cost)``" msgid "``path_id``" msgstr "``path_id``" @@ -7518,10 +7321,10 @@ 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``." +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``." +"Tiene valor **1** para el primero de la ruta de ``start_vid`` a ``end_vid``." msgid "Non selective for multiple paths" msgstr "" @@ -7530,29 +7333,27 @@ msgid "Regardless of the call, al the columns are returned." msgstr "" msgid "" -"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge," -" cost, agg_cost)``" +"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, " +"cost, agg_cost)``" msgstr "" -"Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " -"node, edge, cost, agg_cost)``" +"Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, node, " +"edge, cost, agg_cost)``" -#, fuzzy msgid "Return columns for cost functions" -msgstr "Devolución de columnas y valores" +msgstr "Columnas devueltas para funciones de costo" msgid "Used in the following" msgstr "" msgid "" -"When start_vid or end_vid columns have negative values, the identifier is" -" for a Point." +"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." -#, fuzzy msgid "Return columns for flow functions" -msgstr "Devolución de columnas y valores" +msgstr "Columnas devueltas para funciones de flujo" msgid "Edges SQL for the following" msgstr "" @@ -7572,15 +7373,15 @@ msgstr "Consejos de Rendimiento" msgid "For the Routing functions" msgstr "Para las funciones de Ruteo" -#, fuzzy -msgid "To get faster results bound the queries to an area of interest of routing." +msgid "" +"To get faster results bound the queries to an area of interest of routing." msgstr "" -"Para obtener resultados más rápidos, las consultas enlazan el área de " -"interés para tener, por ejemplo, no más de un millón de filas." +"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." +"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." @@ -7592,86 +7393,77 @@ msgid "Wiki" msgstr "Wiki" msgid "" -"Edit an existing `pgRouting Wiki " -"`__ page." +"Edit an existing `pgRouting Wiki `__ page." msgstr "" -"Edita una página existente `Wiki de pgRouting " -"`_." +"Edita una página existente `Wiki de pgRouting `_." msgid "Or create a new Wiki page" msgstr "O crea una nueva página Wiki" -#, fuzzy msgid "" -"Create a page on the `pgRouting Wiki " -"`__" +"Create a page on the `pgRouting Wiki `__" msgstr "" -"Crear una página en el `pgRouting Wiki " -"`_" +"Crear una página en el `Wiki de pgRouting `_" msgid "Give the title an appropriate name" msgstr "Asigne al título un nombre apropiado" -#, fuzzy msgid "" "`Example `__" msgstr "" -"`Example `_" +"`Ejemplo `__" msgid "Adding Functionaity to pgRouting" msgstr "Agregar funcionalidad a pgRouting" -#, fuzzy msgid "" -"Consult the `developer's documentation " -"`__" -msgstr "" -"Consultar `developer's documentation " -"`_" - -msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" +"Consult the `developer's documentation `__" +msgstr "" +"Consultar la `documentation de desarrolladores `__" + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "Installation" msgstr "Instalación" @@ -7698,21 +7490,20 @@ msgid ":ref:`install_testing`" msgstr ":ref:`install_testing`" 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 " -"`__" +"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 `__" msgstr "" msgid "" -"To use pgRouting PostGIS needs to be installed, please read the " -"information about installation in this `Install Guide " -"`__" +"To use pgRouting PostGIS needs to be installed, please read the information " +"about installation in this `Install Guide `__" msgstr "" "Para utilizar pgRouting postGIS necesita ser instalado, por favor lea la " -"información sobre la instalación en esta `Guía de instalacoón " -"`__" +"información sobre la instalación en esta `Guía de instalacoón `__" msgid "Short Version" msgstr "Versión corta" @@ -7729,18 +7520,18 @@ 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." +"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" +"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" +"La última versión de pgRouting se puede encontrar en https://github.com/" +"pgRouting/pgrouting/releases/latest" msgid "wget" msgstr "Wget" @@ -7748,13 +7539,12 @@ msgstr "Wget" msgid "To download this release:" msgstr "Para descargar esta versión:" -#, fuzzy msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball " -"and compiling pgRouting." +"Go to :ref:`install-short` for more instructions on extracting tar ball and " +"compiling pgRouting." msgstr "" -"Ir a :ref:`install-short` a las instrucciones de compilación (no hay bola" -" de alquitrán)." +"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" @@ -7764,8 +7554,8 @@ 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)." +"(there is no tar ball involved while downloading pgRouting repository from " +"GitHub)." msgstr "" msgid "Enabling and upgrading in the database" @@ -7776,32 +7566,30 @@ 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." +"functionalities to end user. Below given code demonstrates enabling PostGIS " +"and pgRouting in the database." msgstr "" msgid "" -"Checking PostGIS and pgRouting version after enabling them in the " -"database." +"Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" msgid "Upgrading the database" msgstr "Actualización de la base de datos" -#, fuzzy msgid "" "To upgrade pgRouting in the database to version 3.4.0 use the following " "command:" msgstr "" -"Para actualizar pgRouting en la base de datos a la versión 3.3.0 utilice " -"el siguiente comando:" +"Para actualizar pgRouting en la base de datos a la versión 3.4.0 utilice el " +"siguiente comando:" msgid "" -"More information can be found in https://www.postgresql.org/docs/current" -"/sql-createextension.html" +"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" +"Puede hallar más información en https://www.postgresql.org/docs/current/sql-" +"createextension.html" msgid "Dependencies" msgstr "Dependencias" @@ -7810,27 +7598,24 @@ msgid "Compilation Dependencies" msgstr "Dependencias de Compilación" msgid "" -"To be able to compile pgRouting, make sure that the following " -"dependencies are met:" +"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:" +"Para poder compilar pgRouting, asegúrese de que se cumplen las siguientes " +"dependencias:" msgid "C and C++0x compilers" msgstr "" -#, fuzzy msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with " -"C++03 or C++11 standard support" +"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " +"or C++11 standard support" msgstr "" -"Compiladores C and C++0x * Compilando con Boost 1.56 up to Boost 1.74 " -"requires C++ Compiler with C++03 or C++11 standard support * Compiling " -"with Boost 1.75 requires C++ Compiler with C++14 standard support" +"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" +"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" msgid "Postgresql version = Supported versions by PostgreSQL" @@ -7884,9 +7669,8 @@ msgstr "Instalación de las dependencias de compilación" msgid "Database dependencies" msgstr "Dependencias de bases de datos" -#, fuzzy msgid "Configuring PostgreSQL" -msgstr "Configuración" +msgstr "Configurar PostgreSQL" msgid "Entering psql console" msgstr "" @@ -7895,8 +7679,8 @@ msgid "To exit psql console" msgstr "" msgid "" -"Entering psql console directly without switching roles can be done by the" -" following commands" +"Entering psql console directly without switching roles can be done by the " +"following commands" msgstr "" msgid "Then use the above given method to exit out of the psql console" @@ -7915,10 +7699,10 @@ msgid "Creating PostgreSQL role" msgstr "" msgid "" -"Default role provided by PostgreSQL is postgres. To create new roles you " -"can use the above provided commands. The prompt will ask the user to type" -" name of the role and then provide affirmation. Proceed with the steps " -"and you will succeed in creating PostgreSQL role successfully." +"Default role provided by PostgreSQL is postgres. To create new roles you can " +"use the above provided commands. The prompt will ask the user to type name " +"of the role and then provide affirmation. Proceed with the steps and you " +"will succeed in creating PostgreSQL role successfully." msgstr "" msgid "" @@ -7927,8 +7711,8 @@ msgid "" msgstr "" msgid "" -"To get additional details on the flags associated with ``createuser`` " -"below given command can be used" +"To get additional details on the flags associated with ``createuser`` below " +"given command can be used" msgstr "" msgid "Creating Database in PostgreSQL" @@ -7970,13 +7754,12 @@ msgstr "Para ver las variables que se pueden configurar" msgid "Configuring The Documentation" msgstr "Configurar la documentación" -#, fuzzy 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 la documentación:" +"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" @@ -8001,8 +7784,8 @@ 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" +"Si está activado, active/desactive la creación de HTML para la documentación " +"del usuario" msgid "BUILD_DOXY" msgstr "BUILD_DOXY" @@ -8035,11 +7818,10 @@ msgstr "" msgid "Configuring cmake to create documentation before building pgRouting" msgstr "" -#, fuzzy msgid "Most of the effort of the documentation has been on the html files." msgstr "" -"La mayor parte del esfuerzo de la documentación ha estado en los archivos" -" html." +"La mayor parte del esfuerzo de la documentación ha estado en los archivos " +"html." msgid "Building" msgstr "Compilando" @@ -8051,11 +7833,11 @@ msgid "The following instructions start from *path/to/pgrouting/build*" msgstr "Las siguientes instrucciones comienzan desde *path/to/pgrouting/build*" msgid "" -"We have tested on several platforms, For installing or reinstalling all " -"the steps are needed." +"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." +"Hemos probado en varias plataformas, Para instalar o reinstalar todos los " +"pasos son necesarios." msgid "The sql signatures are configured and build in the ``cmake`` command." msgstr "Las firmas sql se configuran y se compilan en el comando ``cmake``." @@ -8070,11 +7852,9 @@ msgid "The following instructions start from *path/to/pgrouting*" msgstr "Las siguientes instrucciones comienzan desde *path/to/pgrouting*" msgid "" -"To remove the build when the configuration changes, use the following " -"code:" +"To remove the build when the configuration changes, use the following code:" msgstr "" -#, fuzzy msgid "and start the build process as mentioned previously." msgstr "e iniciar el proceso de compilación como se mencionó anteriormente." @@ -8090,77 +7870,68 @@ msgid "The following instructions start from *path/to/pgrouting/*" msgstr "Las siguientes instrucciones comienzan desde *path/to/pgrouting/*" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "" "pgRouting is an extension of `PostGIS `__ and " "`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of " -"pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp " -"`__, was later extended by Orkney and renamed to " -"pgRouting. The project is now supported and maintained by `Georepublic " -"`__, `Paragon Corporation " -"`__ and a broad user community." -msgstr "" -"pgRouting es una extensión de la base de datos geoespacial `PostGIS " -"`__ y `PostgreSQL `__ y " -"agrega ruteo y otras funciones de análisis de redes. Un predecesor de " -"pgRouting – pgDijkstra, escrito por Sylvain Pasche de `Camptocamp " -"`__, fue más tarde extendido por Orkney y " -"renombrado a pgRouting. El proyecto ahora es apoyado y mantenido por " -"Georepublic `__, `Paragon Corporation " -"`__ y una amplia comunidad de " -"usuarios." - -msgid "" -"pgRouting is part of `OSGeo Community Projects " -"`__ from the `OSGeo" -" Foundation `__ and included on `OSGeoLive " -"`__." -msgstr "" -"pgRouting es parte de la `Comunidad de Proyectos de OSGeo " -"` __ de la " -"`Fundación OSGeo ` __ y se incluye en`OSGeoLive " -"`__." +"routing and other network analysis functionality. A predecessor of pgRouting " +"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " +"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " +"a broad user community." +msgstr "" +"pgRouting es una extensión de la base de datos geoespacial `PostGIS `__ y `PostgreSQL `__ y agrega ruteo " +"y otras funciones de análisis de redes. Un predecesor de pgRouting – " +"pgDijkstra, escrito por Sylvain Pasche de `Camptocamp `__, fue más tarde extendido por Orkney y renombrado a pgRouting. El " +"proyecto ahora es apoyado y mantenido por Georepublic `__, `Paragon Corporation `__ y " +"una amplia comunidad de usuarios." + +msgid "" +"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "" +"pgRouting es parte de la `Comunidad de Proyectos de OSGeo ` __ de la `Fundación OSGeo ` __ y se incluye en`OSGeoLive `__." msgid "Licensing" msgstr "Licencias" @@ -8175,40 +7946,39 @@ 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 `_." +"Most features of pgRouting are available under `GNU General Public License " +"v2.0 or later `_." msgstr "" "La mayoría de las características de pgRouting están disponibles en " -"`Licencia Pública General v2.0 o posterior " -"`_." +"`Licencia Pública General v2.0 o posterior `_." 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 `_." +"Some Boost extensions are available under `Boost Software License - Version " +"1.0 `_." msgstr "" -"Algunas extensiones de Boost están disponibles bajo `Boost Software " -"License - Version 1.0 `_." +"Algunas extensiones de Boost están disponibles bajo `Boost Software License " +"- Version 1.0 `_." msgid "MIT-X License" msgstr "Licencia MIT-X" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." +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." +"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 `_." +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_." msgstr "" -"El Manual de pgRouting está disponible bajo una licencia `Creative " -"Commons Attribution-Share Alike 3.0 License " -"`_." +"El Manual de pgRouting está disponible bajo una licencia `Creative Commons " +"Attribution-Share Alike 3.0 License `_." msgid "" "In general license information should be included in the header of each " @@ -8223,40 +7993,35 @@ msgstr "Colaboradores" msgid "This Release Contributors" msgstr "Colaboradores de esta Versión" -#, fuzzy msgid "Individuals in this release (in alphabetical order)" -msgstr "Personas (en orden alfabético)" +msgstr "Personas en este lanzamiento (en orden alfabético)" -#, fuzzy msgid "" -"Ashish Kumar, Cayetano Benavent, Daniel Kastl, Nitish Chauhan, Rajat " -"Shinde, Regina Obe, Shobhit Chaurasia, Swapnil Joshi, Virginia Vergara" +"Ashish Kumar, Cayetano Benavent, Daniel Kastl, Nitish Chauhan, Rajat Shinde, " +"Regina Obe, Shobhit Chaurasia, Swapnil Joshi, Virginia Vergara" msgstr "" -"Ashish Kumar, Cayetano Benavent, Daniel Kastl, Himanshu Raj, Martha " -"Vergara, Regina Obe, Veenit Kumar, Virginia Vergara" +"Ashish Kumar, Cayetano Benavent, Daniel Kastl, Nitish Chauhan, Rajat Shinde, " +"Regina Obe, Shobhit Chaurasia, Swapnil Joshi, Virginia Vergara" -#, fuzzy 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 todas las personas que nos dan un poco de su tiempo haciendo " -"comentarios, encontrando problemas, haciendo solicitudes de extracción, " -"etc. en cualquiera de nuestros productos: osm2pgrouting, pgRouting, " -"pgRoutingLayer." +"Y todas las personas que nos dan un poco de su tiempo haciendo comentarios, " +"encontrando problemas, haciendo pull request, etc. en cualquiera de nuestros " +"productos: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -#, fuzzy msgid "Corporate Sponsors in this release (in alphabetical order)" -msgstr "Patrocinadores corporativos (en orden alfabético)" +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:" +"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:" +"desarrollo, alojamiento, o financiamiento monetario directo al proyecto de " +"pgRouting:" msgid "`Georepublic `__" msgstr "`Georepublic `__" @@ -8274,18 +8039,18 @@ msgid "Individuals (in alphabetical order)" msgstr "Personas (en orden alfabético)" msgid "" -"Aasheesh Tiwari, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea" -" Nardelli, Anthony Tasca, Anton Patrushev, Ashraf Hossain, Ashish Kumar, " +"Aasheesh Tiwari, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea " +"Nardelli, Anthony Tasca, Anton Patrushev, 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" +"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" msgstr "" msgid "Corporate Sponsors (in alphabetical order)" @@ -8325,67 +8090,59 @@ 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." +"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." +"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." +"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." -#, fuzzy msgid "" -"The Migration guide from 2.6 can be found at " -"https://github.com/pgRouting/pgrouting/wiki/Migration-Guide." +"The Migration guide from 2.6 can be found at https://github.com/pgRouting/" +"pgrouting/wiki/Migration-Guide." msgstr "" -"La guía de Migración se puede encontrar en " -"https://github.com/pgRouting/pgrouting/wiki/Migration-Guide." +"La guía de Migración de 2.6 se puede encontrar en https://github.com/" +"pgRouting/pgrouting/wiki/Migration-Guide." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "pgr_KSP" msgstr "pgr_KSP" @@ -8412,8 +8169,8 @@ 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." +"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." @@ -8424,9 +8181,9 @@ msgstr "Firmas" msgid "Summary" msgstr "Resumen" -#, fuzzy msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_KSP(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" msgid "**options:** ``[directed, heap_paths]``" msgstr "" @@ -8441,7 +8198,8 @@ 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." +msgstr "" +"Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo dirigido." msgid "**K**" msgstr "**K**" @@ -8460,24 +8218,24 @@ 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." +"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``." +"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``." +"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 "Has value **1** for the first of a path from **start vid** to **end_vid**" -msgstr "Tiene valor **1** para el primer camnio desde **start vid** a **end_vid**" +msgid "" +"Has value **1** for the first of a path from **start vid** to **end_vid**" +msgstr "" +"Tiene valor **1** para el primer camnio desde **start vid** a **end_vid**" msgid "Identifier of the node in the path from **start vid** to **end vid**" msgstr "" -"Identificador del nodo en la ruta como **nodo de salida** o **nodo " -"destino**" +"Identificador del nodo en la ruta como **nodo de salida** o **nodo destino**" msgid ":math:`0` for the last ``node`` of the path." msgstr ":math:`0` para el último ``node`` de la ruta." @@ -8490,8 +8248,7 @@ 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" +"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." @@ -8500,40 +8257,35 @@ msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__)`3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__)`3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "``pgr_TSP``" msgstr "``pgr_TSP``" @@ -8548,11 +8300,11 @@ msgid "Version 3.2.1" msgstr "Versión 3.2.1" msgid "" -"Metric Algorithm from `Boost library " -"`__" +"Metric Algorithm from `Boost library `__" msgstr "" -"Algoritmo Metrico de la `Librería Boost " -"`__" +"Algoritmo Metrico de la `Librería Boost `__" msgid "Simulated Annealing Algorithm no longer supported" msgstr "El algoritmo de recocido simulado ya no es utilizado" @@ -8575,8 +8327,8 @@ 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`." +"Se puede utilizar con funciones :doc:`costMatrix-category` preferiblemente " +"con `directed => false`." msgid "With ``directed => false``" msgstr "Con ``directed => false``" @@ -8588,12 +8340,13 @@ 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)" +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." +"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``" @@ -8602,27 +8355,27 @@ msgid "" "The solutions generated is garanteed to be *twice as long as the optimal " "tour in the worst case*" msgstr "" -"Las soluciones generadas están garantizadas para ser *el doble de largas " -"que el recorrido óptimo en el peor de los casos*" +"Las soluciones generadas están garantizadas para ser *el doble de largas que " +"el recorrido óptimo en el peor de los casos*" 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 garanteed** that the solution will be, in the worse case, " -"twice as long as the optimal tour, due to the fact that `end_vid` is " -"forced to be in a fixed position." +"It is **not garanteed** that the solution will be, in the worse 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 al hecho de que `end_vid` " -"se ve obligado a estar en una posición fija." +"doble de larga que el recorrido óptimo, debido al hecho de que `end_vid` se " +"ve obligado a estar en una posición fija." msgid "With ``directed => true``" msgstr "Con ``directed => true``" msgid "" -"It is **not garanteed** that the solution will be, in the worse case, " -"twice as long as the optimal tour" +"It is **not garanteed** that the solution will be, in the worse case, twice " +"as long as the optimal tour" msgstr "" "**No está garantizado** que la solución sea, en el peor de los casos, el " "doble de larga que el recorrido óptimo" @@ -8634,32 +8387,33 @@ 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." +"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:" +"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)`" +"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)`" +"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)`" +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 del segmento " -"`(u, v)` se considera como el ``agg_cost`` de la arista `(u, v)`" +"El valor mínimo de ``agg_cost`` en todas las instancias del segmento `(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 " @@ -8672,27 +8426,25 @@ msgid "When the data is incomplete, but it is a connected graph:" msgstr "Cuando los datos están incompletos, pero es un grafo conectado:" msgid "the missing values will be calculated with dijkstra algorithm." -msgstr "los datos están incompletos se calcularán con el algoritmo de Dijkstra." +msgstr "" +"los datos están incompletos se calcularán con el algoritmo de Dijkstra." -#, fuzzy msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_TSP(`SQL de martiz`_, ``[start_id, end_id]``)" -#, fuzzy msgid "RETURNS SET OF |tsp-result|" -msgstr "Devuelve el conjunto de ``(node)``" +msgstr "REGRESA CONJUNTO DE |tsp-result|" msgid "OR EMTPY SET" msgstr "" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" -"Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la " -"matriz" +"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." +"**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." @@ -8722,8 +8474,8 @@ 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." +"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." @@ -8750,18 +8502,19 @@ 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" +"**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" +"**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no " +"incluirla en la consulta" msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" -msgstr "**Línea 6** Generación de una matriz asimétrica con ``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``" +":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``" @@ -8770,8 +8523,8 @@ 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:" +"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." @@ -8786,43 +8539,43 @@ 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." +"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`." +"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`." +"Valor del cost para :math:`17 \\rightarrow 10` no existe en la matriz, pero " +"el valor se toma de :math:`10 \\rightarrow 17`." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__)`3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__)`3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones no soportadas:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Versiones no soportadas:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_TSPeuclidean``" msgstr "``pgr_TSPeuclidean``" @@ -8851,8 +8604,7 @@ msgid "New **Official** function" msgstr "Nueva función **Oficial**" msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be " -"kept" +"Any duplicated identifier will be ignored. The coordinates that will be kept" msgstr "" "Cualquier identificador duplicado será ignorado. Las coordenadas que se " "mantendrán" @@ -8860,14 +8612,14 @@ msgstr "" msgid "is arbitrarly." msgstr "es arbitrario." -msgid "The coordinates are quite similar for the same identifier, for example ::" +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 " -"::" +"The coordinates are quite different for the same identifier, for example ::" msgstr "" "Las coordenadas son bastante diferentes para el mismo identificador, por " "ejemplo:" @@ -8904,17 +8656,14 @@ msgstr "Prueba 29 ciudades del Sáhara Occidental" msgid "" "This example shows how to make performance tests using University of " -"Waterloo's `example data " -"`__ using the 29 " -"cities of `Western Sahara dataset " -"`__" -msgstr "" -"Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los " -"`datos de ejemplo " -"`__ de la " -"Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades " -"del `Sáhara Occidental " -"`__" +"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgstr "" +"Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los `datos " +"de ejemplo `__ de la " +"Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades del " +"`Sáhara Occidental `__" msgid "Creating a table for the data and storing the data" msgstr "Creación de una tabla para datos y almacenamiento de los datos" @@ -8926,12 +8675,11 @@ 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" +"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" +"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" @@ -8940,48 +8688,44 @@ msgid "Visual results" msgstr "Resultados visuales" msgid "" -"Visualy, The first image is the `optimal solution " -"`__ and the second " -"image is the solution obtained with ``pgr_TSPeuclidean``." +"Visualy, The first image is the `optimal solution `__ and the second image is the solution " +"obtained with ``pgr_TSPeuclidean``." msgstr "" -"Visualmente, la primera imagen es la 'solución " -"óptima'`__ y la " -"segunda imagen es la solución obtenida con ``pgr_TSPeuclidean``." +"Visualmente, la primera imagen es la 'solución óptima'`__ y la segunda imagen es la solución " +"obtenida con ``pgr_TSPeuclidean``." msgid ":doc:`sampledata` network." msgstr ":doc:`sampledata` ." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__)`3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__)`3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ `2.2 " "`__ `2.1 " "`__ `2.0 " @@ -9024,8 +8768,8 @@ msgid "**Official** ``pgr_aStar`` (`One to One`_)" msgstr "**Oficial** ``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:" +"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:" @@ -9040,31 +8784,31 @@ msgid "`pgr_aStar(` `Many to Many`_ `)`" msgstr "`pgr_aStar(` `Muchos a Muchos`_ `)`" msgid "" -"``start_vid`` and ``end_vid`` in the result is used to distinguish to " -"which path it belongs." +"``start_vid`` and ``end_vid`` in the result is used to distinguish to which " +"path it belongs." msgstr "" -"``start_vid`` y ``end_vid`` en el resultado se utiliza para distinguir a " -"qué ruta pertenece." +"``start_vid`` y ``end_vid`` en el resultado se utiliza para distinguir a qué " +"ruta pertenece." -#, fuzzy msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStar(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" -#, fuzzy msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStar(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" -#, fuzzy msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStar(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" -#, fuzzy msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**, **K**, " +"[**opciones**])" -#, fuzzy msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" +msgstr "pgr_aStar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" msgid "**options:** ``[directed, heuristic, factor, epsilon]``" msgstr "" @@ -9084,8 +8828,8 @@ 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`" +"De vértice :math:`6` a vértice :math:`12` en un grafo **dirigido** usando la " +"heurística :math:`2`" msgid "RETURNS SET OF |result-1-m|" msgstr "" @@ -9094,18 +8838,18 @@ 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`" +"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 "RETURNS SET OF |result-m-1|" msgstr "" msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an " -"**undirected** graph with heuristic :math:`4`" +"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`" +"De los vértices :math:`\\{6, 8\\}` al vértice :math:`10` en un grafo **no " +"dirigido** usando la heurística :math:`4`" msgid "RETURNS SET OF |short-generic-result|" msgstr "" @@ -9114,15 +8858,14 @@ 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`" +"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`." +"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`." +"Usando una tabla de combinaciones en un grafo **dirigido** con factor :math:" +"`0.5`." msgid "The combinations table:" msgstr "La tabla de combinaciones:" @@ -9149,32 +8892,28 @@ msgid "Manually assigned vertex combinations." msgstr "Manualmente asignar combinaciones de vértices." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" msgid "pgr_aStarCost" msgstr "pgr_aStarCost" @@ -9183,8 +8922,7 @@ msgid "" "``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* " "algorithm." msgstr "" -"``pgr_aStarCost`` —Costo total de la ruta más corta usando el algoritmo " -":A*." +"``pgr_aStarCost`` —Costo total de la ruta más corta usando el algoritmo :A*." msgid "``pgr_aStarCost`` (`Combinations`_)" msgstr "``pgr_aStarCost`` (`Combinaciones`_)" @@ -9193,18 +8931,18 @@ msgid "New **proposed** function" msgstr "Nueva función **propuesta**" msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest " -"path(s) using the A* algorithm." +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) " +"using the A* algorithm." msgstr "" -"La función ``pgr_aStarCost`` sumarisa el costo de la ruta más corta " -"usando el algoritmo A*." +"La función ``pgr_aStarCost`` sumarisa el costo de la ruta más corta usando " +"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)`" +"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." @@ -9218,71 +8956,71 @@ msgstr "`start_vid` ascendente" msgid "`end_vid` ascending" msgstr "`end_vid` ascendente" -#, fuzzy msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -#, fuzzy msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -#, fuzzy msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." - -#, fuzzy -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +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**])" -#, fuzzy msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" +msgstr "" +"pgr_aStarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -#, fuzzy msgid "RETURNS SET OF |matrix-result|" -msgstr "Devuelve una matriz de costes." +msgstr "Regresa conjunto de |matrix-result|" -#, fuzzy msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" msgid "``pgr_aStarCostMatrix``" msgstr "``pgr_aStarCostMatrix``" msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using " -":doc:`pgr_aStar`." +"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" -"``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando " -":doc:`pgr_aStar`." +"``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" +"`pgr_aStar`." msgid "Using internaly the :doc:`pgr_aStar` algorithm" msgstr "Usando internamente el algoritmo :doc:`pgr_aStar`" @@ -9311,61 +9049,54 @@ 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" -#, fuzzy msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +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`" +"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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "``pgr_alphaShape``" msgstr "``pgr_alphaShape``" @@ -9386,7 +9117,8 @@ msgid "Boost Geometry is stable on Boost 1.56" msgstr "Boost Geometry es estable en Boost 1.56" msgid "Added alpha argument with default 0 (use optimal value)" -msgstr "Añadido argumento alfa con valor predeterminado 0 (usar el valor óptimo)" +msgstr "" +"Añadido argumento alfa con valor predeterminado 0 (usar el valor óptimo)" msgid "Support to return multiple outer/inner ring" msgstr "Soporte para devolver múltiples anillos exteriores/interiores" @@ -9406,7 +9138,8 @@ msgstr "La entrada es una *geometría* y devuelve una *geometría*" msgid "Uses PostGis ST_DelaunyTriangles" msgstr "Usa PostGis ST_DelaunyTriangles" -msgid "Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" +msgid "" +"Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" msgstr "" "En lugar de utilizar la definición de CGAL de `alpha` utiliza " "``spoon_radius`` el ''spoon_radius''" @@ -9415,34 +9148,32 @@ msgid ":math:`spoon\\_radius = \\sqrt alpha`" msgstr ":math:`spoon\\_radius = \\sqrt alpha`" msgid "" -"A Triangle area is considered part of the alpha shape when " -":math:`circumcenter\\ radius < spoon\\_radius`" +"A Triangle area is considered part of the alpha shape when :math:" +"`circumcenter\\ radius < spoon\\_radius`" msgstr "" -"Un área de triángulo se considera parte de la forma alfa cuando " -":math:`circumcenter\\ radius < spoon\\_radius`" +"Un área de triángulo se considera parte de la forma alfa cuando :math:" +"`circumcenter\\ radius < spoon\\_radius`" msgid "The ``alpha`` parameter is the **spoon radius**" msgstr "El parámetro ``alpha`` es el **radio de cuchara**" -msgid "When the total number of points is less than 3, returns an EMPTY geometry" +msgid "" +"When the total number of points is less than 3, returns an EMPTY geometry" msgstr "" -"Cuando el número total de puntos es menor que 3, devuelve una geometría " -"EMPTY" +"Cuando el número total de puntos es menor que 3, devuelve una geometría EMPTY" -#, fuzzy msgid "pgr_alphaShape(**geometry**, [alpha])" -msgstr "La entrada es una *geometría* y devuelve una *geometría*" +msgstr "pgr_alphaShape(**geometría**, [alpha])" -#, fuzzy msgid "RETURNS ``geometry``" -msgstr "``geometry``" +msgstr "REGRESA ``geometry``" msgid "" -"passing a geometry collection with spoon radius :math:`1.5` using the " -"return variable ``geom``" +"passing a geometry collection with spoon radius :math:`1.5` using the return " +"variable ``geom``" msgstr "" -"pasar una colección de geometrías con radio de cuchara :math:`1.5` usando" -" la variable de retorno ``geom``" +"pasar una colección de geometrías con radio de cuchara :math:`1.5` usando la " +"variable de retorno ``geom``" msgid "**geometry**" msgstr "**geometría**" @@ -9478,46 +9209,40 @@ msgid "`ST_ConcaveHull `__" msgstr "`ST_ConcaveHull `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "pgr_analyzeGraph" msgstr "pgr_analyzeGraph" @@ -9534,9 +9259,8 @@ msgstr "``OK`` Cuando el análisis ha terminado." msgid "``FAIL`` when the analysis was not completed due to an error." msgstr "``FAIL`` cuando el análisis no se completó debido a un error." -#, fuzzy msgid "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_analyzeGraph(**edge_table**, **tolerancia**, [**opciones**])" msgid "**options:** ``[the_geom, id, source, target, rows_where]``" msgstr "" @@ -9553,17 +9277,16 @@ msgid "" "corresponding vertices table _vertices_pgr that stores the " "vertices information." msgstr "" -"La tabla de bordes debe ser analizada debe contener una columna de origen" -" y una columna de destino llena con los identificadores de los vértices " -"de los segmentos y los vértices correspondientes de la tabla " +"La tabla de bordes debe ser analizada debe contener una columna de origen y " +"una columna de destino llena con los identificadores de los vértices de los " +"segmentos y los vértices correspondientes de la tabla " "_vertices_pgr que almacena la información de los vértices." msgid "Use :doc:`pgr_createVerticesTable` to create the vertices table." msgstr "Use :doc:`pgr_createVerticesTable` para crear la tabla de vértices." msgid "" -"Use :doc:`pgr_createTopology` to create the topology and the vertices " -"table." +"Use :doc:`pgr_createTopology` to create the topology and the vertices table." msgstr "Use :doc:`pgr_createTopology` para crear la topología y los vértices." msgid "The analyze graph function accepts the following parameters:" @@ -9578,7 +9301,8 @@ msgstr "``text`` La tabla de la red. (puede contener el nombre del esquema)" msgid "tolerance" msgstr "tolerancia" -msgid "``float8`` Snapping tolerance of disconnected edges. (in projection unit)" +msgid "" +"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" msgstr "" "``float8`` ajuste tolerancia de bordes desconectados. (en la unidad de " "proyección)" @@ -9600,8 +9324,8 @@ msgid "" "``text`` Primary key column name of the network table. Default value is " "``id``." msgstr "" -"``text``Nombre de la columna de la clave principal de la tabla de red. " -"Valor por defecto es ``id``." +"``text``Nombre de la columna de la clave principal de la tabla de red. Valor " +"por defecto es ``id``." msgid "source" msgstr "source" @@ -9620,15 +9344,15 @@ msgid "" "``text`` Target column name of the network table. Default value is " "``target``." msgstr "" -"``text`` El nombre de la columna del nodo de llegada del segmento. El " -"valor por defecto es ``target``." +"``text`` El nombre de la columna del nodo de llegada del segmento. El valor " +"por defecto es ``target``." msgid "rows_where" msgstr "rows_where" msgid "" -"``text`` Condition to select a subset or rows. Default value is " -"``true`` to indicate all rows." +"``text`` Condition to select a subset or rows. Default value is ``true`` " +"to indicate all rows." msgstr "" "``text`` condición para seleccionar un subconjunto o filas. Valor " "predeterminado es ``true`` para indicar todas las filas." @@ -9637,12 +9361,13 @@ msgid "Uses the vertices table: _vertices_pgr." msgstr "Utiliza la tabla de los vértices: _vertices_pgr." msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." -msgstr "Llena totalmente las columnas ``cnt`` y ``chk`` de la tabla de vértices." +msgstr "" +"Llena totalmente las columnas ``cnt`` y ``chk`` de la tabla de vértices." msgid "" -"Returns the analysis of the section of the network defined by " -"``rows_where``" -msgstr "Devuelve el análisis de la sección de la red definida por ``rows_where``" +"Returns the analysis of the section of the network defined by ``rows_where``" +msgstr "" +"Devuelve el análisis de la sección de la red definida por ``rows_where``" msgid "The vertices table is not found." msgstr "No se encuentra en la tabla de los vértices." @@ -9651,8 +9376,8 @@ msgid "" "A required column of the Network table is not found or is not of the " "appropriate type." msgstr "" -"Una columna de la tabla de red requerida no se encuentra o no es del tipo" -" apropiado." +"Una columna de la tabla de red requerida no se encuentra o no es del tipo " +"apropiado." msgid "The condition is not well formed." msgstr "La condición no está bien formada." @@ -9668,12 +9393,10 @@ msgstr "La tabla de vértices" msgid "" "The vertices table can be created with :doc:`pgr_createVerticesTable " -"` or :doc:`pgr_createTopology " -"`" +"` or :doc:`pgr_createTopology `" msgstr "" "Los vértices pueden ser creados con :doc:`pgr_createVerticesTable " -"` o :doc:`pgr_createTopology " -"`" +"` o :doc:`pgr_createTopology `" msgid "The structure of the vertices table is:" msgstr "La estructura de la tabla de los vértices es:" @@ -9685,8 +9408,7 @@ msgid "cnt" msgstr "cnt" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex." +"``integer`` Number of vertices in the edge_table that reference this vertex." msgstr "" "``integer`` Número de vértices en edge_table que hacen referencia a este " "vértice." @@ -9701,31 +9423,29 @@ msgid "ein" msgstr "ein" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming. See :doc:`pgr_analyzeOneWay `." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming. See :doc:`pgr_analyzeOneWay `." msgstr "" "``integer`` Número de vértices en edge_table que hacen referencia a este " -"vértice como entrante. Consulte " -":doc:`pgr_analyzeOneWay`." +"vértice como entrante. Consulte :doc:`pgr_analyzeOneWay`." msgid "eout" msgstr "eout" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing. See :doc:`pgr_analyzeOneWay `." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing. See :doc:`pgr_analyzeOneWay `." msgstr "" "``integer`` Número de vértices en edge_table que hacen referencia a este " -"vértice como saliente. Consulte :doc:`pgr_analyzeOneWay " -"`." +"vértice como saliente. Consulte :doc:`pgr_analyzeOneWay `." msgid "``geometry`` Point geometry of the vertex." msgstr "``geometry`` Valor de la geometría POINT del vértice." msgid "Usage when the edge table's columns MATCH the default values:" msgstr "" -"Uso cuando las columnas de la tabla de borde coinciden con los valores " -"por defecto:" +"Uso cuando las columnas de la tabla de borde coinciden con los valores por " +"defecto:" msgid "The simplest way to use pgr_analyzeGraph is:" msgstr "La forma más sencilla de usar pgr_analyzeGraph es:" @@ -9745,13 +9465,13 @@ msgid "the arguments are not given in the appropriate order:" msgstr "los argumentos se no se escriben en el orden apropiado:" msgid "" -"In this example, the column ``id`` of the table ``mytable`` is passed to " -"the function as the geometry column, and the geometry column ``the_geom``" -" is passed to the function as the id column." +"In this example, the column ``id`` of the table ``mytable`` is passed to the " +"function as the geometry column, and the geometry column ``the_geom`` is " +"passed to the function as the id column." msgstr "" "En este ejemplo, la columna ``id`` de la tabla ``mytable`` se pasa a la " -"función como geometría, y la columna de geometría ``the_geom`` se pasa a " -"la función de columna ``id``." +"función como geometría, y la columna de geometría ``the_geom`` se pasa a la " +"función de columna ``id``." msgid "When using the named notation" msgstr "Cuando se utiliza la notación por nombre" @@ -9760,40 +9480,40 @@ msgid "The order of the parameters do not matter:" msgstr "No importa el orden de los parámetros:" msgid "" -"Parameters defined with a default value can be omitted, as long as the " -"value matches the default:" +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default:" msgstr "" -"Parámetros definidos con un valor predeterminado se pueden omitir, " -"siempre y cuando el valor coincida con el valor por defecto:" +"Parámetros definidos con un valor predeterminado se pueden omitir, siempre y " +"cuando el valor coincida con el valor por defecto:" msgid "Selecting rows using rows_where parameter" msgstr "Seleccionar filas utilizando el parámetro rows_where" msgid "" -"Selecting rows based on the id. Displays the analysis a the section of " -"the network." +"Selecting rows based on the id. Displays the analysis a the section of the " +"network." msgstr "" -"La selección de filas basadas en el id. El análisis muestra una parte de " -"la red." +"La selección de filas basadas en el id. El análisis muestra una parte de la " +"red." msgid "" "Selecting the rows where the geometry is near the geometry of row with " "``id`` = 5" msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la" -" fila con ``id`` = 5" +"Seleccionar las filas donde la geometría está cerca de la geometría de la " +"fila con ``id`` = 5" msgid "" -"Selecting the rows where the geometry is near the geometry of the row " -"with ``gid`` =100 of the table ``othertable``." +"Selecting the rows where the geometry is near the geometry of the row with " +"``gid`` =100 of the table ``othertable``." msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la" -" fila con``gid`` =100 de la tabla ``othertable``." +"Seleccionar las filas donde la geometría está cerca de la geometría de la " +"fila con``gid`` =100 de la tabla ``othertable``." msgid "Usage when the edge table's columns DO NOT MATCH the default values:" msgstr "" -"Uso cuando las columnas de la tabla de borde NO COINCIDEN con los valores" -" por defecto:" +"Uso cuando las columnas de la tabla de borde NO COINCIDEN con los valores " +"por defecto:" msgid "For the following table" msgstr "Para la siguiente tabla" @@ -9801,7 +9521,8 @@ msgstr "Para la siguiente tabla" msgid "Using positional notation:" msgstr "Usando notación posicional:" -msgid "The arguments need to be given in the order described in the parameters:" +msgid "" +"The arguments need to be given in the order described in the parameters:" msgstr "Las discusiones deben recibir en el orden descrito en los parámetros:" msgid "" @@ -9810,19 +9531,19 @@ msgid "" "passed to the function as the geometry column, and the geometry column " "``mygeom`` is passed to the function as the id column." msgstr "" -"Un error puede ocurrir cuando los argumentos no se dan en el orden " -"adecuado: en este ejemplo, la columna ``gid`` de la tabla ``mytable`` se " -"pasa a la función como geometría, y la columna de geometría``mygeom`` se " -"pasa a la función como columna ``id``." +"Un error puede ocurrir cuando los argumentos no se dan en el orden adecuado: " +"en este ejemplo, la columna ``gid`` de la tabla ``mytable`` se pasa a la " +"función como geometría, y la columna de geometría``mygeom`` se pasa a la " +"función como columna ``id``." msgid "" "In this scenario omitting a parameter would create an error because the " "default values for the column names do not match the column names of the " "table." msgstr "" -"En este escenario omitir un parámetro crearía un error porque los valores" -" predeterminados de los nombres de columna no coinciden con los nombres " -"de columna de la tabla." +"En este escenario omitir un parámetro crearía un error porque los valores " +"predeterminados de los nombres de columna no coinciden con los nombres de " +"columna de la tabla." msgid "Selecting rows based on the id." msgstr "La selección de filas basadas en el id." @@ -9831,15 +9552,15 @@ msgid "" "Selecting the rows WHERE the geometry is near the geometry of row with " "``id`` =5 ." msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la" -" fila con ``id`` =5 ." +"Seleccionar las filas donde la geometría está cerca de la geometría de la " +"fila con ``id`` =5 ." msgid "" "Selecting the rows WHERE the geometry is near the place='myhouse' of the " "table ``othertable``. (note the use of quote_literal)" msgstr "" -"Seleccionar las filas donde la geometría está cerca de la place='myhouse'" -" de la tabla ``othertable``. (Nótese el uso de quote_literal)" +"Seleccionar las filas donde la geometría está cerca de la place='myhouse' de " +"la tabla ``othertable``. (Nótese el uso de quote_literal)" msgid "The examples use the :doc:`sampledata` network." msgstr "Los ejemplos usan la red de ejemplo :doc:`sampledata`." @@ -9854,46 +9575,40 @@ msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr ":doc:`pgr_nodeNetwork` para crear nodos en una tabla sin nodos." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "pgr_analyzeOneWay" msgstr "pgr_analyzeOneWay" @@ -9906,60 +9621,59 @@ msgstr "" "identifica los segmentos volteados." msgid "" -"This function analyzes oneway streets in a graph and identifies any " -"flipped segments." +"This function analyzes oneway streets in a graph and identifies any flipped " +"segments." msgstr "" -"Esta función analiza las calles unidireccionales en un gráfico e " -"identifica cualquier segmentos invertido." +"Esta función analiza las calles unidireccionales en un gráfico e identifica " +"cualquier segmentos invertido." msgid "" "The analyses of one way segments is pretty simple but can be a powerful " "tools to identifying some the potential problems created by setting the " -"direction of a segment the wrong way. A node is a `source` if it has " -"edges the exit from that node and no edges enter that node. Conversely, a" -" node is a `sink` if all edges enter the node but none exit that node. " -"For a `source` type node it is logically impossible to exist because no " -"vehicle can exit the node if no vehicle and enter the node. Likewise, if " -"you had a `sink` node you would have an infinite number of vehicle piling" -" up on this node because you can enter it but not leave it." -msgstr "" -"El análisis de segmentos que tienen un solo sentido es bastante simple, " -"pero a la vez ser una herramienta poderosa para identificar algunos " -"problemas potenciales que son creados al establecer la dirección de un " -"segmento de la manera equivocada. Un nodo es un `source` si tiene bordes " -"que salen de ese nodo y no hay bordes que entren a ese nodo. Por el " -"contrario, un nodo es un`sink` si todos los bordes entran al nodo pero " -"ninguno sale de ese nodo. Para un nodo `source` es lógicamente imposible " -"existir porque ningún vehículo puede salir del nodo o si algún vehículo " -"logró entrar en el nodo. Asimismo, si tuvieras un nodo `sink` tienes un " -"número infinito de vehículos que se van acumulando en este nodo porque no" -" pueden salir de el." - -msgid "" -"So why do we care if the are not feasible? Well if the direction of an " -"edge was reversed by mistake we could generate exactly these conditions. " -"Think about a divided highway and on the north bound lane one segment got" -" entered wrong or maybe a sequence of multiple segments got entered wrong" -" or maybe this happened on a round-about. The result would be potentially" -" a `source` and/or a `sink` node." -msgstr "" -"Así que ¿por qué nos importa si no es factibles? Si la dirección de un " -"borde se revirtió por error podríamos generar exactamente en estas " -"condiciones. Pensar en una carretera dividida y en el carril que va al " -"norte un segmento o varios segmentos fueron introducidos al revés, o tal " -"vez esto sucedió en una glorieta. El resultado sería potencialmente un " -"nodo `source` y/o a `sink` node." +"direction of a segment the wrong way. A node is a `source` if it has edges " +"the exit from that node and no edges enter that node. Conversely, a node is " +"a `sink` if all edges enter the node but none exit that node. For a `source` " +"type node it is logically impossible to exist because no vehicle can exit " +"the node if no vehicle and enter the node. Likewise, if you had a `sink` " +"node you would have an infinite number of vehicle piling up on this node " +"because you can enter it but not leave it." +msgstr "" +"El análisis de segmentos que tienen un solo sentido es bastante simple, pero " +"a la vez ser una herramienta poderosa para identificar algunos problemas " +"potenciales que son creados al establecer la dirección de un segmento de la " +"manera equivocada. Un nodo es un `source` si tiene bordes que salen de ese " +"nodo y no hay bordes que entren a ese nodo. Por el contrario, un nodo es " +"un`sink` si todos los bordes entran al nodo pero ninguno sale de ese nodo. " +"Para un nodo `source` es lógicamente imposible existir porque ningún " +"vehículo puede salir del nodo o si algún vehículo logró entrar en el nodo. " +"Asimismo, si tuvieras un nodo `sink` tienes un número infinito de vehículos " +"que se van acumulando en este nodo porque no pueden salir de el." + +msgid "" +"So why do we care if the are not feasible? Well if the direction of an edge " +"was reversed by mistake we could generate exactly these conditions. Think " +"about a divided highway and on the north bound lane one segment got entered " +"wrong or maybe a sequence of multiple segments got entered wrong or maybe " +"this happened on a round-about. The result would be potentially a `source` " +"and/or a `sink` node." +msgstr "" +"Así que ¿por qué nos importa si no es factibles? Si la dirección de un borde " +"se revirtió por error podríamos generar exactamente en estas condiciones. " +"Pensar en una carretera dividida y en el carril que va al norte un segmento " +"o varios segmentos fueron introducidos al revés, o tal vez esto sucedió en " +"una glorieta. El resultado sería potencialmente un nodo `source` y/o a " +"`sink` node." msgid "" "So by counting the number of edges entering and exiting each node we can " -"identify both `source` and `sink` nodes so that you can look at those " -"areas of your network to make repairs and/or report the problem back to " -"your data vendor." +"identify both `source` and `sink` nodes so that you can look at those areas " +"of your network to make repairs and/or report the problem back to your data " +"vendor." msgstr "" -"Así contando el número de aristas entrantes y salientes de cada nodo " -"podemos identificar los nodos `source` y `sink`, así que usted puede " -"mirar esas áreas de su red para hacer reparaciones o informar del " -"problema a su proveedor de datos." +"Así contando el número de aristas entrantes y salientes de cada nodo podemos " +"identificar los nodos `source` y `sink`, así que usted puede mirar esas " +"áreas de su red para hacer reparaciones o informar del problema a su " +"proveedor de datos." msgid "" "pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " @@ -10017,13 +9731,14 @@ msgstr "" "bidireccional. Valor predeterminado es``true``." msgid "" -"It is strongly recommended to use the named notation. See " -":doc:`pgr_createVerticesTable` or :doc:`pgr_createTopology` for examples." +"It is strongly recommended to use the named notation. See :doc:" +"`pgr_createVerticesTable` or :doc:`pgr_createTopology` for examples." msgstr "" -"Es ampliamente recomendable usar la notación nombrada . Ver ejemplos en: " -":doc:`pgr_createVerticesTable` o :doc:`pgr_createTopology`." +"Es ampliamente recomendable usar la notación nombrada . Ver ejemplos en: :" +"doc:`pgr_createVerticesTable` o :doc:`pgr_createTopology`." -msgid "Fills completely the ``ein`` and ``eout`` columns of the vertices table." +msgid "" +"Fills completely the ``ein`` and ``eout`` columns of the vertices table." msgstr "" "Se llena completamente las columnas de la tabla de vértices ``ein`` y " "``eout``." @@ -10036,82 +9751,82 @@ msgid "" "``oneway`` value would be counted as ``true`` for the source or target " "**in** or **out** condition." msgstr "" -"Las reglas se definen como un conjunto de textos que si encajan con el " -"valor de ``oneway`` se contara como ``true`` para las condiciones de el " -"origen o destino **in** o **out** ." +"Las reglas se definen como un conjunto de textos que si encajan con el valor " +"de ``oneway`` se contara como ``true`` para las condiciones de el origen o " +"destino **in** o **out** ." msgid "" -"The vertices table can be created with :doc:`pgr_createVerticesTable` or " -":doc:`pgr_createTopology`" +"The vertices table can be created with :doc:`pgr_createVerticesTable` or :" +"doc:`pgr_createTopology`" msgstr "" -"Los vértices pueden ser creados con :doc:`pgr_createVerticesTable` o " -":doc:`pgr_createTopology`" +"Los vértices pueden ser creados con :doc:`pgr_createVerticesTable` o :doc:" +"`pgr_createTopology`" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex. See :doc:`pgr_analyzeGgraph `." +"``integer`` Number of vertices in the edge_table that reference this vertex. " +"See :doc:`pgr_analyzeGgraph `." msgstr "" "``integer`` Número de vértices en edge_table que hacen referencia a este " "vértice. Consulte :doc:`pgr_analyzeGgraph `." msgid "" -"``integer`` Indicator that the vertex might have a problem. See " -":doc:`pgr_analyzeGraph `." +"``integer`` Indicator that the vertex might have a problem. See :doc:" +"`pgr_analyzeGraph `." msgstr "" -"``integer`` Indicador de que el vértice podría tener un problema. " -"Consulte :doc:`pgr_analyzeGraph `." +"``integer`` Indicador de que el vértice podría tener un problema. Consulte :" +"doc:`pgr_analyzeGraph `." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming." msgstr "" -"``integer`` número de vértices en la edge_table que hacen referencia a " -"este vértice como entrante." +"``integer`` número de vértices en la edge_table que hacen referencia a este " +"vértice como entrante." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing." msgstr "" -"``integer`` número de vértices en la edge_table que hacen referencia a " -"este vértice como saliente." +"``integer`` número de vértices en la edge_table que hacen referencia a este " +"vértice como saliente." msgid ":doc:`pgr_analyzeGraph`" msgstr ":doc:`pgr_analyzeGraph`" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_articulationPoints``" msgstr "``pgr_articulationPoints``" msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an " -"undirected graph." +"``pgr_articulationPoints`` - Return the articulation points of an undirected " +"graph." msgstr "" -"``pgr_articulationPoints`` - Devuelve los puntos de articulación de un " -"grafo no dirigido." +"``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo " +"no dirigido." msgid "Return columns change: ``seq`` is removed" msgstr "Cambio de columnas de retorno: ``seq`` se elimina" @@ -10123,17 +9838,16 @@ msgid "New **experimental** function" msgstr "Nueva función **experimental**" 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." +"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." +"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**." @@ -10144,13 +9858,11 @@ msgstr "``node`` ascendente" msgid "Running time: :math:`O(V + E)`" msgstr "Tiempo de ejecución: :math:`O(V + E)`" -#, fuzzy msgid "pgr_articulationPoints(`Edges SQL`_)" -msgstr "``pgr_articulationPoints``" +msgstr "pgr_articulationPoints(`SQL de aristas`_)" -#, fuzzy msgid "RETURNS SET OF |result-node|" -msgstr "Devuelve el conjunto de ``(node)``" +msgstr "REGRESA CONJUNTO DE |result-node|" msgid "The articulation points of the graph" msgstr "Los puntos de articulación del grafo" @@ -10158,61 +9870,54 @@ 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." -#, fuzzy msgid "Returns set of |result-node|" -msgstr "Devuelve el conjunto de ``(node)``" +msgstr "Regresa conjunto de |result-node|" msgid "" -"Boost: `Biconnected components & articulation points " -"`__" +"Boost: `Biconnected components & articulation points `__" msgstr "" -"Boost: `Componentes biconectados & y puntos de articulación " -"`__" +"Boost: `Componentes biconectados & y puntos de articulación `__" msgid "" -"wikipedia: `Biconnected component " -"`__" +"wikipedia: `Biconnected component `__" msgstr "" -"wikipedia: `Componentes biconnectados " -"`__" +"wikipedia: `Componentes biconnectados `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 `__ `2.0" -" `__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"`2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 `__ `2.0" -" `__" +"`2.2 `__ `2.1 `__ `2.0 `__" msgid "``pgr_bdAstar``" msgstr "``pgr_bdAstar``" @@ -10241,8 +9946,8 @@ msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" msgstr "**Oficial** ``pgr_bdAstar`` (`Uno a Uno`_)" msgid "" -"The results are equivalent to the union of the results of the " -"`pgr_bdAStar(` `One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the `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:" @@ -10256,51 +9961,50 @@ msgstr "`pgr_bdAstar(` `Muchos a Uno`_ `)`" msgid "`pgr_bdAstar(` `Many to Many`_ `)`" msgstr "`pgr_bdAstar(` `Muchos a Muchos`_ `)`" -#, fuzzy msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -#, fuzzy msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -#, fuzzy msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -#, fuzzy msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -#, fuzzy msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "``pgr_bdAstarCost`` (`Combinaciones`_)" +msgstr "pgr_bdAstar(`SQL de aristas`_, `SQL de combinations`_, [**opciones**])" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "pgr_bdAstarCost" msgstr "pgr_bdAstarCost" @@ -10309,8 +10013,8 @@ msgid "" "``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the " "bidirectional A* algorithm." msgstr "" -"``pgr_bdAstarCost`` - Devuelve el costo agregado de la ruta más corta " -"usando el algoritmo bidireccional A*." +"``pgr_bdAstarCost`` - Devuelve el costo agregado de la ruta más corta usando " +"el algoritmo bidireccional A*." msgid "``pgr_bdAstarCost`` (`Combinations`_)" msgstr "``pgr_bdAstarCost`` (`Combinaciones`_)" @@ -10322,110 +10026,107 @@ msgstr "" "La función ``pgr_bdAstarCost`` Sumariza el costo del camino más corto " "utilizando el algoritmo bidireccional A*." -#, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -#, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -#, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -#, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -#, fuzzy msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "``pgr_bdAstarCost`` (`Combinaciones`_)" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Ultima " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Versiones soportadas:** `Ultima `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_bdAstarCostMatrix``" msgstr "``pgr_bdAstarCostMatrix``" msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using " -":doc:`pgr_aStar`." +"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" -"``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando " -":doc:`pgr_aStar`." +"``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" +"`pgr_aStar`." msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" msgstr "Usando internamente el algoritmo :doc:`pgr_bdAstar`" -#, fuzzy msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." - -msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" +msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "``pgr_bdDijkstra``" msgstr "``pgr_bdDijkstra``" @@ -10434,8 +10135,8 @@ msgid "" "``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional " "Dijkstra algorithm." msgstr "" -"``pgr_bdDijkstra`` — Devuelve la(s) rutas más cortas mediante el " -"algoritmo Bidirectional Dijkstra." +"``pgr_bdDijkstra`` — Devuelve la(s) rutas más cortas mediante el algoritmo " +"Bidirectional Dijkstra." msgid "pgr_bdDijkstra(`Combinations`_)" msgstr "pgr_bdDijkstra(`Combinaciones`_)" @@ -10459,24 +10160,28 @@ msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" msgstr "**Oficial** ``pgr_bdDijkstra`` (`Uno a Uno`_)" #, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "" +"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -#, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" +"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -#, fuzzy msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +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**" @@ -10489,8 +10194,7 @@ msgstr "" "**dirigido**" msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** " -"graph" +"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**" @@ -10499,48 +10203,51 @@ 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**" +"De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un " +"grafo **no dirigido**" -#, fuzzy msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "Using a combinations table on an **undirected** graph" msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" -#, python-format -msgid "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf" -msgstr "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf" +msgid "" +"https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP" +"%20shortest%20path%20algorithms.pdf" +msgstr "" +"https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP" +"%20shortest%20path%20algorithms.pdf" msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_bdDijkstraCost``" msgstr "``pgr_bdDijkstraCost``" @@ -10556,129 +10263,127 @@ msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" msgstr "``pgr_bdDijkstraCost`` (`Combinaciones`_)" msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest" -" path using the bidirectional Dijkstra Algorithm." +"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " +"path using the bidirectional Dijkstra Algorithm." msgstr "" "La función ``pgr_bdDijkstraCost`` sumarisa el costo de la ruta más corta " "utilizando el algoritmo de bidirecional de Dijkstra." -#, fuzzy msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , " +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, " +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "" "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, " +"[``directed``])" -#, fuzzy msgid "" "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, " +"[``directed``])" -#, fuzzy msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " +"[``directed``])" -#, fuzzy msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " +"[``directed``])" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ `3.1" -" `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ `3.1" -" `__ " -"`3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5" -" `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5" -" `__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "``pgr_bdDijkstraCostMatrix``" msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_bdDijkstra`." +"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_bdDijkstra`." msgstr "" -"``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando " -":doc:`pgr_bdDijkstra`." +"``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:" +"`pgr_bdDijkstra`." msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost " -"matrix." +"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" "Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una " "matriz de costos." -#, fuzzy msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, 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**" +"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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "``pgr_bellmanFord - Experimental``" msgstr "``pgr_bellmanFord`` - Experimental" msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm." msgstr "" -"``pgr_bellmanFord`` —Camino m+as corto usando el algoritmo de Bellman-" -"Ford." +"``pgr_bellmanFord`` —Camino m+as corto usando el algoritmo de Bellman-Ford." msgid "New **experimental** signature:" msgstr "Nueva firma **experimental**:" @@ -10702,61 +10407,62 @@ msgid "``pgr_bellmanFord`` (`Many to Many`_)" msgstr "``pgr_bellmanFord`` (`Muchos a Muchos`_)" 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." +"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." +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`." +"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`." +"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." +"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." +"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." +"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." +"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`." +"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 " @@ -10768,88 +10474,76 @@ msgstr "" msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`" -#, fuzzy -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -#, fuzzy -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -#, fuzzy msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "" +"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -#, fuzzy msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -#, fuzzy msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_bellmanFord(`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" +"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " +"graph" msgstr "" -"Desde el vértice :math:`6` a los vértices :math:`\\{ 10, 17\\}` en un " -"grafo **dirigido**" +"Desde el vértice :math:`6` a los vértices :math:`\\{ 10, 17\\}` en un grafo " +"**dirigido**" -#, fuzzy -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" msgid "Using a combinations table on an **undirected** graph." msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**." -#, python-format msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 " -"`__ " -"`3.2 " -"`__ " -"`3.1 " -"`__ " -"`3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 " -"`__) " -"`3.3 " -"`__ " -"`3.2 " -"`__ " -"`3.1 " -"`__ " -"`3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ " -"`2.5 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ " -"`2.5 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" @@ -10871,20 +10565,20 @@ 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." +"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 " +"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." +"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." @@ -10895,20 +10589,17 @@ msgstr "``componente`` ascendente." msgid "``edge`` ascending." msgstr "``edge`` ascendente." -#, fuzzy msgid "pgr_biconnectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents" +msgstr "pgr_biconnectedComponents(`SQL de aristas`_)" -#, fuzzy msgid "RETURNS SET OF |result-component-E|" -msgstr "Devuelve el conjunto de``(seq, component, node)``" +msgstr "REGRESA CONJUNTO DE |result-component-E|" msgid "The biconnected components of the graph" msgstr "Los componentes biconectados del grafo" -#, fuzzy msgid "Returns set of |result-component-E|" -msgstr "Devuelve el conjunto de``(seq, component, node)``" +msgstr "Regresa conjunto de |result-component-E|" msgid "``component``" msgstr "``component``" @@ -10923,47 +10614,41 @@ msgid "Identifier of the edge that belongs to the ``component``." msgstr "Identificador de arista que pertenece a ``component``." msgid "" -"Boost: `Biconnected components " -"`__" +"Boost: `Biconnected components `__" msgstr "" -"Boost: `Componentes Biconectados " -"`__" +"Boost: `Componentes Biconectados `__" msgid "" -"**Supported versions:** `Latest " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__ " -"`3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__ " -"`3.2 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a " -"binary graph." +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary " +"graph." msgstr "" "``pgr_binaryBreadthFirstSearch`` — Regresa los caminos más cortos 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'." +"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'." +"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`_)" @@ -10982,93 +10667,97 @@ msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Muchos`_)" 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 alledges in graph have the same weight, that we" -" need a more general algorithm, like Dijkstra's Algorithm which runs in " -":math:`O(|E|log|V|)` time." -msgstr "" -"Es bien sabido que las rutas más cortas entre una sola fuente y todos los" -" demás vértices se pueden encontrar usando Breadth First Search en " -":math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el " -"número mínimo de aristas que necesita atravesar desde el origen a otro " -"vértice. Podemos interpretar tal grafo también como un grafo ponderado, " -"donde cada arista tiene el peso 1. Si no todas las aristas del grafo " -"tienen el mismo peso, que necesitamos un algoritmo más general, como el " -"Algoritmo de Dijkstra que se ejecuta en :math:`O(|E|log|V|)` tiempo." - -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.)" +"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 alledges in graph have the same weight, that we need a more " +"general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" +"V|)` time." +msgstr "" +"Es bien sabido que las rutas más cortas entre una sola fuente y todos los " +"demás vértices se pueden encontrar usando Breadth First Search en :math:`O(|" +"E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de " +"aristas que necesita atravesar desde el origen a otro vértice. Podemos " +"interpretar tal grafo también como un grafo ponderado, donde cada arista " +"tiene el peso 1. Si no todas las aristas del grafo tienen el mismo peso, que " +"necesitamos un algoritmo más general, como el Algoritmo de Dijkstra que se " +"ejecuta en :math:`O(|E|log|V|)` tiempo." + +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|)`" -#, fuzzy msgid "" "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, " +"[``directed``])" -#, fuzzy msgid "" "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, " +"[``directed``])" -#, fuzzy msgid "" "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, " +"[``directed``])" -#, fuzzy msgid "" "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, " +"[``directed``])" -#, fuzzy msgid "" "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **Combinations SQL**, " "[``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" +msgstr "" msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same " -"(i.e :math:`1``)" +"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" +"math:`1``)" msgstr "" -"**Nota:** Usando la red de :doc:`BFS-category` como todos los pesos son " -"los mismos (i.e :math:`1``)" +"**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los " +"mismos (i.e :math:`1``)" -#, fuzzy msgid "" "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " "[``directed``])" -msgstr "pgr_binaryBreadthFirstSearch(`Combinaciones`_)" +msgstr "" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, " +"[``directed``])" msgid "Optional Parameters" msgstr "Parámetros opcionales" @@ -11076,22 +10765,23 @@ msgstr "Parámetros opcionales" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "https://cp-algorithms.com/graph/01_bfs.html" -#, python-format -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "pgr_bipartite -Experimental" msgstr "pgr_bipartite - Experimental" @@ -11100,22 +10790,22 @@ 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." +"``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el " +"mismo conjunto son adjacentes." msgid "New **experimental** signature" msgstr "Nueva función **experimental**" 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." +"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." +"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." @@ -11124,9 +10814,9 @@ 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." +"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 bi-partido o no. Si es bipartido, " "devuelve el nodo junto con dos colores `0` y `1` que representan dos " @@ -11135,13 +10825,11 @@ msgstr "" 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." -#, fuzzy msgid "pgr_bipartite(`Edges SQL`_)" -msgstr "pgr_bipartite" +msgstr "pgr_bipartite(`SQL de aristas`_)" -#, fuzzy msgid "RETURNS SET OF |result-node-color|" -msgstr "Devuelve el conjunto de ``(node)``" +msgstr "REGRESA CONJUNTO DE |result-node-color|" msgid "When the graph is bipartite" msgstr "Cuando el grafo es bi-partido" @@ -11153,56 +10841,53 @@ 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." +"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." +"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 "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ " -"`2.3 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ " -"`2.3 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" 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." +"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 " @@ -11226,25 +10911,20 @@ msgstr "Nueva función **Experimental**" msgid "Running time: Polynomial" msgstr "Tiempo de ejecución: Polinomio" -#, fuzzy msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destino**)" -#, fuzzy msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destinos**)" -#, fuzzy msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destino**)" -#, fuzzy msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destinos**)" -#, fuzzy msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "``pgr_boykovKolmogorov`` (`Combinaciones`_)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "RETURNS SET OF |result-flow|" msgstr "" @@ -11258,47 +10938,48 @@ 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\\}`" +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\\}`" +"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\\}`." +"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\\}`." +"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 "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" msgstr "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "``pgr_breadthFirstSearch`` - Experimental" msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth" -" First Search algorithm." +"``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." +"``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante " +"el algoritmo Breadth First Search." msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" msgstr "``pgr_breadthFirstSearch`` (`Vértice único`_)" @@ -11307,32 +10988,30 @@ msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" msgstr "``pgr_breadthFirstSearch`` (`Múltiples Vértices`_)" msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a" -" particular depth." +"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." +"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." +"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." +"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)`" -#, fuzzy msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raíz**, [**options**])" -#, fuzzy msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])" msgid "**options:** ``[max_depth, directed]``" msgstr "" @@ -11344,8 +11023,8 @@ msgid "Single vertex" msgstr "Vértice único" msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in " -"ascending order of ``id``" +"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``" @@ -11374,12 +11053,12 @@ 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." +"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." +"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|" @@ -11391,44 +11070,42 @@ msgid "descending" msgstr "descendente" msgid "" -"`Boost: Breadth First Search algorithm documentation " -"`__" +"`Boost: Breadth First Search algorithm documentation `__" msgstr "" -"`Boost: Breadth First Search " -"`__" +"`Boost: Breadth First Search `__" msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +"`Wikipedia: Breadth First Search algorithm `__" msgstr "" "`Wikipedia: Breadth First Search `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_bridges``" msgstr "``pgr_bridges``" @@ -11438,12 +11115,12 @@ 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." +"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." +"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" @@ -11451,63 +11128,56 @@ msgstr "``edge`` ascendente" msgid "Running time: :math:`O(E * (V + E))`" msgstr "Tiempo de ejecución: :math:`O(E * (V + E))`" -#, fuzzy msgid "pgr_bridges(`Edges SQL`_)" -msgstr "pgr_bipartite" +msgstr "pgr_bridges(`SQL de aristas`_)" -#, fuzzy msgid "RETURNS SET OF |result-edge|" -msgstr "Devuelve el conjunto de ``(edge)``" +msgstr "REGRESA CONJUNTO DE |result-edge|" msgid "The bridges of the graph" msgstr "Los puentes del grafo" -#, fuzzy msgid "Returns set of |result-edge|" -msgstr "Devuelve el conjunto de ``(edge)``" +msgstr "Regresa conjunto de |result-edge|" msgid "Identifier of the edge that is a bridge." msgstr "Identificador del borde que es un puente." -#, python-format msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgid "" -"**Supported versions** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" 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." +"``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." +"``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" -#, fuzzy msgid "pgr_chinesePostman(`Edges SQL`_)" -msgstr "``pgr_chinesepostmancost``" +msgstr "pgr_chinesePostman(`SQL de aristas`_)" msgid "RETURNS SET OF |result-1-1-no-seq|" msgstr "" @@ -11519,51 +11189,49 @@ 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." +"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." +"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 "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Versiones soportadas:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" 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." +"``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." +"circuito que contiene cada arista de un grafo dirigido y comienza y termina " +"en el mismo vértice." -#, fuzzy msgid "Return value when the graph if disconnected" -msgstr "[TBD] Valor devuelto cuando el grafo está desconectado" +msgstr "Valor devuelto cuando el grafo está desconectado" -#, fuzzy msgid "pgr_chinesePostmanCost(`Edges SQL`_)" -msgstr "``pgr_chinesepostmancost``" +msgstr "pgr_chinesePostmanCost(`SQL de aristas`_)" msgid "RETURNS ``FLOAT``" msgstr "" @@ -11575,46 +11243,44 @@ msgid "Minimum costs of a circuit path." msgstr "Costes mínimos de una trayectoria de circuito." msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "pgr_connectedComponents" msgstr "pgr_connectedComponents" msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph" -" using a DFS-based approach." +"``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." +"``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." +"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í." @@ -11625,20 +11291,17 @@ msgstr "Los componentes se describen mediante vértices" msgid "``component`` ascending" msgstr "``component`` ascendente" -#, fuzzy msgid "pgr_connectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents" +msgstr "pgr_connectedComponents(`SQL de aristas`_)" -#, fuzzy msgid "RETURNS SET OF |result-component-V|" -msgstr "Devuelve el conjunto de``(seq, component, node)``" +msgstr "REGRESA CONJUNTO DE |result-component-V|" msgid "The connected components of the graph" msgstr "Los componentes conectados del grafo" -#, fuzzy msgid "Returns set of |result-component-V|" -msgstr "Devuelve el conjunto de``(seq, component, node)``" +msgstr "Regresa conjunto de |result-component-V|" 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." @@ -11650,55 +11313,55 @@ msgid "Connecting disconnected components" msgstr "Conectando componentes desconectados" msgid "" -"Boost: `Connected components " -"`__" +"Boost: `Connected components `__" msgstr "" -"Boost: `Componente conectado " -"`__" +"Boost: `Componente conectado `__" msgid "" -"wikipedia: `Connected component " -"`__" +"wikipedia: `Connected component `__" msgstr "" -"wikipedia: `Componente conectado " -"`__" +"wikipedia: `Componente conectado `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_contraction``" msgstr "``pgr_contraction``" msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the " -"contracted vertices and edges." +"``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.." @@ -11710,15 +11373,14 @@ 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." +"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." +"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 completo contraído" @@ -11756,9 +11418,9 @@ msgstr "columna ``id`` descendente cuando el tipo = ``e``" msgid "The pgr_contraction function has the following signature:" msgstr "La función pgr_contraction tiene la siguiente firma:" -#, fuzzy msgid "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_contraction(`SQL de aristas`_, **orden de contracción**, [**opciones**])" msgid "**options:** ``[ max_cycles, forbidden_vertices, directed]``" msgstr "" @@ -11770,8 +11432,8 @@ msgid "" "Making a 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." +"Hacer una contracción de callejón sin salida y una contracción lineal en ese " +"orden en un grafo no dirigido." msgid "**contraction Order**" msgstr "**Orden de contracciones**" @@ -11801,11 +11463,11 @@ msgid ":math:`1`" msgstr ":math:`1`" msgid "" -"Number of times the contraction operations on ``contraction_order`` will " -"be performed." +"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``." +"Número de veces que se realizarán las operaciones de contracción en el orden " +"``contraction_order``." msgid "Returns set of |result-contract|" msgstr "" @@ -11850,8 +11512,8 @@ 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." +"Representando un pseudo `id` como no incorporado en el conjunto de aristas " +"originales." msgid "Array of contracted vertex identifiers." msgstr "Arreglo de identificadores de vértices contraídos." @@ -11860,22 +11522,21 @@ 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``)." +"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``)." +"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``)." +"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``)." +"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" "En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, " "``target``)." @@ -11887,46 +11548,42 @@ msgid "Only linear contraction" msgstr "Sólo contracción lineal" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " +"`__" +msgstr "" +"**Versiones soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " +"`__" msgid "pgr_createTopology" msgstr "pgr_createTopology" @@ -11947,8 +11604,7 @@ msgstr "" msgid "``FAIL`` when the network topology was not built due to an error." msgstr "" -"``FAIL`` cuando el la red topológica no se no se completó debido a un " -"error." +"``FAIL`` cuando el la red topológica no se no se completó debido a un error." msgid "pgr_createTopology(edge_table, tolerance, [**options**])" msgstr "" @@ -11957,28 +11613,28 @@ msgid "**options:** ``[the_geom, id, source, target, rows_where, clean]``" msgstr "" msgid "The topology creation function accepts the following parameters:" -msgstr "La función de creación de topología requiere los siguientes parámetros:" +msgstr "" +"La función de creación de topología requiere los siguientes parámetros:" msgid "``text`` Network table name. (may contain the schema name AS well)" msgstr "``text`` La tabla de la red. (puede contener el nombre del esquema)" msgid "" -"``text`` Condition to SELECT a subset or rows. Default value is " -"``true`` to indicate all rows that where ``source`` or ``target`` have a " -"null value, otherwise the condition is used." +"``text`` Condition to SELECT a subset or rows. Default value is ``true`` " +"to indicate all rows that where ``source`` or ``target`` have a null value, " +"otherwise the condition is used." msgstr "" "``text`` Condición para SELECCIONAR un subconjunto de filas. El valor " -"predeterminado es ``true`` para indicar todas las filas donde ``source`` " -"o ``target`` tienen un valor nulo, de lo contrario se utiliza la " -"condición." +"predeterminado es ``true`` para indicar todas las filas donde ``source`` o " +"``target`` tienen un valor nulo, de lo contrario se utiliza la condición." msgid "clean" msgstr "limpio" msgid "``boolean`` Clean any previous topology. Default value is ``false``." msgstr "" -"``boolean`` Limpie cualquier topología previa. El valor predeterminado es" -" ``false``." +"``boolean`` Limpie cualquier topología previa. El valor predeterminado es " +"``false``." msgid "The ``edge_table`` will be affected" msgstr "La ``edge_table`` se verán afectados" @@ -11990,8 +11646,8 @@ msgid "The ``target`` column values will change." msgstr "Cambian los valores de la columna``target``." msgid "" -"An index will be created, if it doesn't exists, to speed up the process " -"to the following columns:" +"An index will be created, if it doesn't exists, to speed up the process to " +"the following columns:" msgstr "" "Un índice será creado, si no existe, para acelerar el proceso para las " "columnas siguientes:" @@ -12009,8 +11665,8 @@ msgid "Fills ``id`` and ``the_geom`` columns of the vertices table." msgstr "Llena las columnas ``id`` y ``the_geom`` de la tabla de vértices." msgid "" -"Fills the source and target columns of the edge table referencing the " -"``id`` of the vertices table." +"Fills the source and target columns of the edge table referencing the ``id`` " +"of the vertices table." msgstr "" "Llena las columnas los origen y destino de la tabla de borde haciendo " "referencia al ``id`` de la tabla de los vértices." @@ -12019,46 +11675,46 @@ msgid "``FAIL`` when the network topology was not built due to an error:" msgstr "``FAIL`` cuando la topología de red no se construyó debido a un error:" msgid "" -"The vertices table is a requirement of the :doc:`pgr_analyzeGraph` and " -"the :doc:`pgr_analyzeOneWay` functions." +"The vertices table is a requirement of the :doc:`pgr_analyzeGraph` and the :" +"doc:`pgr_analyzeOneWay` functions." msgstr "" -"La tabla de vértices es un requerimiento de las funciones " -":doc:`pgr_analyzeGraph` y :doc:`pgr_analyzeOneWay`." +"La tabla de vértices es un requerimiento de las funciones :doc:" +"`pgr_analyzeGraph` y :doc:`pgr_analyzeOneWay`." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex. See :doc:`pgr_analyzeGraph`." +"``integer`` Number of vertices in the edge_table that reference this vertex. " +"See :doc:`pgr_analyzeGraph`." msgstr "" "``integer`` Número de vértices en la edge_table que referencian este " "vértice. Ver :doc:`pgr_analyzeGraph`." msgid "" -"``integer`` Indicator that the vertex might have a problem. See " -":doc:`pgr_analyzeGraph`." +"``integer`` Indicator that the vertex might have a problem. See :doc:" +"`pgr_analyzeGraph`." msgstr "" -"``integer`` Indicador de que el vértice podría tener un problema. " -"Consulte :doc:`pgr_analyzeGraph`." +"``integer`` Indicador de que el vértice podría tener un problema. Consulte :" +"doc:`pgr_analyzeGraph`." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex AS incoming. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"AS incoming. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer`` Número de vértices en edge_table que referencian a este " -"vértice como (AS) entrante. Ver :doc:`pgr_analyzeOneWay " -"`." +"``integer`` Número de vértices en edge_table que referencian a este vértice " +"como (AS) entrante. Ver :doc:`pgr_analyzeOneWay `." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex AS outgoing. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"AS outgoing. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer`` Número de vértices en edge_table que referencian este vértice" -" como (AS) saliente. Ver :doc:`pgr_analyzeOneWay `." +"``integer`` Número de vértices en edge_table que referencian este vértice " +"como (AS) saliente. Ver :doc:`pgr_analyzeOneWay `." msgid "The simplest way to use pgr_createTopology is:" msgstr "La forma más sencilla de utilizar pgr_createTopology es:" msgid "When the arguments are given in the order described:" -msgstr "Cuando los argumentos se escriben en el orden descrito en los parámetros:" +msgstr "" +"Cuando los argumentos se escriben en el orden descrito en los parámetros:" msgid "We get the same result AS the simplest way to use the function." msgstr "" @@ -12073,34 +11729,34 @@ msgid "" msgstr "" msgid "" -"Parameters defined with a default value can be omitted, as long as the " -"value matches the default And The order of the parameters would not " -"matter." +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default And The order of the parameters would not matter." msgstr "" "Los parámetros definidos con un valor predeterminado se pueden omitir, " -"siempre que el valor coincida con el valor predeterminado y el orden de " -"los parámetros no importaría." +"siempre que el valor coincida con el valor predeterminado y el orden de los " +"parámetros no importaría." msgid "" -"Selecting the rows where the geometry is near the geometry of row with " -"``id = 5``." +"Selecting the rows where the geometry is near the geometry of row with ``id " +"= 5``." msgstr "" -"Selección de las filas en las que la geometría está cerca de la geometría" -" de la fila con ``id = 5``." +"Selección de las filas en las que la geometría está cerca de la geometría de " +"la fila con ``id = 5``." -msgid "The arguments need to be given in the order described in the parameters." +msgid "" +"The arguments need to be given in the order described in the parameters." msgstr "Los argumentos deben darse en el orden descrito en los parámetros." msgid "" -"Note that this example uses clean flag. So it recreates the whole " -"vertices table." +"Note that this example uses clean flag. So it recreates the whole vertices " +"table." msgstr "" "Tenga en cuenta que en este ejemplo se utiliza la marca clean. Así que " "recrea toda la tabla de vértices." msgid "" -"An error would occur when the arguments are not given in the appropiriate" -" order: In this example, the column ``gid`` of the table ``mytable`` is " +"An error would occur when the arguments are not given in the appropiriate " +"order: In this example, the column ``gid`` of the table ``mytable`` is " "passed to the function AS the geometry column, and the geometry column " "``mygeom`` is passed to the function AS the id column." msgstr "" @@ -12110,9 +11766,9 @@ msgid "" "default values for the column names do not match the column names of the " "table. The order of the parameters do not matter:" msgstr "" -"En este escenario omitir un parámetro crearía un error porque los valores" -" predeterminados para los nombres de columna no coinciden con los nombres" -" de columna de la tabla. El orden de los parámetros no importa:" +"En este escenario omitir un parámetro crearía un error porque los valores " +"predeterminados para los nombres de columna no coinciden con los nombres de " +"columna de la tabla. El orden de los parámetros no importa:" msgid "Based on id:" msgstr "Basado en id:" @@ -12121,8 +11777,8 @@ msgid "Create a routing topology" msgstr "Creación de una topología de ruteo" msgid "" -"An alternate method to create a routing topology use " -":doc:`pgr_extractVertices`" +"An alternate method to create a routing topology use :doc:" +"`pgr_extractVertices`" msgstr "" msgid "Make sure the database does not have the ``vertices_table``" @@ -12135,8 +11791,7 @@ msgid "Create the vertices table" msgstr "Crear la tabla de vértices" msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, " -")``" +"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" msgid "For big edge tables that are been prepared," @@ -12170,8 +11825,8 @@ msgid "With full output" msgstr "Con salida completa" msgid "" -"This example start a clean topology, with 5 edges, and then its " -"incremented to the rest of the edges." +"This example start a clean topology, with 5 edges, and then its incremented " +"to the rest of the edges." msgstr "" "En este ejemplo se inicia una topología limpia, con 5 aristas y, a " "continuación, se incrementa al resto de los bordes." @@ -12180,55 +11835,49 @@ msgid "The example uses the :doc:`sampledata` network." msgstr "En el ejemplo se utiliza la red :doc:`sampledata`." msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" -msgstr "" -"**Versiones soportadas** `Última " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "pgr_createVerticesTable" msgstr "pgr_createVerticesTable" msgid "" -"``pgr_createVerticesTable`` — Reconstructs the vertices table based on " -"the source and target information." +"``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " +"source and target information." msgstr "" "``pgr_createVerticesTable`` — para reconstruir la tabla de vértices " "basándose en la información de origen y de destino." @@ -12237,7 +11886,8 @@ msgid "``OK`` after the vertices table has been reconstructed." msgstr "``OK`` después de que se ha construido la tabla de vértices." msgid "``FAIL`` when the vertices table was not reconstructed due to an error." -msgstr "``FAIL`` cuando la tabla de vértices no se construyó debido a un error." +msgstr "" +"``FAIL`` cuando la tabla de vértices no se construyó debido a un error." msgid "" "pgr_createVerticesTable(edge_table, [``the_geom, source, target, " @@ -12252,8 +11902,8 @@ msgstr "" "siguientes parámetros:" msgid "" -"``text`` Condition to SELECT a subset or rows. Default value is " -"``true`` to indicate all rows." +"``text`` Condition to SELECT a subset or rows. Default value is ``true`` " +"to indicate all rows." msgstr "" "``text`` condición para seleccionar un subconjunto o filas. Valor " "predeterminado es ``true`` para indicar todas las filas." @@ -12262,51 +11912,51 @@ msgid "" "Fills ``id`` and ``the_geom`` columns of the vertices table based on the " "source and target columns of the edge table." msgstr "" -"Llena las columnas ``id`` y ``the_geom`` de la tabla de vértices basado " -"en la información de la fuente y el destino." +"Llena las columnas ``id`` y ``the_geom`` de la tabla de vértices basado en " +"la información de la fuente y el destino." msgid "The names of source, target are the same." msgstr "Los nombres de los campos de origen y destino son las mismos." msgid "" -"The vertices table is a requierment of the :doc:`pgr_analyzeGraph` and " -"the :doc:`pgr_analyzeOneWay` functions." +"The vertices table is a requierment of the :doc:`pgr_analyzeGraph` and the :" +"doc:`pgr_analyzeOneWay` functions." msgstr "" -"La tabla de vértices es un requerimiento de las funciones " -":doc:`pgr_analyzeGraph` y :doc:`pgr_analyzeOneWay`." +"La tabla de vértices es un requerimiento de las funciones :doc:" +"`pgr_analyzeGraph` y :doc:`pgr_analyzeOneWay`." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming. See :doc:`pgr_analyzeOneWay`." msgstr "" "``integer`` Número de vértices en edge_table que hacen referencia a este " "vértice como entrante. Consulte :doc:`pgr_analyzeOneWay`." msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing. See :doc:`pgr_analyzeOneWay`." msgstr "" -"``integer`` Número de vértices en el edge_table que hacen referencia a " -"este vértice como saliente. Consulte :doc:`pgr_analyzeOneWay`." +"``integer`` Número de vértices en el edge_table que hacen referencia a este " +"vértice como saliente. Consulte :doc:`pgr_analyzeOneWay`." msgid "The simplest way to use pgr_createVerticesTable" msgstr "La forma más sencilla de utilizar pgr_createVerticesTable" msgid "When the arguments are given in the order described in the parameters:" -msgstr "Cuando los argumentos se escriben en el orden descrito en los parámetros:" +msgstr "" +"Cuando los argumentos se escriben en el orden descrito en los parámetros:" msgid "" "An error would occur when the arguments are not given in the appropriate " "order: In this example, the column source column ``source`` of the table " "``mytable`` is passed to the function as the geometry column, and the " -"geometry column ``the_geom`` is passed to the function as the source " -"column." +"geometry column ``the_geom`` is passed to the function as the source column." msgstr "" -"Se producirá un error cuando los argumentos no se proporcionan en el " -"orden adecuado: en este ejemplo, la columna de origen de columna ' " -"``source`` de la tabla ``mytable`` se pasa a la función como la columna " -"de geometría, y la columna de geometría ``the_geom`` se pasa a la función" -" como la columna de origen." +"Se producirá un error cuando los argumentos no se proporcionan en el orden " +"adecuado: en este ejemplo, la columna de origen de columna ' ``source`` de " +"la tabla ``mytable`` se pasa a la función como la columna de geometría, y la " +"columna de geometría ``the_geom`` se pasa a la función como la columna de " +"origen." msgid "Example 4" msgstr "Ejemplo 4" @@ -12327,8 +11977,8 @@ msgid "" "Selecting the rows where the geometry is near the geometry of row with " "``id`` =5 ." msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la" -" fila con ``id`` =5." +"Seleccionar las filas donde la geometría está cerca de la geometría de la " +"fila con ``id`` =5." msgid "Example 8" msgstr "Ejemplo 8" @@ -12345,10 +11995,10 @@ msgid "" "passed to the function as the geometry column, and the geometry column " "``mygeom`` is passed to the function as the source column." msgstr "" -"Se producirá un error cuando los argumentos no se dan en el orden " -"adecuado: en este ejemplo, la columna ``src`` de la tabla ``mytable`` se " -"pasa a la función como la columna de geometría, y la columna de geometría" -" ``mygeom`` se pasa a la función como columna de origen." +"Se producirá un error cuando los argumentos no se dan en el orden adecuado: " +"en este ejemplo, la columna ``src`` de la tabla ``mytable`` se pasa a la " +"función como la columna de geometría, y la columna de geometría ``mygeom`` " +"se pasa a la función como columna de origen." msgid "Example 10" msgstr "Ejemplo 10" @@ -12375,8 +12025,8 @@ msgid "" "Selecting the rows where the geometry is near the geometry of row with " "``gid`` = 5." msgstr "" -"Selección de las filas en las que la geometría está cerca de la geometría" -" de la fila con ``gid`` = 5." +"Selección de las filas en las que la geometría está cerca de la geometría de " +"la fila con ``gid`` = 5." msgid "Example 15" msgstr "Ejemplo 15" @@ -12394,151 +12044,137 @@ msgid "" ":doc:`topology-functions` for an overview of a topology for routing " "algorithms." msgstr "" -":doc:`topology-functions` para obtener una visión general de una " -"topología para algoritmos de ruteo." +":doc:`topology-functions` para obtener una visión general de una topología " +"para algoritmos de ruteo." msgid "" -":doc:`pgr_createTopology` ` to create a topology " -"based on the geometry." +":doc:`pgr_createTopology` ` to create a topology based " +"on the geometry." msgstr "" -":doc:`pgr_createTopology` ` para crear una topología" -" basada en la geometría." +":doc:`pgr_createTopology` ` para crear una topología " +"basada en la geometría." msgid "" -":doc:`pgr_analyzeGraph` to analyze the edges and vertices of the edge " -"table." +":doc:`pgr_analyzeGraph` to analyze the edges and vertices of the edge table." msgstr "" -":doc:`pgr_analyzeGraph` para analizar los bordes y vértices de la tabla " -"de bordes." +":doc:`pgr_analyzeGraph` para analizar los bordes y vértices de la tabla de " +"bordes." msgid ":doc:`pgr_analyzeOneWay` to analyze directionality of the edges." -msgstr ":doc:`pgr_analyzeOneWay` para analizar la direccionalidad de los bordes." +msgstr "" +":doc:`pgr_analyzeOneWay` para analizar la direccionalidad de los bordes." -#, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__)" +"**Versiones Soportadas:** `Última `__ (`3.4 `__)" -#, fuzzy msgid "``pgr_cuthillMckeeOrdering`` - Experimental" -msgstr "pgr_edgeColoring - Experimental" +msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" -#, fuzzy msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering" -" of an undirected graphs" +"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " +"an undirected graphs" msgstr "" -"``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos " -"acíclicos" +"``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." +"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 "" 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." +"that at each step, the adjacent vertices are placed in the queue in order of " +"increasing degree." msgstr "" -#, fuzzy msgid "The implementation is for **undirected** graphs." -msgstr "Su implementación es solo para grafo **no dirigido**." +msgstr "La implementación es para grafos **no dirigidos**." -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "" +"The bandwidth minimization problems are considered NP-complete problems." msgstr "" -#, fuzzy msgid "The running time complexity is: :math:`O(m log(m)|V|)`" -msgstr "Tiempo de ejecución de Prim: :math:`O(E*log 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," -#, fuzzy msgid ":math:`m` 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," +msgstr ":math:`m`es el grado máximo de los vértices en el grafo." -#, fuzzy msgid "pgr_cuthillMckeeOrdering(`Edges SQL`_)" -msgstr "``pgr_full_version``" +msgstr "pgr_cuthillMckeeOrdering(`SQL de aristas`_)" -#, fuzzy msgid "RETURNS SET OF |result-node-order|" -msgstr "Devuelve el conjunto de ``(node)``" +msgstr "REGRESA CONJUNTO DE |result-node-order|" -#, fuzzy msgid "Graph ordering of pgRouting :doc:`sampledata`" -msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" +msgstr "Ordenamiento del grafo de los :doc:`sampledata` de pgRouting" -#, fuzzy msgid "Returns SET OF ``(seq, node)``" -msgstr "Devuelve el conjunto de ``(node)``" +msgstr "Regresa conjunto de ``(seq, node)``" -#, fuzzy msgid "Sequence of the order starting from 1." -msgstr "Valor secuencial a partir de **1**." +msgstr "Valor secuencial a partir de 1." -#, fuzzy msgid "New ordering in reverse order." -msgstr "No se realiza ningún pedido" +msgstr "Nuevo ordenamiento es en orden inverso." -#, fuzzy msgid "" -"`Boost: Cuthill-McKee Ordering " -"`__" +"`Boost: Cuthill-McKee Ordering `__" msgstr "" -"`Boost: algoritmo de Kruskal " -"`__" +"`Boost: Ordernamiento Cuthill-McKee `__" -#, fuzzy, python-format msgid "" -"`Wikipedia: Cuthill-McKee Ordering " -"`__" +"`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" -"`Wikipedia: algoritmo de Kruskal " -"`__" +"`Wikipedia: Ordenamiento Cuthill-McKee `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "pgr_dagShortestPath - Experimental" msgstr "pgr_dagShortestPath - Experimental" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted " -"directed acyclic graphs(DAG). In particular, the DAG shortest paths " -"algorithm implemented by Boost.Graph." +"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed " +"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " +"implemented by Boost.Graph." msgstr "" -"``pgr_dagShortestPath`` — Devuelve la(s) rutas más cortas para los grafos" -" acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de " -"rutas más cortas de DAG implementado por Boost.Graph." +"``pgr_dagShortestPath`` — Devuelve la(s) rutas más cortas para los grafos " +"acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de rutas " +"más cortas de DAG implementado por Boost.Graph." msgid "New **experimental** function:" msgstr "Nueva función **experimental**:" @@ -12547,15 +12183,15 @@ 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``)." +"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``)." +"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 " @@ -12566,51 +12202,48 @@ msgstr "" 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." +"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." +"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." +"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`" +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))`" -#, fuzzy msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destino**)" -#, fuzzy msgid "pgr_dagShortestPath(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salida**, **destinos**)" -#, fuzzy msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destino**)" -#, fuzzy msgid "pgr_dagShortestPath(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_dagShortestPath(`SQL de aristas`_, **salidas**, **destinos**)" -#, fuzzy msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_dagShortestPath(Combinaciones)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" -msgstr "Desde el vértice :math:`5` al vértice :math:`11` en un grafo **dirigido**" +msgstr "" +"Desde el 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\\}`" @@ -12622,12 +12255,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**" +"Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` " +"en un grafo **no dirigido**" -#, fuzzy msgid "pgr_dagShortestPath(`Edges SQL`_, Combinations)" -msgstr "pgr_dagShortestPath(Combinaciones)" +msgstr "pgr_dagShortestPath(`SQL de aristas`_, `SQL de combinations`_)" msgid "Resturn Columns" msgstr "Columnas de Resultados" @@ -12639,9 +12271,9 @@ msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" msgid "``pgr_degree`` -- Proposed" @@ -12656,9 +12288,8 @@ msgstr "" msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgstr "" -#, fuzzy msgid "RETURNS SETOF |result-degree|" -msgstr "Devuelve el conjunto de ``(edge)``" +msgstr "REGRESA CONJUNTO DE |result-degree|" msgid "Extracting the vertex information" msgstr "Extraer la información del vértice" @@ -12674,8 +12305,7 @@ 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." +"Cuando verdadero, no procesar y recibir un AVISO de la consulta resultante." msgid "Vertex SQL" msgstr "" @@ -12687,11 +12317,11 @@ msgid "``BIGINT[]``" msgstr "``BIGINT[]``" msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first " -"end point*." +"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*." +"Arreglo de identificadores de las aristas que tienen el vértice ``id`` como " +"*primer punto final*." msgid "When missing, ``out_edges`` must exist." msgstr "" @@ -12700,18 +12330,17 @@ msgid "``out_edges``" msgstr "``out_edges``" msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second " -"end point*." +"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*." +"Arreglo de identificadores de las aristas que tienen el vértice ``id`` como " +"*segundo punto final*." msgid "When missing, ``in_edges`` must exist." msgstr "" -#, fuzzy msgid "Vertex identifier" -msgstr "Identificador del camino." +msgstr "Identificador de vértice" msgid "``degree``" msgstr "" @@ -12726,13 +12355,13 @@ msgid "Dry run execution" msgstr "" msgid "" -"To get the query generated used to get the vertex information, use " -"``dryrun => true``." +"To get the query generated used to get the vertex information, use ``dryrun " +"=> true``." msgstr "" msgid "" -"The results can be used as base code to make a refinement based on the " -"back end development needs." +"The results can be used as base code to make a refinement based on the back " +"end development needs." msgstr "" msgid "Degree from an existing table" @@ -12742,17 +12371,17 @@ msgid ":doc:`pgr_extractVertices`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "``pgr_depthFirstSearch`` - Propusto" @@ -12761,8 +12390,8 @@ 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." +"``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" @@ -12777,33 +12406,33 @@ msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" msgstr "``pgr_depthFirstSearch`` (`Vértices multiples`_)" 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." +"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." +"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." +msgid "" +"The implementation works for both **directed** and **undirected** graphs." msgstr "" -"La implementación funciona para los grafos **dirigidos** y **no " -"dirigidos**." +"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." +"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." +"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." +"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." @@ -12812,12 +12441,11 @@ 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`." +"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." +"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." @@ -12830,83 +12458,75 @@ 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)`" +"Tiempo de ejecución de la Primera Búsqueda de Profundidad: :math:`O(E + V)`" -#, fuzzy msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raíz**, [**opciones**])" -#, fuzzy msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raices**, [**opciones**])" msgid "**options:** ``[directed, max_depth]``" msgstr "" 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``." +"Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." msgid "" -"`Boost: Depth First Search algorithm documentation " -"`__" +"`Boost: Depth First Search algorithm documentation `__" msgstr "" "`Boost: Documentación del algoritmo de Primera Búsqueda de Profundidad " "`__" msgid "" -"`Boost: Undirected DFS algorithm documentation " -"`__" +"`Boost: Undirected DFS algorithm documentation `__" msgstr "" -"`Boost: Documentación del algoritmo DFS No dirigido " -"`__" +"`Boost: Documentación del algoritmo DFS No dirigido `__" msgid "" -"`Wikipedia: Depth First Search algorithm `__" +"`Wikipedia: Depth First Search algorithm `__" msgstr "" -"'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad " -"`__" +"'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 `__ " -"`2.0 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ " +"`2.2 `__ `2.1 `__ `2.0 `__" msgstr "" -"**Versiones no soportadas** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 `__ " -"`2.0 `__" +"**Versiones no soportadas** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ " +"`2.2 `__ `2.1 `__ `2.0 `__" msgid "``pgr_dijkstra``" msgstr "``pgr_dijkstra``" @@ -12944,36 +12564,43 @@ msgstr "Cambio de firma en ``pgr_dijkstra`` (`Uno a Uno`_)" msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" msgstr "**Oficial** ``pgr_dijkstra`` (`Uno a Uno`_)" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids** , [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids** , [``directed``])" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids** , [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids** , [``directed``])" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -#, fuzzy msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **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**" +"Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **no " +"dirigido**" -#, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "" +"pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "The examples of this section are based on the :doc:`sampledata` network." +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" @@ -12995,34 +12622,34 @@ 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" +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" +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" +"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" +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\\}`" +"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" -"Rutas :math:`\\{6\\}\\rightarrow\\{10, " -"7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +"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``" @@ -13043,22 +12670,20 @@ 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" +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" +"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" +"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" +"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``" @@ -13080,23 +12705,20 @@ 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" +"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" +"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" +"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" +"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``" @@ -13118,33 +12740,28 @@ 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" +"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" +"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" +"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" +"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\\}`" +"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" -"Los siguientes ejemplos son para la ruta " -":math:`\\{6\\}\\rightarrow\\{10\\}`" +"Los siguientes ejemplos son para la ruta :math:`\\{6\\}\\rightarrow\\{10\\}`" msgid "33) Using `One to One`_" msgstr "33) Usando `Uno a Uno`_" @@ -13158,49 +12775,45 @@ msgstr "35) Usando `Muchos a Uno`_" msgid "36) Using `Many to Many`_" msgstr "36) Usando `Muchos a Muchos`_" -#, fuzzy msgid "37) Using `Combinations`_" -msgstr "36) Usando `Combinaciones`_" +msgstr "37) Usando `Combinaciones`_" -#, python-format msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.3 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.3 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.3 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.3 `__" msgid "``pgr_dijkstraCost``" msgstr "``pgr_dijkstraCost``" @@ -13219,96 +12832,93 @@ msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " "path(s) using Dijkstra Algorithm." msgstr "" -"La función ``pgr_dijkstraCost`` function sumarizes el costo de los " -"caminos más cortos usando el algoritmo de Dijkstra." +"La función ``pgr_dijkstraCost`` function sumarizes el costo de los caminos " +"más cortos usando el algoritmo de Dijkstra." -#, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid** , " -"[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "" +"pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -#, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -#, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "" +"pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -#, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" +"pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, " "[``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_dijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__) " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__) " -"`3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_dijkstraCostMatrix``" msgstr "``pgr_dijkstraCostMatrix``" msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_dijkstra`." +"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_dijkstra`." msgstr "" -"``pgr_dijkstraCostMatrix`` - Calcula la matriz de costes utilizando " -":doc:`pgr_dijkstra`." +"``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." +msgstr "" +"Utilizando el algoritmo Dijkstra, calcula y devuelve una matriz de costes." -#, fuzzy msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_dijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "``pgr_dijkstraNear`` - Proposed" msgstr "``pgr_dijkstraNear`` - Propuesto" @@ -13317,16 +12927,16 @@ 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." +"``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." +"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 " +"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." @@ -13361,8 +12971,8 @@ 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|)`" +"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`" @@ -13376,27 +12986,28 @@ msgstr "Muchos a Muchos: :math:`drt * |Starting vids|`" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "Combinaciones: :math:`drt * |Starting vids|`" -#, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options " +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones " "A**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options " +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones " "A**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options " +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones " "B**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNearCost(Combinaciones)" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones " +"B**])" msgid "**options A:** ``[directed, cap]``" msgstr "" @@ -13404,25 +13015,27 @@ msgstr "" msgid "**options B:** ``[directed, cap, global]``" msgstr "" -#, fuzzy -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" msgid "**options:** ``[directed, cap]``" msgstr "" 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." +"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\\}`" +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\\}`" +"Las estaciones de metro se encuentran en los siguientes vértices :math:`" +"\\{ 1, 10, 11\\}`" msgid "The defaults used:" msgstr "Los valores predeterminados utilizados:" @@ -13438,42 +13051,44 @@ msgstr "" "El resultado muestra que la estación en el vértice :math:`11` es la más " "cercana." -#, fuzzy -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +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`" +"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 "The subway stations are on the following vertices :math:`\\{ 1, 10, 11\\}`" +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\\}`" +"Las estaciones de metro se encuentran en los siguientes vértices :math:`" +"\\{ 1, 10, 11\\}`" 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``" +"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`." +"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`." -#, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, " +"[**opciones**])" msgid "**options:** ``[directed, cap, global]``" msgstr "" @@ -13485,63 +13100,65 @@ msgid "Unsing 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\\}`" +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\\}`" +"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`" +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." +"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." +"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``" +"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``" -#, fuzzy msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNearCost(Combinaciones)" +msgstr "" +"pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "Find the best car connection between all the stations of two subway lines" +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\\}`" +"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\\}`" +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" +"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" +"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" +"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" @@ -13553,44 +13170,43 @@ 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\\}`:" +"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\\}`:" +"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)}`" +"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)}`" +"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`)" +"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\\}`:" +"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\\}`:" +"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)}`" +"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)}`" +"Las mejores conecciones de todas las estaciones desde la segunda línea son: :" +"math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgid "" -"Both are equaly good as they have the same cost. (lines: `13` and `14` " -"and lines: `15` and `16`)" +"Both are equaly 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`)" @@ -13621,54 +13237,56 @@ msgstr "Cuando ``false``: ``cap`` límite por ``Start vid`` será devuelto" 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" -#, python-format msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "``pgr_dijkstraNearCost`` - Proposed" msgstr "``pgr_dijkstraNearCost`` - Propuesto" msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that" -" leads to the nearest vertex." +"``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." +"``pgr_dijkstraNearCost`` — Usando el algoritmo dijkstra, encuentra la ruta " +"que conduce al vértice más cercano." -#, fuzzy msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options A**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " +"A**])" +msgstr "" +"pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, " +"[**opciones A**])" #, fuzzy msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options A**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " +"A**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options B**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " +"B**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "pgr_dijkstraNearCost(Combinaciones)" +msgid "" +"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "" +"pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones " +"B**])" #, fuzzy msgid "" @@ -13683,8 +13301,8 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Departing on a car from a subway station find the nearest **two** " -"stations to vertex :math:`6`" +"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`" @@ -13695,54 +13313,54 @@ msgid "" "[**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_dijkstraNearCost(Combinaciones)" +msgstr "" +"pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, " +"[**opciones**])" msgid "" -"lines `3~4` sets the start vertices to be from the fisrt subway line and " -"the ending vertices to be from the second subway line" +"lines `3~4` sets the start vertices to be from the fisrt subway line and the " +"ending vertices to be from the second subway line" msgstr "" -"líneas `3~4` establecen los vértices de inicio de la primera línea de " -"metro y los vértices finales de la segunda línea de metro" +"líneas `3~4` establecen 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 "" "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`)" +"La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: " +"`1`)" msgid "Both are equaly 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`)" +"Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and " +"`13`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"***Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"***Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "``pgr_dijkstraVia`` - Proposed" @@ -13752,9 +13370,9 @@ msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." 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)`." +"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 "" msgid "Route" @@ -13784,15 +13402,16 @@ msgid "RETURNS SET OF |via-result|" msgstr "" msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that " -"order on an **directed** graph." +"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " +"on an **directed** graph." msgstr "" 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" +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." @@ -13807,18 +13426,18 @@ msgid "``route_agg_cost``" msgstr "``route_agg_cost``" msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the " -"current ``seq``." +"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." +"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." +"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**." +"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 "" @@ -13845,54 +13464,51 @@ msgid ":doc:`dijkstra-family`." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ " +"`2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ " +"`2.1 `__ `2.0 `__" msgid "``pgr_drivingDistance``" msgstr "``pgr_drivingDistance``" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "" +"``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" -"``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo " -"de inicio." +"``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de " +"inicio." msgid "Version 2.1.0:" msgstr "Versión 2.1.0:" @@ -13910,13 +13526,13 @@ msgid "**Official** pgr_drivingDistance(single vertex)" msgstr "**Oficial** pgr_drivingDistance(single vertex)" 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." +"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." +"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." #, fuzzy msgid "" @@ -13924,11 +13540,11 @@ msgid "" "[``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, " -"[**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgstr "" +"pgr_drivingDistance(`SQL de aristas`_, **raices**, **distancia**, " +"[**opciones**])" #, fuzzy msgid "**options:** [directed, equicost]" @@ -13950,11 +13566,11 @@ msgid "RETURNS SET OF |result-dij-dd-m|" msgstr "" msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with " -"equi-cost on a directed graph" +"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" +"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" @@ -13963,14 +13579,15 @@ msgid "``equicost``" msgstr "``equicost``" msgid "When ``true`` the node will only appear in the closest ``from_v`` list." -msgstr "Cuando ``true`` el nodo solo aparecen en la lista más cercana ``from_v``." +msgstr "" +"Cuando ``true`` el nodo solo aparecen en la lista más cercana ``from_v``." msgid "" -"When ``false`` which resembles several calls using the single starting " -"point signatures. Tie brakes are arbitrary." +"When ``false`` which resembles several calls using the single starting point " +"signatures. Tie brakes are arbitrary." msgstr "" -"Cuando ``false`` que asemeja a varias llamadas utilizando las firma de " -"punto de inicio único. Los empates se rompen arbitrariamente." +"Cuando ``false`` que asemeja a varias llamadas utilizando las firma de punto " +"de inicio único. Los empates se rompen arbitrariamente." msgid "Returns SET OF ``(seq, from_v, node, edge, cost, agg_cost)``" msgstr "Devuelve el conjunto ``(seq, from_v, node, edge, cost, agg_cost)``" @@ -13979,7 +13596,8 @@ msgid "``[from_v]``" msgstr "``[from_v]``" msgid "Identifier of ``node`` within the limits from ``from_v``." -msgstr "Identificador del ``node`` en la ruta dentro de los límites de ``from_v``." +msgstr "" +"Identificador del ``node`` en la ruta dentro de los límites de ``from_v``." msgid ":math:`0` when ``node`` = ``from_v``." msgstr ":math:`0` cuando ``node`` = ``from_v``." @@ -13991,39 +13609,37 @@ 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" +"Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un " +"grafo no dirigido" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__" msgid "pgr_edgeColoring - Experimental" msgstr "pgr_edgeColoring - Experimental" msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-" -"free graphs" +"``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" +"``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." +"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**" @@ -14034,31 +13650,32 @@ 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." +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." +"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." +"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." +"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." +"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`)" +"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)` (mínima cantidad de colores necesitados" -" para colorear apropiadamentnte las aristas de un grafo) es igual al " -"grado :math:`\\Delta + 1` del grafo, (:math:`x'(G) = \\Delta`)" +"El número cromático :math:`x'(G)` (mínima cantidad de colores necesitados " +"para colorear apropiadamentnte las aristas de un 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." @@ -14066,7 +13683,8 @@ 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." +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." @@ -14095,34 +13713,34 @@ msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" @@ -14141,11 +13759,11 @@ 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." +"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." +"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:" @@ -14159,8 +13777,8 @@ 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." +"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." @@ -14192,9 +13810,11 @@ msgid "" "[``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgid "" +"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "" +"pgr_edgeDisjointPaths(`SQL de aristas`_, `SQL de combinaciones`_, " +"[``directed``])" msgid "RETURNS SET OF |result-disjoint|" msgstr "" @@ -14212,56 +13832,54 @@ msgid "RETURNS SET OF |result-disjoint-m-m|" msgstr "" msgid "" -"Using a combinations table, equivalent to calculating result from " -"vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an " -"undirected graph." +"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." +"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." +"Asignando manualmente las combinaciones de vértices en un grafo no dirigido." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Versiones soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" 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." +"``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 " @@ -14276,39 +13894,33 @@ msgstr "Renombrado desde ``pgr_maxFlowEdmondsKarp``" msgid "Running time: :math:`O( V * E ^ 2)`" msgstr "Tiempo de ejecución: :math:`O( V * E ^ 2)`" -#, fuzzy msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destino**)" -#, fuzzy msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salida**, **destinos**)" -#, fuzzy msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destino**)" -#, fuzzy msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)" -#, fuzzy msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgstr "``pgr_edmondsKarp`` (`Combinaciones`_)" +msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" msgstr "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" -#, python-format msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_edwardMoore - Experimental``" @@ -14318,8 +13930,8 @@ 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." +"``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-" +"Moore." msgid "``pgr_edwardMoore`` (`Combinations`_)" msgstr "``pgr_edwardMoore`` (`Combinaciones`_)" @@ -14337,46 +13949,45 @@ msgid "``pgr_edwardMoore`` (`Many to Many`_)" msgstr "" 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." +"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." +"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." +"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." +"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" +"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." +"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`." @@ -14397,72 +14008,73 @@ msgid "Average case: :math:`O( | E | )`" msgstr "" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -#, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``]);" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``]);" +msgstr "" +"pgr_edwardMoore(`SQL de aristas`_, **salida**, **destino**, [``directed``]);" -#, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``]);" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``]);" +msgstr "" +"pgr_edwardMoore(`SQL de aristas`_, **salida**, **destinos**, [``directed``]);" -#, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``]);" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``]);" +msgstr "" +"pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destino**, [``directed``]);" -#, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, " +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``]);" +msgstr "" +"pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destinos**, " "[``directed``]);" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``]);" -msgstr "pgr_dijkstraNear(Combinaciones)" +msgstr "" +"pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``]);" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "pgr_extractVertices -- Proposed" msgstr "pgr_extractVertices -- Propuesto" @@ -14475,18 +14087,18 @@ msgid "Classified as **proposed** function" msgstr "Promovido a función **propuesta**" msgid "" -"This is an auxiliary function for extracting the vertex information of " -"the set of edges of a graph." +"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" +"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" +"Cuando se proporciona el identificador de arista, también se calcularán las " +"aristas de entrada y salida" #, fuzzy msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" @@ -14513,12 +14125,12 @@ msgid "Geometry of the edge." msgstr "Geometría LINESTRING de la arista." msgid "" -"This inner query takes precedence over the next two inner query, " -"therefore other columns are ignored when ``geom`` column appears." +"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''." +"siguientes, por lo que se omiten otras columnas cuando aparece la columna " +"''geom''." msgid "Ignored columns:" msgstr "Columnas ignoradas:" @@ -14533,8 +14145,8 @@ 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." +"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." @@ -14550,13 +14162,12 @@ msgstr "Geometría POINT del vértice final." #, fuzzy msgid "" -"This inner query takes precedence over the next inner query, therefore " -"other columns are ignored when ``startpoint`` and ``endpoint`` columns " -"appears." +"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 se omiten otras columnas cuando aparecen las columnas" -" ``startpoint`` y ``endpoint``." +"Esta consulta interna tiene prioridad sobre la siguiente consulta interna, " +"por lo que se omiten otras columnas cuando aparecen las columnas " +"``startpoint`` y ``endpoint``." msgid "When identifiers of vertices are known" msgstr "Cuando se conocen identificadores de vértices" @@ -14565,9 +14176,8 @@ 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." +"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" @@ -14587,23 +14197,23 @@ msgid "Dryrun execution" msgstr "Ejecución de Dryrun" msgid "" -"To get the query generated used to get the vertex information, use " -"``dryrun := true``." +"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``." +"Para obtener la consulta generada que se usa para obtener la información de " +"vértices, utilice ``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." +"Los resultados se pueden usar como código base para realizar un refinamiento " +"basado en las necesidades de desarrollo de back-end." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" msgid "``pgr_findCloseEdges``" @@ -14622,11 +14232,12 @@ msgid "``pgr_findCloseEdges`` (`Many points`_)" msgstr "" msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge " -"to a point geometry." +"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " +"a point geometry." msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgid "" +"The geometries must be in the same coordinate system (have the same SRID)." msgstr "" msgid "" @@ -14637,13 +14248,15 @@ msgstr "" msgid "``EMTPY SET`` is returned on dryrun executions" msgstr "" -#, fuzzy -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "" +"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgstr "" +"pgr_findCloseEdges(`Edges SQL`_, **punto**, **tolerancia**, [**options**])" -#, fuzzy -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgid "" +"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "" +"pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])" msgid "**options:** ``[cap, partial, dryrun]``" msgstr "" @@ -14686,31 +14299,31 @@ msgid "Many points" msgstr "" msgid "" -"Find at most :math:`2` edges close to all vertices on the points of " -"interest table." +"Find at most :math:`2` edges close to all vertices on the points of interest " +"table." msgstr "" msgid "One answer per point, as small as possible." msgstr "" msgid "" -"Columns ``edge_id``, ``fraction``, ``side`` and ``geom`` are returned " -"with values." +"Columns ``edge_id``, ``fraction``, ``side`` and ``geom`` are returned with " +"values." msgstr "" msgid "" -"``geom`` contains the original point geometry to assist on " -"deterpartialing to which point geometry the row belongs to." +"``geom`` contains the original point geometry to assist on deterpartialing " +"to which point geometry the row belongs to." msgstr "" msgid "**point**" -msgstr "" +msgstr "**punto**" msgid "The point geometry" msgstr "" msgid "**points**" -msgstr "" +msgstr "**puntos**" msgid "``POINT[]``" msgstr "" @@ -14719,7 +14332,7 @@ msgid "An array of point geometries" msgstr "" msgid "**tolerance**" -msgstr "" +msgstr "**tolerancia**" msgid "Max distance between geometries" msgstr "" @@ -14786,16 +14399,16 @@ msgid "``POINT`` geometry" msgstr "" msgid "" -"`One Point`_: Contains the point on the edge that is ``fraction`` away " -"from the starting point of the edge." +"`One Point`_: Contains the point on the edge that is ``fraction`` away from " +"the starting point of the edge." msgstr "" msgid "`Many Points`_: Contains the corresponding **original point**" msgstr "" msgid "" -"``LINESTRING`` geometry from the **original point** to the closest point " -"of the edge with identifier ``edge_id``" +"``LINESTRING`` geometry from the **original point** to the closest point of " +"the edge with identifier ``edge_id``" msgstr "" msgid "One point results" @@ -14804,12 +14417,13 @@ msgstr "" msgid "The green nodes is the **original point**" msgstr "" -msgid "The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." +msgid "" +"The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." msgstr "" msgid "" -"The geometry ``edge`` is a line that connects the **original point** with" -" ``geom``" +"The geometry ``edge`` is a line that connects the **original point** with " +"``geom``" msgstr "" msgid "Many point results" @@ -14859,13 +14473,13 @@ msgid "For edge :math:`5`:" msgstr "" msgid "" -"``fraction``: The closest point from the **original point** is at the " -":math:`0.8` fraction of the edge :math:`5`." +"``fraction``: The closest point from the **original point** is at the :math:" +"`0.8` fraction of the edge :math:`5`." msgstr "" msgid "" -"``side``: The **original point** is located to the left side of edge " -":math:`5`." +"``side``: The **original point** is located to the left side of edge :math:" +"`5`." msgstr "" msgid "" @@ -14877,18 +14491,18 @@ msgid "For edge :math:`8`:" msgstr "" msgid "" -"``fraction``: The closest point from the **original point** is at the " -":math:`0.89..` fraction of the edge :math:`8`." +"``fraction``: The closest point from the **original point** is at the :math:" +"`0.89..` fraction of the edge :math:`8`." msgstr "" msgid "" -"``side``: The **original point** is located to the right side of edge " -":math:`8`." +"``side``: The **original point** is located to the right side of edge :math:" +"`8`." msgstr "" msgid "" -"``distance``: The **original point** is located :math:`0.19..` length " -"units from edge :math:`8`." +"``distance``: The **original point** is located :math:`0.19..` length units " +"from edge :math:`8`." msgstr "" msgid "One answer, all columns" @@ -14900,7 +14514,8 @@ msgstr "" msgid "Calculate all columns" msgstr "" -msgid "``edge_id`` identifier of the edge **closest** to the **original point**" +msgid "" +"``edge_id`` identifier of the edge **closest** to the **original point**" msgstr "" msgid "" @@ -14909,13 +14524,13 @@ msgid "" msgstr "" msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`5` " -"from the **original point**." +"``geom``: Contains the geometry of the closest point on edge :math:`5` from " +"the **original point**." msgstr "" msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** " -"to the closest point on on edge :math:`5` ``geom``" +"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " +"the closest point on on edge :math:`5` ``geom``" msgstr "" msgid "At most two answers with all columns" @@ -14925,13 +14540,13 @@ msgid "Understanding the result:" msgstr "" msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`8` " -"from the **original point**." +"``geom``: Contains the geometry of the closest point on edge :math:`8` from " +"the **original point**." msgstr "" msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** " -"to the closest point on on edge :math:`8` ``geom``" +"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " +"the closest point on on edge :math:`8` ``geom``" msgstr "" msgid "One point dry run execution" @@ -14947,8 +14562,8 @@ msgid "Is ignored" msgstr "" msgid "" -"Because it is a **dry run** excecution, the code for all calculations are" -" shown on the PostgreSQL ``NOTICE``." +"Because it is a **dry run** excecution, the code for all calculations are " +"shown on the PostgreSQL ``NOTICE``." msgstr "" msgid "``dryrun => true``" @@ -14958,8 +14573,7 @@ msgid "Do not process query" msgstr "" msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all " -"columns" +"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" msgid "``cap`` and **original point** are used in the code" @@ -14975,8 +14589,7 @@ msgid "``NULL`` on ``edge``" msgstr "" msgid "" -"``edge_id`` identifier of the edge close to a **original point** " -"(``geom``)" +"``edge_id`` identifier of the edge close to a **original point** (``geom``)" msgstr "" msgid "" @@ -14994,8 +14607,8 @@ msgid "For point ``POINT(2.9 1.8)``" msgstr "" msgid "" -"Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the " -"shortest distance to ``POINT(2.9 1.8)``." +"Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the shortest " +"distance to ``POINT(2.9 1.8)``." msgstr "" msgid "One answer per point, all columns" @@ -15008,8 +14621,7 @@ msgid "Edge :math:`5` is the closest edge to the **original point**" msgstr "" msgid "" -"``geom``: Contains the geometry of the **original point** ``POINT(2.9 " -"1.8)``" +"``geom``: Contains the geometry of the **original point** ``POINT(2.9 1.8)``" msgstr "" msgid "" @@ -15037,24 +14649,25 @@ 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." +"that is not a vertex in the graph. Those locations, in pgRrouting are called " +"points of interest." msgstr "" msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``," -" ``side``, ``fraction``." +"The information needed in the points of interest is ``pid``, ``edge_id``, " +"``side``, ``fraction``." msgstr "" msgid "" -"On this documentation there will be some 6 fixed points of interest and " -"they will be stored on a table." +"On this documentation there will be some 6 fixed points of interest and they " +"will be stored on a table." msgstr "" msgid "A unique identifier." msgstr "" -msgid "Identifier of the edge nearest edge that allows an arrival to the point." +msgid "" +"Identifier of the edge nearest edge that allows an arrival to the point." msgstr "" msgid "Is it on the left, right or both sides of the segment ``edge_id``" @@ -15082,8 +14695,8 @@ msgid "Points of interest fillup" msgstr "LLenado de puntos de interés" msgid "" -"Using :doc:`pgr_findCloseEdges` Calculating for visual purposes the " -"points over the graph." +"Using :doc:`pgr_findCloseEdges` Calculating for visual purposes the points " +"over the graph." msgstr "" msgid "A special case to arrive from both sides of the edge." @@ -15093,68 +14706,61 @@ msgid "Points of interest data" msgstr "Datos de puntos de interés" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" 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." +"``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." +"``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," +"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," +"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 "" @@ -15163,39 +14769,40 @@ msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`." msgid "" -"Boost `floyd-Warshall " -"`_" +"Boost `floyd-Warshall `_" msgstr "" -"Boost `Algoritmo floyd-Warshall " -"`_" +"Boost `Algoritmo floyd-Warshall `_" msgid "Queries uses the :doc:`sampledata` network." -msgstr "Queries utiliza la red :doc:`sampledata`." +msgstr "Consultas utilizan la red :doc:`sampledata`." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "``pgr_full_version``" msgstr "``pgr_full_version``" -msgid "``pgr_full_version`` — Get the details of pgRouting version information." +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." +"``pgr_full_version`` — Obtener los detalles de la información de la versión " +"de pgRouting." msgid "New **official** function" msgstr "Nueva función **oficial**" @@ -15270,13 +14877,13 @@ msgstr "Hash de Git de pgRouting" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__)" +"**Versiones soportadas** `Última `__ (`3.4 `__)" #, fuzzy msgid "``pgr_hawickCircuits - Experimental``" @@ -15284,37 +14891,36 @@ msgstr "pgr_pickDeliver - Experimental" #, fuzzy msgid "" -"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick " -"circuits algorithm." +"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " +"algorithm." msgstr "" -"``pgr_bdDijkstra`` — Devuelve la(s) rutas más cortas mediante el " -"algoritmo Bidirectional Dijkstra." +"``pgr_bdDijkstra`` — Devuelve la(s) rutas más cortas mediante el algoritmo " +"Bidirectional Dijkstra." #, fuzzy msgid "``pgr_hawickCircuits``" msgstr "``pgr_kruskal``" msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health " -"A. James. This algorithm solves the problem of detecting and enumerating " +"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." +"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 "" 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." +"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 "" -#, fuzzy msgid "The algorithm implementation works only for directed graph" -msgstr "Su implementación es solo para grafo **no dirigido**." +msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" msgid "It is a variation of Johnson's algorithm for circuit enumeration." msgstr "" @@ -15336,19 +14942,17 @@ msgstr "``pgr_kruskal``" msgid "RETURNS SET OF |generic-result|" msgstr "" -#, fuzzy msgid "Circuits present in the pgRouting :doc:`sampledata`" -msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" +msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting" #, fuzzy msgid "Id of the circuit starting from ``1``" msgstr "Valor secuencial a partir de ``1``" -#, fuzzy msgid "Relative postion in the path. Has value ``0`` for beginning of the path" msgstr "" -"Posición relativa en la ruta. Tiene el valor **1** para el inicio de una " -"ruta." +"Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la " +"ruta" #, fuzzy msgid "Identifier of the starting vertex of the circuit." @@ -15364,23 +14968,21 @@ msgstr "Identificador del nodo en la ruta de ``start_vid`` a ``end_vid``." #, fuzzy msgid "" -"`Boost: Hawick Circuit Algorithm " -"`__" +"`Boost: Hawick Circuit Algorithm `__" msgstr "" -"`Boost: es bipartido " -"`__" +"`Boost: es bipartido `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " "`__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " "`__" msgid "``pgr_isPlanar`` - Experimental" @@ -15390,28 +14992,28 @@ 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." +"``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." +"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." +"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." +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." @@ -15444,15 +15046,15 @@ 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." +"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`." +"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." +"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`." @@ -15461,108 +15063,97 @@ msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" msgstr "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__ " -"`2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"`2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__ " -"`2.0 " -"`__" +"`2.2 `__ `2.1 `__ `2.0 `__" msgid "``pgr_johnson``" msgstr "``pgr_johnson``" msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for " -"each pair of nodes in the graph using Floyd-Warshall algorithm." +"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " +"pair of nodes in the graph using Floyd-Warshall 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." +"``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." 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 usees the Boost's implementation which runs in :math:`O(V E " -"\\log V)` time," +"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 usees 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," +"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 "" msgid "" -"Boost `Johnson " -"`_" +"Boost `Johnson `_" msgstr "" -"Boost `Algoritmo de Johnson " -"`_" +"Boost `Algoritmo de Johnson `_" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "``pgr_kruskal``" msgstr "``pgr_kruskal``" msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's " -"algorithm." +"``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." +"``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." +"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." @@ -15581,21 +15172,21 @@ msgid "Minimum spanning forest" msgstr "Bosque de expansión mínimo" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "``pgr_kruskalBFS``" msgstr "``pgr_kruskalBFS``" @@ -15604,16 +15195,15 @@ 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." +"``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo " +"con orden de Primera Búsqueda en Anchura." msgid "" -"Visits and extracts the nodes information in Breath First Search ordering" -" of the Minimum Spanning Tree created using Kruskal's algorithm." +"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." +"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 "" @@ -15621,7 +15211,8 @@ msgstr "" "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)`" +msgstr "" +"Tiempo de ejecución de la Primera Búsqueda de Anchura: :math:`O(E + V)`" #, fuzzy msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -15635,90 +15226,87 @@ 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`" +"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`" +"El Árbol de Expansión Mínimo que comienza en los vértices :math:`\\{9, 6\\}` " +"con ::math:`depth \\leq 3`" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgid "``pgr_kruskalDD``" msgstr "``pgr_kruskalDD``" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." -msgstr "``pgr_kruskalDD`` — Nodos de captación utilizando el algoritmo de Kruskal." +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." +"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." +"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." +"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)`" -#, fuzzy msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_kruskalDD(`SQL de aristas`_, **raíz**, **distancia**)" -#, fuzzy msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_kruskalDD(`SQL de aristas`_, **raices**, **distancia**)" msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with " -":math:`distance \\leq 3.5`" +"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`" +"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`" +"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`" +"El árbol de expansión mínimo que comienza en los vértices :math:`\\{9, 6\\}` " +"con :math:`distance \\leq 3.5`" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiónes soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiónes soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "``pgr_kruskalDFS``" msgstr "``pgr_kruskalDFS``" @@ -15727,68 +15315,60 @@ 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." +"``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." +"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." +"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" -#, fuzzy msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])" -#, fuzzy msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])" msgid "" -"**Supported versions:** `Latest " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__" -" `3.2 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__" -" `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "pgr_lengauerTarjanDominatorTree -Experimental" msgstr "pgr_lengauerTarjanDominatorTree -Experimental" msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of " -"all vertices." +"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " +"vertices." msgstr "" "``pgr_lengauerTarjanDominatorTree`` — Devuelve el dominador inmediato de " "todos los vértices." msgid "" "The algorithm calculates the *immidiate 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." +"**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." +"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." @@ -15796,7 +15376,8 @@ 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." +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." @@ -15838,51 +15419,49 @@ msgid "Dominator tree of another component." msgstr "Árbnol dominante de otro componente." msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm " -"`__" +"`Boost: Lengauer-Tarjan dominator tree algorithm `__" msgstr "" -"`Boost: Algoritmo Lengauer-Tarjan de árbol dominante " -"`__" +"`Boost: Algoritmo Lengauer-Tarjan de árbol dominante `__" msgid "" -"`Wikipedia: dominator tree " -"`__" +"`Wikipedia: dominator tree `__" msgstr "" -"'Wikipedia: árbol de dominador' " -"`__" +"'Wikipedia: árbol de dominador' `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) " +"`3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__) `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__) `3.2 `__ `3.1 `__) `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_lineGraph`` - Experimental" msgstr "``pgr_lineGraph`` - Experimental" msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding " -"edge-based graph." +"``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." @@ -15894,8 +15473,8 @@ msgid "Each vertex of L(G) represents an edge of G" msgstr "Cada vértice de L(G) representa una arista de G" msgid "" -"Two vertices of L(G) are adjacent if and only if their corresponding " -"edges share a common endpoint in G." +"Two vertices of L(G) are adjacent if and only if their corresponding edges " +"share a common endpoint in G." msgstr "" "Dos vértices de L(G) son adyacentes si y sólo si sus aristas " "correspondientes comparten un punto final común en G." @@ -15917,15 +15496,15 @@ msgid "Identifier of the source vertex of the current edge." msgstr "Identificador del vértice de origen de la arista actual." 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." +msgstr "" +"Cuando es 'negativo': el origen es la arista inversa en el grafo original." msgid "Identifier of the target vertex of the current edge." msgstr "Identificador del vértice destino de la arista actual." 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." +"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``)." @@ -15951,62 +15530,61 @@ msgid "https://en.wikipedia.org/wiki/Line_graph" msgstr "https://en.wikipedia.org/wiki/Line_graph" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__" +"**Unsupported versions:** `2.6 `__" msgstr "" -"**Versiones no sustentadas:** `2.6 " -"`__" +"**Versiones no sustentadas:** `2.6 `__" #, fuzzy 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." +"``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." +"``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" #, fuzzy 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." +"``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 original a un grafo lineal" -" dirigido, 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." +"pgr_lineGraphFull, convierte un grafo dirigido original a un grafo lineal " +"dirigido, 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\"**:" +"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\"**:" +"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" +"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" @@ -16016,26 +15594,24 @@ msgid "" "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." +"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." +"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." +"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." +"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." +"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" @@ -16049,17 +15625,16 @@ msgstr "" 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\\}`" +"Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. " -"The examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples of this section are based on the :doc:`sampledata` network. The " +"examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" -"Los ejemplos de esta sección están basados en la red :doc:`sampledata`. " -"Los ejemplos incluyen el subgrafo que incluye las aristas 4, 7, 8 y 10 " -"con reverse_cost." +"Los ejemplos de esta sección se basan en la red :doc:`sampledata`. Los " +"ejemplos incluyen el subgrafo que incluye las aristas 4, 7, 8 y 10 con " +"``reverse_cost``." msgid "The data" msgstr "" @@ -16068,8 +15643,8 @@ 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." +"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|" @@ -16088,39 +15663,38 @@ msgstr "segundo" #, fuzzy 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)." +"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 tenemos aristas adicionales para cada " -"giro que se podría hacer a través del vértice 6 (naranja)." +"presentes (amarillos), pero ahora tenemos aristas adicionales para cada giro " +"que se podría hacer a través del vértice 6 (naranja)." #, fuzzy msgid "Creating table that identifies transformed vertices" msgstr "Para crear una tabla que identifique 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." +"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" +"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" @@ -16150,8 +15724,8 @@ 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." +"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" @@ -16175,8 +15749,8 @@ msgid "Idenifying the restriction" msgstr "" msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where " -"the cost will be increased" +"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " +"cost will be increased" msgstr "" msgid "" @@ -16199,7 +15773,8 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "In this example, there is no additional cost for traversing a leaf vertex." +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." @@ -16221,8 +15796,8 @@ msgid "Which can be removed" msgstr "" msgid "" -"Routing can be done now using the original vertices id using " -":doc:`pgr_dijkstra`" +"Routing can be done now using the original vertices id using :doc:" +"`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -16232,8 +15807,8 @@ 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" +"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" @@ -16257,17 +15832,17 @@ msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "https://en.wikipedia.org/wiki/Complete_graph" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - Experimental" @@ -16276,30 +15851,31 @@ 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." +"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." +"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." +"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." +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." #, fuzzy @@ -16314,8 +15890,8 @@ msgid "" "Query done on :doc:`sampledata` network gives the list of edges that are " "needed to connect the graph." msgstr "" -"La consulta realizada en la red de :doc:`sampledata` proporciona la lista" -" de aristas que se necesitan en el grafo para conectarlo." +"La consulta realizada en la red de :doc:`sampledata` proporciona la lista de " +"aristas que se necesitan en el grafo para conectarlo." #, fuzzy msgid "Returns set of |result-component-make|" @@ -16325,38 +15901,35 @@ msgid "https://www.boost.org/libs/graph/doc/make_connected.html" msgstr "https://www.boost.org/libs/graph/doc/make_connected.html" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" -" `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" -" `2.3 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgid "pgr_maxCardinalityMatch" msgstr "pgr_maxCardinalityMatch" msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching " -"in a graph." +"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " +"graph." msgstr "" "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad " "máxima en un grafo." @@ -16382,8 +15955,8 @@ msgstr "" "conjunto de aristas sin vértices comunes." msgid "" -"A maximum matching is a matching that contains the largest possible " -"number of edges." +"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." @@ -16393,7 +15966,8 @@ msgstr "Puede haber muchas coincidencias máximas." #, fuzzy msgid "Calculates one possible maximum cardinality matching in a graph." -msgstr "Calcula **una** posible coincidencia máxima de cardinalidad en un grafo." +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))`" @@ -16408,10 +15982,11 @@ msgstr "pgr_maximumcardinalitymatching" msgid "Using all edges." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" +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:" +"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``, " @@ -16420,13 +15995,12 @@ msgstr "" "Un valor positivo representa la existencia de la arista (``source``, " "``target``)." -#, fuzzy msgid "" "A positive value represents the existence of the edge (``target``, " "``source``)" msgstr "" "Un valor positivo representa la existencia de la arista (``target``, " -"``source``)." +"``source``)" msgid "Identifier of the edge in the original query." msgstr "Identificador de la arista en la consulta original." @@ -16437,7 +16011,6 @@ msgstr "" msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" msgstr "https://www.boost.org/libs/graph/doc/maximum_matching.html" -#, python-format msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -16445,42 +16018,38 @@ msgid "https://en.wikipedia.org/wiki/Ackermann_function" msgstr "https://en.wikipedia.org/wiki/Ackermann_function" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__" 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." +"``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." +"``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`_)" @@ -16492,11 +16061,9 @@ msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." msgstr "Calcula el flujo máximo desde `source(s)` a `target(s)`." msgid "" -"When the maximum flow is **0** then there is no flow and **0** is " -"returned." +"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**." +"Cuando el flujo máximo es **0**, entonces no hay flujo y se devuelve **0**." msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." msgstr "Use el algoritmo :doc:`pgr_pushRelabel ` ." @@ -16504,25 +16071,20 @@ msgstr "Use el algoritmo :doc:`pgr_pushRelabel ` ." msgid "Running time: :math:`O( V ^ 3)`" msgstr "Tiempo de ejecución: :math:`O( V ^ 3)`" -#, fuzzy msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destino**)" -#, fuzzy msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlow(`SQL de aristas`_, **salida** , **destinos**)" -#, fuzzy msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destino**)" -#, fuzzy msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlow(`SQL de aristas`_, **salidas** , **destinos**)" -#, fuzzy msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)" -msgstr "``pgr_maxFlow`` (`Combinaciones`_)" +msgstr "pgr_maxFlow(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "RETURNS ``BIGINT``" msgstr "" @@ -16533,36 +16095,37 @@ msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)" msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" msgstr "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" -#, python-format -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 "" +"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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" 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" +"``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" +"``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo " +"maximo en un grafo" msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" msgstr "``pgr_maxFlowMinCost`` (`Combinaciones`_)" @@ -16571,7 +16134,8 @@ 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." +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 "" @@ -16588,57 +16152,54 @@ 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`." +":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`." +"casos de la vida reales, la cantidad de iteraciones es mucho menor que :math:" +"`U`." -#, fuzzy msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destino**)" -#, fuzzy msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destinos**)" -#, fuzzy msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destino**)" -#, fuzzy msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salidas** , **destinos**)" -#, fuzzy msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "``pgr_maxFlowMinCost`` (`Combinaciones`_)" +msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "RETURNS SET OF |result-flow-mincost|" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/successive_shortest_path_nonnegative_weights.html" -msgstr "https://www.boost.org/libs/graph/doc/successive_shortest_path_nonnegative_weights.html" +msgid "" +"https://www.boost.org/libs/graph/doc/" +"successive_shortest_path_nonnegative_weights.html" +msgstr "" +"https://www.boost.org/libs/graph/doc/" +"successive_shortest_path_nonnegative_weights.html" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas** `Última " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Versiones soportadas** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental" @@ -16647,42 +16208,37 @@ 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" +"``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.**" +"**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** ." +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`." -#, fuzzy msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destino**)" -#, fuzzy msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salida** , **destinos**)" -#, fuzzy msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destino**)" -#, fuzzy msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, **salidas** , **destinos**)" -#, fuzzy msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)" -msgstr "``pgr_maxFlowMinCost_Cost`` (`Combinaciones`_)" +msgstr "pgr_maxFlowMinCost_Cost(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "RETURNS FLOAT" msgstr "" @@ -16693,52 +16249,47 @@ msgstr "" "objetivo(s)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "pgr_nodeNetwork" msgstr "pgr_nodeNetwork" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." -msgstr "``pgr_nodeNetwork`` - Crea los nodos de una tabla de aristas de la red." +msgstr "" +"``pgr_nodeNetwork`` - Crea los nodos de una tabla de aristas de la red." msgid "Author" msgstr "Autor" @@ -16753,8 +16304,8 @@ msgid "Nicolas Ribot, The source code is released under the MIT-X license." msgstr "Nicolas Ribot, el código fuente está liberado bajo la licencia MIT-X." msgid "" -"The function reads edges from a not \"noded\" network table and writes " -"the \"noded\" edges into a new table." +"The function reads edges from a not \"noded\" network table and writes the " +"\"noded\" edges into a new table." msgstr "" "La función carga los bordes de una tabla que no tiene los nodos en las " "intersecciones y reescribe los bordes con los nodos en una nueva tabla." @@ -16764,36 +16315,35 @@ msgid "" "fact that the data is often not \"noded\" correctly. This will create " "invalid topologies, which will result in routes that are incorrect." msgstr "" -"Un problema común asociado con la incorporación de datos SIG en pgRouting" -" es el hecho de que los datos a menudo no están correctamente " -"referenciados con nodos. Esto provoca topologías no válidas, que resultan" -" en rutas que son incorrectas." +"Un problema común asociado con la incorporación de datos SIG en pgRouting es " +"el hecho de que los datos a menudo no están correctamente referenciados con " +"nodos. Esto provoca topologías no válidas, que resultan en rutas que son " +"incorrectas." msgid "" -"What we mean by \"noded\" is that at every intersection in the road " -"network all the edges will be broken into separate road segments. There " -"are cases like an over-pass and under-pass intersection where you can not" -" traverse from the over-pass to the under-pass, but this function does " -"not have the ability to detect and accommodate those situations." +"What we mean by \"noded\" is that at every intersection in the road network " +"all the edges will be broken into separate road segments. There are cases " +"like an over-pass and under-pass intersection where you can not traverse " +"from the over-pass to the under-pass, but this function does not have the " +"ability to detect and accommodate those situations." msgstr "" "Que los bordes estén indicados como anudados significa que, en cada " -"intersección de la red de caminos, las aristas se descompondrán en " -"segmentos separados . Los casos como una intersección por puente o túnel " -"donde no existe conexión vial no son detectados por esta función." +"intersección de la red de caminos, las aristas se descompondrán en segmentos " +"separados . Los casos como una intersección por puente o túnel donde no " +"existe conexión vial no son detectados por esta función." msgid "" -"This function reads the ``edge_table`` table, that has a primary key " -"column ``id`` and geometry column named ``the_geom`` and intersect all " -"the segments in it against all the other segments and then creates a " -"table ``edge_table_noded``. It uses the ``tolerance`` for deciding that " -"multiple nodes within the tolerance are considered the same node." +"This function reads the ``edge_table`` table, that has a primary key column " +"``id`` and geometry column named ``the_geom`` and intersect all the segments " +"in it against all the other segments and then creates a table " +"``edge_table_noded``. It uses the ``tolerance`` for deciding that multiple " +"nodes within the tolerance are considered the same node." msgstr "" "Esta función lee la tabla ``edge_table``, que tiene una columna de clave " -"principal ``id`` y columna de la geometría llamada ``the_geom``, y " -"verifica la intersección de todos los segmentos contra todos los demás " -"segmentos creando una tabla de salida ``edge_table_noded``. Usa la " -"tolerancia ``tolerance`` para decidir cuáles nodos son considerados como " -"mismo nodo." +"principal ``id`` y columna de la geometría llamada ``the_geom``, y verifica " +"la intersección de todos los segmentos contra todos los demás segmentos " +"creando una tabla de salida ``edge_table_noded``. Usa la tolerancia " +"``tolerance`` para decidir cuáles nodos son considerados como mismo nodo." msgid "``float8`` tolerance for coincident points (in projection unit)dd" msgstr "" @@ -16804,8 +16354,8 @@ msgid "" "``text`` Primary key column name of the network table. Default value is " "``id``." msgstr "" -"``text``Nombre de la columna de la clave principal de la tabla de red. " -"Valor por defecto es ``id``'." +"``text``Nombre de la columna de la clave principal de la tabla de red. Valor " +"por defecto es ``id``'." msgid "" "``text`` Geometry column name of the network table. Default value is " @@ -16818,7 +16368,8 @@ msgid "table_ending" msgstr "table_ending" msgid "``text`` Suffix for the new table's. Default value is ``noded``." -msgstr "``text`` sufijo para la nueva tabla. El valor predeterminado es ``noded``." +msgstr "" +"``text`` sufijo para la nueva tabla. El valor predeterminado es ``noded``." msgid "The output table will have for ``edge_table_noded``" msgstr "La tabla de salida tendrá para ``edge_table_noded``" @@ -16839,18 +16390,18 @@ msgid "``integer`` Segment number of the original edge" msgstr "``integer`` número del segmento del borde original" msgid "" -"``integer`` Empty source column to be used with :doc:`pgr_createTopology`" -" function" +"``integer`` Empty source column to be used with :doc:`pgr_createTopology` " +"function" msgstr "" -"``integer`` Columna de origen vacía que se utilizará con la función " -":doc:`pgr_createTopology`" +"``integer`` Columna de origen vacía que se utilizará con la función :doc:" +"`pgr_createTopology`" msgid "" -"``integer`` Empty target column to be used with :doc:`pgr_createTopology`" -" function" +"``integer`` Empty target column to be used with :doc:`pgr_createTopology` " +"function" msgstr "" -"``integer`` Columna vacía de destino que se utilizará con la función " -":doc:`pgr_createTopology`" +"``integer`` Columna vacía de destino que se utilizará con la función :doc:" +"`pgr_createTopology`" msgid "the geom" msgstr "la geom" @@ -16868,15 +16419,15 @@ msgid "Now we can analyze the network." msgstr "Ahora podemos analizar la red." msgid "" -"The analysis tell us that the network has a gap and an intersection. We " -"try to fix the problem using:" +"The analysis tell us that the network has a gap and an intersection. We try " +"to fix the problem using:" msgstr "" -"El análisis dice que la red tiene un hueco y una intersección. Trataremos" -" de solucionar el problema usando:" +"El análisis dice que la red tiene un hueco y una intersección. Trataremos de " +"solucionar el problema usando:" msgid "" -"Inspecting the generated table, we can see that edges 13,14 and 18 has " -"been segmented" +"Inspecting the generated table, we can see that edges 13,14 and 18 has been " +"segmented" msgstr "" "Inspeccionar la tabla generada, podemos ver que los bordes 13,14 y 18 ha " "sido segmentado" @@ -16936,11 +16487,11 @@ msgid "Edges with 2 dead ends 17,18" msgstr "Bordes con 2 callejones sin salida 17,18" msgid "" -"Edge 17's right node is a dead end because there is no other edge sharing" -" that same node. (cnt=1)" +"Edge 17's right node is a dead end because there is no other edge sharing " +"that same node. (cnt=1)" msgstr "" -"Nodo derecho borde de 17 es un callejón sin salida porque no hay ningún " -"otro borde que comparta ese mismo nodo. (cnt = 1)" +"Nodo derecho borde de 17 es un callejón sin salida porque no hay ningún otro " +"borde que comparta ese mismo nodo. (cnt = 1)" msgid "Edges with 1 dead end: 1-1 ,6-1,14-2, 18-1 17-1 18-2" msgstr "Los bordes con 1 callejón sin salida: 1-1, 6-1,14-2, 18-1-17-1 18-2" @@ -16964,18 +16515,18 @@ msgid "Gaps" msgstr "Espacios" msgid "" -"There is a gap between edge 17 and 14 because edge 14 is near to the " -"right node of edge 17" +"There is a gap between edge 17 and 14 because edge 14 is near to the right " +"node of edge 17" msgstr "" -"Existe un espacio entre la arista 17 y la 14 porque la arista 14 está " -"cerca del nodo derecho a la arista 17" +"Existe un espacio entre la arista 17 y la 14 porque la arista 14 está cerca " +"del nodo derecho a la arista 17" msgid "" "Edge 14 was segmented Now edges: 14-1 14-2 17 share the same node The " "tolerance value was taken in account" msgstr "" -"Borde 14 fue segmentado ahora bordes: 14-1 14-2 17 comparten el mismo " -"nodo, el valor de tolerancia fue tomado en cuenta" +"Borde 14 fue segmentado ahora bordes: 14-1 14-2 17 comparten el mismo nodo, " +"el valor de tolerancia fue tomado en cuenta" msgid "Intersections" msgstr "Intersecciones" @@ -16984,39 +16535,39 @@ msgid "Edges 13 and 18 were intersecting" msgstr "Bordes 13 y 18 años se intersectan" msgid "" -"Edges were segmented, So, now in the interection's point there is a node " -"and the following edges share it: 13-1 13-2 18-1 18-2" +"Edges were segmented, So, now in the interection's point there is a node and " +"the following edges share it: 13-1 13-2 18-1 18-2" msgstr "" -"Bordes fueron segmentados, ahora en el punto de la interesección hay un " -"nodo y los bordes siguientes lo comparten: 13-1 13-2-18-1 18-2" +"Bordes fueron segmentados, ahora en el punto de la interesección hay un nodo " +"y los bordes siguientes lo comparten: 13-1 13-2-18-1 18-2" msgid "" -"Now, we are going to include the segments 13-1, 13-2 14-1, 14-2 ,18-1 and" -" 18-2 into our edge-table, copying the data for dir,cost,and reverse cost" -" with tho following steps:" +"Now, we are going to include the segments 13-1, 13-2 14-1, 14-2 ,18-1 and " +"18-2 into our edge-table, copying the data for dir,cost,and reverse cost " +"with tho following steps:" msgstr "" -"Ahora, vamos a incluir los segmentos 13-1, 13-2-14-1, 14-2, 18-1 y 18-2 " -"en nuestra tabla de bordes, copiando además los datos para dir, costo y " -"costo inverso con los siguientes los pasos:" +"Ahora, vamos a incluir los segmentos 13-1, 13-2-14-1, 14-2, 18-1 y 18-2 en " +"nuestra tabla de bordes, copiando además los datos para dir, costo y costo " +"inverso con los siguientes los pasos:" msgid "" -"Add a column old_id into edge_table, this column is going to keep track " -"the id of the original edge" +"Add a column old_id into edge_table, this column is going to keep track the " +"id of the original edge" msgstr "" -"Agregar una columna old_id en edge_table, esta columna va a seguir la " -"pista el id del borde original" +"Agregar una columna old_id en edge_table, esta columna va a seguir la pista " +"el id del borde original" msgid "Insert only the segmented edges, that is, the ones whose max(sub_id) >1" msgstr "" -"Introduzca sólo los bordes segmentados, es decir, aquellos cuyo " -"max(sub_id) > 1" +"Introduzca sólo los bordes segmentados, es decir, aquellos cuyo max(sub_id) " +"> 1" msgid "We recreate the topology:" msgstr "Recreamos la topología:" msgid "" -"To get the same analysis results as the topology of edge_table_noded, we " -"do the following query:" +"To get the same analysis results as the topology of edge_table_noded, we do " +"the following query:" msgstr "" "Para obtener los mismos resultados de análisis que la topología de " "edge_table_noded, hacemos la siguiente consulta:" @@ -17025,47 +16576,47 @@ msgid "" "To get the same analysis results as the original edge_table, we do the " "following query:" msgstr "" -"Para obtener los mismos resultados de análisis como el edge_table " -"original, hacemos la siguiente consulta:" +"Para obtener los mismos resultados de análisis como el edge_table original, " +"hacemos la siguiente consulta:" msgid "" -"Or we can analyze everything because, maybe edge 18 is an overpass, edge " -"14 is an under pass and there is also a street level juction, and the " -"same happens with edges 17 and 13." +"Or we can analyze everything because, maybe edge 18 is an overpass, edge 14 " +"is an under pass and there is also a street level juction, and the same " +"happens with edges 17 and 13." msgstr "" -"O podemos analizar todo porque, tal vez edge 18 es un puente, borde 14 es" -" un bajo paso y también hay una juntura nivel calle, y lo mismo ocurre " -"con los bordes 17 y 13." +"O podemos analizar todo porque, tal vez edge 18 es un puente, borde 14 es un " +"bajo paso y también hay una juntura nivel calle, y lo mismo ocurre con los " +"bordes 17 y 13." msgid "" ":doc:`topology-functions` for an overview of a topology for routing " "algorithms. :doc:`pgr_analyzeOneWay` to analyze directionality of the " "edges. :doc:`pgr_createTopology` to create a topology based on the " -"geometry. :doc:`pgr_analyzeGraph` to analyze the edges and vertices of " -"the edge table." +"geometry. :doc:`pgr_analyzeGraph` to analyze the edges and vertices of the " +"edge table." msgstr "" -":doc:`topology-functions` para obtener una visión general de una " -"topología para algoritmos de enrutamiento. :doc:`pgr_analyzeOneWay` para " -"analizar la direccionalidad de los bordes. :doc:`pgr_createTopology` para" -" crear una topología basada en la geometría. :doc:`pgr_analyzeGraph` para" -" analizar los bordes y vértices de la tabla de bordes." +":doc:`topology-functions` para obtener una visión general de una topología " +"para algoritmos de enrutamiento. :doc:`pgr_analyzeOneWay` para analizar la " +"direccionalidad de los bordes. :doc:`pgr_createTopology` para crear una " +"topología basada en la geometría. :doc:`pgr_analyzeGraph` para analizar los " +"bordes y vértices de la tabla de bordes." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" #, fuzzy msgid "``pgr_pickDeliver`` - Experimental" @@ -17073,15 +16624,15 @@ 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" +"``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." +"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." +"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." @@ -17138,18 +16689,17 @@ 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" +"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" +"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**])" +"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -17195,43 +16745,41 @@ msgid "[end_node_id, end_open, end_close, end_service]" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ " -"current(`3.1 " -"`__) " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ current(`3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 `__ " -"`2.1 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__" msgstr "" -"**Versiones No Soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 `__ " -"`2.1 `__" +"**Versiones No Soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__" #, fuzzy msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "pgr_pickDeliverEuclidean - Experimental" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "" +"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -"``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida" -" y Entrega" +"``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida y " +"Entrega" msgid "Replaces ``pgr_gsoc_vrppdtw``" msgstr "Reemplaza ``pgr_gsoc_vrppdtw``" @@ -17259,8 +16807,7 @@ 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." +"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." @@ -17288,8 +16835,8 @@ 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/" +"This data example **lc101** is from data published at https://www.sintef.no/" +"projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehciles in the problem all with the same characteristics." @@ -17299,8 +16846,8 @@ msgid "The original orders" msgstr "" msgid "" -"The data comes in different rows for the pickup and the delivery of the " -"same order." +"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 appropiate table:" @@ -17311,8 +16858,8 @@ 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/" +"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" @@ -17322,33 +16869,32 @@ msgid "This implementation's travel time: 854.54" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "``pgr_prim``" msgstr "``pgr_prim``" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +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." +"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." @@ -17364,28 +16910,26 @@ msgid "Minimum spanning forest of a subgraph" msgstr "Bosque de Expansión Mínimo de un subgrafo" msgid "" -"`Boost: Prim's algorithm documentation " -"`__" +"`Boost: Prim's algorithm documentation `__" msgstr "" -"`Boost: algoritmo de Prim " -"`__" +"`Boost: algoritmo de Prim `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__) `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__) `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "``pgr_primBFS``" msgstr "``pgr_primBFS``" @@ -17394,16 +16938,16 @@ 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." +"``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 with Prims's algorithm." +"Visits and extracts the nodes information in Breath First Search ordering of " +"the Minimum Spanning Tree created with Prims's algorithm." msgstr "" "Visita y extrae la información de los nodos en el orden de búsqueda de " -"Primera Búsqueda de Respiración del Árbol de Expansión Mínimo creado con " -"el algoritmo de Prim." +"Primera Búsqueda de Respiración del Árbol de Expansión Mínimo creado con el " +"algoritmo de Prim." #, fuzzy msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -17414,21 +16958,19 @@ msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "``pgr_primDD``" msgstr "``pgr_primDD``" @@ -17437,56 +16979,52 @@ 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." +"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 Prim, se extraen los nodos que tienen costes " -"agregados menores o iguales que el valor de la **Distancia** desde un " -"vértice (o vértices) raíz dentro del árbol de expansión mínimo calculado." +"Mediante el algoritmo Prim, se extraen los nodos que tienen costes agregados " +"menores o iguales que el valor de la **Distancia** desde un vértice (o " +"vértices) raíz dentro del árbol de expansión mínimo calculado." -#, fuzzy msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_primDD(`SQL de aristas`_, **raíz**, **distancia**)" -#, fuzzy msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_primDD(`SQL de aristas`_, **raices**, **distancia**)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "``pgr_primDFS``" msgstr "``pgr_primDFS``" msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +"``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." +"''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." +"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." +"Búsqueda de Profundidad del Árbol de Expansión Mínima creado utilizando el " +"algoritmo de Prim." #, fuzzy msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -17497,46 +17035,44 @@ msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**Versiones no sustentadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Versiones no sustentadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" 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." +"``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." +"``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`_)" @@ -17544,44 +17080,33 @@ msgstr "``pgr_pushRelabel`` (`Combinaciones`_)" msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "Renombrado de ``pgr_maxFlowPushRelabel``" -#, fuzzy msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destino**)" -#, fuzzy msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salida**, **destinos**)" -#, fuzzy msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destino**)" -#, fuzzy msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destinos**)" -#, fuzzy msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgstr "``pgr_pushRelabel`` (`Combinaciones`_)" +msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "" -"**Supported versions:** `Latest " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__ " -"`3.2 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__ " -"`3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "pgr_sequentialVertexColoring - Proposed" msgstr "pgr_sequentialVertexColoring - Propuesto" @@ -17590,37 +17115,35 @@ 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." +"``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo " +"no dirigido, utilizando un enfoque codicioso." msgid "Promoted to **proposed** signature" msgstr "Promovido a firma **propuesta**" 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." +"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." +"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." +"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." +"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|]`" +"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." @@ -17628,23 +17151,24 @@ 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." +"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." +"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." +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))`" +"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," @@ -17657,29 +17181,29 @@ msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" 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." +"``pgr_stoerWagner`` — El corte mínimo del grafo usando el algoritmo Stoer-" +"Wagner." #, fuzzy msgid "Version 3.0" @@ -17689,42 +17213,39 @@ 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." +"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." +"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." +"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." @@ -17737,17 +17258,16 @@ 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." +"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." +"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." +"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)`." @@ -17786,52 +17306,51 @@ msgstr "corte mínimo de una arista" msgid "Using :doc:`pgr_connectedComponents`" msgstr "Usando :doc:`pgr_connectedComponents`" -#, python-format msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__" msgid "``pgr_strongComponents``" msgstr "``pgr_strongComponents``" msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed " -"graph using Tarjan's algorithm based on DFS." +"``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." +"``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." +"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í." +"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**." @@ -17847,27 +17366,27 @@ msgid "The strong components of the graph" msgstr "Los componentes fuertes del grafo" msgid "" -"Boost: `Strong components " -"`__" +"Boost: `Strong components `__" msgstr "" -"Boost: `Components fuertemente conectados " -"`__" +"Boost: `Components fuertemente conectados `__" msgid "" -"wikipedia: `Strongly connected component " -"`__" +"wikipedia: `Strongly connected component `__" msgstr "" -"Wikipedia: `Componentes fuertemente conectados " -"`__" +"Wikipedia: `Componentes fuertemente conectados `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_topologicalSort`` - Experimental" @@ -17877,26 +17396,27 @@ 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)." +"``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." +"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." +"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." +"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." +"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" +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." @@ -17937,30 +17457,30 @@ msgid "Graph is not a DAG" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.1 `__ `3.0 `__" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - Experimental" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "" +"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" msgid "" -"Transforms the input directed graph into the transitive closure of the " -"graph." +"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." @@ -17971,8 +17491,7 @@ msgstr "" msgid "" "Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see " -":doc:`pgr_connectedComponents`)" +"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" @@ -18011,46 +17530,43 @@ 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." +msgstr "" +"Identificadores de los vértices que son alcanzables desde el vértice v." msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ " +"`2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "pgr_trsp - Proposed" msgstr "" @@ -18089,13 +17605,11 @@ msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" msgstr "" msgid "" -"``pgr_trspviaedges(text,integer[],double " -"precision[],boolean,boolean,text)``" +"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" msgstr "" -#, fuzzy msgid "New prototypes:" -msgstr "Nuevo *Via* **prototypes**" +msgstr "Nuevos prototipos:" #, fuzzy msgid "``pgr_trspViaVertices``" @@ -18112,8 +17626,7 @@ msgid "" msgstr "" msgid "" -"It does no guarantee the shortest path as it might contain restriction " -"paths." +"It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -18148,25 +17661,26 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**," -" [``directed``])" +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " +"[``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -#, fuzzy msgid "" "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " "[``directed``])" -msgstr "pgr_dijkstraNear(Combinaciones)" +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 "" msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected " -"graph." +"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." +msgid "" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" msgid "" @@ -18174,27 +17688,24 @@ msgid "" "undirected graph." msgstr "" -#, fuzzy msgid "Using a combinations table on an undirected graph." -msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" +msgstr "Usando una tabla de combinaciones en un grafo no dirigido." msgid "" -"`Deprecated documentation " -"`_" +"`Deprecated documentation `_" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" msgid "``pgr_trspVia`` - Proposed" msgstr "" msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with " -"restrictions." +"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" msgid "New proposed function:" @@ -18204,10 +17715,9 @@ msgid "``pgr_trspVia`` (`One Via`_)" 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." +"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." @@ -18217,8 +17727,7 @@ msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" msgid "" -"For the set of sub paths of the solution that pass through a restriction " -"then" +"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." @@ -18235,30 +17744,29 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that " -"order on an directed graph." +"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**." #, fuzzy 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." +"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**." +"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**." -#, fuzzy msgid "Simulation of how algorithm works." -msgstr "Sumulación del functionamiento del algoritmo" +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 " +"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 "" @@ -18266,9 +17774,8 @@ 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:" +"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``:" @@ -18278,14 +17785,14 @@ 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." +"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." +"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " +"is no ``U_turn_on_edge`` flag." msgstr "" msgid "" @@ -18297,29 +17804,28 @@ msgid ":doc:`via-category`" msgstr ":doc:`via-category`" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" msgid "``pgr_trspVia_withPoints`` - Proposed" msgstr "" msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices " -"and/or points with restrictions." +"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" +"or points with restrictions." msgstr "" msgid "``pgr_trspVia_withPoints`` (`One Via`_)" 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." +"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" @@ -18337,7 +17843,8 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "For the set of paths of the solution that pass through a restriction then" +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." @@ -18346,11 +17853,12 @@ 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**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " +"puntos`_, **vertices**, [**opciones**])" msgid "" "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " @@ -18388,18 +17896,18 @@ msgid "``details``" msgstr "``details``" 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." +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." +"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." +"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." @@ -18415,29 +17923,28 @@ msgid "" "`(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)`." +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)`." +"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)`." +"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)`." +"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`)." +"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." +"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." @@ -18447,46 +17954,45 @@ msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" 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 " +"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." +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:" +"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." +"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." +"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." +"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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" msgid "pgr_trsp_withPoints - Proposed" @@ -18514,8 +18020,8 @@ msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path(s)" msgstr "" -"Modificar el grafo para incluir puntos definidos por points_sql. Usando " -"el algoritmo Dijkstra, busar la o las rutas más cortas" +"Modificar el grafo para incluir puntos definidos por points_sql. Usando el " +"algoritmo Dijkstra, busar la o las rutas más cortas" msgid "Characteristics:" msgstr "Características:" @@ -18527,7 +18033,7 @@ msgid "**positive** when it belongs to the `Edges SQL`_" msgstr "" msgid "**negative** when it belongs to the `Points SQL`_" -msgstr "" +msgstr "**negative** cuando pertence al `SQL de puntos`_" msgid "Driving side can not be ``b``" msgstr "" @@ -18542,45 +18048,51 @@ 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." +"Para fines de optimización, se omite cualquier valor duplicado en start_vids " +"o end_vids." -msgid "The returned values are ordered: - start_vid ascending - end_vid ascending" +msgid "" +"The returned values are ordered: - start_vid ascending - end_vid ascending" msgstr "" -"Los valores devueltos se ordenan: - start_vid ascendente - end_vid " -"ascendente" +"Los valores devueltos se ordenan: - start_vid ascendente - end_vid ascendente" 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**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " +"puntos`_,**salida**, **destino**, [**opciones**])" -#, fuzzy msgid "" "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vid**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +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**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " +"puntos`_,**salidas**, **destino**, [**opciones**])" -#, fuzzy msgid "" "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " "**start vids**, **end vids**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +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**])" +"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**])" #, fuzzy msgid "**options:** ``[directed, driving_side, details]``" @@ -18595,8 +18107,8 @@ msgid "" "side configuration on a directed graph with details." msgstr "" "Desde el punto :math:`1` al vértice :math:`3` con detalles en una " -"configuración de manejo por la **izquierda** en un grafo **dirigido** con" -" **detalles**." +"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:`5`." #, fuzzy @@ -18611,8 +18123,8 @@ msgstr "Desde el punto :math:`1` y vértice :math:`2` al punto :math:`3`." # | 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`." +"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`." msgstr "Desde el punto :math:`1` al punto :math:`3` y vértice :math:`5`." # | msgid "From point :math:`1` and vertex :math:`2` to point :math:`3`." @@ -18623,32 +18135,31 @@ msgid "" msgstr "Desde el punto :math:`1` y vértice :math:`2` al punto :math:`3`." msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the" -" graph of point `(2.9, 1.8)`." +"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 "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +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)`." +"Punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." #, fuzzy msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, " -"1.8)`." +"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)`." +"Punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, " +"1.8)`." msgid "Pass in front or visits." msgstr "" msgid "" -"Which path (if any) passes in front of point :math:`6` or vertex " -":math:`11` with right side driving topology." +"Which path (if any) passes in front of point :math:`6` or vertex :math:`11` " +"with right side driving topology." msgstr "" msgid "Show details on undirected graph." @@ -18659,36 +18170,36 @@ msgstr "" # | "driving side configuration on a **directed** graph with **details**." #, fuzzy msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` to vertex " -":math:`1` on an undirected graph, with details." +"From point :math:`1` and vertex :math:`6` to point :math:`3` to vertex :math:" +"`1` on an undirected graph, with details." msgstr "" "Desde el punto :math:`1` al vértice :math:`3` con detalles en una " -"configuración de manejo por la **izquierda** en un grafo **dirigido** con" -" **detalles**." - -msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" -msgstr "" -"***Versiones soportadas:** `Última " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"configuración de manejo por la **izquierda** en un grafo **dirigido** con " +"**detalles**." + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"***Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "pgr_turnRestrictedPath - Experimental" msgstr "pgr_turnRestrictedPath - Experimental" msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex -Vertex routing " -"with restrictions" +"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex -Vertex routing with " +"restrictions" msgstr "" #, fuzzy @@ -18696,15 +18207,16 @@ msgid "New experimental function" msgstr "Nueva función **Experimental**" msgid "" -"Using Yen's algorithm to obtain K shortest paths and analyze the paths to" -" select the paths that do not use the restrictions" +"Using Yen's algorithm to obtain K shortest paths and analyze the paths to " +"select the paths that do not use the restrictions" msgstr "" -#, fuzzy msgid "" "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " "**end vid**, **K**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_turnRestrictedPath(`SQL de aristas`_, `SQL de restricciones`_, " +"**salida**, **destino**, **K**, [**opciones**])" #, fuzzy msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -18719,7 +18231,8 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgid "" +"When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -18744,52 +18257,45 @@ msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soporadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ `2.2 " +"`__ `2.1 " +"`__ " +"`2.0 `__" +msgstr "" +"**Versiones no soporadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ `2.2 " +"`__ `2.1 " +"`__ " +"`2.0 `__" 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." +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" @@ -18808,40 +18314,38 @@ msgid "pgRouting Version for this documentation" msgstr "Versión de pgRouting para esta documentación" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 `__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__" msgid "pgr_vrpOneDepot - Experimental" msgstr "pgr_vrpOneDepot - Experimental" @@ -18853,45 +18357,43 @@ msgid "**TBD**" msgstr "**TBD**" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgid "``pgr_withPoints`` - Proposed" msgstr "``pgr_withPoints`` - Propuesto" msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional" -" temporary vertices." +"``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." @@ -18906,48 +18408,53 @@ msgid "**negative** when it belongs to the points_sql" msgstr "**negativo** cuando pertenece a points_sql" msgid "" -"When the starting vertex and ending vertex are the same, there is no " -"path. - The agg_cost the non included values (v, v) is 0" +"When the starting vertex and ending vertex are the same, there is no path. - " +"The agg_cost the non included values (v, v) is 0" msgstr "" -"Cuando el vértice inicial y el vértice final son los mismos, no hay " -"ninguna ruta. - El agg_cost los valores no incluidos (v, v) es 0" +"Cuando el vértice inicial y el vértice final son los mismos, no hay ninguna " +"ruta. - El agg_cost los valores no incluidos (v, v) es 0" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path: - The agg_cost the non included values (u, v) is ∞" +"When the starting vertex and ending vertex are the different and there is no " +"path: - The agg_cost the non included values (u, v) is ∞" msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y no hay " -"ninguna ruta: - En ell agg_cost los valores no incluidos (u, v) es ∞" +"Cuando el vértice inicial y el vértice final son diferentes y no hay ninguna " +"ruta: - En ell agg_cost los valores no incluidos (u, v) es ∞" -#, fuzzy msgid "" "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " "[**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_withPoints(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, " +"[**opciones**])" -#, fuzzy msgid "" "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " "[**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_withPoints(`SQL de aristas`_, `SQL de puntos`_, **salida**, " +"**destinos**, [**opciones**])" -#, fuzzy msgid "" "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " "[**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_withPoints(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " +"**destino**, [**opciones**])" -#, fuzzy msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**," -" [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " +"[**options**])" +msgstr "" +"pgr_withPoints(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " +"**destinos**, [**opciones**])" -#, fuzzy msgid "" "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " "[**options**])" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" +msgstr "" +"pgr_withPoints(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, " +"[**opciones**])" #, fuzzy msgid "**options:** ``[directed, driving_side, details])``" @@ -18987,8 +18494,8 @@ msgid "RETURNS SET OF |pid-m-m|" msgstr "Devuelve el conjunto de ``(node)``" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex " -":math:`1`" +"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`" msgstr "" "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y al " "vértice :math:`1`" @@ -19000,26 +18507,26 @@ 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**." +"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 "" -"Identifier of the starting vertex of the path. Negative value is for " -"point’s identifier." +"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." +"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." +"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." +"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." @@ -19028,8 +18535,8 @@ 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." +"Arreglo de identificadores de vértices finales. Valores negativos son para " +"identificadores de puntos." msgid "Value in [``r``, ``l``, ``b``] indicating if the driving side is:" msgstr "Valor en [``r``, ``l``, ``b``] indica si el lado de manejo es:" @@ -19044,16 +18551,14 @@ msgid "``b`` for both." msgstr "``b`` for ambos." msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." -msgstr "Usa :doc:`pgr_findCloseEdges` en el `SQL puntos`_." +msgstr "Usar :doc:`pgr_findCloseEdges` en el `SQL 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\\}`" +"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\\}`" +"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." @@ -19065,50 +18570,48 @@ msgid "Passes in front or visits with left side driving." msgstr "Pasa enfrente o visita con lado izquierdo de manejo." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgid "``pgr_withPointsCost`` - Proposed" msgstr "``pgr_withPointsCost`` - Propuesto" msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only " -"the aggregate cost of the shortest path(s) found, for the combination of " -"points given." +"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " +"aggregate cost of the shortest path(s) found, for the combination of points " +"given." msgstr "" -"``pgr_withPointsCost`` - Calcula la ruta más corta y devuelve solo el " -"costo agregado de la(s) rutas más cortas encontradas, para la combinación" -" de puntos dados." +"``pgr_withPointsCost`` - Calcula la ruta más corta y devuelve solo el costo " +"agregado de la(s) rutas más cortas encontradas, para la combinación de " +"puntos dados." msgid "pgr_withPointsCost(Combinations)" msgstr "pgr_withPointsCost(Combinaciones)" @@ -19122,11 +18625,11 @@ msgstr "" "cortas encontradas." msgid "" -"Returns the sum of the costs of the shortest path for pair combination of" -" vertices in the modified graph." +"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." +"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." msgid "" "The returned values are in the form of a set of `(start_vid, end_vid, " @@ -19142,11 +18645,11 @@ 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`" msgid "" -"If the values returned are stored in a table, the unique index would be " -"the pair: `(start_vid, end_vid)`." +"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)`." +"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**." @@ -19161,35 +18664,40 @@ msgstr "" msgid "Running time: :math:`O(| start\\_vids | * (V \\log V + E))`" msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V \\log V + E))`" -#, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end " -"vid**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vid**, " +"**[options**])" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, 'SQL de puntos`_, **salida**, " +"**destino**, [**opciones**])" -#, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end " -"vids**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vids**, " +"**[options**])" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, 'SQL de puntos`_, **salida**, " +"**destinos**, [**opciones**])" -#, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end " -"vid**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end vid**, " +"**[options**])" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, 'SQL de puntos`_, **salidas**, " +"**destino**, [**opciones**])" -#, fuzzy msgid "" "pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end " "vids**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, 'SQL de puntos`_, **salidas**, " +"**destinos**, [**opciones**])" -#, fuzzy msgid "" "pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, `Combinations SQL`_, " "**[options**])" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, 'SQL de puntos`_, `SQL de " +"combinaciones`_, [**opciones**])" #, fuzzy msgid "**options:** ``[directed, driving_side]``" @@ -19203,42 +18711,46 @@ 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." +"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:`10` with defaults" msgstr "Del punto :math:`1` al punto :math:`3` con valores por defecto" -#, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -"vids**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " +"**[options**])" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salida**, " +"**destinos**, [**opciones**])" -#, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vid**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " +"**[options**])" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " +"**destino**, [**opciones**])" -#, fuzzy msgid "" "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " "vids**, **[options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " +"**destinos**, [**opciones**])" msgid "" -"From point :math:`15` and vertex :math:`6` to point :math:`3` and vertex" -" :math:`1`" +"From point :math:`15` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`" msgstr "" -"Desde el punto :math:`15` y vértice :math:`6` al punto :math:`3` y " -"vértice :math:`1`" +"Desde el punto :math:`15` y vértice :math:`6` al punto :math:`3` y vértice :" +"math:`1`" -#, fuzzy msgid "" "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " "**[options**])" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" +msgstr "" +"pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, `SQL de " +"combinaciones`_, [**opciones**])" msgid "Identifier of the starting vertex or point." msgstr "Identificador del vértice o punto inicial." @@ -19266,11 +18778,11 @@ 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\\}`" +"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\\}`" +"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" @@ -19279,50 +18791,44 @@ msgid "Does not matter driving side driving topology" msgstr "No importa el lado de manejo" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ `3.1" -" `__ " -"`3.0 `__" -msgstr "" -"Columna ``id`` tiene valor positivo " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ `3.1" -" `__ " -"`3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5" -" `__ " -"`2.4 `__" -" `2.3 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5" -" `__ " -"`2.4 `__" -" `2.3 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"Columna ``id`` tiene valor positivo `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_withPointsCostMatrix`` - proposed" msgstr "``pgr_withPointsCostMatrix`` - propuesto" msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_withPoints`." +"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_withPoints`." msgstr "" -"``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando " -":doc:`pgr_withPoints`." +"``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando :doc:" +"`pgr_withPoints`." msgid "" "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " @@ -19330,8 +18836,8 @@ msgid "" msgstr "" msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, " -"11\\}` on an **undirected** graph" +"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**" @@ -19348,45 +18854,43 @@ 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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"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 "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"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 "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgid "``pgr_withPointsDD`` - Proposed" msgstr "``pgr_withPointsDD`` - Propuesto" @@ -19399,27 +18903,29 @@ msgstr "" "punto de partida." 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." +"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." +"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**," -" [**options A**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " +"[**options A**])" +msgstr "" +"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, " +"**distancia**, [**opciones A**])" -#, fuzzy msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -"**distance**, [**options B**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " +"[**options B**])" +msgstr "" +"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, " +"**distancia**, [**opciones B**])" #, fuzzy msgid "**options A:** ``[directed, driving_side, details]``" @@ -19433,24 +18939,26 @@ msgstr "**Grafo 4: No dirigido, con costo**" msgid "RETURNS SET OF |result-generic-no-seq|" msgstr "Devuelve el conjunto de ``(node)``" -#, fuzzy msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**," -" [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " +"[**options**])" +msgstr "" +"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, " +"**distancia**, [**opciones**])" msgid "" -"Right side driving topology, from point :math:`1` within a distance of " -":math:`3.3` with details." +"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**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " +"[**options**])" +msgstr "" +"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, " +"**distancia**, [**opciones**])" #, fuzzy msgid "**options:** ``[directed, driving_side, details, equicost]``" @@ -19461,11 +18969,11 @@ msgid "RETURNS SET OF |result-m-1-no-seq|" msgstr "Devuelve el conjunto de ``(node)``" msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of " -":math:`3.3` with ``equicost`` on a directed graph" +"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" +"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" @@ -19494,67 +19002,66 @@ msgid ":doc:`pgr_alphaShape`" msgstr ":doc:`pgr_alphaShape`" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgid "pgr_withPointsKSP - Proposed" msgstr "pgr_withPointsKSP - Propuesto" msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using " -"Dijkstra." +"``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 "" -"Modifies the graph to include the points defined in the `Points SQL`_ and" -" using Yen algorithm, finds the :math:`K` shortest paths." +"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 `SQL puntos`_ y " +"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**, [**options**])" -msgstr "Haciendo **vids iniciales** los mismos que **vids destinos**." +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_ **start vid**, **end vid**, " +"**K**, [**options**])" +msgstr "" +"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " +"**destino**, **K**, [**options**])" #, fuzzy msgid "**options:** ``[directed, heap_paths, driving_side, details]``" msgstr "**Grafo 4: No dirigido, con costo**" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph." +msgid "" +"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph." msgstr "" "Obtener 2 rutas desde el punto :math:`1` al punto :math:`2` en un grafo " "dirigido." @@ -19566,8 +19073,8 @@ msgid "" "The driving side is set as **b** both. So arriving/departing to/from the " "point(s) can be in any direction." msgstr "" -"Ambos lados de conducción se establecen como **b**. Así que llegar/partir" -" hacia/desde el o los puntos, puede ser en cualquier dirección." +"Ambos lados de conducción se establecen como **b**. Así que llegar/partir " +"hacia/desde el o los puntos, puede ser en cualquier dirección." msgid "No details are given about distance of other points of the query." msgstr "" @@ -19578,136 +19085,132 @@ msgid "No heap paths are returned." msgstr "No se devuelven rutas pre-calculadas." msgid "`Points SQL`_ query as described." -msgstr "`SQL puntos`_ como se describe." +msgstr "`SQL de puntos`_ como se describe." #, fuzzy msgid "Identifier of the destination vertex." msgstr "Identificador del vértice de salida." 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)`." +"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)`." +"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:`2` with details." +"Get :math:`2` paths using left side driving topology, from point :math:`1` " +"to point :math:`2` with details." msgstr "" -"Obtener :math:`2` rutas, usando topología de manejo por la izquierda, " -"desde el punto :math:`1` al punto :math:`2`, detallado." +"Obtener :math:`2` rutas, usando topología de manejo por la izquierda, desde " +"el punto :math:`1` al punto :math:`2`, 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." +"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." +"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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" msgid "``pgr_withPointsVia`` - Proposed" msgstr "" msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or" -" points." +"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " +"points." msgstr "" msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" msgstr "" 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)`." +"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**, " "[**options**])" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "" +"pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, " +"[**opciones**])" msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that" -" order on a **directed** graph." +"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " +"order on a **directed** graph." msgstr "" 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." +"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 "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" 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." +"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." +"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 " @@ -19717,59 +19220,53 @@ msgstr "" "produce resultados correctos en grafos con bordes paralelos .\"" msgid "" -"Boost: `Prim's algorithm " -"`__" +"Boost: `Prim's algorithm `__" msgstr "" -"Boost: `Algoritmo de Prim " -"`__" +"Boost: `Algoritmo de Prim `__" -#, python-format msgid "" -"Wikipedia: `Prim's algorithm " -"`__" +"Wikipedia: `Prim's algorithm `__" msgstr "" -"Wikipedia: `Algoritmo de Prim " -"`__" +"Wikipedia: `Algoritmo de Prim `__" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ " +"`2.4 `__ `2.3 `__ `2.2 `__" msgid "Proposed Functions" msgstr "Funciones propuestas" 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." +":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." @@ -19793,8 +19290,8 @@ msgid ":doc:`pgr_degree` - Calculates the degree of the vertices of a graph." msgstr ":doc:`pgr_degree` - Calcula el grado de los vertices del grafo." msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the " -"edge table information." +":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." @@ -19821,59 +19318,55 @@ msgid ":doc:`pgr_findCloseEdges`" msgstr ":doc:`pgr_findCloseEdges`" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones soportadas** `Última " -"`__ (`3.4 " -"`__)" +"**Versiones soportadas** `Última `__ (`3.4 `__)" msgid "Reference" msgstr "Referencia" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 `__" -" `2.1 `__" -" `2.0 `__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 `__" -" `2.1 `__" -" `2.0 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ " +"`2.2 `__ " +"`2.1 `__ " +"`2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ " +"`2.2 `__ " +"`2.1 `__ " +"`2.0 `__" msgid "Release Notes" msgstr "Notas de versión" msgid "" -"To see the full list of changes check the list of `Git commits " -"`_ on Github." +"To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" "Para ver la lista completa de cambios, consulte la lista de `Git commits " "`_ en Github." @@ -19982,9 +19475,8 @@ msgstr "" msgid "New experimental functions" msgstr "Nuevas funciones experimentales" -#, fuzzy msgid "Ordering" -msgstr "Ordenamiento es:" +msgstr "Ordenamiento" #, fuzzy msgid "``pgr_cuthillMckeeOrdering``" @@ -20014,8 +19506,8 @@ msgstr "Funciones Obsoletas" #, fuzzy msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" msgstr "" -"Correción pgr_trsp(text,integer,double precision,integer,double " -"precision,boolean,boolean[,text])" +"Correción pgr_trsp(text,integer,double precision,integer,double precision," +"boolean,boolean[,text])" msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" msgstr "" @@ -20024,16 +19516,15 @@ msgstr "" msgid "pgRouting 3.3.2 Release Notes" msgstr "Notas de la versión 3.3.0 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.2 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.2 `_" msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada de 3.3.0 " -"`_" -" en Github" +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada de 3.3.0 `_ en " +"Github" msgid "Revised documentation" msgstr "" @@ -20085,17 +19576,16 @@ msgstr "" msgid "pgRouting 3.3.1 Release Notes" msgstr "Notas de la versión 3.3.0 de pgRouting" -#, fuzzy, python-format +#, fuzzy msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.1 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada de 3.3.0 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada de 3.3.0 `_ en " +"Github." #, fuzzy msgid "" @@ -20116,21 +19606,19 @@ msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "Notas de la versión 3.3.0 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.0 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada de 3.3.0 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada de 3.3.0 `_ en " +"Github." msgid "" -"`#2057 `__: " -"trspViaEdges columns in different order" +"`#2057 `__: trspViaEdges " +"columns in different order" msgstr "" "`#2057 `__: columnas " "trspViaEdges en orden diferente" @@ -20223,31 +19711,29 @@ msgstr "pgr_depthFirstSearch (Vértice único)" msgid "pgRouting 3.2.2 Release Notes" msgstr "Notas de la Versión 3.2.2 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.2 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada 3.2.2 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada 3.2.2 `_ en " +"Github." msgid "Issues" msgstr "Corrección de problemas" msgid "" -"`#2093 `__: " -"Compilation on Visual Studio" +"`#2093 `__: Compilation " +"on Visual Studio" msgstr "" -"`#2093 `__: " -"Compilación con Visual Studio" +"`#2093 `__: Compilación " +"con Visual Studio" msgid "" -"`#2189 `__: Build " -"error on RHEL 7" +"`#2189 `__: Build error " +"on RHEL 7" msgstr "" "`#2189 `__: Error de " "compilación en RHEL 7" @@ -20255,17 +19741,15 @@ msgstr "" msgid "pgRouting 3.2.1 Release Notes" msgstr "Notas de la Versión 3.2.1 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.1 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada 3.2.1 " -"`_" -" on Github." +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada 3.2.1 `_ on " +"Github." msgid "" "`#1883 `__: " @@ -20281,38 +19765,36 @@ 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" +"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" +"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" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.0 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerradas por " -"esta versión, consulte el hito de cierre de Git para 3.2.0 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerradas por esta " +"versión, consulte el hito de cierre de Git para 3.2.0 `_ en Github." msgid "Build" msgstr "Construir" msgid "" -"`#1850 `__: Change " -"Boost min version to 1.56" +"`#1850 `__: Change Boost " +"min version to 1.56" msgstr "" -"`#1850 `__: Cambie la" -" versión mínima de Boost a 1.56" +"`#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" @@ -20392,17 +19874,15 @@ msgstr "pgr_pushRelabel(Combinaciones)" msgid "pgRouting 3.1.4 Release Notes" msgstr "Notas de la Versión 3.1.4 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.4 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.4 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada de 3.1.4 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada de 3.1.4 `_ en " +"Github." msgid "Issues fixes" msgstr "Corrección de problemas" @@ -20410,17 +19890,15 @@ msgstr "Corrección de problemas" msgid "pgRouting 3.1.3 Release Notes" msgstr "pgRouting 3.1.3 Notas de la Versión" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.3 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.3 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerradas por " -"esta versión, consulte el hito de cierre de Git para 3.1.3 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerradas por esta " +"versión, consulte el hito de cierre de Git para 3.1.3 `_ en Github." msgid "" "`#1825 `__: Boost " @@ -20430,62 +19908,60 @@ msgstr "" "respetan las versiones Boost" msgid "" -"`#1849 `__: Boost " -"1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +"`#1849 `__: Boost 1.75.0 " +"geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" -"`#1849 `__: Aumente " -"el error de compilación \"point_xy.hpp\" de la geometría 1.75.0 en el " -"entorno macOS" +"`#1849 `__: Aumente el " +"error de compilación \"point_xy.hpp\" de la geometría 1.75.0 en el entorno " +"macOS" msgid "" "`#1861 `__: vrp " "functions crash server" msgstr "" -"`#1861 `__:servidor " -"de fallas de funciones vrp" +"`#1861 `__:servidor de " +"fallas de funciones vrp" msgid "pgRouting 3.1.2 Release Notes" msgstr "Notas de la Versión pgRouting 3.1.2" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.2 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerradas por " -"esta versión, consulte el `hito cerrado de Git para 3.1.2 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerradas por esta " +"versión, consulte el `hito cerrado de Git para 3.1.2 `_ en Github." msgid "" -"`#1304 `__: FreeBSD " -"12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +"`#1304 `__: FreeBSD 12 " +"64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" -"`#1304 `__: FreeBSD " -"12 de 64 bits falla en pgr_vrOneDepot prueba la función experimental" +"`#1304 `__: FreeBSD 12 " +"de 64 bits falla en pgr_vrOneDepot prueba la función experimental" msgid "" -"`#1356 `__: " -"tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +"`#1356 `__: tools/" +"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" -"`#1356 `__: " -"tools/testers/pg_prove_tests.sh falla cuando no pasa el puerto PostgreSQL" +"`#1356 `__: tools/" +"testers/pg_prove_tests.sh falla cuando no pasa el puerto PostgreSQL" msgid "" -"`#1725 `__: Server " -"crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +"`#1725 `__: Server crash " +"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" -"`#1725 `__: El " -"servidor falla en pgr_pickDeliver y pgr_vrpOneDepot en openbsd" +"`#1725 `__: El servidor " +"falla en pgr_pickDeliver y pgr_vrpOneDepot en openbsd" msgid "" -"`#1760 `__: TSP " -"server crash on ubuntu 20.04 #1760" +"`#1760 `__: TSP server " +"crash on ubuntu 20.04 #1760" msgstr "" -"`#1760 `__: el " -"servidor TSP cae en ubuntu 20.04 #1760" +"`#1760 `__: el servidor " +"TSP cae en ubuntu 20.04 #1760" msgid "" "`#1770 `__: Remove " @@ -20497,25 +19973,21 @@ msgstr "" msgid "pgRouting 3.1.1 Release Notes" msgstr "pgRouting 3.1.1 Notas de la Versión" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta vers 3.1.1 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta vers 3.1.1 `_ on Github." msgid "" -"`#1733 `__: " -"pgr_bdAstar fails when source or target vertex does not exist in the " -"graph" +"`#1733 `__: pgr_bdAstar " +"fails when source or target vertex does not exist in the graph" msgstr "" -"`#1733 `__: " -"pgr_bdAstar falla cuando el vértice de origen o de destino no existe en " -"el gráfico" +"`#1733 `__: pgr_bdAstar " +"falla cuando el vértice de origen o de destino no existe en el gráfico" msgid "" "`#1647 `__: Linear " @@ -20536,8 +20008,8 @@ msgid "" "evaluation on C++ not updated before the results go back to C" msgstr "" "`#1616 `__: La " -"evaluación de la ruta en C ++ no se actualiza antes de que los resultados" -" vuelvan a C" +"evaluación de la ruta en C ++ no se actualiza antes de que los resultados " +"vuelvan a C" msgid "" "`#1300 `__: " @@ -20549,17 +20021,14 @@ msgstr "" msgid "pgRouting 3.1.0 Release Notes" msgstr "Notas de la Versión pgRouting 3.1.0" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `hito " -"cerrado de Git para 3.1.0 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `hito cerrado " +"de Git para 3.1.0 `_ en Github." msgid "pgr_dijkstra(combinations)" msgstr "pgr_dijkstra(combinaciones)" @@ -20576,32 +20045,28 @@ msgstr "Requerimientos mínimos para Sphinx: versión 1.8" msgid "pgRouting 3.0.6 Release Notes" msgstr "Notas de la Versión 3.0.6 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.6 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.6 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora " -"ésta versión, consulte la `meta cerrada de 3.0.6 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " +"versión, consulte la `meta cerrada de 3.0.6 `_ en " +"Github." msgid "pgRouting 3.0.5 Release Notes" msgstr "pgRouting 3.0.5 Notas de la Versión" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.5 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.5 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerradas por " -"esta versión, consulte el hito de cierre de Git para 3.0.5 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerradas por esta " +"versión, consulte el hito de cierre de Git para 3.0.5 `_ en Github." msgid "Backport issues fixes" msgstr "Corrección de problemas de Backport" @@ -20609,17 +20074,15 @@ msgstr "Corrección de problemas de Backport" msgid "pgRouting 3.0.4 Release Notes" msgstr "Notas de la Versión pgRouting 3.0.4" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.4 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.4 `_ on Github." msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerradas por " -"esta versión, consulte la `meta cerrada para 3.0.4 " -"`_" -" en Github." +"Para ver todos los problemas y solicitudes de extracción cerradas por esta " +"versión, consulte la `meta cerrada para 3.0.4 `_ en " +"Github." msgid "pgRouting 3.0.3 Release Notes" msgstr "Notas de la versión de pgRouting 3.0.3" @@ -20627,17 +20090,14 @@ msgstr "Notas de la versión de pgRouting 3.0.3" msgid "pgRouting 3.0.2 Release Notes" msgstr "Notas de la Versión pgRouting 3.0.2" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.2 `_ on Github." msgstr "" "Para ver los problemas cerrados por esta versión, consulte en Github la " -"`meta cerrada para 3.0.2 " -"`_" -" en Github." +"`meta cerrada para 3.0.2 `_ en Github." msgid "" "`#1378 `__: Visual " @@ -20649,21 +20109,18 @@ msgstr "" msgid "pgRouting 3.0.1 Release Notes" msgstr "Notas de la versión 3.0.1 de pgRouting" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Hito " -"cerrado de Git para 3.0.1 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Hito cerrado " +"de Git para 3.0.1 `_ en Github." msgid "" -"`#232 `__: Honor " -"client cancel requests in C /C++ code" +"`#232 `__: Honor client " +"cancel requests in C /C++ code" msgstr "" "`#232 `__: Cliente " "honorable cliente cancela las solicitudes de código C /C++" @@ -20671,17 +20128,14 @@ msgstr "" msgid "pgRouting 3.0.0 Release Notes" msgstr "Notas de la versión de pgRouting 3.0.0" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `hito " -"cerrado de Git para 3.0.0 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `hito cerrado " +"de Git para 3.0.0 `_ en Github." msgid "Fixed Issues" msgstr "Problemas solucionados" @@ -20690,40 +20144,40 @@ msgid "" "`#1153 `__: Renamed " "pgr_eucledianTSP to pgr_TSPeuclidean" msgstr "" -"`#1153 `__: " -"Renombrado de pgr_eucledianTSP a pgr_TSPeuclidean" +"`#1153 `__: Renombrado " +"de pgr_eucledianTSP a pgr_TSPeuclidean" msgid "" -"`#1188 `__: Removed " -"CGAL dependency" +"`#1188 `__: Removed CGAL " +"dependency" msgstr "" -"`#1188 `__: Se " -"suprimió la dependencia CGAL" +"`#1188 `__: Se suprimió " +"la dependencia CGAL" msgid "" "`#1002 `__: Fixed " "contraction issues:" msgstr "" -"`#1002 `__: Problemas" -" de contracción solucionados:" +"`#1002 `__: Problemas de " +"contracción solucionados:" msgid "" -"`#1004 `__: Contracts" -" when forbidden vertices do not belong to graph" +"`#1004 `__: Contracts " +"when forbidden vertices do not belong to graph" msgstr "" -"`#1004 `__: Se " -"contrae cuando los vértices prohibidos no pertenecen al grafo" +"`#1004 `__: Se contrae " +"cuando los vértices prohibidos no pertenecen al grafo" msgid "" -"`#1005 `__: " -"Intermideate results eliminated" +"`#1005 `__: Intermideate " +"results eliminated" msgstr "" -"`#1005 `__: " -"Resultados intermedios eliminados" +"`#1005 `__: Resultados " +"intermedios eliminados" msgid "" -"`#1006 `__: No loss " -"of information" +"`#1006 `__: No loss of " +"information" msgstr "" "`#1006 `__: No hay " "pérdida de información2" @@ -21018,8 +20472,7 @@ msgstr "Se trasladó al legado" msgid "pgr_labelGraph - Use the components family of functions instead." msgstr "" -"pgr_labelGraph - Utilice la familia de componentes de funciones en su " -"lugar." +"pgr_labelGraph - Utilice la familia de componentes de funciones en su lugar." msgid "Max flow - functions were renamed on v2.5.0" msgstr "Max flow - las funciones fueron renombradas en v2.5.0" @@ -21054,88 +20507,76 @@ msgstr "pgr_alphaShape firma antigua" msgid "pgRouting 2.6.3 Release Notes" msgstr "pgRouting 2.6.3 Notas de la Versión" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.3 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.3 `_ on Github." msgstr "" "Para ver los problemas cerrados por esta versión, consulte `Git closed " -"milestone for 2.6.3 " -"`_" -" en Github." +"milestone for 2.6.3 `_ en Github." msgid "" -"`#1219 `__ Implicit " -"cast for via_path integer to text" +"`#1219 `__ Implicit cast " +"for via_path integer to text" msgstr "" -"`#1219 `__ Implicit " -"cast for via_path integer to text" +"`#1219 `__ Implicit cast " +"for via_path integer to text" msgid "" "`#1193 `__ Fixed " "pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" msgstr "" -"`#1193 `__ Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" msgid "" "`#1185 `__ Improve " "FindPostgreSQL.cmake" msgstr "" -"`#1185 `__ Improve " -"FindPostgreSQL.cmake" msgid "pgRouting 2.6.2 Release Notes" msgstr "pgRouting 2.6.2 Notas de la versión" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.2 `_ on Github." msgstr "" "Para ver los problemas cerrados por esta versión, consulte en Github la " -"`meta cerrada para 2.6.2 " -"`_." +"`meta cerrada para 2.6.2 `_." msgid "" -"`#1152 `__ Fixes " -"driving distance when vertex is not part of the graph" +"`#1152 `__ Fixes driving " +"distance when vertex is not part of the graph" msgstr "" -"`#1152 `__ Corrige la" -" distancia de conducción cuando el vértice no forma parte del grafo" +"`#1152 `__ Corrige la " +"distancia de conducción cuando el vértice no forma parte del grafo" msgid "" -"`#1098 `__ Fixes " -"windows test" +"`#1098 `__ Fixes windows " +"test" msgstr "" -"`#1098 `__ " -"Correcciones de pruebas de ventanas" +"`#1098 `__ Correcciones " +"de pruebas de ventanas" msgid "" -"`#1165 `__ Fixes " -"build for python3 and perl5" +"`#1165 `__ Fixes build " +"for python3 and perl5" msgstr "" -"`#1165 `__ " -"Correcciones de la compilación de python3 y perl5" +"`#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" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.6.1 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.6.1 `_ en Github." msgid "Fixes server crash on several functions." msgstr "Corrige el bloqueo del servidor en varias funciones." @@ -21217,8 +20658,8 @@ 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" +"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" @@ -21229,35 +20670,31 @@ 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" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.0 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte la `meta " -"cerrada para 2.6.0 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte la `meta cerrada " +"para 2.6.0 `_ en Github." msgid "pgr_lineGraphFull" msgstr "pgr_lineGraphFull" msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double " -"precision,boolean,boolean[,text])" +"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])" +"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)" +"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)" @@ -21272,11 +20709,11 @@ msgid "Internal code" msgstr "Código interno" msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [," -" text])" +"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])" +"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" @@ -21290,22 +20727,18 @@ msgstr "Limpiado el código interno de withPoints" msgid "pgRouting 2.5.5 Release Notes" msgstr "Notas de la versión de PgRouting 2.5.5" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.5 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.5 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.5.5 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.5.5 `_ en Github." 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" +"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" @@ -21316,72 +20749,61 @@ 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" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.4 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.4 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.5.4 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.5.4 `_ en Github." msgid "pgRouting 2.5.3 Release Notes" msgstr "Notas de la versión de pgRouting 2.5.3" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.3 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.3 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.5.3 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.5.3 `_ en Github." 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" +"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" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.2 `_ on Github." msgstr "" "Para ver los problemas cerrados por esta versión, consulte el`Git closed " -"milestone for 2.5.2 " -"`_" -" en Github." +"milestone for 2.5.2 `_ en Github." msgid "Fix for postgresql 10.1: Removed a compiler condition" -msgstr "Arreglo para postgresql 10.1: Se ha eliminado una condición del compilador" +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" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.5.1 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.5.1 `_ en Github." msgid "Fixed prerequisite minimum version of: cmake" msgstr "Prerrequisito fijo versión mínima de: cmake" @@ -21391,14 +20813,12 @@ msgstr "Notas de la versión de pgRouting 2.5.0" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.5.0 " -"`_" -" on Github." +"2.5.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.5.0 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.5.0 `_ en Github." msgid "enhancement:" msgstr "mejora:" @@ -21419,7 +20839,8 @@ 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" +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:" @@ -21459,8 +20880,7 @@ 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" +"pgr_maximumCardinalityMatching - utilice pgr_maxCardinalityMatch en su lugar" msgid "Deprecated function" msgstr "Función Obsoleta" @@ -21471,17 +20891,14 @@ msgstr "pgr_pointToEdgeNode" msgid "pgRouting 2.4.2 Release Notes" msgstr "Notas de la versión de pgRouting 2.4.2" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.4.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.4.2 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.4.2 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.4.2 `_ en Github." msgid "Improvement" msgstr "Mejora" @@ -21492,25 +20909,23 @@ 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" +msgid "" +"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "" -"Reemplace __linux__ por __GLIBC__ para cabeceras y funciones específicas " -"de glibc" +"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" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.4.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.4.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" milestone for 2.4.1 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"milestone for 2.4.1 `_ on Github." msgid "Fixed compiling error on macOS" msgstr "Corregido error de compilación en macOS" @@ -21523,14 +20938,12 @@ msgstr "Notas de la versión de pgRouting 2.4.0" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.4.0 " -"`_" -" on Github." +"2.4.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte el `Git closed" -" issues for 2.4.0 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta versión, consulte el `Git closed " +"issues for 2.4.0 `_ on Github." msgid "New Signatures" msgstr "Nuevas Firmas" @@ -21590,27 +21003,24 @@ msgstr "Notas de la versión de pgRouting 2.3.2" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.2 " -"`_" -" on Github." +"2.3.2 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.3.2 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.3.2 `_ en Github." 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." +"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" +"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" @@ -21620,14 +21030,12 @@ msgstr "Notas de la versión de pgRouting 2.3.1" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.1 " -"`_" -" on Github." +"2.3.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.3.1 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.3.1 `_ on Github." msgid "Leaks on proposed max_flow functions" msgstr "Fugas en las funciones max_flow propuestas" @@ -21643,14 +21051,12 @@ msgstr "Notas de la versión de pgRouting 2.3.0" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.0 " -"`_" -" on Github." +"2.3.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.3.0 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.3.0 `_ en Github." msgid "pgr_TSP" msgstr "pgr_TSP" @@ -21732,14 +21138,12 @@ msgstr "Notas de la versión de pgRouting 2.2.4" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.4 " -"`_" -" on Github." +"2.2.4 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.2.4 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.2.4 `_ on Github." msgid "Bogus uses of extern \"C\"" msgstr "Bogus usos de extern \"C\"" @@ -21755,14 +21159,12 @@ msgstr "Notas de la versión de pgRouting 2.2.3" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.3 " -"`_" -" on Github." +"2.2.3 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.2.3 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.2.3 `_ en Github." msgid "Fixed compatibility issues with PostgreSQL 9.6." msgstr "Problemas de compatibilidad con PostgreSQL 9.6 corregidos." @@ -21772,14 +21174,12 @@ msgstr "Notas de la versión de pgRouting 2.2.2" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.2 " -"`_" -" on Github." +"2.2.2 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte la `meta " -"cerrada para 2.2.2 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte la `meta cerrada " +"para 2.2.2 `_ en Github." msgid "Fixed regression error on pgr_drivingDistance" msgstr "Corregido error de regresión en pgr_drivingDistance" @@ -21789,14 +21189,12 @@ msgstr "Notas de la versión de pgRouting 2.2.1" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.1 " -"`_" -" on Github." +"2.2.1 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.2.1 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.2.1 `_ en Github." msgid "Server crash fix on pgr_alphaShape" msgstr "Corrección de bloqueo del servidor en pgr_alphaShape" @@ -21809,14 +21207,12 @@ msgstr "Notas de la versión de pgRouting 2.2.0" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.0 " -"`_" -" on Github." +"2.2.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.2.0 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.2.0 `_ on Github." msgid "Improvements" msgstr "Mejoras" @@ -21910,14 +21306,12 @@ msgstr "Notas de la versión de pgRouting 2.1.0" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.1.0 " -"`_" -" on Github." +"2.1.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.1.0 " -"`_" -" en Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.1.0 `_ en Github." msgid "pgr_dijkstra(one to many)" msgstr "pgr_dijkstra(uno a muchos)" @@ -21944,18 +21338,18 @@ msgid "pgr_drivingDistance(single vertex)" msgstr "pgr_drivingDistance(single vertex)" msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes" -" and alpha parameter." +"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." +"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.)" +"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " +"author.)" msgstr "" -"Funciones propuestas de Steve Woodbridge, (Clasificado como Conveniencia " -"por el autor.)" +"Funciones propuestas de Steve Woodbridge, (Clasificado como Conveniencia por " +"el autor.)" msgid "" "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " @@ -21965,8 +21359,8 @@ msgstr "" "basado en la arista más cercana." msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect " -"end to end." +"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." @@ -21978,20 +21372,22 @@ 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." +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." +"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." +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." +"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:" @@ -22061,12 +21457,11 @@ 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" +"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" +"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" @@ -22085,19 +21480,17 @@ msgstr "Notas de la versión de pgRouting 2.0.0" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.0.0 " -"`_" -" on Github." +"2.0.0 `_ on Github." msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git " -"closed issues for 2.0.0 " -"`_" -" on Github." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 2.0.0 `_ on Github." msgid "" "With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.x Release Notes`_ releases. The main Goals " -"for this release are:" +"compatibility to `pgRouting 1.x Release Notes`_ 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.x " @@ -22134,18 +21527,17 @@ msgid "Important Changes" msgstr "Cambios Importantes" msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems" -" in a graph" +"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" +"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)" +"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)" @@ -22172,8 +21564,8 @@ msgstr "" 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 \"Shooting Star\"" +"Ruta más corta con giros restringidos (pgr_trsp) que reemplaza a la estrella " +"fugaz \"Shooting Star\"" msgid "Dropped support for Shooting Star" msgstr "Se deja de soportar a la Estrella fugaz \"Shooting Star\"" @@ -22182,20 +21574,21 @@ 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" +"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." +"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." +"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" +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" @@ -22234,17 +21627,16 @@ msgid "pgRouting 1.x Release Notes" msgstr "Notas de versión de pgRouting 1.x" msgid "" -"To see the issues closed by this release see the `Git closed issues for " -"1.x " -"`_" -" on Github. The following release notes have been copied from the " -"previous ``RELEASE_NOTES`` file and are kept as a reference." +"To see the issues closed by this release see the `Git closed issues for 1.x " +"`_ 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 " -"`_" -" on Github. The following release notes have been copied from the " -"previous ``RELEASE_NOTES`` file and are kept as a reference." +"Para ver los problemas cerrados por esta versión, consulte los `Git closed " +"issues for 1.x `_ 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" @@ -22281,8 +21673,8 @@ 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" +"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" @@ -22300,8 +21692,7 @@ msgid "PostgreSQL 8.2 support" msgstr "Soporte PostgreSQL 8.2" msgid "" -"Shortest path functions return empty result if they could not find any " -"path" +"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" @@ -22310,96 +21701,85 @@ 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" +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 "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"routing_postgis.SQL fue modificado para utilizar dijkstra en la búsqueda TSP" + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "Function Families" msgstr "Familias de Funciones" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 " "`__ " -"`2.0 " -"`__" +"`2.0 `__" msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__ " -"`2.0 " -"`__" +"`2.2 `__ `2.1 `__ `2.0 `__" msgid "Sample Data" msgstr "Datos Muestra" @@ -22407,13 +21787,13 @@ msgstr "Datos Muestra" #, fuzzy msgid "" "The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the mayority " -"of the examples queries, follow the instructions bellow." +"sample network that resembles a city. To be able to execute the mayority of " +"the examples queries, follow the instructions bellow." msgstr "" -"La documentación proporciona consultas de ejemplo muy simples basadas en " -"una red muestra pequeña. Para ser capaz de ejecutar las consultas de la " -"muestra, ejecute los siguientes comandos SQL para crear una tabla con el " -"conjunto de datos de la red." +"La documentación proporciona consultas de ejemplo muy simples basadas en una " +"red muestra pequeña. Para ser capaz de ejecutar las consultas de la muestra, " +"ejecute los siguientes comandos SQL para crear una tabla con el conjunto de " +"datos de la red." msgid "Main graph" msgstr "" @@ -22425,25 +21805,23 @@ 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, cpacity values, category values and some locations that are not " -"in the graph." +"Information known at this point is the geometry of the edges, cost values, " +"cpacity 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." +"The process to have working topology starts by inserting the edges. After " +"that everything else is calculated." msgstr "" msgid "Edges" 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 oposite direction. Therfore some information has the ``reverse_`` " -"prefix which corresponds to the segment on the oposite direction of the " -"geometry." +"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 " +"oposite direction. Therfore some information has the ``reverse_`` prefix " +"which corresponds to the segment on the oposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -22493,19 +21871,20 @@ msgid "Starting on PostgreSQL 12::" msgstr "" msgid "" -"Optionally indexes on different columns can be created. The recomendation" -" is to have" +"Optionally indexes on different columns can be created. The recomendation is " +"to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "" +"``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" msgid "" -"``geom`` indexed to speed up gemetry processes that might be needed in " -"the front end." +"``geom`` indexed to speed up gemetry processes that might be needed in the " +"front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -22518,17 +21897,17 @@ 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." +"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`:" +"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 "" @@ -22560,8 +21939,8 @@ msgid "" "This queries based on the vertices data create a topology by filling the " "``source`` and ``target`` columns in the edges table." msgstr "" -"Antes de probar una función de ruteo, utiliza esta consulta para crear " -"una topología (rellena las columnas ``source`` y ``target``)." +"Antes de probar una función de ruteo, utiliza esta consulta para crear una " +"topología (rellena las columnas ``source`` y ``target``)." #, fuzzy msgid "Topology data" @@ -22575,13 +21954,13 @@ msgid "Support tables" msgstr "Crear tabla" msgid "" -"Many functions can be used with a combinations of ``(source, target)`` " -"pairs when wanting a route from ``source`` to ``target``." +"Many functions can be used with a combinations of ``(source, target)`` pairs " +"when wanting a route from ``source`` to ``target``." msgstr "" msgid "" -"For convinence of this documentations, some combinations will be stored " -"on a table:" +"For convinence of this documentations, some combinations will be stored on a " +"table:" msgstr "" msgid "Inserting the data:" @@ -22594,12 +21973,13 @@ msgid "Some functions accept soft restrictions about the segments." msgstr "" msgid "Red arrows correspond when ``cost`` > 0 in the edge table." -msgstr "Las flechas rojas corresponden cuando ``cost`` > 0 en la tabla de aristas." +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." +"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." @@ -22612,11 +21992,11 @@ msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "**Grafo 2: No dirigido, con costo y costo inverso**" msgid "" -"When working with city networks, this is recommended for point of view of" -" vehicles." +"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." +"Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de " +"vista de los vehículos." #, fuzzy msgid "Directed, with cost and reverse_cost" @@ -22627,11 +22007,11 @@ msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "**Grafo 2: No dirigido, con costo y costo inverso**" msgid "" -"When working with city networks, this is recommended for point of view of" -" pedestrians." +"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." +"Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de " +"vista de los peatones." #, fuzzy msgid "Undirected, with cost and reverse cost" @@ -22655,21 +22035,21 @@ msgid "Pick & Deliver Data" msgstr "Datos de Recogida y Entrega" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "Spanning Tree - Category" msgstr "Árbol de expansión - Categoría" @@ -22678,8 +22058,8 @@ 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." +"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 " @@ -22690,121 +22070,105 @@ msgstr "" "conectado." msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" -msgstr "" -"**Versiones soportadas:** `Última " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" - -msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " +"**Supported versions:** `Latest `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 " "`__ " -"`2.0 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " +"`2.0 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 " "`__ " -"`2.0 " -"`__" +"`2.0 `__" msgid "" "pgRouting community support is available through the `pgRouting website " -"`_, `documentation " -"`_, tutorials, mailing lists and others. If " -"you’re looking for :ref:`commercial support `, 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 `_, `documentación " -"`_, tutoriales, listas de correos y otros. Si " -"estás buscando :ref:`Soporte Comercial `, a " -"continuación se encuentra una lista de compañias que proporcionan " -"servicios de consultoría y desarrollo de pgRouting." +"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " +"for :ref:`commercial support `, 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 `_, `documentación `_, tutoriales, listas de correos y otros. Si estás " +"buscando :ref:`Soporte Comercial `, 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 " -"`_. Please follow these " -"steps:" +"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" -"Errores son registrados y manejados en un `issue tracker " -"`_. Por favor siga los " -"siguientes pasos:" +"Errores son registrados y manejados en un `issue tracker `_. 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." +"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." +"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 " -"`__ for it." +"If your problem is unreported, create a `new issue `__ for it." msgstr "" -"Si su problema no se ha informado, cree un `nuevo asunto " -"`__ para ello." +"Si su problema no se ha informado, cree un `nuevo asunto `__ 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." +"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." +"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." +"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." +"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." +"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." +"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." +"Se recomienda usar siguiente envoltorio en el problema para determinar el " +"paso que está causando el problema." msgid "Mailing List and GIS StackExchange" msgstr "Listas de correo y GIS StackExchange" @@ -22813,57 +22177,55 @@ msgid "" "There are two mailing lists for pgRouting hosted on OSGeo mailing list " "server:" msgstr "" -"Hay dos listas de correo para pgRouting alojados en las listas de correo " -"del Servidor de OSGeo:" +"Hay dos listas de correo para pgRouting alojados en las listas de correo del " +"Servidor de OSGeo:" msgid "" -"User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-" -"users" +"User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" msgstr "" -"Lista de correo para usuarios: https://lists.osgeo.org/mailman/listinfo" -"/pgrouting-users" +"Lista de correo para usuarios: https://lists.osgeo.org/mailman/listinfo/" +"pgrouting-users" msgid "" -"Developer mailing list: https://lists.osgeo.org/mailman/listinfo" -"/pgrouting-dev" +"Developer mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-" +"dev" msgstr "" -"Lista de correo para desarroladores: " -"https://lists.osgeo.org/mailman/listinfo/pgrouting-dev" +"Lista de correo para desarroladores: https://lists.osgeo.org/mailman/" +"listinfo/pgrouting-dev" msgid "" -"For general questions and topics about how to use pgRouting, please write" -" to the user mailing list." +"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 "" -"You can also ask at `GIS StackExchange `_" -" 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 " -"`_." +"You can also ask at `GIS StackExchange `_ " +"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 `_." msgstr "" -"También puede preguntar en `GIS StackExchange " -"`_ 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 " -"`_." +"También puede preguntar en `GIS StackExchange `_ 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 `_." 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:" +"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:" +"consultoría, considere ponerse en contacto con cualquiera de las siguientes " +"organizaciones, que han contribuido significativamente al desarrollo de " +"pgRouting:" msgid "**Company**" msgstr "**Empresa**" @@ -22896,65 +22258,59 @@ msgid "https://www.osgeo.org/service-providers/netlab/" msgstr "https://www.osgeo.org/service-providers/netlab/" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__" -" `2.0 " -"`__" -msgstr "" -"**Versiones no soportadas** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__" -" `2.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" + +msgid "" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" +msgstr "" +"**Versiones no soportadas** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgid "Topology - Family of Functions" msgstr "Topología - Familia de Funciones" msgid "" -"The pgRouting's topology of a network represented with a graph in form of" -" two tables: and edge table and a vertex table." +"The pgRouting's topology of a network represented with a graph in form of " +"two tables: and edge table and a vertex table." msgstr "" msgid "" "Attributes associated to the tables help to indicate if the graph is " "directed or undirected, if an edge is one way on a directed graph, and " -"depending on the final application needs, suitable topology(s) need to be" -" created." +"depending on the final application needs, suitable topology(s) need to be " +"created." msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to " -"analyze the topology." +"pgRouting suplies some functions to create a routing topology and to analyze " +"the topology." msgstr "" msgid "Additional functions to create a graph:" @@ -22964,51 +22320,49 @@ msgid "Additional functions to analyze a graph:" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgid "" -"**Unsupported versions:** `2.6 `__" +"**Unsupported versions:** `2.6 `__" msgstr "" -"**Versiones No Soportadas:** `2.6 `__" +"**Versiones No Soportadas:** `2.6 `__" msgid "Transformation - Family of functions (Experimental)" msgstr "Transformation - Familia de funciones (Experimental)" 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')`." +"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')`." +"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 "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgid "Traversal - Family of functions" msgstr "Traversal - Familia de funciones" @@ -23017,13 +22371,13 @@ msgid "Aditionaly there are 2 categories under this family" msgstr "Adicionalmente, hay dos categorías en esta familia" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones Soportadas:** `Última `__ (`3.4 `__)" +"**Versiones Soportadas:** `Última `__ (`3.4 `__)" msgid "Via - Category" msgstr "Via- Categoria" @@ -23032,18 +22386,18 @@ 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" +"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" +"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 continuos route that visits all the vertices in " -"the order given." +"In other words, find a continuos 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." +"En otras palabras, encuentre la ruta continua que visite todos los vértices " +"en el orden dado." msgid "path" msgstr "camino" @@ -23064,26 +22418,27 @@ 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." +"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 on 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." +msgstr "" +"Dependiendo de la función, serán necesarias una o mas consultas internas." msgid "Used on" msgstr "Usado en" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__)" +"**Versiones soportadas:** `Última `__ (`3.4 `__)" msgid "withPoints - Category" msgstr "withPoints- Categoría" @@ -23092,11 +22447,11 @@ 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." +"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 `Points SQL`_ ." +"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 " @@ -23106,31 +22461,31 @@ msgstr "" "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." +"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." +"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." +"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." +"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\":" +"Todas estas funciones consideran el mayor numero características posibles " +"del \"mundo real\":" msgid "Kind of graph:" msgstr "Tipo de grafo:" @@ -23144,7 +22499,8 @@ 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." +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." @@ -23163,29 +22519,31 @@ 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." +"**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." +"**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." +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." +"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" +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." +"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." @@ -23203,27 +22561,27 @@ 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 el `SQL de puntos`_" +msgstr "signo negativo es un punto en la `SQL de puntos`_" msgid "About points" msgstr "Sobre los puntos" msgid "" -"For this section the following city (see :doc:`sampledata`) some " -"interesing points such as restaurant, supermarket, post office, etc. will" -" be used as example." +"For this section the following city (see :doc:`sampledata`) some interesing " +"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." +"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" +"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 "" @@ -23234,8 +22592,8 @@ 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)``" +"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**." @@ -23247,8 +22605,8 @@ 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:" +"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:" @@ -23266,11 +22624,11 @@ 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." +"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." +"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)``" @@ -23301,8 +22659,7 @@ 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``" +"Como si se tuvieran todos los puntos en ambos lados considerados como ``b``" msgid "Prefered usage on **undirected** graphs" msgstr "Uso preferido en grafos **no dirigidos**" @@ -23323,8 +22680,8 @@ 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." +"This section will demonstrate how a temporary vertex is created internally " +"on the graph." msgstr "" msgid "Problem" @@ -23352,8 +22709,8 @@ 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`)" +"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " +"0.4`)" msgstr "" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" @@ -23362,7 +22719,8 @@ 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." +msgid "" +"If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" @@ -23378,21 +22736,21 @@ 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:" +"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." +"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." +"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " +"graph." msgstr "" msgid "When driving side does not matter" @@ -23405,8 +22763,8 @@ 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." +"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:" @@ -23421,55 +22779,53 @@ 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." +"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." +"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " +"graph." +msgstr "" + +msgid "" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" +"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**Versiones soportadas:** `Última `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" - -msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -msgstr "" -"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ `2.2 `__" +msgstr "" +"**Versiones no soportadas:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" 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 " +"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 "" @@ -23503,3 +22859,654 @@ msgstr "pgr_withPoints se basa en pgr_dijkstra" msgid "Advanced Documentation" 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 "pgr_version();" +#~ msgstr "pgr_version();" + +#, fuzzy +#~ msgid "RETURNS geometry" +#~ msgstr "Tipo de geometría" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " +#~ "agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_seq [, start_vid] [, end_vid], node, " +#~ "edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS (seq, path_seq, end_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SETOF (node, degree)" +#~ msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_seq, start vid, end vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#~ msgid "RETURNS SETOF ``(seq, source, target, cost, reverse_cost)``" +#~ msgstr "DEVUELVE CONJUNTO DE ``(seq, source, target, cost, reverse_cost)``" + +#~ msgid "RETURNS SETOF (seq, vid, target_array)" +#~ msgstr "DEVUELVE UN CONJUNTO DE (seq, vid, target_array)" + +#, fuzzy +#~ msgid "RETURNS SETOF (seq, path_id, path_seq, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#~ msgid "" +#~ "pgr_withPointsCost(`Edges SQL`_, 'Points SQL', **start vid**, **end " +#~ "vid**, **[options**])" +#~ msgstr "" +#~ "pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salida**, " +#~ "**destino**, [**opciones**])" + +#~ msgid "" +#~ "pgr_withPointsCost(`Edges SQL`_, 'Points SQL', **start vid**, **end " +#~ "vids**, **[options**])" +#~ msgstr "" +#~ "pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salida**, " +#~ "**destinos**, [**opciones**])" + +#~ msgid "" +#~ "pgr_withPointsCost(`Edges SQL`_, 'Points SQL', **start vids**, **end " +#~ "vid**, **[options**])" +#~ msgstr "" +#~ "pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " +#~ "**destino**, [**opciones**])" + +#~ msgid "" +#~ "pgr_withPointsCost(`Edges SQL`_, 'Points SQL', **start vids**, **end " +#~ "vids**, **[options**])" +#~ msgstr "" +#~ "pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " +#~ "**destinos**, [**opciones**])" + +#~ msgid "" +#~ "pgr_withPointsCost(`Edges SQL`_, 'Points SQL', `Combinations SQL`_, " +#~ "**[options**])" +#~ msgstr "" +#~ "pgr_withPointsCost(`SQL de aristas`_, `SQL de puntos`_, `SQL de " +#~ "combinaciones`_, [**opciones**])" + +#~ msgid "Returns SET OF ``(seq, [start_vid,] node, edge, cost, agg_cost)``" +#~ msgstr "" +#~ "Regresa vonjunto de ``(seq, [start_vid,] node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "**options:** [directed, strict, U_turn_on_edge]``" +#~ msgstr "**Grafo 4: No dirigido, con costo**" + +#, fuzzy +#~ msgid "" +#~ "**Supported versions:** `Latest `__ (`3.4 `__)" +#~ msgstr "" +#~ "**Versiones soportadas** `Última `__ (`3.4 `__)" + +#, fuzzy +#~ msgid "" +#~ "``cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " +#~ "an undirected graphs" +#~ msgstr "" +#~ "``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos " +#~ "acíclicos" + +#, fuzzy +#~ msgid "" +#~ "**Supported versions:** `Latest `__ (`3.4 `__)" +#~ msgstr "" +#~ "**Versiones soportadas** `Última `__ (`3.4 `__)" + +#, fuzzy +#~ msgid "" +#~ "``pgr_hawickCircuits`` — Returns the list of cirucits using " +#~ "hawickCircuits algorithm." +#~ msgstr "" +#~ "``pgr_bdDijkstra`` — Devuelve la(s) rutas más cortas mediante el " +#~ "algoritmo Bidirectional Dijkstra." + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, vehicle_number, vehicle_id," +#~ msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, vehicle_seq, vehicle_id," +#~ msgstr "Devuelve el conjunto de ``(seq, vertex_id, idom)``" + +#~ msgid "TEXT pgr_version();" +#~ msgstr "TEXT pgr_version();" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_seq, [start_vid,] [end_vid,] node, edge, cost, " +#~ "agg_cost)" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS (seq, path_seq, node, edge, cost, agg_cost)" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS (seq, path_seq, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS (start_vid, end_vid, agg_cost)" +#~ msgstr "Devuelve un conjunto de ``(start_vid, end_vid, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, [start_vid,] node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa vonjunto de ``(seq, [start_vid,] node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, node, edge, cost, agg_cost)" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa vonjunto de ``(seq, [start_vid,] node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, path_id, path_seq, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, path_pid, path_seq, start_vid, end_vid," +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid** [**options " +#~ "A**])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids** [**options " +#~ "B**])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#~ msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_ [**options B**])" +#~ msgstr "" +#~ "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**options " +#~ "B**])" + +#, fuzzy +#~ msgid "cuthillMckeeOrdering - Experimental" +#~ msgstr "pgr_edgeColoring - Experimental" + +#, fuzzy +#~ msgid "cuthillMckeeOrdering(`Edges SQL`_)" +#~ msgstr "``pgr_full_version``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, node) OR EMPTY SET" +#~ msgstr "Devuelve conjunto de ``(seq, sorted_v)``" + +#~ msgid "Returns set of ``(node)``" +#~ msgstr "Devuelve el conjunto de ``(node)``" + +#~ msgid "Returns set of ``(seq, component, edge)``" +#~ msgstr "Devuelve el conjunto de ``(seq, component, edge)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (vertex_id, color_id) OR EMPTY SET" +#~ msgstr "Devuelve SET OF ``(vertex_id, color_id)``" + +#~ msgid "Returns set of ``(edge)``" +#~ msgstr "Devuelve el conjunto de ``(edge)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, component, node) OR EMPTY SET" +#~ msgstr "Devuelve el conjunto de``(seq, component, node)``" + +#~ msgid "Returns set of ``(seq, component, node)``" +#~ msgstr "Devuelve el conjunto de``(seq, component, node)``" + +#, fuzzy +#~ msgid "RETURNS SETOF (type, id, contracted_vertices, source, target, cost)" +#~ msgstr "" +#~ "DEVOLUCION DE CONJUNTOS (type, id, contracted_vertices, source, target, " +#~ "cost)" + +#~ msgid "RETURNS SETOF (type, id, contracted_vertices, source, target, cost)" +#~ msgstr "" +#~ "DEVOLUCION DE CONJUNTOS (type, id, contracted_vertices, source, target, " +#~ "cost)" + +#, fuzzy +#~ msgid "" +#~ "RETURNS SET OF (seq, path_seq, node, edge, cost, agg_cost) OR EMPTY SET" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_ [, directed]) RETURNS " +#~ "(seq, path_seq, start vid, end vid, node, edge, cost, agg_cost) OR EMPTY " +#~ "SET" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#~ msgid "36) Using `Combinations`_" +#~ msgstr "36) Usando `Combinaciones`_" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_ [, ``directed``])" +#~ msgstr "pgr_dijkstraNear(Combinaciones)" + +#, fuzzy +#~ msgid "" +#~ "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids** [, ``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#~ msgid "[, directed] [, cap])" +#~ msgstr "[, directed] [, cap])" + +#, fuzzy +#~ msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_" +#~ msgstr "pgr_dijkstraNear(Combinaciones)" + +#, fuzzy +#~ msgid "[, directed])" +#~ msgstr "es dirigido" + +#, fuzzy +#~ msgid "[, directed] [, equicost])" +#~ msgstr "**Grafo 4: No dirigido, con costo**" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, [from_v,] node, edge, cost, agg_cost)" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, from_v, node, edge, cost, agg_cost)" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (edge_id, color_id) OR EMPTY SET" +#~ msgstr "Devuelve SET OF ``((edge_id, color_id)``" + +#, fuzzy +#~ msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_" +#~ msgstr "pgr_edgeDisjointPaths(Combinaciones)" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_id, path_seq, [start_vid,] [end_vid,] node, edge, " +#~ "cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS (seq, path_id, path_seq, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_id, path_seq, end_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "RETURNS (seq, path_id, path_seq, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#~ msgid "**pgr_isplanar**" +#~ msgstr "**pgr_isplanar**" + +#, fuzzy +#~ msgid "" +#~ "pgr_kruskalBFS(`Edges SQL`_, **Root vid** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_kruskalBFS(`Edges SQL`_, **Root vids** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_kruskalDD(`Edges SQL`_, **Root vid**, **distance**) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_kruskalDD(`Edges SQL`_, **Root vids**, **distance**) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_kruskalDFS(`Edges SQL`_, **Root vid** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_kruskalDFS(`Edges SQL`_, **Root vids** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#~ msgid "**Edges SQL**" +#~ msgstr "**SQL de aristas**" + +#~ msgid "**vertex_id**" +#~ msgstr "**vertex_id**" + +#~ msgid "**idom**" +#~ msgstr "**idom**" + +#, fuzzy +#~ msgid "" +#~ "pgr_makeConnected(`Edges SQL`_) RETURNS SET OF (seq, start_vid, end_vid) " +#~ "OR EMPTY SET" +#~ msgstr "Devuelve el conjunto de ``(seq, start_vid, end_vid)``" + +#~ msgid "Returns set of ``(seq, start_vid, end_vid)``" +#~ msgstr "Devuelve el conjunto de ``(seq, start_vid, end_vid)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_primBFS(`Edges SQL`_, **Root vid** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_primBFS(`Edges SQL`_, **Root vids** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_primDD(`Edges SQL`_, **Root vid**, **distance**) RETURNS SET OF (seq, " +#~ "depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_primDD(`Edges SQL`_, **Root vids**, **distance**) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_primDFS(`Edges SQL`_, **Root vid** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_primDFS(`Edges SQL`_, **Root vids** [, max_depth]) RETURNS SET OF " +#~ "(seq, depth, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Regresa ``SET OF (seq, depth, start_vid, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_stoerWagner(`Edges SQL`_) RETURNS SET OF (seq, edge, cost, mincut) OR " +#~ "EMPTY SET" +#~ msgstr "Devuelve conjunto de ``(seq, edge, cost, mincut)``" + +#~ msgid "Returns set of ``(seq, sorted_v)``" +#~ msgstr "Devuelve conjunto de ``(seq, sorted_v)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_hawickCircuits(`Edges SQL`_) RETURNS SET OF (seq, path_id, path_seq, " +#~ "start_vid, node, edge, cost, agg_cost) OR EMPTY SET" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_id, path_seq, start_vid, end_vid, " +#~ "node, edge, cost, agg_cost)``" + +#~ msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**" +#~ msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**" + +#, fuzzy +#~ msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_" +#~ msgstr "``pgr_aStar`` (`Combinaciones`_)" + +#, fuzzy +#~ msgid "RETURNS SET OF" +#~ msgstr "Devuelve el conjunto de ``(node)``" + +#, fuzzy +#~ msgid "" +#~ "(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_seq [, start_vid] [, end_vid], node, " +#~ "edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, path_seq, node, edge, cost, agg_cost)" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "RETURNS SET OF (seq, path_seq, end_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_seq [, start_vid] [, end_vid], node, " +#~ "edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "RETURNS SET OF (seq, path_seq, start_vid, node, edge, cost, agg_cost)" +#~ msgstr "" +#~ "Devuelve el conjunto de ``(seq, path_seq [, start_vid] [, end_vid], node, " +#~ "edge, cost, agg_cost)``" + +#, fuzzy +#~ msgid "pgr_alphaShape(**geometry**, [alpha]) RETURNS geometry" +#~ msgstr "La entrada es una *geometría* y devuelve una *geometría*" + +#, fuzzy +#~ msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_" +#~ msgstr "``pgr_bdAstar`` (`Combinaciones`_)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid** [, directed])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids** [, directed])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid** [, directed])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids** [, directed])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ [, directed])" +#~ msgstr "pgr_dijkstraNear(Combinaciones)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids** [, " +#~ "``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_ [, ``directed``])" +#~ msgstr "pgr_dijkstraNear(Combinaciones)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids** [, ``directed``])" +#~ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" + +#, fuzzy +#~ msgid "" +#~ "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids** [, directed]) " +#~ "RETURNS (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost) " +#~ "OR EMPTY SET" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_ [, directed]) RETURNS " +#~ "(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost) OR EMPTY " +#~ "SET" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **Combinations SQL**" +#~ msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" + +#~ msgid "[, directed]);" +#~ msgstr "[, directed]);" + +#, fuzzy +#~ msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_" +#~ msgstr "pgr_binaryBreadthFirstSearch(`Combinaciones`_)" + +#, fuzzy +#~ msgid "\\ \\ :class: signatures" +#~ msgstr "Firmas antiguas de TSP" + +#, fuzzy +#~ msgid "" +#~ "pgr_chinesePostman(`Edges SQL`_) RETURNS SET OF (seq, node, edge, cost, " +#~ "agg_cost) OR EMPTY SET" +#~ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" + +#~ msgid "[TBD] Return value when the graph if disconnected" +#~ msgstr "[TBD] Valor devuelto cuando el grafo está desconectado" + +#, fuzzy +#~ msgid "pgr_chinesePostmanCost(`Edges SQL`_) RETURNS FLOAT" +#~ msgstr "``pgr_chinesepostmancost``" + +#, fuzzy +#~ msgid "" +#~ "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids** [, directed]); " +#~ "RETURNS (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost) " +#~ "OR EMPTY SET" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" + +#, fuzzy +#~ msgid "" +#~ "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_ [, directed]); RETURNS " +#~ "(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost) OR EMPTY " +#~ "SET" +#~ msgstr "" +#~ "Regresa ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " +#~ "agg_cost)``" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index f386dd32ae6..cb9d320f587 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -133,26 +133,27 @@ msgid "" msgstr "" "Project-Id-Version: PROJECT VERSION\n" -"Report-Msgid-Bugs-To: EMAIL@ADDRESS\n" +"Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-09-23 16:50+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" +"Language: \n" "MIME-Version: 1.0\n" -"Content-Type: text/plain; charset=utf-8\n" +"Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Generated-By: Babel 2.10.3\n" #, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "BFS - Category" msgstr "" @@ -219,8 +220,8 @@ msgid "Identifier of the root vertex of the tree." msgstr "" msgid "" -"When value is :math:`0` then gets the spanning forest starting in " -"aleatory nodes for each tree in the forest." +"When value is :math:`0` then gets the spanning forest starting in aleatory " +"nodes for each tree in the forest." msgstr "" #, fuzzy @@ -321,8 +322,8 @@ msgid "Weight of the edge (``target``, ``source``)" msgstr "" msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore " -"it's not part of the graph." +"When negative: edge (``target``, ``source``) does not exist, therefore it's " +"not part of the graph." msgstr "" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -392,24 +393,23 @@ msgid "See Also" msgstr "参照" msgid "" -"`Boost: Prim's algorithm " -"`__" +"`Boost: Prim's algorithm `__" msgstr "" msgid "" -"`Boost: Kruskal's algorithm " -"`__" +"`Boost: Kruskal's algorithm `__" msgstr "" -#, python-format msgid "" -"`Wikipedia: Prim's algorithm " -"`__" +"`Wikipedia: Prim's algorithm `__" msgstr "" msgid "" -"`Wikipedia: Kruskal's algorithm " -"`__" +"`Wikipedia: Kruskal's algorithm `__" msgstr "" msgid "Indices and tables" @@ -423,14 +423,14 @@ msgstr ":ref:`search`" #, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "DFS - Category" msgstr "" @@ -469,12 +469,15 @@ msgid "Functionality might not change. (But still can)" msgstr "機能は変更されない場合があります。(しかし、まだ変更することもできます)" msgid "pgTap tests have being done. But might need more." -msgstr "pgTap テストが行われています。しかし、さらなるテストが必要となるかもしれません。" +msgstr "" +"pgTap テストが行われています。しかし、さらなるテストが必要となるかもしれませ" +"ん。" msgid "Documentation might need refinement." msgstr "ドキュメントには改良が必要な場合があります。" -msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid "" +":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr "" #, fuzzy @@ -482,20 +485,18 @@ msgid "In general:" msgstr "概要" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__) `3.0 `__" msgstr "" msgid "" "**Unsupported versions:** `2.5 `__ `2.4 `__ `2.6 `__" +"category.html>`__ `2.4 `__ `2.6 `__" msgstr "" msgid "K shortest paths - Category" @@ -509,14 +510,14 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" #, fuzzy msgid "TRSP - Family of functions" @@ -535,8 +536,7 @@ msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr "" msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with " -"restrictions." +":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgstr "" msgid "" @@ -605,21 +605,20 @@ msgid "Introduction" msgstr "序章" 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." +"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 "" msgid "TRSP algorithm" msgstr "" 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." +"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 "" msgid "`Edges SQL`_ query as described." @@ -660,9 +659,9 @@ msgid "These restrictions are represented on a table as follows:" msgstr "" 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." +"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 "" msgid "Restrictions SQL" @@ -676,8 +675,8 @@ msgstr "" 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." +"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " +"``NULL`` element will raise an exception." msgstr "" msgid "``Cost``" @@ -687,21 +686,19 @@ msgid "Cost of taking the forbidden path." msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__" msgstr "" msgid "Traveling Sales Person - Family of functions" @@ -726,10 +723,12 @@ msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "" 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 "*都市の一覧と各都市間の距離を指定し、どの都市も必ず一回訪問し元の都市に戻ってくるための最短ルートはどうなるか?*" +"*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 "" +"*都市の一覧と各都市間の距離を指定し、どの都市も必ず一回訪問し元の都市に戻って" +"くるための最短ルートはどうなるか?*" msgid "Origin" msgstr "発端" @@ -741,11 +740,11 @@ msgid "" msgstr "" msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the " -"book **Graph Theory (Biggs et al. 1976)**." +"A discussion about the work of Hamilton & Kirkman can be found in the book " +"**Graph Theory (Biggs et al. 1976)**." msgstr "" -"Hamilton & Kirkman の業績についての議論は **Graph Theory (Biggs et al. 1976)** " -"という書籍に見出すことができます。" +"Hamilton & Kirkman の業績についての議論は **Graph Theory (Biggs et al. " +"1976)** という書籍に見出すことができます。" msgid "ISBN-13: 978-0198539162" msgstr "ISBN-13: 978-0198539162" @@ -754,12 +753,12 @@ 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) " -"`__" +"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) `__" msgstr "" msgid "To calculate the number of different tours through :math:`n` cities:" @@ -775,11 +774,12 @@ msgid "And :math:`n-2` choices for the third city, etc." msgstr "そして、3番目の都市のための :math:`n-2` の選択肢などがあります。" msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." -msgstr "これらを掛け合わせると、 :math:`(n-1)! = (n-1) (n-2) . . 1` となります。" +msgstr "" +"これらを掛け合わせると、 :math:`(n-1)! = (n-1) (n-2) . . 1` となります。" msgid "" -"Now since the travel costs do not depend on the direction taken around " -"the tour:" +"Now since the travel costs do not depend on the direction taken around the " +"tour:" msgstr "" msgid "this number by 2" @@ -798,8 +798,8 @@ msgid "Metric Algorithm is used" msgstr "" msgid "" -"Implementation generates solutions that *are twice as long as the optimal" -" tour in the worst case* when:" +"Implementation generates solutions that *are twice as long as the optimal " +"tour in the worst case* when:" msgstr "" msgid "Graph is undirected" @@ -818,8 +818,8 @@ msgid "The traveling costs are symmetric:" msgstr "" msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from " -"``v`` to ``u``" +"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " +"to ``u``" msgstr "" msgid "TSP optional parameters" @@ -844,37 +844,37 @@ msgid "Last visiting vertex before returning to ``start_vid``." msgstr "" msgid "" -"When ``0`` any vertex can become the last visiting vertex before " -"returning to ``start_id``." +"When ``0`` any vertex can become the last visiting vertex before returning " +"to ``start_id``." msgstr "" -msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgid "" +"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" msgstr "" msgid "References" msgstr "参照" msgid "" -"`Boost's metric appro's metric approximation " -"`__" +"`Boost's metric appro's metric approximation `__" msgstr "" msgid "`University of Waterloo TSP `__" msgstr "" msgid "" -"`Wikipedia: Traveling Salesman Problem " -"`__" +"`Wikipedia: Traveling Salesman Problem `__" msgstr "" -"`Wikipedia: 巡回セールスマン問題 " -"`__" +"`Wikipedia: 巡回セールスマン問題 `__" msgid "" -"**Supported versions:** `Latest `__ (`3.2 `__ `3.1 `__) `3.0 `__" +"**Supported versions:** `Latest `__ (`3.2 `__ `3.1 `__) `3.0 " +"`__" msgstr "" msgid "Vehicle Routing Functions - Category (Experimental)" @@ -887,8 +887,7 @@ msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr "" msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean " -"distances" +":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr "" msgid "Distribution problem" @@ -915,19 +914,19 @@ msgid "**pgRouting does not try to implement all variants.**" msgstr "" msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have " -"limited carrying capacity of the goods." +"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " +"carrying capacity of the goods." msgstr "" msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations " -"have time windows within which the vehicle's visits must be made." +"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " +"time windows within which the vehicle's visits must be made." msgstr "" 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." +"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 "" msgid "Limitations" @@ -949,8 +948,8 @@ msgid "Pick & Delivery" msgstr "" msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem" -" with Time Windows" +"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " +"with Time Windows" msgstr "" msgid "Times are relative to `0`" @@ -1072,10 +1071,12 @@ msgstr "" msgid "``4`` Optimize insert." msgstr "" -msgid "``5`` Push back order that allows more orders to be inserted at the back" +msgid "" +"``5`` Push back order that allows more orders to be inserted at the back" msgstr "" -msgid "``6`` Push front order that allows more orders to be inserted at the front" +msgid "" +"``6`` Push front order that allows more orders to be inserted at the front" msgstr "" msgid "Orders SQL" @@ -1155,8 +1156,8 @@ msgid "``d_node_id``" msgstr "" msgid "" -"The node identifier of the delivery, must match a vertex identifier in " -"the `Matrix SQL`_." +"The node identifier of the delivery, must match a vertex identifier in the " +"`Matrix SQL`_." msgstr "" msgid "" @@ -1260,16 +1261,16 @@ msgid "``start_node_id``" msgstr "" msgid "" -"The node identifier of the start location, must match a vertex identifier" -" in the `Matrix SQL`_." +"The node identifier of the start location, must match a vertex identifier in " +"the `Matrix SQL`_." msgstr "" msgid "[``end_node_id``]" msgstr "" msgid "" -"The node identifier of the end location, must match a vertex identifier " -"in the `Matrix SQL`_." +"The node identifier of the end location, must match a vertex identifier in " +"the `Matrix SQL`_." msgstr "" msgid "When missing: ``end_node_id`` is used." @@ -1333,8 +1334,8 @@ msgid "``vehicle_seq``" msgstr "" msgid "" -"Sequential value starting from **1** for current vehicles. The " -":math:`n_{th}` vehicle in the solution." +"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" +"` vehicle in the solution." msgstr "" msgid "Value :math:`-2` indicates it is the summary row." @@ -1352,7 +1353,8 @@ msgstr "" msgid "Sumary row has the **total capacity violations**." msgstr "" -msgid "A capacity violation happens when overloading or underloading a vehicle." +msgid "" +"A capacity violation happens when overloading or underloading a vehicle." msgstr "" msgid "``stop_seq``" @@ -1370,8 +1372,7 @@ msgid "Sumary row has the **total time windows violations**." msgstr "" msgid "" -"A time window violation happens when arriving after the location has " -"closed." +"A time window violation happens when arriving after the location has closed." msgstr "" msgid "``stop_type``" @@ -1401,7 +1402,8 @@ msgstr "" msgid "Pickup-Delivery order pair identifier." msgstr "" -msgid "Value :math:`-1`: When no order is involved on the current stop location." +msgid "" +"Value :math:`-1`: When no order is involved on the current stop location." msgstr "" msgid "``cargo``" @@ -1474,8 +1476,8 @@ msgid "Summary row has the **total solution time**:" msgstr "" msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ " -"service\\ time`." +":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " +"time`." msgstr "" msgid "Summary Row" @@ -1507,8 +1509,8 @@ msgstr "" 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." +"consistent results. This section gives an insight of how parameters are to " +"be considered." msgstr "" msgid "`Capacity and Demand Units Handling`_" @@ -1545,31 +1547,31 @@ msgid "Number of seats in the vehicle" msgstr "" msgid "" -"The `demand` request of the pickup-deliver orders must use the same units" -" as the units used in the vehicle's `capacity`." +"The `demand` request of the pickup-deliver orders must use the same units as " +"the units used in the vehicle's `capacity`." msgstr "" 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)." +"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 "" msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg" -" of feathers` to `number of boxes` is needed." +"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " +"feathers` to `number of boxes` is needed." msgstr "" msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box " -"of apples` to `kg` is needed." +"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " +"apples` to `kg` is needed." msgstr "" msgid "Showing how the 2 possible conversions can be done" msgstr "" msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. " -"- :math:`a\\_weight`: weight of `1` box of apples." +"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" +"math:`a\\_weight`: weight of `1` box of apples." msgstr "" msgid "Capacity Units" @@ -1624,14 +1626,13 @@ msgid "Time Handling" msgstr "" msgid "" -"The times are relative to **0**. All time units have to be converted to a" -" **0** reference and the same time units." +"The times are relative to **0**. All time units have to be converted to a " +"**0** reference and the same time units." msgstr "" 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." +"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." msgstr "" msgid "Meaning of 0" @@ -1709,9 +1710,9 @@ msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "" 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." +"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 "" msgid "Latitude" @@ -1765,8 +1766,8 @@ msgid "Time" msgstr "" msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36" -" km/hr`" +"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" +"hr`" msgstr "" msgid "" @@ -1832,28 +1833,26 @@ msgid "The queries use the :doc:`sampledata` network." msgstr "クエリは :doc:`sampledata` ネットワークを使用します。" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" "**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" +"family.html>`__ `2.5 `__ `2.4 `__" msgstr "" msgid "A* - Family of functions" msgstr "" 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 " +"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 "" @@ -1971,16 +1970,16 @@ msgid "Analysis 1" msgstr "" msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: " -"Factor = 1 (no need to change units)" +"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " +"= 1 (no need to change units)" msgstr "" msgid "Analysis 2" msgstr "" msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: " -"Factor = would depend on the location of the points:" +"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor " +"= would depend on the location of the points:" msgstr "" msgid "1 longitude degree is 78846.81 m" @@ -1999,9 +1998,9 @@ msgid "Analysis 3" msgstr "" 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." +"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 "" msgid ":doc:`bdAstar-family`" @@ -2014,23 +2013,20 @@ msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ " +"`2.2 `__" msgstr "" msgid "All Pairs - Family of Functions" @@ -2052,8 +2048,8 @@ msgid "It does not return a path." msgstr "" msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes " -"in the graph." +"Returns the sum of the costs of the shortest path for each pair of nodes in " +"the graph." msgstr "" msgid "" @@ -2145,8 +2141,8 @@ msgstr "" msgid "" "This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average " -"The tested query is:" +"extremely low. For each 30 tests were executed to get the average The " +"tested query is:" msgstr "" msgid "The results of this tests are presented as:" @@ -2489,9 +2485,9 @@ msgid "Two" msgstr "" msgid "" -"This test is with a bounding box The density of the passed graph higher " -"than of the Test One. For each 30 tests were executed to get the " -"average The tested edge query is:" +"This test is with a bounding box The density of the passed graph higher than " +"of the Test One. For each 30 tests were executed to get the average " +"The tested edge query is:" msgstr "" msgid "The tested queries" @@ -2795,40 +2791,39 @@ msgid ":doc:`pgr_floydWarshall`" msgstr "" msgid "" -"Boost `floyd-Warshall " -"`__" +"Boost `floyd-Warshall `__" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgstr "" msgid "" -"**Unsupported versions:** `2.5 `__ `2.6 `__" +"**Unsupported versions:** `2.5 `__ `2.6 `__" msgstr "" msgid "Bidirectional A* - Family of functions" msgstr "" msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A*" -" algorithm." +"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " +"algorithm." msgstr "" msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr "" msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost" -" of the paths." +":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " +"the paths." msgstr "" msgid "" @@ -2837,12 +2832,12 @@ msgid "" msgstr "" 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." +"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 "" msgid "" @@ -2860,32 +2855,32 @@ msgid "Previous versions of this page" msgstr "このページの以前のバージョン" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "Bidirectional Dijkstra - Family of functions" msgstr "" msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest" -" paths." +":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " +"paths." msgstr "" msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost " -"of the shortest paths" +":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " +"the shortest paths" msgstr "" msgid "" @@ -2912,8 +2907,7 @@ msgid "" msgstr "" msgid "" -"A negative value on a cost column is interpreted as the edge does not " -"exist." +"A negative value on a cost column is interpreted as the edge does not exist." msgstr "" msgid "When there is no path:" @@ -2923,23 +2917,22 @@ msgid "When the starting vertex and ending vertex are the same." msgstr "" msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is " -":math:`0`" +"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" msgstr "" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path:" +"When the starting vertex and ending vertex are the different and there is no " +"path:" msgstr "" msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is " -":math:`\\infty`" +"The **aggregate cost** the non included values :math:`(u, v)` is :math:`" +"\\infty`" msgstr "" msgid "" -"For optimization purposes, any duplicated value in the starting vertices " -"or on the ending vertices are ignored." +"For optimization purposes, any duplicated value in the starting vertices or " +"on the ending vertices are ignored." msgstr "" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" @@ -2949,15 +2942,13 @@ msgid "It is expected to terminate faster than pgr_dijkstra" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 " -"`__)" -" `3.3 `__ `3.2 `__ `3.1 " -"`__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " +"`__" msgstr "" msgid "Chinese Postman Problem - Family of functions (Experimental)" @@ -2982,32 +2973,31 @@ msgid "Graph must be connected." msgstr "" msgid "" -"An Edges SQL that represents a **directed** graph with the following " -"columns" +"An Edges SQL that represents a **directed** graph with the following columns" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "Coloring - Family of functions" msgstr "" msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using " -"greedy approach." +":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " +"approach." msgstr "" msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based " -"coloring approach." +":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " +"approach." msgstr "" -msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid "" +":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgstr "" msgid "Returns SET OF ``(vertex_id, color_id)``" @@ -3038,72 +3028,68 @@ msgid "Identifier of the color of the edge." msgstr "" msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation " -"`__" +"`Boost: Sequential Vertex Coloring algorithm documentation `__" msgstr "" msgid "" -"`Wikipedia: Graph coloring " -"`__" +"`Wikipedia: Graph coloring `__" msgstr "" msgid "" -"`Boost: is_bipartite " -"`__" +"`Boost: is_bipartite `__" msgstr "" msgid "" -"`Wikipedia: bipartite graph " -"`__" +"`Wikipedia: bipartite graph `__" msgstr "" msgid "" -"`Boost: Edge Coloring Algorithm documentation " -"`__" +"`Boost: Edge Coloring Algorithm documentation `__" msgstr "" msgid "" -"`Wikipedia: Graph Coloring " -"`__" +"`Wikipedia: Graph Coloring `__" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "Components - Family of functions" msgstr "" msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected " -"graph." +":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr "" msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed" -" graph." +":doc:`pgr_strongComponents` - Strongly connected components of a directed " +"graph." msgstr "" msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an " -"undirected graph." +":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " +"graph." msgstr "" msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected " -"graph." +":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr "" msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -3113,23 +3099,22 @@ msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected." msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "Contraction - Family of functions" @@ -3164,8 +3149,8 @@ msgid "Forbid contraction on a set of nodes." msgstr "" msgid "" -"Decide the order of the contraction algorithms and set the maximum number" -" of times they are to be executed." +"Decide the order of the contraction algorithms and set the maximum number of " +"times they are to be executed." msgstr "" msgid "Contraction of the leaf nodes of the graph." @@ -3193,8 +3178,8 @@ msgid "There are no incoming edges and has at least one outgoing edge." msgstr "" msgid "" -"When the conditions are true then the `Operation: Dead End Contraction`_ " -"can be done." +"When the conditions are true then the `Operation: Dead End Contraction`_ can " +"be done." msgstr "" msgid "Dead end vertex on undirected graph" @@ -3230,7 +3215,8 @@ msgstr "" msgid "Dead end vertex on directed graph" msgstr "" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "" +"The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" msgid "Number of incoming edges" @@ -3261,27 +3247,26 @@ msgid ":math:`\\{x, y\\}`" msgstr "" msgid "" -"From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number " -"of adjacent vertices is 1. No further checks are needed for those nodes." +"From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number of " +"adjacent vertices is 1. No further checks are needed for those nodes." msgstr "" msgid "" -"On the following table, nodes :math:`\\{c, e\\}` because the even that " -"the number of adjacent vertices is not 1 for" +"On the following table, nodes :math:`\\{c, e\\}` because the even that the " +"number of adjacent vertices is not 1 for" msgstr "" msgid "Operation: Dead End Contraction" msgstr "" msgid "" -"The dead end contraction will stop until there are no more dead end " -"nodes. For example from the following graph where :math:`w` is the `dead " -"end`_ node:" +"The dead end contraction will stop until there are no more dead end nodes. " +"For example from the following graph where :math:`w` is the `dead end`_ node:" msgstr "" msgid "" -"After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and" -" is contracted:" +"After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and is " +"contracted:" msgstr "" msgid "" @@ -3298,7 +3283,8 @@ msgstr "" msgid "Linear" msgstr "" -msgid "In case of an undirected graph, a node is considered a `linear` node when" +msgid "" +"In case of an undirected graph, a node is considered a `linear` node when" msgstr "" msgid "The number of adjacent vertices is 2." @@ -3362,9 +3348,9 @@ msgid "Operation: Linear Contraction" msgstr "" msgid "" -"The linear contraction will stop when there are no more linear nodes. For" -" example from the following graph where :math:`v` and :math:`w` are " -"`linear`_ nodes:" +"The linear contraction will stop when there are no more linear nodes. For " +"example from the following graph where :math:`v` and :math:`w` are `linear`_ " +"nodes:" msgstr "" msgid "Contracting :math:`w`," @@ -3374,13 +3360,12 @@ msgid "The vertex :math:`w` is removed from the graph" msgstr "" msgid "" -"The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are " -"removed from the graph." +"The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are removed " +"from the graph." msgstr "" msgid "" -"A new edge :math:`v \\rightarrow z` is inserted represented with red " -"color." +"A new edge :math:`v \\rightarrow z` is inserted represented with red color." msgstr "" msgid "Contracting :math:`v`:" @@ -3390,13 +3375,12 @@ msgid "The vertex :math:`v` is removed from the graph" msgstr "" msgid "" -"The edges :math:`u \\rightarrow v` and :math:`v \\rightarrow z` are " -"removed from the graph." +"The edges :math:`u \\rightarrow v` and :math:`v \\rightarrow z` are removed " +"from the graph." msgstr "" msgid "" -"A new edge :math:`u \\rightarrow z` is inserted represented with red " -"color." +"A new edge :math:`u \\rightarrow z` is inserted represented with red color." msgstr "" msgid "" @@ -3408,10 +3392,10 @@ msgid "The cycle" msgstr "" 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." +"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 "" msgid "" @@ -3456,8 +3440,8 @@ msgid "" msgstr "" msgid "" -"Observe that vertices, for example, :math:`6` do not appear in the " -"results because it was not affected by the contraction algorithm." +"Observe that vertices, for example, :math:`6` do not appear in the results " +"because it was not affected by the contraction algorithm." msgstr "" msgid "After doing the dead end contraction operation:" @@ -3473,8 +3457,8 @@ msgid "Add additional columns" msgstr "" msgid "" -"Adding extra columns to the ``edge_table`` and " -"``edge_table_vertices_pgr`` tables, where:" +"Adding extra columns to the ``edge_table`` and ``edge_table_vertices_pgr`` " +"tables, where:" msgstr "" msgid "``contracted_vertices``" @@ -3490,8 +3474,7 @@ msgid "On the vertex table" msgstr "" msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted " -"graph." +"when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" msgid "" @@ -3506,8 +3489,8 @@ msgid "On the edge table" msgstr "" msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its " -"part of the contracted graph." +"when ``true`` the edge was generated by the contraction algorithm. its part " +"of the contracted graph." msgstr "" msgid "" @@ -3524,7 +3507,8 @@ msgstr "" msgid "The vertex table update" msgstr "" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "" +"Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" msgid "" @@ -3576,15 +3560,15 @@ msgstr "" msgid "Case 3: Source and/or target belong to a vertex." msgstr "" -msgid "Using the `Edges that belong to the contracted graph.`_ on lines 10 to 19." +msgid "" +"Using the `Edges that belong to the contracted graph.`_ on lines 10 to 19." msgstr "" msgid "Case 1" msgstr "" msgid "" -"When both source and target belong to the contracted graph, a path is " -"found." +"When both source and target belong to the contracted graph, a path is found." msgstr "" msgid "Case 2" @@ -3596,8 +3580,8 @@ msgid "" msgstr "" msgid "" -"In this case, the contracted graph do not have an edge connecting with " -"node :math:`4`." +"In this case, the contracted graph do not have an edge connecting with node :" +"math:`4`." msgstr "" msgid "Case 3" @@ -3607,8 +3591,8 @@ msgid "When source and/or target belong to a vertex then a path is not found." msgstr "" msgid "" -"In this case, the contracted graph do not have an edge connecting with " -"node :math:`7` and of node :math:`4` of the second case." +"In this case, the contracted graph do not have an edge connecting with node :" +"math:`7` and of node :math:`4` of the second case." msgstr "" msgid "Refining the above function to include nodes that belong to an edge." @@ -3617,31 +3601,32 @@ msgstr "" msgid "The vertices that need to be expanded are calculated on lines 10 to 16." msgstr "" -msgid "Adding to the contracted graph that additional section on lines 25 to 27." +msgid "" +"Adding to the contracted graph that additional section on lines 25 to 27." msgstr "" msgid "" -"When source and/or target belong to an edge subgraph, now, a path is " -"found." +"When source and/or target belong to an edge subgraph, now, a path is found." msgstr "" msgid "The routing graph now has an edge connecting with node :math:`4`." msgstr "" msgid "" -"In this case, the contracted graph do not have an edge connecting with " -"node :math:`7`." +"In this case, the contracted graph do not have an edge connecting with node :" +"math:`7`." msgstr "" msgid "The vertices that need to be expanded are calculated on lines 18 to 23." msgstr "" -msgid "Adding to the contracted graph that additional section on lines 38 to 40." +msgid "" +"Adding to the contracted graph that additional section on lines 38 to 40." msgstr "" msgid "" -"The code change do not affect this case so when source and/or target " -"belong to an edge subgraph, a path is still found." +"The code change do not affect this case so when source and/or target belong " +"to an edge subgraph, a path is still found." msgstr "" msgid "When source and/or target belong to a vertex, now, a path is found." @@ -3653,27 +3638,27 @@ msgstr "" msgid ":doc:`sampledata`" msgstr "" -msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" +msgid "" +"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" +"lecture16.pdf" msgstr "" msgid "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ " +"`3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" "**Unsupported versions:** `2.5 `__ `2.4 `__ `2.6 `__" +"category.html>`__ `2.4 `__ `2.6 `__" msgstr "" msgid "Cost - Category" @@ -3701,8 +3686,8 @@ msgid "Each function works as part of the family it belongs to." msgstr "" msgid "" -"Returns the sum of the costs of the shortest path of each pair " -"combination of nodes requested." +"Returns the sum of the costs of the shortest path of each pair combination " +"of nodes requested." msgstr "" msgid "" @@ -3711,16 +3696,15 @@ msgid "" msgstr "" msgid "" -"Depending on the function and its parameters, the results can be " -"symmetric." +"Depending on the function and its parameters, the results can be symmetric." msgstr "" msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, " -"u)`." +"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr "" -msgid "Any duplicated value in the start or end vertex identifiers are ignored." +msgid "" +"Any duplicated value in the start or end vertex identifiers are ignored." msgstr "" msgid "The returned values are ordered:" @@ -3733,20 +3717,20 @@ msgid "``end_vid`` ascending" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" msgid "Cost Matrix - Category" @@ -3771,19 +3755,20 @@ msgid ":doc:`pgr_withPointsCostMatrix`" msgstr "" msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u," -" v)` must value :math:`\\infty`." +":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " +"v)` must value :math:`\\infty`." msgstr "" -msgid "This collection of functions will return a cost matrix in form of a table." +msgid "" +"This collection of functions will return a cost matrix in form of a table." msgstr "" msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "" msgid "" -"Use directly when the resulting matrix is symmetric and there is no " -":math:`\\infty` value." +"Use directly when the resulting matrix is symmetric and there is no :math:`" +"\\infty` value." msgstr "" msgid "It will be the users responsibility to make the matrix symmetric." @@ -3796,35 +3781,35 @@ msgid "By using max or min the non symmetric values." msgstr "" msgid "" -"By setting the upper triangle to be the mirror image of the lower " -"triangle." +"By setting the upper triangle to be the mirror image of the lower triangle." msgstr "" msgid "" -"By setting the lower triangle to be the mirror image of the upper " -"triangle." +"By setting the lower triangle to be the mirror image of the upper triangle." msgstr "" msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "" msgid "" -"Returns the sum of the costs of the shortest path for pair combination of" -" nodes in the graph." +"Returns the sum of the costs of the shortest path for pair combination of " +"nodes in the graph." msgstr "" -msgid "When the starting vertex and ending vertex are the same, there is no path." +msgid "" +"When the starting vertex and ending vertex are the same, there is no path." msgstr "" msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path." +"When the starting vertex and ending vertex are the different and there is no " +"path." msgstr "" -msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgid "" +"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." msgstr "" msgid "Let be the case the values returned are stored in a table:" @@ -3872,7 +3857,8 @@ msgstr "" msgid "Identifier of the point." msgstr "" -msgid "Use with positive value, as internally will be converted to negative value" +msgid "" +"Use with positive value, as internally will be converted to negative value" msgstr "" msgid "If column is present, it can not be NULL." @@ -3919,46 +3905,51 @@ msgid ":doc:`TSP-family`" msgstr ":doc:`TSP-family`" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ " +"`2.2 `__" msgstr "" msgid "Dijkstra - Family of functions" msgstr "ダイクストラ関連機能" msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr ":doc:'pgr_dijkstra' - 最短経路を求めるためのダイクストラ・アルゴリズム。" +msgstr "" +":doc:'pgr_dijkstra' - 最短経路を求めるためのダイクストラ・アルゴリズム。" msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." msgstr ":doc:'pgr_dijkstraCost' - 最短経路の総コストを集計します。" -msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr ":doc:'pgr_dijkstraCostMatrix' - pgr_dijkstra を使用してコストマトリックスを作成します。" +msgid "" +":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgstr "" +":doc:'pgr_dijkstraCostMatrix' - pgr_dijkstra を使用してコストマトリックスを作" +"成します。" msgid "" ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " "information." -msgstr ":doc:'pgr_drivingDistance' - pgr_dijkstra を使用して対象エリアの情報を計算します。" +msgstr "" +":doc:'pgr_drivingDistance' - pgr_dijkstra を使用して対象エリアの情報を計算し" +"ます。" msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K " -"shortest paths." -msgstr ":doc:'pgr_KSP' - pgr_dijkstraでYenアルゴリズムを使用してK最短経路を取得します。" +":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " +"paths." +msgstr "" +":doc:'pgr_KSP' - pgr_dijkstraでYenアルゴリズムを使用してK最短経路を取得しま" +"す。" msgid ":doc:`pgr_dijkstraVia` - Get a route of a seuence of vertices." msgstr ":doc:'pgr_dijkstraVia' - 連続したノードの経路を取得します。" @@ -3970,11 +3961,11 @@ msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr "" 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." +"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 "" msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -4026,11 +4017,11 @@ 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)\\}`" +"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse" +"\\_cost_i)\\}`" msgstr "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, " -"reverse\\_cost_i)\\}`" +"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" +"`" msgid "and" msgstr "and" @@ -4062,19 +4053,19 @@ msgstr "エッジのセット: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 " +"\\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}`" +"\\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}`" +"\\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 "導かれないグラフ" @@ -4092,23 +4083,22 @@ msgid "" "\\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}`" +"\\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}`" +"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 "問題点" @@ -4123,23 +4113,21 @@ msgid ":math:`end_{vid} \\in V` an ending vertex" msgstr ":math:`end_{vid} \\in V` an ending vertex" 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}`" +":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}`" +":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 "その次に：" msgid "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" +":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)\\}`" +":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg" +"\\_cost_i)\\}`" msgid "where:" msgstr "どこに：" @@ -4160,79 +4148,77 @@ 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`" +":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`" +":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}`" +":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}`" +"\\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}`" +":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," +"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 "" msgid "" -":math:`path\\_seq` indicates the relative position in the path of the " -":math:`node` or :math:`edge`." -msgstr ":math:'path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を示しています。" +":math:`path\\_seq` indicates the relative position in the path of the :math:" +"`node` or :math:`edge`." +msgstr "" +":math:'path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を" +"示しています。" msgid ":math:`cost` is the cost of the edge to be used to go to the next node." msgstr ":math:'cost'は、次のノードに移動するために使用するエッジのコストです。" msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the " -"node." -msgstr ":math:'agg\\_cost' は、:math:'start_{vid}' からノードまでのコストです。" +":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgstr "" +":math:'agg\\_cost' は、:math:'start_{vid}' からノードまでのコストです。" msgid "If there is no path, the resulting set is empty." msgstr "経路がない場合、計算結果は空になります。" msgid "" -"**Supported versions:** `Latest `__ (`3.4 " -"`__) " -"`3.3 `__" -" `3.2 `__ `3.1 `__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 " -"`__ `2.4" -" `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" msgid "Driving Distance - Category" msgstr "" msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's " -"algorithm" +":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" @@ -4271,8 +4257,8 @@ msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "" 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." +"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 "" msgid "Edges SQL as described below." @@ -4294,26 +4280,22 @@ msgid "Upper limit for the inclusion of a node in the result." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 `__ `2.4 " -"`__ `2.3 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ `2.2 " -"`__" +"proposed-functions>`__ `2.2 `__" msgstr "" msgid "Experimental Functions" @@ -4341,26 +4323,24 @@ msgid ":doc:`transformation-family`" msgstr "" msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line " -"Graph." +":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line" -" Graph out of each vertex in the input graph." +":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " +"Graph out of each vertex in the input graph." msgstr "" msgid ":doc:`traversal-family`" msgstr "" msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the " -"graph." +":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of " -"the graph." +":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " +"graph." msgstr "" msgid ":doc:`components-family`" @@ -4371,8 +4351,8 @@ msgid ":doc:`ordering-family`" msgstr ":doc:`TSP-family`" msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering " -"of an undirected graph." +":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " +"an undirected graph." msgstr "" msgid ":doc:`TRSP-family`" @@ -4415,57 +4395,55 @@ msgid ":doc:`pgr_hawickCircuits`" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" "**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" +"family.html>`__ `2.5 `__ " +"`2.4 `__ `2.3 `__" msgstr "" msgid "Flow - Family of functions" msgstr "" msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel" -" algorithm." +":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " +"algorithm." msgstr "" msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow " -"on edges." +":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " +"edges." msgstr "" msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow " -"on edges." +":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " +"edges." msgstr "" msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow " -"on edges." +":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " +"edges." msgstr "" msgid "Applications" msgstr "" msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two" -" groups of vertices." +":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " +"groups of vertices." msgstr "" msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality " -"matching in a graph." +":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " +"in a graph." msgstr "" msgid "Flow Functions General Information" @@ -4500,9 +4478,9 @@ msgid "" msgstr "" msgid "" -"The maximum flow through the graph is guaranteed to be the value returned" -" by :doc:`pgr_maxFlow ` when executed with the same " -"parameters and can be calculated:" +"The maximum flow through the graph is guaranteed to be the value returned " +"by :doc:`pgr_maxFlow ` when executed with the same parameters " +"and can be calculated:" msgstr "" msgid "By aggregation of the outgoing flow from the sources" @@ -4512,10 +4490,10 @@ msgid "By aggregation of the incoming flow to the targets" msgstr "" 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." +":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 "" msgid "Capacity edges" @@ -4591,8 +4569,7 @@ msgid "**residual_capacity**" msgstr "" msgid "" -"Residual capacity of the edge in the direction (``start_vid``, " -"``end_vid``)." +"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" msgid "For :doc:`pgr_maxFlowMinCost`" @@ -4630,14 +4607,14 @@ msgstr "" 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." +"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 "" msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and " -"the flow of each edge." +"Maximum flow algorithms calculate the maximum flow through the graph and the " +"flow of each edge." msgstr "" msgid "" @@ -4649,8 +4626,8 @@ msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "" msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse" +"\\_capacity_i)\\}`" msgstr "" msgid "Graph definition" @@ -4660,18 +4637,18 @@ msgid "The weighted directed graph, :math:`G(V,E)`, is defined as:" msgstr "" msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i " -"\\bigcup target_i`" +":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " +"target_i`" msgstr "" 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}`" +"\\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 "" msgid "Maximum flow problem" @@ -4697,8 +4674,8 @@ msgstr "" 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:" +"obtained by aggregating on the source or sink and summing the flow from/to " +"it. In particular:" msgstr "" msgid ":math:`id_i = i`" @@ -4714,30 +4691,26 @@ msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 " +"`__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " "`__" msgstr "" msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL " -"`__ geospatial database to provide geospatial" -" routing and other network analysis functionality." +"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " +"other network analysis functionality." msgstr "" msgid "This is the manual for pgRouting |release|." @@ -4747,12 +4720,12 @@ msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "" msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-" -"Share Alike 3.0 License `_. 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." +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_. 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 "" msgid "General" @@ -4810,16 +4783,16 @@ msgid ":doc:`topology-functions`" msgstr "" msgid "" -"The following functions modify the database directly therefore the user " -"must have special permissions given by the administrators to use them." +"The following functions modify the database directly therefore the user must " +"have special permissions given by the administrators to use them." msgstr "" msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." msgstr "" msgid "" -":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on " -"the source and target information." +":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " +"source and target information." msgstr "" msgid "" @@ -4873,13 +4846,12 @@ msgid ":doc:`release_notes`" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ " +"`3.1 `__ `3.0 " +"`__" msgstr "" msgid "Kruskal - Family of functions" @@ -4889,9 +4861,9 @@ msgid "Boost Graph Inside" msgstr "" 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." +"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 "" msgid "**The main Characteristics are:**" @@ -4905,14 +4877,13 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "Migration guide" msgstr "" @@ -4929,14 +4900,14 @@ msgid "Migrating functions:" msgstr "" msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, " -"therefore the ``directed`` flag has been removed." +":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " +"the ``directed`` flag has been removed." msgstr "" msgid "" -":doc:`pgr_trsp` signatures have changed and many issues have been fixed " -"in the new signatures. This section will show how to migrate from the old" -" signatures to the new replacement functions. This also affects the " +":doc:`pgr_trsp` signatures have changed and many issues have been fixed in " +"the new signatures. This section will show how to migrate from the old " +"signatures to the new replacement functions. This also affects the " "restrictions." msgstr "" @@ -4975,8 +4946,8 @@ msgid "Before migration" msgstr "もっと詳しく知る" msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of " -"an edge." +"Columns used are ``going`` and ``coming`` to represent the existence of an " +"edge." msgstr "" msgid "" @@ -4996,8 +4967,8 @@ msgid "Migration" msgstr "" msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence " -"of an edge." +"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " +"an edge." msgstr "" msgid "Do not use the flag ``directed``." @@ -5115,14 +5086,15 @@ msgid "Restrictions data" msgstr "" msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 " -"\\rightarrow5 \\rightarrow9`." +"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " +"\\rightarrow9`." msgstr "" msgid "By inspection the path is clear." msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "" +"To transform the old restrictions table to the new restrictions structure," msgstr "" msgid "Create a new table with the new restrictions structure." @@ -5132,8 +5104,8 @@ msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal " -"of an array ``_pgr_array_reverse`` needed for the migration." +"For this migration pgRouting supplies an auxiliary function for reversal of " +"an array ``_pgr_array_reverse`` needed for the migration." msgstr "" msgid "``_pgr_array_reverse``:" @@ -5170,8 +5142,8 @@ msgid "Does not autodetect if ``reverse_cost`` column exist." msgstr "" msgid "" -"User must be careful to match the existence of the column with the value " -"of ``has_rcost`` parameter." +"User must be careful to match the existence of the column with the value of " +"``has_rcost`` parameter." msgstr "" msgid "The restrictions inner query is optional." @@ -5233,8 +5205,8 @@ msgid "The flag has been omitted and the default is been used." msgstr "" msgid "" -"When the need of using strictly the same (meaningless) names and types of" -" the function been migrated then:" +"When the need of using strictly the same (meaningless) names and types of " +"the function been migrated then:" msgstr "" msgid "``id1`` is the node" @@ -5302,8 +5274,8 @@ msgid "On the points query do not include the ``side`` column." msgstr "" msgid "" -"When the need of using strictly the same (meaningless) names and types, " -"and node values of the function been migrated then:" +"When the need of using strictly the same (meaningless) names and types, and " +"node values of the function been migrated then:" msgstr "" msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints``" @@ -5359,8 +5331,8 @@ msgid "Migration of ``pgr_trspViaEdges``" msgstr "" msgid "" -"And will travel thru the following Via points " -":math:`4\\rightarrow3\\rightarrow6`" +"And will travel thru the following Via points :math:" +"`4\\rightarrow3\\rightarrow6`" msgstr "" msgid ":doc:`pgr_withPointsVia` when there are no restrictions," @@ -5392,35 +5364,34 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" #, fuzzy msgid "Ordering - Family of functions" msgstr "ダイクストラ関連機能" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ `2.2 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ `2.2 " "`__ `2.1 " "`__ `2.0 " "`__" @@ -5430,8 +5401,8 @@ msgid "pgRouting Concepts" msgstr "" msgid "" -"This is a simple guide that go through some of the steps for getting " -"started with pgRouting. This guide covers:" +"This is a simple guide that go through some of the steps for getting started " +"with pgRouting. This guide covers:" msgstr "" msgid "Graphs" @@ -5464,7 +5435,8 @@ msgstr "" msgid "Directed simple graph" msgstr "" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "" +":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" msgid "Graphs:" @@ -5474,11 +5446,12 @@ msgid "Do not have geometries." msgstr "" msgid "" -"Some graph theory problems require graphs to have weights, called " -"**cost** in pgRouting." +"Some graph theory problems require graphs to have weights, called **cost** " +"in pgRouting." msgstr "" -msgid "In pgRouting there are several ways to represent a graph on the database:" +msgid "" +"In pgRouting there are several ways to represent a graph on the database:" msgstr "" msgid "With ``cost``" @@ -5504,18 +5477,20 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``):" msgstr "" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "" +"When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" msgid "``cost`` must exist in the query." msgstr "" -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "" +"When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "" msgid "" -"The decision of the graph to be **directed** or **undirected** is done " -"when executing a pgRouting algorithm." +"The decision of the graph to be **directed** or **undirected** is done when " +"executing a pgRouting algorithm." msgstr "" msgid "Graph with ``cost``" @@ -5531,8 +5506,8 @@ msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } " -"cost_{id} \\ge 0 \\}`" +":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " +"\\ge 0 \\}`" msgstr "" msgid "Edges where ``cost`` is non negative are part of the graph." @@ -5545,9 +5520,8 @@ msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` has directionality: :math:`source_{id} \\rightarrow " -"target_{id}`" +"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " +"has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "For the following data:" @@ -5561,18 +5535,18 @@ msgstr "" msgid "" "In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" +"\\;\\;}{} target_{id}`" msgstr "" msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id}" -" \\leftrightarrow target_{id}`" +"In terms of a directed graph is like having two edges: :math:`source_{id} " +"\\leftrightarrow target_{id}`" msgstr "" msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of " -"the graph." +"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " +"graph." msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -5588,15 +5562,15 @@ msgid "The set of edges :math:`E`:" msgstr "" 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}`" +":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 "" msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative" -" are part of the graph." +"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " +"are part of the graph." msgstr "" msgid "" @@ -5611,8 +5585,8 @@ msgid "In a directed graph both edges have directionality" msgstr "" msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: " -":math:`source_{id} \\rightarrow target_{id}`" +"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" +"`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "" @@ -5638,8 +5612,8 @@ msgid "" msgstr "" msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is " -":math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" +"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" msgid "In terms of a directed graph is like having four edges:" @@ -5661,18 +5635,17 @@ msgid "Graphs without geometries" msgstr "" msgid "" -"Personal relationships, genealogy, file dependency problems can be solved" -" using pgRouting. Those problems, normally, do not come with geometries " +"Personal relationships, genealogy, file dependency problems can be solved " +"using pgRouting. Those problems, normally, do not come with geometries " "associated with the graph." msgstr "" msgid "Wiki example" msgstr "" -#, python-format msgid "" -"Solve the example problem taken from `wikipedia " -"`__):" +"Solve the example problem taken from `wikipedia `__):" msgstr "" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." @@ -5682,8 +5655,7 @@ msgid "Is an undirected graph." msgstr "" msgid "" -"Although visually looks like to have geometries, the drawing is not to " -"scale." +"Although visually looks like to have geometries, the drawing is not to scale." msgstr "" msgid "No geometries associated to the vertices or edges" @@ -5696,9 +5668,9 @@ msgid "Has 9 edges:" msgstr "" 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}`" +":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 "" msgid "The graph can be represented in many ways for example:" @@ -5716,8 +5688,8 @@ msgid "Create a table" msgstr "" msgid "" -"The basic elements needed to perform basic routing on an undirected graph" -" are:" +"The basic elements needed to perform basic routing on an undirected graph " +"are:" msgstr "" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -5752,15 +5724,16 @@ msgstr "" msgid "Create a routing Database" msgstr "" -msgid "The first step is to create a database and load pgRouting in the database." +msgid "" +"The first step is to create a database and load pgRouting in the database." msgstr "" msgid "Typically create a database for each project." msgstr "" msgid "" -"Once having the database to work in, load your data and build the routing" -" application in that database." +"Once having the database to work in, load your data and build the routing " +"application in that database." msgstr "" msgid "Load Data" @@ -5779,8 +5752,8 @@ msgid ":doc:`sampledata`: a small graph used on the documentation examples" msgstr "" msgid "" -"Using `osm2pgrouting " -"`__" +"Using `osm2pgrouting `__" msgstr "" msgid "There are various open source tools that can help, like:" @@ -5840,20 +5813,20 @@ msgid "Prepare the graph" msgstr "" 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." +"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 "" msgid "" -"The steps to prepare the graph involve geometry operations using `PostGIS" -" `__ and some others involve graph operations like " -":doc:`pgr_contraction` to contract a graph." +"The steps to prepare the graph involve geometry operations using `PostGIS " +"`__ and some others involve graph operations like :doc:" +"`pgr_contraction` to contract a graph." msgstr "" msgid "" -"The `workshop `__ has a step by " -"step on how to prepare a graph using Open Street Map data, for a small " +"The `workshop `__ has a step by step " +"on how to prepare a graph using Open Street Map data, for a small " "application." msgstr "" @@ -5875,40 +5848,39 @@ msgid "Build a routing topology" msgstr "" 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." +"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 "" 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." +"``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 "" msgid "" -"When the data comes with geometries and there is no routing topology, " -"then this step is needed." +"When the data comes with geometries and there is no routing topology, then " +"this step is needed." msgstr "" 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." +"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 "" msgid "" -"If the columns do not exist they need to be added to the table in " -"question. (see `ALTER TABLE `__)" +"If the columns do not exist they need to be added to the table in question. " +"(see `ALTER TABLE `__)" msgstr "" 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." +"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 "" msgid "" @@ -5920,19 +5892,18 @@ msgid "See :doc:`sampledata` for an example for building a topology." msgstr "" msgid "" -"Data coming from OSM and using `osm2pgrouting " -"`__ as an import tool, comes " -"with the routing topology. See an example of using ``osm2pgrouting`` on " -"the `workshop " -"`__." +"Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an " +"example of using ``osm2pgrouting`` on the `workshop `__." msgstr "" msgid "Adjust costs" msgstr "" msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be" -" the double of the length of the geometry." +"For this example the ``cost`` and ``reverse_cost`` values are going to be " +"the double of the length of the geometry." msgstr "" msgid "Update costs to length of geometry" @@ -6020,16 +5991,15 @@ msgid "To get the crossing edges:" msgstr "" msgid "" -"That information is correct, for example, when in terms of vehicles, is " -"it a tunnel or bride crossing over another road." +"That information is correct, for example, when in terms of vehicles, is it a " +"tunnel or bride crossing over another road." msgstr "" msgid "It might be incorrect, for example:" msgstr "" msgid "" -"When it is actually an intersection of roads, where vehicles can make " -"turns." +"When it is actually an intersection of roads, where vehicles can make turns." msgstr "" msgid "" @@ -6045,14 +6015,14 @@ msgstr "" 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 " -"`__ and the data imported again." +"``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." msgstr "" 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" +"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 "" msgid "For very specific applications" @@ -6067,9 +6037,8 @@ msgid "The data needs a local fix for the specific application." msgstr "" msgid "" -"Once analyzed one by one the crossings, for the ones that need a local " -"fix, the edges need to be `split " -"`__." +"Once analyzed one by one the crossings, for the ones that need a local fix, " +"the edges need to be `split `__." msgstr "" msgid "" @@ -6101,8 +6070,8 @@ msgid "" msgstr "" msgid "" -"Capacity information, used on the :doc:`flow-family` functions does not " -"need to change when splitting edges." +"Capacity information, used on the :doc:`flow-family` functions does not need " +"to change when splitting edges." msgstr "" msgid "Adding new vertices" @@ -6148,17 +6117,16 @@ msgid "To get the graph connectivity:" msgstr "" msgid "" -"In this example, the component :math:`2` consists of vertices " -":math:`\\{2, 4\\}` and both vertices are also part of the dead end result" -" set." +"In this example, the component :math:`2` consists of vertices :math:`\\{2, " +"4\\}` and both vertices are also part of the dead end result set." msgstr "" msgid "This graph needs to be connected." msgstr "" msgid "" -"With the original graph of this documentation, there would be 3 " -"components as the crossing edge in this graph is a different component." +"With the original graph of this documentation, there would be 3 components " +"as the crossing edge in this graph is a different component." msgstr "" msgid "Prepare storage for connection information" @@ -6174,15 +6142,14 @@ msgid "Get the closest vertex" msgstr "" msgid "" -"Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1`" -" is vertex :math:`4`. And the closest edge to vertex :math:`4` is edge " -":math:`14`." +"Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1` is " +"vertex :math:`4`. And the closest edge to vertex :math:`4` is edge :math:" +"`14`." msgstr "" msgid "" -"The ``edge`` can be used to connect the components, using the " -"``fraction`` information about the edge :math:`14` to split the " -"connecting edge." +"The ``edge`` can be used to connect the components, using the ``fraction`` " +"information about the edge :math:`14` to split the connecting edge." msgstr "" msgid "Connecting components" @@ -6222,18 +6189,18 @@ msgstr "" 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." +"correctness of the data, on the final application, or any other factor not " +"mentioned." msgstr "" 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." +"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 "" msgid "" -"A complete method on how to contract and how to use the contracted graph " -"is described on :doc:`contraction-family`" +"A complete method on how to contract and how to use the contracted graph is " +"described on :doc:`contraction-family`" msgstr "" msgid "Dead ends" @@ -6243,13 +6210,13 @@ msgid "To get the dead ends:" msgstr "" msgid "" -"That information is correct, for example, when the dead end is on the " -"limit of the imported graph." +"That information is correct, for example, when the dead end is on the limit " +"of the imported graph." msgstr "" msgid "" -"Visually node :math:`4` looks to be as start/ending of 3 edges, but it is" -" not." +"Visually node :math:`4` looks to be as start/ending of 3 edges, but it is " +"not." msgstr "" msgid "Is that correct?" @@ -6262,8 +6229,8 @@ msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" msgid "" -"Is the application for pedestrians and therefore the pedestrian can " -"easily walk on the small curb?" +"Is the application for pedestrians and therefore the pedestrian can easily " +"walk on the small curb?" msgstr "" msgid "" @@ -6272,13 +6239,13 @@ msgid "" msgstr "" msgid "" -"Is there a big cliff and from eagles view look like the dead end is close" -" to the segment?" +"Is there a big cliff and from eagles view look like the dead end is close to " +"the segment?" msgstr "" msgid "" -"When there are many dead ends, to speed up, the :doc:`contraction-family`" -" functions can be used to divide the problem." +"When there are many dead ends, to speed up, the :doc:`contraction-family` " +"functions can be used to divide the problem." msgstr "" msgid "Linear edges" @@ -6293,14 +6260,15 @@ msgid "" msgstr "" msgid "" -"When there are many linear edges, to speed up, the :doc:`contraction-" -"family` functions can be used to divide the problem." +"When there are many linear edges, to speed up, the :doc:`contraction-family` " +"functions can be used to divide the problem." msgstr "" msgid "Function's structure" msgstr "" -msgid "Once the graph preparation work has been done above, it is time to use a" +msgid "" +"Once the graph preparation work has been done above, it is time to use a" msgstr "" msgid "The general form of a pgRouting function call is:" @@ -6317,24 +6285,26 @@ msgid "" "containing SQL queries." msgstr "" -msgid "**parameters**: Additional compulsory parameters needed by the function." +msgid "" +"**parameters**: Additional compulsory parameters needed by the function." msgstr "" msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that " -"have a default value when omitted." +"``Optional parameters``: Are non compulsory **named** parameters that have a " +"default value when omitted." msgstr "" msgid "" -"The compulsory parameters are positional parameters, the optional " -"parameters are named parameters." +"The compulsory parameters are positional parameters, the optional parameters " +"are named parameters." msgstr "" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" #, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** [, ``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** [, ``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "`Edges SQL`_:" @@ -6350,8 +6320,8 @@ msgid "It is an inner query." msgstr "" msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner " -"query needs to be used" +"It has no name, so **Edges SQL** gives an idea of what kind of inner query " +"needs to be used" msgstr "" msgid "**start vid**:" @@ -6369,8 +6339,8 @@ msgid "Is the third parameter." msgstr "" msgid "" -"It has no name, so **end vid** gives an idea of what the third " -"parameter's value should contain" +"It has no name, so **end vid** gives an idea of what the third parameter's " +"value should contain" msgstr "" msgid "Is the fourth parameter." @@ -6468,10 +6438,10 @@ msgid "Needs a `Combinations SQL`_" msgstr "" 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 variety of types, " -"**ANY-INTEGER** and **ANY-NUMERICAL** is used." +"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 variety of types, **ANY-INTEGER** and " +"**ANY-NUMERICAL** is used." msgstr "" msgid "Edges SQL for" @@ -6490,8 +6460,8 @@ msgid "General with (X,Y)" msgstr "" msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore " -"it's not part of the graph." +"When negative: edge (``source``, ``target``) does not exist, therefore it's " +"not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)," @@ -6542,14 +6512,14 @@ msgid "" msgstr "" msgid "" -"Depending on the family or category of a function it will have additional" -" parameters, some of them are compulsory and some are optional." +"Depending on the family or category of a function it will have additional " +"parameters, some of them are compulsory and some are optional." msgstr "" 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." +"order. The optional parameters are named parameters and will have a default " +"value." msgstr "" msgid "Parameters for the Via functions" @@ -6583,15 +6553,15 @@ msgid "``U_turn_on_edge``" msgstr "" 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." +"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 "" 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." +"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 "" msgid "For the TRSP functions" @@ -6603,7 +6573,8 @@ msgstr "" msgid "Array of identifiers of destination vertices." msgstr "" -msgid "There are several kinds of columns returned are depending of the function." +msgid "" +"There are several kinds of columns returned are depending of the function." msgstr "" msgid "Return columns for a path" @@ -6613,39 +6584,38 @@ msgid "Used on functions that return one path solution" msgstr "" msgid "" -"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, " -"cost, agg_cost)``" +"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " +"agg_cost)``" msgstr "" msgid "``path_seq``" msgstr "" msgid "" -"Relative position in the path. Has value **1** for the beginning of a " -"path." +"Relative position in the path. Has value **1** for the beginning of a path." msgstr "" msgid "" -"Identifier of the starting vertex. Returned when multiple starting " -"vetrices are in the query." +"Identifier of the starting vertex. Returned when multiple starting vetrices " +"are in the query." msgstr "" msgid "" -"Identifier of the ending vertex. Returned when multiple ending vertices " -"are in the query." +"Identifier of the ending vertex. Returned when multiple ending vertices are " +"in the query." msgstr "" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" 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." +"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 "" msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the " -"path sequence." +"Cost to traverse from ``node`` using ``edge`` to the next node in the path " +"sequence." msgstr "" msgid "Used on functions the following:" @@ -6655,8 +6625,8 @@ msgid ":doc:`pgr_withPoints`" msgstr "" msgid "" -"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, " -"cost, agg_cost)``" +"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " +"agg_cost)``" msgstr "" msgid "Relative position in the path." @@ -6705,8 +6675,8 @@ msgid "When negative is the identifier of the a point." msgstr "" msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the " -"path sequence." +"Identifier of the edge used to go from ``node`` to the next node in the path " +"sequence." msgstr "" msgid "**-1** for the last row of the path." @@ -6719,8 +6689,7 @@ msgid ":doc:`pgr_dijkstraNear`" msgstr "" msgid "" -"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " -"agg_cost)``" +"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" msgstr "" msgid "Identifier of the starting vertex of the current path." @@ -6749,7 +6718,8 @@ msgstr "" msgid "Path identifier." msgstr "" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "" +"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" msgid "Non selective for multiple paths" @@ -6759,8 +6729,8 @@ msgid "Regardless of the call, al the columns are returned." msgstr "" msgid "" -"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge," -" cost, agg_cost)``" +"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, " +"cost, agg_cost)``" msgstr "" msgid "Return columns for cost functions" @@ -6770,8 +6740,8 @@ msgid "Used in the following" msgstr "" msgid "" -"When start_vid or end_vid columns have negative values, the identifier is" -" for a Point." +"When start_vid or end_vid columns have negative values, the identifier is " +"for a Point." msgstr "" msgid "Return columns for flow functions" @@ -6795,12 +6765,13 @@ msgstr "" msgid "For the Routing functions" msgstr "" -msgid "To get faster results bound the queries to an area of interest of routing." +msgid "" +"To get faster results bound the queries to an area of interest of routing." msgstr "" 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." +"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 "" msgid "How to contribute" @@ -6810,16 +6781,16 @@ msgid "Wiki" msgstr "" msgid "" -"Edit an existing `pgRouting Wiki " -"`__ page." +"Edit an existing `pgRouting Wiki `__ page." msgstr "" msgid "Or create a new Wiki page" msgstr "" msgid "" -"Create a page on the `pgRouting Wiki " -"`__" +"Create a page on the `pgRouting Wiki `__" msgstr "" msgid "Give the title an appropriate name" @@ -6834,32 +6805,29 @@ msgid "Adding Functionaity to pgRouting" msgstr "" msgid "" -"Consult the `developer's documentation " -"`__" +"Consult the `developer's documentation `__" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "Installation" @@ -6887,17 +6855,16 @@ msgid ":ref:`install_testing`" msgstr "" 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 " -"`__" +"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 `__" msgstr "" msgid "" -"To use pgRouting PostGIS needs to be installed, please read the " -"information about installation in this `Install Guide " -"`__" +"To use pgRouting PostGIS needs to be installed, please read the information " +"about installation in this `Install Guide `__" msgstr "" msgid "Short Version" @@ -6918,8 +6885,8 @@ msgid "Get the sources" msgstr "" msgid "" -"The pgRouting latest release can be found in " -"https://github.com/pgRouting/pgrouting/releases/latest" +"The pgRouting latest release can be found in https://github.com/pgRouting/" +"pgrouting/releases/latest" msgstr "" msgid "wget" @@ -6929,8 +6896,8 @@ msgid "To download this release:" msgstr "" msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball " -"and compiling pgRouting." +"Go to :ref:`install-short` for more instructions on extracting tar ball and " +"compiling pgRouting." msgstr "" msgid "git" @@ -6941,8 +6908,8 @@ msgstr "" msgid "" "Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository " -"from GitHub)." +"(there is no tar ball involved while downloading pgRouting repository from " +"GitHub)." msgstr "" msgid "Enabling and upgrading in the database" @@ -6953,13 +6920,12 @@ msgstr "" 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." +"functionalities to end user. Below given code demonstrates enabling PostGIS " +"and pgRouting in the database." msgstr "" msgid "" -"Checking PostGIS and pgRouting version after enabling them in the " -"database." +"Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" msgid "Upgrading the database" @@ -6971,8 +6937,8 @@ msgid "" msgstr "" msgid "" -"More information can be found in https://www.postgresql.org/docs/current" -"/sql-createextension.html" +"More information can be found in https://www.postgresql.org/docs/current/sql-" +"createextension.html" msgstr "" msgid "Dependencies" @@ -6982,21 +6948,20 @@ msgid "Compilation Dependencies" msgstr "" msgid "" -"To be able to compile pgRouting, make sure that the following " -"dependencies are met:" +"To be able to compile pgRouting, make sure that the following dependencies " +"are met:" msgstr "" msgid "C and C++0x compilers" msgstr "" msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with " -"C++03 or C++11 standard support" +"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " +"or C++11 standard support" msgstr "" msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard " -"support" +"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" msgid "Postgresql version = Supported versions by PostgreSQL" @@ -7060,8 +7025,8 @@ msgid "To exit psql console" msgstr "" msgid "" -"Entering psql console directly without switching roles can be done by the" -" following commands" +"Entering psql console directly without switching roles can be done by the " +"following commands" msgstr "" msgid "Then use the above given method to exit out of the psql console" @@ -7080,10 +7045,10 @@ msgid "Creating PostgreSQL role" msgstr "" msgid "" -"Default role provided by PostgreSQL is postgres. To create new roles you " -"can use the above provided commands. The prompt will ask the user to type" -" name of the role and then provide affirmation. Proceed with the steps " -"and you will succeed in creating PostgreSQL role successfully." +"Default role provided by PostgreSQL is postgres. To create new roles you can " +"use the above provided commands. The prompt will ask the user to type name " +"of the role and then provide affirmation. Proceed with the steps and you " +"will succeed in creating PostgreSQL role successfully." msgstr "" msgid "" @@ -7092,8 +7057,8 @@ msgid "" msgstr "" msgid "" -"To get additional details on the flags associated with ``createuser`` " -"below given command can be used" +"To get additional details on the flags associated with ``createuser`` below " +"given command can be used" msgstr "" msgid "Creating Database in PostgreSQL" @@ -7204,8 +7169,8 @@ msgid "The following instructions start from *path/to/pgrouting/build*" msgstr "" msgid "" -"We have tested on several platforms, For installing or reinstalling all " -"the steps are needed." +"We have tested on several platforms, For installing or reinstalling all the " +"steps are needed." msgstr "" msgid "The sql signatures are configured and build in the ``cmake`` command." @@ -7221,8 +7186,7 @@ msgid "The following instructions start from *path/to/pgrouting*" msgstr "" msgid "" -"To remove the build when the configuration changes, use the following " -"code:" +"To remove the build when the configuration changes, use the following code:" msgstr "" msgid "and start the build process as mentioned previously." @@ -7238,45 +7202,41 @@ msgid "The following instructions start from *path/to/pgrouting/*" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "" "pgRouting is an extension of `PostGIS `__ and " "`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of " -"pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp " -"`__, was later extended by Orkney and renamed to " -"pgRouting. The project is now supported and maintained by `Georepublic " -"`__, `Paragon Corporation " -"`__ and a broad user community." +"routing and other network analysis functionality. A predecessor of pgRouting " +"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " +"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " +"a broad user community." msgstr "" msgid "" -"pgRouting is part of `OSGeo Community Projects " -"`__ from the `OSGeo" -" Foundation `__ and included on `OSGeoLive " -"`__." +"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" msgid "Licensing" @@ -7292,35 +7252,35 @@ msgid "GNU General Public License v2.0 or later" msgstr "" msgid "" -"Most features of pgRouting are available under `GNU General Public " -"License v2.0 or later `_." +"Most features of pgRouting are available under `GNU General Public License " +"v2.0 or later `_." msgstr "" msgid "Boost Software License - Version 1.0" msgstr "" msgid "" -"Some Boost extensions are available under `Boost Software License - " -"Version 1.0 `_." +"Some Boost extensions are available under `Boost Software License - Version " +"1.0 `_." msgstr "" msgid "MIT-X License" msgstr "" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgid "" +"Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-" -"Share Alike 3.0 License `_." +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_." msgstr "" msgid "" "In general license information should be included in the header of each " "source file." -msgstr "一般に、ライセンス情報は、各ソースファイルのヘッダーに含める必要があります。" +msgstr "" +"一般に、ライセンス情報は、各ソースファイルのヘッダーに含める必要があります。" msgid "Contributors" msgstr "貢献者" @@ -7332,8 +7292,8 @@ msgid "Individuals in this release (in alphabetical order)" msgstr "" msgid "" -"Ashish Kumar, Cayetano Benavent, Daniel Kastl, Nitish Chauhan, Rajat " -"Shinde, Regina Obe, Shobhit Chaurasia, Swapnil Joshi, Virginia Vergara" +"Ashish Kumar, Cayetano Benavent, Daniel Kastl, Nitish Chauhan, Rajat Shinde, " +"Regina Obe, Shobhit Chaurasia, Swapnil Joshi, Virginia Vergara" msgstr "" msgid "" @@ -7346,9 +7306,11 @@ msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" msgid "" -"These are corporate entities that have contributed developer time, " -"hosting, or direct monetary funding to the pgRouting project:" -msgstr "これらは、デベロッパーが開発に要する時間、ホスティング、また pgRoutingプロジェクトへ直接資金を支援してくださっているスポンサー企業です。" +"These are corporate entities that have contributed developer time, hosting, " +"or direct monetary funding to the pgRouting project:" +msgstr "" +"これらは、デベロッパーが開発に要する時間、ホスティング、また pgRoutingプロ" +"ジェクトへ直接資金を支援してくださっているスポンサー企業です。" msgid "`Georepublic `__" msgstr "" @@ -7366,18 +7328,18 @@ msgid "Individuals (in alphabetical order)" msgstr "個人(アルファベット順)" msgid "" -"Aasheesh Tiwari, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea" -" Nardelli, Anthony Tasca, Anton Patrushev, Ashraf Hossain, Ashish Kumar, " +"Aasheesh Tiwari, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea " +"Nardelli, Anthony Tasca, Anton Patrushev, 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" +"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" msgstr "" msgid "Corporate Sponsors (in alphabetical order)" @@ -7416,11 +7378,13 @@ msgstr "もっと詳しく知る" msgid "" "The latest software, documentation and news items are available at the " "pgRouting web site https://pgrouting.org." -msgstr "最新のソフトウェア、ドキュメント、ニュースは、pgRoutingのウェブサイト https://pgrouting.orgで入手できます。" +msgstr "" +"最新のソフトウェア、ドキュメント、ニュースは、pgRoutingのウェブサイト " +"https://pgrouting.orgで入手できます。" msgid "" -"PostgreSQL database server at the PostgreSQL main site " -"https://www.postgresql.org." +"PostgreSQL database server at the PostgreSQL main site https://www." +"postgresql.org." msgstr "" msgid "PostGIS extension at the PostGIS project web site https://postgis.net." @@ -7430,29 +7394,26 @@ msgid "Boost C++ source libraries at https://www.boost.org." msgstr "" msgid "" -"The Migration guide from 2.6 can be found at " -"https://github.com/pgRouting/pgrouting/wiki/Migration-Guide." +"The Migration guide from 2.6 can be found at https://github.com/pgRouting/" +"pgrouting/wiki/Migration-Guide." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "pgr_KSP" @@ -7497,8 +7458,8 @@ msgid "**Official** function" msgstr "**公式** 機能" msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is " -"the number of shortest paths desired." +"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " +"number of shortest paths desired." msgstr "" msgid "Signatures" @@ -7545,11 +7506,12 @@ msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" 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``." +"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 "" -msgid "Has value **1** for the first of a path from **start vid** to **end_vid**" +msgid "" +"Has value **1** for the first of a path from **start vid** to **end_vid**" msgstr "" msgid "Identifier of the node in the path from **start vid** to **end vid**" @@ -7574,24 +7536,21 @@ msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_TSP``" @@ -7607,8 +7566,8 @@ msgid "Version 3.2.1" msgstr "" msgid "" -"Metric Algorithm from `Boost library " -"`__" +"Metric Algorithm from `Boost library `__" msgstr "" msgid "Simulated Annealing Algorithm no longer supported" @@ -7656,17 +7615,17 @@ msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" msgid "" -"It is **not garanteed** that the solution will be, in the worse case, " -"twice as long as the optimal tour, due to the fact that `end_vid` is " -"forced to be in a fixed position." +"It is **not garanteed** that the solution will be, in the worse case, twice " +"as long as the optimal tour, due to the fact that `end_vid` is forced to be " +"in a fixed position." msgstr "" msgid "With ``directed => true``" msgstr "" msgid "" -"It is **not garanteed** that the solution will be, in the worse case, " -"twice as long as the optimal tour" +"It is **not garanteed** that the solution will be, in the worse case, twice " +"as long as the optimal tour" msgstr "" msgid "is directed" @@ -7683,8 +7642,8 @@ msgid "" msgstr "" msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted " -"`(u, v)`" +"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " +"v)`" msgstr "" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" @@ -7720,8 +7679,8 @@ msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because " -"they are not connected." +"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " +"are not connected." msgstr "" msgid "`Matrix SQL`_ as described below" @@ -7749,9 +7708,10 @@ msgid "Identifier of the node/coordinate/point." msgstr "ノード/座標/ポイントの識別子" msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the " -"path sequence." -msgstr "現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト" +"Cost to traverse from the current ``node`` to the next ``node`` in the path " +"sequence." +msgstr "" +"現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト" msgid "``0`` for the last row in the tour sequence." msgstr "" @@ -7775,16 +7735,16 @@ msgid "To generate an asymmetric matrix:" msgstr "" msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by" -" not including it in the query" +"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " +"not including it in the query" msgstr "" msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" msgstr "" msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered" -" as the ``agg_cost``" +":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " +"the ``agg_cost``" msgstr "" msgid "" @@ -7807,30 +7767,30 @@ msgid "" msgstr "" 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`." +"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 "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_TSPeuclidean``" msgstr "" @@ -7855,19 +7815,18 @@ msgid "New **Official** function" msgstr "新しい **公式** 機能" msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be " -"kept" +"Any duplicated identifier will be ignored. The coordinates that will be kept" msgstr "" msgid "is arbitrarly." msgstr "" -msgid "The coordinates are quite similar for the same identifier, for example ::" +msgid "" +"The coordinates are quite similar for the same identifier, for example ::" msgstr "" msgid "" -"The coordinates are quite different for the same identifier, for example " -"::" +"The coordinates are quite different for the same identifier, for example ::" msgstr "" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -7902,10 +7861,9 @@ msgstr "" msgid "" "This example shows how to make performance tests using University of " -"Waterloo's `example data " -"`__ using the 29 " -"cities of `Western Sahara dataset " -"`__" +"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" msgstr "" msgid "Creating a table for the data and storing the data" @@ -7918,8 +7876,8 @@ msgid "Total tour cost" msgstr "" msgid "" -"Getting a total cost of the tour, compare the value with the length of an" -" optimal tour is 27603, given on the dataset" +"Getting a total cost of the tour, compare the value with the length of an " +"optimal tour is 27603, given on the dataset" msgstr "" msgid "Getting a geometry of the tour" @@ -7929,33 +7887,31 @@ msgid "Visual results" msgstr "" msgid "" -"Visualy, The first image is the `optimal solution " -"`__ and the second " -"image is the solution obtained with ``pgr_TSPeuclidean``." +"Visualy, The first image is the `optimal solution `__ and the second image is the solution " +"obtained with ``pgr_TSPeuclidean``." msgstr "" msgid ":doc:`sampledata` network." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_aStar``" @@ -7995,8 +7951,8 @@ msgid "**Official** ``pgr_aStar`` (`One to One`_)" msgstr "" msgid "" -"The results are equivalent to the union of the results of the " -"`pgr_aStar(` `One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the `pgr_aStar(` " +"`One to One`_ `)` on the:" msgstr "" msgid "`pgr_aStar(` `One to Many`_ `)`" @@ -8009,8 +7965,8 @@ msgid "`pgr_aStar(` `Many to Many`_ `)`" msgstr "" msgid "" -"``start_vid`` and ``end_vid`` in the result is used to distinguish to " -"which path it belongs." +"``start_vid`` and ``end_vid`` in the result is used to distinguish to which " +"path it belongs." msgstr "" #, fuzzy @@ -8062,8 +8018,8 @@ msgid "RETURNS SET OF |result-m-1|" msgstr "" msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an " -"**undirected** graph with heuristic :math:`4`" +"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " +"graph with heuristic :math:`4`" msgstr "" msgid "RETURNS SET OF |short-generic-result|" @@ -8075,8 +8031,7 @@ msgid "" msgstr "" msgid "" -"Using a combinations table on a **directed** graph with factor " -":math:`0.5`." +"Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" msgid "The combinations table:" @@ -8104,20 +8059,18 @@ msgid "Manually assigned vertex combinations." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" msgid "pgr_aStarCost" @@ -8135,8 +8088,8 @@ msgid "New **proposed** function" msgstr "" msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest " -"path(s) using the A* algorithm." +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) " +"using the A* algorithm." msgstr "" msgid "" @@ -8169,7 +8122,8 @@ msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -8183,28 +8137,28 @@ msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" msgid "``pgr_aStarCostMatrix``" msgstr "" msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using " -":doc:`pgr_aStar`." +"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" msgid "Using internaly the :doc:`pgr_aStar` algorithm" @@ -8247,27 +8201,24 @@ msgid "Use with :doc:`pgr_TSP`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_alphaShape``" @@ -8309,21 +8260,23 @@ msgstr "" msgid "Uses PostGis ST_DelaunyTriangles" msgstr "" -msgid "Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" +msgid "" +"Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" msgstr "" msgid ":math:`spoon\\_radius = \\sqrt alpha`" msgstr "" msgid "" -"A Triangle area is considered part of the alpha shape when " -":math:`circumcenter\\ radius < spoon\\_radius`" +"A Triangle area is considered part of the alpha shape when :math:" +"`circumcenter\\ radius < spoon\\_radius`" msgstr "" msgid "The ``alpha`` parameter is the **spoon radius**" msgstr "" -msgid "When the total number of points is less than 3, returns an EMPTY geometry" +msgid "" +"When the total number of points is less than 3, returns an EMPTY geometry" msgstr "" msgid "pgr_alphaShape(**geometry**, [alpha])" @@ -8333,8 +8286,8 @@ msgid "RETURNS ``geometry``" msgstr "" msgid "" -"passing a geometry collection with spoon radius :math:`1.5` using the " -"return variable ``geom``" +"passing a geometry collection with spoon radius :math:`1.5` using the return " +"variable ``geom``" msgstr "" msgid "**geometry**" @@ -8371,27 +8324,24 @@ msgid "`ST_ConcaveHull `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "pgr_analyzeGraph" @@ -8433,8 +8383,7 @@ msgid "Use :doc:`pgr_createVerticesTable` to create the vertices table." msgstr "" msgid "" -"Use :doc:`pgr_createTopology` to create the topology and the vertices " -"table." +"Use :doc:`pgr_createTopology` to create the topology and the vertices table." msgstr "" msgid "The analyze graph function accepts the following parameters:" @@ -8449,7 +8398,8 @@ msgstr "" msgid "tolerance" msgstr "" -msgid "``float8`` Snapping tolerance of disconnected edges. (in projection unit)" +msgid "" +"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" msgstr "" msgid "the_geom" @@ -8488,8 +8438,8 @@ msgid "rows_where" msgstr "" msgid "" -"``text`` Condition to select a subset or rows. Default value is " -"``true`` to indicate all rows." +"``text`` Condition to select a subset or rows. Default value is ``true`` " +"to indicate all rows." msgstr "" msgid "Uses the vertices table: _vertices_pgr." @@ -8499,8 +8449,7 @@ msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." msgstr "" msgid "" -"Returns the analysis of the section of the network defined by " -"``rows_where``" +"Returns the analysis of the section of the network defined by ``rows_where``" msgstr "" msgid "The vertices table is not found." @@ -8525,8 +8474,7 @@ msgstr "" msgid "" "The vertices table can be created with :doc:`pgr_createVerticesTable " -"` or :doc:`pgr_createTopology " -"`" +"` or :doc:`pgr_createTopology `" msgstr "" msgid "The structure of the vertices table is:" @@ -8539,8 +8487,7 @@ msgid "cnt" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex." +"``integer`` Number of vertices in the edge_table that reference this vertex." msgstr "" msgid "chk" @@ -8553,16 +8500,16 @@ msgid "ein" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming. See :doc:`pgr_analyzeOneWay `." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming. See :doc:`pgr_analyzeOneWay `." msgstr "" msgid "eout" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing. See :doc:`pgr_analyzeOneWay `." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing. See :doc:`pgr_analyzeOneWay `." msgstr "" msgid "``geometry`` Point geometry of the vertex." @@ -8587,9 +8534,9 @@ msgid "the arguments are not given in the appropriate order:" msgstr "" msgid "" -"In this example, the column ``id`` of the table ``mytable`` is passed to " -"the function as the geometry column, and the geometry column ``the_geom``" -" is passed to the function as the id column." +"In this example, the column ``id`` of the table ``mytable`` is passed to the " +"function as the geometry column, and the geometry column ``the_geom`` is " +"passed to the function as the id column." msgstr "" msgid "When using the named notation" @@ -8599,16 +8546,16 @@ msgid "The order of the parameters do not matter:" msgstr "" msgid "" -"Parameters defined with a default value can be omitted, as long as the " -"value matches the default:" +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default:" msgstr "" msgid "Selecting rows using rows_where parameter" msgstr "" msgid "" -"Selecting rows based on the id. Displays the analysis a the section of " -"the network." +"Selecting rows based on the id. Displays the analysis a the section of the " +"network." msgstr "" msgid "" @@ -8617,8 +8564,8 @@ msgid "" msgstr "" msgid "" -"Selecting the rows where the geometry is near the geometry of the row " -"with ``gid`` =100 of the table ``othertable``." +"Selecting the rows where the geometry is near the geometry of the row with " +"``gid`` =100 of the table ``othertable``." msgstr "" msgid "Usage when the edge table's columns DO NOT MATCH the default values:" @@ -8630,7 +8577,8 @@ msgstr "" msgid "Using positional notation:" msgstr "" -msgid "The arguments need to be given in the order described in the parameters:" +msgid "" +"The arguments need to be given in the order described in the parameters:" msgstr "" msgid "" @@ -8672,27 +8620,24 @@ msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "pgr_analyzeOneWay" @@ -8704,36 +8649,36 @@ msgid "" msgstr "" msgid "" -"This function analyzes oneway streets in a graph and identifies any " -"flipped segments." +"This function analyzes oneway streets in a graph and identifies any flipped " +"segments." msgstr "" msgid "" "The analyses of one way segments is pretty simple but can be a powerful " "tools to identifying some the potential problems created by setting the " -"direction of a segment the wrong way. A node is a `source` if it has " -"edges the exit from that node and no edges enter that node. Conversely, a" -" node is a `sink` if all edges enter the node but none exit that node. " -"For a `source` type node it is logically impossible to exist because no " -"vehicle can exit the node if no vehicle and enter the node. Likewise, if " -"you had a `sink` node you would have an infinite number of vehicle piling" -" up on this node because you can enter it but not leave it." +"direction of a segment the wrong way. A node is a `source` if it has edges " +"the exit from that node and no edges enter that node. Conversely, a node is " +"a `sink` if all edges enter the node but none exit that node. For a `source` " +"type node it is logically impossible to exist because no vehicle can exit " +"the node if no vehicle and enter the node. Likewise, if you had a `sink` " +"node you would have an infinite number of vehicle piling up on this node " +"because you can enter it but not leave it." msgstr "" msgid "" -"So why do we care if the are not feasible? Well if the direction of an " -"edge was reversed by mistake we could generate exactly these conditions. " -"Think about a divided highway and on the north bound lane one segment got" -" entered wrong or maybe a sequence of multiple segments got entered wrong" -" or maybe this happened on a round-about. The result would be potentially" -" a `source` and/or a `sink` node." +"So why do we care if the are not feasible? Well if the direction of an edge " +"was reversed by mistake we could generate exactly these conditions. Think " +"about a divided highway and on the north bound lane one segment got entered " +"wrong or maybe a sequence of multiple segments got entered wrong or maybe " +"this happened on a round-about. The result would be potentially a `source` " +"and/or a `sink` node." msgstr "" msgid "" "So by counting the number of edges entering and exiting each node we can " -"identify both `source` and `sink` nodes so that you can look at those " -"areas of your network to make repairs and/or report the problem back to " -"your data vendor." +"identify both `source` and `sink` nodes so that you can look at those areas " +"of your network to make repairs and/or report the problem back to your data " +"vendor." msgstr "" msgid "" @@ -8788,11 +8733,12 @@ msgid "" msgstr "" msgid "" -"It is strongly recommended to use the named notation. See " -":doc:`pgr_createVerticesTable` or :doc:`pgr_createTopology` for examples." +"It is strongly recommended to use the named notation. See :doc:" +"`pgr_createVerticesTable` or :doc:`pgr_createTopology` for examples." msgstr "" -msgid "Fills completely the ``ein`` and ``eout`` columns of the vertices table." +msgid "" +"Fills completely the ``ein`` and ``eout`` columns of the vertices table." msgstr "" msgid "The names of source , target or oneway are the same." @@ -8805,55 +8751,55 @@ msgid "" msgstr "" msgid "" -"The vertices table can be created with :doc:`pgr_createVerticesTable` or " -":doc:`pgr_createTopology`" +"The vertices table can be created with :doc:`pgr_createVerticesTable` or :" +"doc:`pgr_createTopology`" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex. See :doc:`pgr_analyzeGgraph `." +"``integer`` Number of vertices in the edge_table that reference this vertex. " +"See :doc:`pgr_analyzeGgraph `." msgstr "" msgid "" -"``integer`` Indicator that the vertex might have a problem. See " -":doc:`pgr_analyzeGraph `." +"``integer`` Indicator that the vertex might have a problem. See :doc:" +"`pgr_analyzeGraph `." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing." msgstr "" msgid ":doc:`pgr_analyzeGraph`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_articulationPoints``" msgstr "" msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an " -"undirected graph." +"``pgr_articulationPoints`` - Return the articulation points of an undirected " +"graph." msgstr "" msgid "Return columns change: ``seq`` is removed" @@ -8866,11 +8812,10 @@ msgid "New **experimental** function" msgstr "" 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." +"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 "" msgid "Works for **undirected** graphs." @@ -8898,35 +8843,32 @@ msgid "Returns set of |result-node|" msgstr "" msgid "" -"Boost: `Biconnected components & articulation points " -"`__" +"Boost: `Biconnected components & articulation points `__" msgstr "" msgid "" -"wikipedia: `Biconnected component " -"`__" +"wikipedia: `Biconnected component `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 `__ `2.0" -" `__" +"`2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_bdAstar``" @@ -8954,8 +8896,8 @@ msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" msgstr "" msgid "" -"The results are equivalent to the union of the results of the " -"`pgr_bdAStar(` `One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the `pgr_bdAStar(` " +"`One to One`_ `)` on the:" msgstr "" msgid "`pgr_bdAstar(` `One to Many`_ `)`" @@ -8988,19 +8930,19 @@ msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "pgr_bdAstarCost" @@ -9020,46 +8962,50 @@ msgid "" msgstr "" #, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_bdAstarCostMatrix``" msgstr "" msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using " -":doc:`pgr_aStar`." +"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" @@ -9070,27 +9016,24 @@ msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_bdDijkstra``" @@ -9123,19 +9066,23 @@ msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" msgstr "" #, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -9151,8 +9098,7 @@ msgid "" msgstr "" msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** " -"graph" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" msgid "" @@ -9167,27 +9113,28 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "Using a combinations table on an **undirected** graph" msgstr "" -#, python-format -msgid "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf" +msgid "" +"https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP" +"%20shortest%20path%20algorithms.pdf" msgstr "" msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_bdDijkstraCost``" @@ -9202,20 +9149,18 @@ msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" msgstr "" msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest" -" path using the bidirectional Dijkstra Algorithm." +"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " +"path using the bidirectional Dijkstra Algorithm." msgstr "" #, fuzzy msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , " -"[``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -9239,34 +9184,31 @@ msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ `3.1" -" `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5" -" `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "" msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_bdDijkstra`." +"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_bdDijkstra`." msgstr "" msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost " -"matrix." +"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" #, fuzzy @@ -9282,13 +9224,13 @@ msgid "Use with :doc:`pgr_TSP`." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_bellmanFord - Experimental``" @@ -9319,34 +9261,35 @@ msgid "``pgr_bellmanFord`` (`Many to Many`_)" msgstr "" 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." +"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 "" -msgid "Process is valid for edges with both positive and negative edge weights." +msgid "" +"Process is valid for edges with both positive and negative edge weights." msgstr "" msgid "" -"When the start vertex and the end vertex are the same, there is no path. " -"The agg_cost would be :math:`0`." +"When the start vertex and the end vertex are the same, there is no path. The " +"agg_cost would be :math:`0`." msgstr "" 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." +"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 "" 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." +"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 "" msgid "" @@ -9363,23 +9306,23 @@ msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" #, fuzzy -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -9390,41 +9333,35 @@ msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "" msgid "" -"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed**" -" graph" +"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " +"graph" msgstr "" #, fuzzy -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "Using a combinations table on an **undirected** graph." msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 " -"`__ " -"`3.2 " -"`__ " -"`3.1 " -"`__ " -"`3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ " -"`2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_biconnectedComponents``" @@ -9445,12 +9382,12 @@ msgid "``seq`` changed type to ``BIGINT``" msgstr "" 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." +"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 "" msgid "Components are described by edges." @@ -9487,32 +9424,29 @@ msgid "Identifier of the edge that belongs to the ``component``." msgstr "" msgid "" -"Boost: `Biconnected components " -"`__" +"Boost: `Biconnected components `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__ " -"`3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a " -"binary graph." +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary " +"graph." msgstr "" 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'." +"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 "" msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" @@ -9532,28 +9466,28 @@ msgstr "" 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 alledges in graph have the same weight, that we" -" need a more general algorithm, like Dijkstra's Algorithm which runs in " -":math:`O(|E|log|V|)` time." +"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 alledges in graph have the same weight, that we need a more " +"general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" +"V|)` time." msgstr "" 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." +"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 "" 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.)" +"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 "" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" @@ -9590,8 +9524,8 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same " -"(i.e :math:`1``)" +"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" +"math:`1``)" msgstr "" #, fuzzy @@ -9606,16 +9540,16 @@ msgstr "オプションとなるパラメータ" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -#, python-format -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "pgr_bipartite -Experimental" @@ -9630,10 +9564,10 @@ msgid "New **experimental** signature" msgstr "" 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." +"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 "" msgid "The algorithm works in undirected graph only." @@ -9643,9 +9577,9 @@ msgid "The returned values are not ordered." msgstr "" 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." +"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 "" msgid "If graph is not bipartite then algorithm returns empty set." @@ -9667,31 +9601,29 @@ msgid "The odd length cyclic graph can not be bipartite." msgstr "" 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." +"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 "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ " -"`2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_boykovKolmogorov``" @@ -9699,8 +9631,8 @@ msgstr "" msgid "" "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Boykov " -"Kolmogorov algorithm." +"maximizes the flow from the sources to the targets using Boykov Kolmogorov " +"algorithm." msgstr "" msgid "New **proposed** signature" @@ -9752,33 +9684,34 @@ msgstr "" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "" +"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" msgid "" -"Using a combinations table, equivalent to calculating result from " -"vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +"Using a combinations table, equivalent to calculating result from vertices :" +"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth" -" First Search algorithm." +"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " +"First Search algorithm." msgstr "" msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" @@ -9788,16 +9721,16 @@ msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" msgstr "" msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a" -" particular depth." +"Provides the Breadth First Search traversal order from a root vertex to a " +"particular depth." msgstr "" msgid "The implementation will work on any type of graph." msgstr "" msgid "" -"Provides the Breadth First Search traversal order from a source node to a" -" target depth level." +"Provides the Breadth First Search traversal order from a source node to a " +"target depth level." msgstr "" msgid "Running time: :math:`O(E + V)`" @@ -9821,8 +9754,8 @@ msgid "Single vertex" msgstr "" msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in " -"ascending order of ``id``" +"From root vertex :math:`6` on a **directed** graph with edges in ascending " +"order of ``id``" msgstr "" msgid "Multiple vertices" @@ -9846,8 +9779,8 @@ msgid "The resulting traversal is different." msgstr "" msgid "" -"The left image shows the result with ascending order of ids and the right" -" image shows with descending order of the edge identifiers." +"The left image shows the result with ascending order of ids and the right " +"image shows with descending order of the edge identifiers." msgstr "" msgid "|ascending| |descending|" @@ -9860,29 +9793,28 @@ msgid "descending" msgstr "" msgid "" -"`Boost: Breadth First Search algorithm documentation " -"`__" +"`Boost: Breadth First Search algorithm documentation `__" msgstr "" msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +"`Wikipedia: Breadth First Search algorithm `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_bridges``" @@ -9893,8 +9825,8 @@ msgstr "" 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." +"number of connected components. This implementation can only be used with an " +"undirected graph." msgstr "" msgid "``edge`` ascending" @@ -9918,27 +9850,25 @@ msgstr "" msgid "Identifier of the edge that is a bridge." msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" msgid "" -"**Supported versions** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" msgstr "" msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which " -"contains every edge in a directed graph and starts and ends on the same " -"vertex." +"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " +"every edge in a directed graph and starts and ends on the same vertex." msgstr "" msgid "Returns ``EMPTY SET`` on a disconnected graph" @@ -9957,30 +9887,30 @@ msgid "Sequential value starting from ``1``" msgstr "" 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." +"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 "" msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" 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." +"``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 "" msgid "Return value when the graph if disconnected" @@ -9999,33 +9929,32 @@ msgid "Minimum costs of a circuit path." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "pgr_connectedComponents" msgstr "" msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph" -" using a DFS-based approach." +"``pgr_connectedComponents`` — Connected components of an undirected graph " +"using a DFS-based approach." msgstr "" msgid "" -"A connected component of an undirected graph is a set of vertices that " -"are all reachable from each other." +"A connected component of an undirected graph is a set of vertices that are " +"all reachable from each other." msgstr "" msgid "Components are described by vertices" @@ -10056,39 +9985,39 @@ msgid "Connecting disconnected components" msgstr "" msgid "" -"Boost: `Connected components " -"`__" +"Boost: `Connected components `__" msgstr "" msgid "" -"wikipedia: `Connected component " -"`__" +"wikipedia: `Connected component `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_contraction``" msgstr "" msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the " -"contracted vertices and edges." +"``pgr_contraction`` — Performs graph contraction and returns the contracted " +"vertices and edges." msgstr "" msgid "Name change from ``pgr_contractGraph``" @@ -10098,10 +10027,9 @@ msgid "Bug fixes" msgstr "" 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." +"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 "" msgid "Does not return the full contracted graph" @@ -10183,8 +10111,8 @@ msgid ":math:`1`" msgstr "" msgid "" -"Number of times the contraction operations on ``contraction_order`` will " -"be performed." +"Number of times the contraction operations on ``contraction_order`` will be " +"performed." msgstr "" msgid "Returns set of |result-contract|" @@ -10238,18 +10166,17 @@ msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current " -"edge (``source``, ``target``)." +"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " +"(``source``, ``target``)." msgstr "" msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current " -"edge (``source``, ``target``)." +"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " +"(``source``, ``target``)." msgstr "" msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, " -"``target``)." +"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" msgid "Only dead end contraction" @@ -10259,27 +10186,25 @@ msgid "Only linear contraction" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 " +"`__" msgstr "" msgid "pgr_createTopology" @@ -10311,9 +10236,9 @@ msgid "``text`` Network table name. (may contain the schema name AS well)" msgstr "" msgid "" -"``text`` Condition to SELECT a subset or rows. Default value is " -"``true`` to indicate all rows that where ``source`` or ``target`` have a " -"null value, otherwise the condition is used." +"``text`` Condition to SELECT a subset or rows. Default value is ``true`` " +"to indicate all rows that where ``source`` or ``target`` have a null value, " +"otherwise the condition is used." msgstr "" msgid "clean" @@ -10332,8 +10257,8 @@ msgid "The ``target`` column values will change." msgstr "" msgid "" -"An index will be created, if it doesn't exists, to speed up the process " -"to the following columns:" +"An index will be created, if it doesn't exists, to speed up the process to " +"the following columns:" msgstr "" msgid "``the_geom``" @@ -10349,36 +10274,36 @@ msgid "Fills ``id`` and ``the_geom`` columns of the vertices table." msgstr "" msgid "" -"Fills the source and target columns of the edge table referencing the " -"``id`` of the vertices table." +"Fills the source and target columns of the edge table referencing the ``id`` " +"of the vertices table." msgstr "" msgid "``FAIL`` when the network topology was not built due to an error:" msgstr "" msgid "" -"The vertices table is a requirement of the :doc:`pgr_analyzeGraph` and " -"the :doc:`pgr_analyzeOneWay` functions." +"The vertices table is a requirement of the :doc:`pgr_analyzeGraph` and the :" +"doc:`pgr_analyzeOneWay` functions." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex. See :doc:`pgr_analyzeGraph`." +"``integer`` Number of vertices in the edge_table that reference this vertex. " +"See :doc:`pgr_analyzeGraph`." msgstr "" msgid "" -"``integer`` Indicator that the vertex might have a problem. See " -":doc:`pgr_analyzeGraph`." +"``integer`` Indicator that the vertex might have a problem. See :doc:" +"`pgr_analyzeGraph`." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex AS incoming. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"AS incoming. See :doc:`pgr_analyzeOneWay`." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex AS outgoing. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"AS outgoing. See :doc:`pgr_analyzeOneWay`." msgstr "" msgid "The simplest way to use pgr_createTopology is:" @@ -10398,27 +10323,27 @@ msgid "" msgstr "" msgid "" -"Parameters defined with a default value can be omitted, as long as the " -"value matches the default And The order of the parameters would not " -"matter." +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default And The order of the parameters would not matter." msgstr "" msgid "" -"Selecting the rows where the geometry is near the geometry of row with " -"``id = 5``." +"Selecting the rows where the geometry is near the geometry of row with ``id " +"= 5``." msgstr "" -msgid "The arguments need to be given in the order described in the parameters." +msgid "" +"The arguments need to be given in the order described in the parameters." msgstr "" msgid "" -"Note that this example uses clean flag. So it recreates the whole " -"vertices table." +"Note that this example uses clean flag. So it recreates the whole vertices " +"table." msgstr "" msgid "" -"An error would occur when the arguments are not given in the appropiriate" -" order: In this example, the column ``gid`` of the table ``mytable`` is " +"An error would occur when the arguments are not given in the appropiriate " +"order: In this example, the column ``gid`` of the table ``mytable`` is " "passed to the function AS the geometry column, and the geometry column " "``mygeom`` is passed to the function AS the id column." msgstr "" @@ -10436,8 +10361,8 @@ msgid "Create a routing topology" msgstr "" msgid "" -"An alternate method to create a routing topology use " -":doc:`pgr_extractVertices`" +"An alternate method to create a routing topology use :doc:" +"`pgr_extractVertices`" msgstr "" msgid "Make sure the database does not have the ``vertices_table``" @@ -10450,8 +10375,7 @@ msgid "Create the vertices table" msgstr "" msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, " -")``" +"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" msgid "For big edge tables that are been prepared," @@ -10485,44 +10409,41 @@ msgid "With full output" msgstr "" msgid "" -"This example start a clean topology, with 5 edges, and then its " -"incremented to the rest of the edges." +"This example start a clean topology, with 5 edges, and then its incremented " +"to the rest of the edges." msgstr "" msgid "The example uses the :doc:`sampledata` network." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "pgr_createVerticesTable" msgstr "" msgid "" -"``pgr_createVerticesTable`` — Reconstructs the vertices table based on " -"the source and target information." +"``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " +"source and target information." msgstr "" msgid "``OK`` after the vertices table has been reconstructed." @@ -10542,8 +10463,8 @@ msgid "" msgstr "" msgid "" -"``text`` Condition to SELECT a subset or rows. Default value is " -"``true`` to indicate all rows." +"``text`` Condition to SELECT a subset or rows. Default value is ``true`` " +"to indicate all rows." msgstr "" msgid "" @@ -10555,18 +10476,18 @@ msgid "The names of source, target are the same." msgstr "" msgid "" -"The vertices table is a requierment of the :doc:`pgr_analyzeGraph` and " -"the :doc:`pgr_analyzeOneWay` functions." +"The vertices table is a requierment of the :doc:`pgr_analyzeGraph` and the :" +"doc:`pgr_analyzeOneWay` functions." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming. See :doc:`pgr_analyzeOneWay`." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing. See :doc:`pgr_analyzeOneWay`." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing. See :doc:`pgr_analyzeOneWay`." msgstr "" msgid "The simplest way to use pgr_createVerticesTable" @@ -10579,8 +10500,7 @@ msgid "" "An error would occur when the arguments are not given in the appropriate " "order: In this example, the column source column ``source`` of the table " "``mytable`` is passed to the function as the geometry column, and the " -"geometry column ``the_geom`` is passed to the function as the source " -"column." +"geometry column ``the_geom`` is passed to the function as the source column." msgstr "" msgid "Example 4" @@ -10663,13 +10583,12 @@ msgid "" msgstr "" msgid "" -":doc:`pgr_createTopology` ` to create a topology " -"based on the geometry." +":doc:`pgr_createTopology` ` to create a topology based " +"on the geometry." msgstr "" msgid "" -":doc:`pgr_analyzeGraph` to analyze the edges and vertices of the edge " -"table." +":doc:`pgr_analyzeGraph` to analyze the edges and vertices of the edge table." msgstr "" msgid ":doc:`pgr_analyzeOneWay` to analyze directionality of the edges." @@ -10677,44 +10596,44 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering" -" of an undirected graphs" +"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " +"an undirected graphs" msgstr "" msgid "Version 3.4.0" msgstr "" 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." +"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 "" 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." +"that at each step, the adjacent vertices are placed in the queue in order of " +"increasing degree." msgstr "" msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "" +"The bandwidth minimization problems are considered NP-complete problems." msgstr "" msgid "The running time complexity is: :math:`O(m log(m)|V|)`" @@ -10747,33 +10666,32 @@ msgid "New ordering in reverse order." msgstr "" msgid "" -"`Boost: Cuthill-McKee Ordering " -"`__" +"`Boost: Cuthill-McKee Ordering `__" msgstr "" -#, python-format msgid "" -"`Wikipedia: Cuthill-McKee Ordering " -"`__" +"`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "pgr_dagShortestPath - Experimental" msgstr "" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted " -"directed acyclic graphs(DAG). In particular, the DAG shortest paths " -"algorithm implemented by Boost.Graph." +"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed " +"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " +"implemented by Boost.Graph." msgstr "" msgid "New **experimental** function:" @@ -10783,10 +10701,10 @@ msgid "pgr_dagShortestPath(Combinations)" msgstr "" 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``)." +"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 "" msgid "" @@ -10796,8 +10714,8 @@ msgstr "" 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." +"ordering on the vertices, and thus is more efficient for DAG's than either " +"the Dijkstra or Bellman-Ford algorithm." msgstr "" msgid "" @@ -10862,14 +10780,14 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_degree`` -- Proposed" msgstr "" @@ -10911,8 +10829,8 @@ msgid "``BIGINT[]``" msgstr "" msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first " -"end point*." +"Array of identifiers of the edges that have the vertex ``id`` as *first end " +"point*." msgstr "" msgid "When missing, ``out_edges`` must exist." @@ -10922,8 +10840,8 @@ msgid "``out_edges``" msgstr "" msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second " -"end point*." +"Array of identifiers of the edges that have the vertex ``id`` as *second end " +"point*." msgstr "" msgid "When missing, ``in_edges`` must exist." @@ -10945,13 +10863,13 @@ msgid "Dry run execution" msgstr "" msgid "" -"To get the query generated used to get the vertex information, use " -"``dryrun => true``." +"To get the query generated used to get the vertex information, use ``dryrun " +"=> true``." msgstr "" msgid "" -"The results can be used as base code to make a refinement based on the " -"back end development needs." +"The results can be used as base code to make a refinement based on the back " +"end development needs." msgstr "" msgid "Degree from an existing table" @@ -10961,11 +10879,11 @@ msgid ":doc:`pgr_extractVertices`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_depthFirstSearch`` - Proposed" @@ -10989,24 +10907,25 @@ msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" msgstr "" 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." +"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 "" -msgid "The implementation works for both **directed** and **undirected** graphs." +msgid "" +"The implementation works for both **directed** and **undirected** graphs." msgstr "" msgid "" -"Provides the Depth First Search traversal order from a root vertex or " -"from a set of root vertices." +"Provides the Depth First Search traversal order from a root vertex or from a " +"set of root vertices." msgstr "" msgid "" -"An optional non-negative maximum depth parameter to limit the results up " -"to a particular depth." +"An optional non-negative maximum depth parameter to limit the results up to " +"a particular depth." msgstr "" msgid "" @@ -11015,8 +10934,7 @@ msgid "" msgstr "" msgid "" -"It does not produce the shortest path from a root vertex to a target " -"vertex." +"It does not produce the shortest path from a root vertex to a target vertex." msgstr "" msgid "The aggregate cost of traversal is not guaranteed to be minimal." @@ -11043,40 +10961,38 @@ msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" msgid "" -"`Boost: Depth First Search algorithm documentation " -"`__" +"`Boost: Depth First Search algorithm documentation `__" msgstr "" msgid "" -"`Boost: Undirected DFS algorithm documentation " -"`__" +"`Boost: Undirected DFS algorithm documentation `__" msgstr "" msgid "" -"`Wikipedia: Depth First Search algorithm `__" +"`Wikipedia: Depth First Search algorithm `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 `__ " -"`2.0 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ " +"`2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_dijkstra``" @@ -11116,33 +11032,40 @@ msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" msgstr "" #, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids** , [``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids** , [``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "" +"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" #, fuzzy -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "The examples of this section are based on the :doc:`sampledata` network." +msgid "" +"The examples of this section are based on the :doc:`sampledata` network." msgstr "" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -11185,8 +11108,7 @@ msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, " -"7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" @@ -11283,8 +11205,7 @@ msgid "Equvalences between signatures" msgstr "" msgid "" -"The following examples find the path for " -":math:`\\{6\\}\\rightarrow\\{10\\}`" +"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" msgid "33) Using `One to One`_" @@ -11302,29 +11223,27 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.3 `__" msgstr "" msgid "``pgr_dijkstraCost``" @@ -11345,26 +11264,22 @@ msgstr "" #, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid** , " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -11372,29 +11287,29 @@ msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__) " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_dijkstraCostMatrix``" msgstr "" msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_dijkstra`." +"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_dijkstra`." msgstr "" msgid "Using Dijkstra algorithm, calculate and return a cost matrix." @@ -11405,11 +11320,11 @@ msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_dijkstraNear`` - Proposed" @@ -11421,9 +11336,9 @@ msgid "" msgstr "" 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." +"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 "" msgid "Uses Dijkstra algorithm." @@ -11473,20 +11388,17 @@ msgstr "" #, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -11500,7 +11412,8 @@ msgid "**options B:** ``[directed, cap, global]``" msgstr "" #, fuzzy -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options:** ``[directed, cap]``" @@ -11512,7 +11425,8 @@ msgstr "" msgid "Using a **directed** graph for car routing." msgstr "" -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "" +"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" msgid "The defaults used:" @@ -11528,15 +11442,17 @@ msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "" #, fuzzy -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Departing on a car from a subway station find the nearest **two** " -"stations to vertex :math:`2`" +"Departing on a car from a subway station find the nearest **two** stations " +"to vertex :math:`2`" msgstr "" -msgid "The subway stations are on the following vertices :math:`\\{ 1, 10, 11\\}`" +msgid "" +"The subway stations are on the following vertices :math:`\\{ 1, 10, 11\\}`" msgstr "" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" @@ -11546,14 +11462,13 @@ msgid "In line `5`: using named parameter `cap => 2`" msgstr "" msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the" -" next best is :math:`11`." +"The result shows that station at vertex :math:`10` is the nearest and the " +"next best is :math:`11`." msgstr "" #, fuzzy msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options:** ``[directed, cap, global]``" @@ -11578,21 +11493,21 @@ msgid "`global => true`" msgstr "" 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." +"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 "" msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is " -"``1``" +"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" #, fuzzy msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "Find the best car connection between all the stations of two subway lines" +msgid "" +"Find the best car connection between all the stations of two subway lines" msgstr "" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" @@ -11605,13 +11520,13 @@ msgid "The combinations contents:" msgstr "" 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" +"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 "" 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" +"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 "" msgid "On line `8`: using the named parameter is `global => false`" @@ -11621,13 +11536,13 @@ msgid "From the results:" msgstr "" msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to" -" the second :math:`\\{15, 16\\}`:" +"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " +"the second :math:`\\{15, 16\\}`:" msgstr "" msgid "" -"The best connections from all the stations from the first line are: " -":math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +"The best connections from all the stations from the first line are: :math:" +"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" msgid "" @@ -11636,18 +11551,18 @@ msgid "" msgstr "" msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to " -"the first :math:`\\{1, 10, 11\\}`:" +"making a connection from the second subway line :math:`\\{15, 16\\}` to the " +"first :math:`\\{1, 10, 11\\}`:" msgstr "" msgid "" -"The best connections from all the stations from the second line are: " -":math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +"The best connections from all the stations from the second line are: :math:" +"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" msgid "" -"Both are equaly good as they have the same cost. (lines: `13` and `14` " -"and lines: `15` and `16`)" +"Both are equaly good as they have the same cost. (lines: `13` and `14` and " +"lines: `15` and `16`)" msgstr "" msgid "Dijkstra optional parameters" @@ -11674,45 +11589,45 @@ msgstr "" msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" msgstr "" -#, python-format msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_dijkstraNearCost`` - Proposed" msgstr "" msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that" -" leads to the nearest vertex." +"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " +"leads to the nearest vertex." msgstr "" #, fuzzy msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options A**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " +"A**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options A**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " +"A**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options B**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " +"B**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "" +"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" #, fuzzy @@ -11728,8 +11643,8 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Departing on a car from a subway station find the nearest **two** " -"stations to vertex :math:`6`" +"Departing on a car from a subway station find the nearest **two** stations " +"to vertex :math:`6`" msgstr "" #, fuzzy @@ -11742,8 +11657,8 @@ msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" msgid "" -"lines `3~4` sets the start vertices to be from the fisrt subway line and " -"the ending vertices to be from the second subway line" +"lines `3~4` sets the start vertices to be from the fisrt subway line and the " +"ending vertices to be from the second subway line" msgstr "" msgid "" @@ -11755,23 +11670,22 @@ msgid "Both are equaly good as they have the same cost. (lines: `12` and `13`)" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "``pgr_dijkstraVia`` - Proposed" @@ -11781,9 +11695,9 @@ msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." 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)`." +"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 "" msgid "Route" @@ -11812,8 +11726,8 @@ msgid "RETURNS SET OF |via-result|" msgstr "" msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that " -"order on an **directed** graph." +"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " +"on an **directed** graph." msgstr "" msgid "Via optional parameters" @@ -11835,13 +11749,13 @@ msgid "``route_agg_cost``" msgstr "" msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the " -"current ``seq``." +"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " +"``seq``." msgstr "" 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." +"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 "" msgid "The main query" @@ -11869,33 +11783,32 @@ msgid ":doc:`dijkstra-family`." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ " +"`2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_drivingDistance``" msgstr "" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "" +"``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" msgid "Version 2.1.0:" @@ -11914,9 +11827,9 @@ msgid "**Official** pgr_drivingDistance(single vertex)" msgstr "" 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." +"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 "" #, fuzzy @@ -11927,8 +11840,7 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, " -"[**options**])" +"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options:** [directed, equicost]" @@ -11950,8 +11862,8 @@ msgid "RETURNS SET OF |result-dij-dd-m|" msgstr "" msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with " -"equi-cost on a directed graph" +"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" +"cost on a directed graph" msgstr "" msgid "Driving distance optional parameters" @@ -11964,8 +11876,8 @@ msgid "When ``true`` the node will only appear in the closest ``from_v`` list." msgstr "" msgid "" -"When ``false`` which resembles several calls using the single starting " -"point signatures. Tie brakes are arbitrary." +"When ``false`` which resembles several calls using the single starting point " +"signatures. Tie brakes are arbitrary." msgstr "" msgid "Returns SET OF ``(seq, from_v, node, edge, cost, agg_cost)``" @@ -11990,22 +11902,22 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "pgr_edgeColoring - Experimental" msgstr "" msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-" -"free graphs" +"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " +"graphs" msgstr "" msgid "" @@ -12023,23 +11935,24 @@ msgstr "" msgid "no self-loops and no parallel edges." msgstr "" -msgid "Provides the color to be assigned to all the edges present in the graph." +msgid "" +"Provides the color to be assigned to all the edges present in the graph." msgstr "" msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the" -" degree of the graph." +"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " +"degree of the graph." msgstr "" 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." +"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 "" 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`)" +"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` " +"of the graph, (:math:`x'(G) = \\Delta`)" msgstr "" msgid "The algorithm tries to assign the least possible color to every edge." @@ -12048,7 +11961,8 @@ msgstr "" msgid "Does not always produce optimal coloring." msgstr "" -msgid "The returned rows are ordered in ascending order of the edge identifier." +msgid "" +"The returned rows are ordered in ascending order of the edge identifier." msgstr "" msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" @@ -12073,21 +11987,21 @@ msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_edgeDisjointPaths``" @@ -12105,8 +12019,8 @@ msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" msgid "" -"Calculates the edge disjoint paths between two groups of vertices. " -"Utilizes underlying maximum flow algorithms to calculate the paths." +"Calculates the edge disjoint paths between two groups of vertices. Utilizes " +"underlying maximum flow algorithms to calculate the paths." msgstr "" msgid "The main characterics are:" @@ -12151,7 +12065,8 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "" +"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "RETURNS SET OF |result-disjoint|" @@ -12170,39 +12085,38 @@ msgid "RETURNS SET OF |result-disjoint-m-m|" msgstr "" msgid "" -"Using a combinations table, equivalent to calculating result from " -"vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an " -"undirected graph." +"Using a combinations table, equivalent to calculating result from vertices :" +"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " +"graph." msgstr "" msgid "Manually assigned vertex combinations on an undirected graph." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_edmondsKarp``" msgstr "" msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Edmonds Karp " -"Algorithm." +"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " +"the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" msgid "``pgr_edmondsKarp`` (`Combinations`_)" @@ -12237,16 +12151,15 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_edwardMoore - Experimental``" @@ -12273,19 +12186,18 @@ msgid "``pgr_edwardMoore`` (`Many to Many`_)" msgstr "" 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." +"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 "" 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." +"complexity of :math:`O( | E | )` for random graphs. This is significantly " +"faster in terms of computation speed." msgstr "" msgid "" @@ -12297,8 +12209,8 @@ msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" msgid "" -"For optimization purposes, any duplicated value in the `start vids` or " -"`end vids` are ignored." +"For optimization purposes, any duplicated value in the `start vids` or `end " +"vids` are ignored." msgstr "" msgid "`start vid` ascending" @@ -12317,21 +12229,23 @@ msgid "Average case: :math:`O( | E | )`" msgstr "" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -12339,25 +12253,23 @@ msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``]);" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``]);" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``]);" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``]);" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``]);" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``]);" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``]);" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``]);" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -12368,13 +12280,13 @@ msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "pgr_extractVertices -- Proposed" @@ -12387,13 +12299,13 @@ msgid "Classified as **proposed** function" msgstr "" msgid "" -"This is an auxiliary function for extracting the vertex information of " -"the set of edges of a graph." +"This is an auxiliary function for extracting the vertex information of the " +"set of edges of a graph." msgstr "" msgid "" -"When the edge identifier is given, then it will also calculate the in and" -" out edges" +"When the edge identifier is given, then it will also calculate the in and " +"out edges" msgstr "" #, fuzzy @@ -12419,8 +12331,8 @@ msgid "Geometry of the edge." msgstr "" msgid "" -"This inner query takes precedence over the next two inner query, " -"therefore other columns are ignored when ``geom`` column appears." +"This inner query takes precedence over the next two inner query, therefore " +"other columns are ignored when ``geom`` column appears." msgstr "" msgid "Ignored columns:" @@ -12436,8 +12348,8 @@ msgid "When vertex geometry is known" msgstr "" msgid "" -"To use this inner query the column ``geom`` should not be part of the set" -" of columns." +"To use this inner query the column ``geom`` should not be part of the set of " +"columns." msgstr "" msgid "``POINT``" @@ -12450,9 +12362,8 @@ msgid "POINT geometry of the ending vertex." msgstr "" msgid "" -"This inner query takes precedence over the next inner query, therefore " -"other columns are ignored when ``startpoint`` and ``endpoint`` columns " -"appears." +"This inner query takes precedence over the next inner query, therefore other " +"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" msgid "When identifiers of vertices are known" @@ -12479,8 +12390,8 @@ msgid "Dryrun execution" msgstr "" msgid "" -"To get the query generated used to get the vertex information, use " -"``dryrun := true``." +"To get the query generated used to get the vertex information, use ``dryrun :" +"= true``." msgstr "" msgid "" @@ -12490,14 +12401,14 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_findCloseEdges``" msgstr "" @@ -12515,11 +12426,12 @@ msgid "``pgr_findCloseEdges`` (`Many points`_)" msgstr "" msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge " -"to a point geometry." +"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " +"a point geometry." msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgid "" +"The geometries must be in the same coordinate system (have the same SRID)." msgstr "" msgid "" @@ -12531,11 +12443,13 @@ msgid "``EMTPY SET`` is returned on dryrun executions" msgstr "" #, fuzzy -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "" +"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "" +"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options:** ``[cap, partial, dryrun]``" @@ -12578,21 +12492,21 @@ msgid "Many points" msgstr "" msgid "" -"Find at most :math:`2` edges close to all vertices on the points of " -"interest table." +"Find at most :math:`2` edges close to all vertices on the points of interest " +"table." msgstr "" msgid "One answer per point, as small as possible." msgstr "" msgid "" -"Columns ``edge_id``, ``fraction``, ``side`` and ``geom`` are returned " -"with values." +"Columns ``edge_id``, ``fraction``, ``side`` and ``geom`` are returned with " +"values." msgstr "" msgid "" -"``geom`` contains the original point geometry to assist on " -"deterpartialing to which point geometry the row belongs to." +"``geom`` contains the original point geometry to assist on deterpartialing " +"to which point geometry the row belongs to." msgstr "" #, fuzzy @@ -12679,16 +12593,16 @@ msgid "``POINT`` geometry" msgstr "" msgid "" -"`One Point`_: Contains the point on the edge that is ``fraction`` away " -"from the starting point of the edge." +"`One Point`_: Contains the point on the edge that is ``fraction`` away from " +"the starting point of the edge." msgstr "" msgid "`Many Points`_: Contains the corresponding **original point**" msgstr "" msgid "" -"``LINESTRING`` geometry from the **original point** to the closest point " -"of the edge with identifier ``edge_id``" +"``LINESTRING`` geometry from the **original point** to the closest point of " +"the edge with identifier ``edge_id``" msgstr "" msgid "One point results" @@ -12697,12 +12611,13 @@ msgstr "" msgid "The green nodes is the **original point**" msgstr "" -msgid "The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." +msgid "" +"The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." msgstr "" msgid "" -"The geometry ``edge`` is a line that connects the **original point** with" -" ``geom``" +"The geometry ``edge`` is a line that connects the **original point** with " +"``geom``" msgstr "" msgid "Many point results" @@ -12753,13 +12668,13 @@ msgid "For edge :math:`5`:" msgstr "エッジのセット:math:`E`" msgid "" -"``fraction``: The closest point from the **original point** is at the " -":math:`0.8` fraction of the edge :math:`5`." +"``fraction``: The closest point from the **original point** is at the :math:" +"`0.8` fraction of the edge :math:`5`." msgstr "" msgid "" -"``side``: The **original point** is located to the left side of edge " -":math:`5`." +"``side``: The **original point** is located to the left side of edge :math:" +"`5`." msgstr "" msgid "" @@ -12772,18 +12687,18 @@ msgid "For edge :math:`8`:" msgstr "エッジのセット:math:`E`" msgid "" -"``fraction``: The closest point from the **original point** is at the " -":math:`0.89..` fraction of the edge :math:`8`." +"``fraction``: The closest point from the **original point** is at the :math:" +"`0.89..` fraction of the edge :math:`8`." msgstr "" msgid "" -"``side``: The **original point** is located to the right side of edge " -":math:`8`." +"``side``: The **original point** is located to the right side of edge :math:" +"`8`." msgstr "" msgid "" -"``distance``: The **original point** is located :math:`0.19..` length " -"units from edge :math:`8`." +"``distance``: The **original point** is located :math:`0.19..` length units " +"from edge :math:`8`." msgstr "" msgid "One answer, all columns" @@ -12795,7 +12710,8 @@ msgstr "" msgid "Calculate all columns" msgstr "" -msgid "``edge_id`` identifier of the edge **closest** to the **original point**" +msgid "" +"``edge_id`` identifier of the edge **closest** to the **original point**" msgstr "" msgid "" @@ -12804,13 +12720,13 @@ msgid "" msgstr "" msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`5` " -"from the **original point**." +"``geom``: Contains the geometry of the closest point on edge :math:`5` from " +"the **original point**." msgstr "" msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** " -"to the closest point on on edge :math:`5` ``geom``" +"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " +"the closest point on on edge :math:`5` ``geom``" msgstr "" msgid "At most two answers with all columns" @@ -12820,13 +12736,13 @@ msgid "Understanding the result:" msgstr "" msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`8` " -"from the **original point**." +"``geom``: Contains the geometry of the closest point on edge :math:`8` from " +"the **original point**." msgstr "" msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** " -"to the closest point on on edge :math:`8` ``geom``" +"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " +"the closest point on on edge :math:`8` ``geom``" msgstr "" msgid "One point dry run execution" @@ -12842,8 +12758,8 @@ msgid "Is ignored" msgstr "" msgid "" -"Because it is a **dry run** excecution, the code for all calculations are" -" shown on the PostgreSQL ``NOTICE``." +"Because it is a **dry run** excecution, the code for all calculations are " +"shown on the PostgreSQL ``NOTICE``." msgstr "" msgid "``dryrun => true``" @@ -12853,8 +12769,7 @@ msgid "Do not process query" msgstr "" msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all " -"columns" +"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" msgid "``cap`` and **original point** are used in the code" @@ -12870,8 +12785,7 @@ msgid "``NULL`` on ``edge``" msgstr "" msgid "" -"``edge_id`` identifier of the edge close to a **original point** " -"(``geom``)" +"``edge_id`` identifier of the edge close to a **original point** (``geom``)" msgstr "" msgid "" @@ -12889,8 +12803,8 @@ msgid "For point ``POINT(2.9 1.8)``" msgstr "" msgid "" -"Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the " -"shortest distance to ``POINT(2.9 1.8)``." +"Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the shortest " +"distance to ``POINT(2.9 1.8)``." msgstr "" msgid "One answer per point, all columns" @@ -12903,8 +12817,7 @@ msgid "Edge :math:`5` is the closest edge to the **original point**" msgstr "" msgid "" -"``geom``: Contains the geometry of the **original point** ``POINT(2.9 " -"1.8)``" +"``geom``: Contains the geometry of the **original point** ``POINT(2.9 1.8)``" msgstr "" msgid "" @@ -12932,24 +12845,25 @@ msgstr "" 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." +"that is not a vertex in the graph. Those locations, in pgRrouting are called " +"points of interest." msgstr "" msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``," -" ``side``, ``fraction``." +"The information needed in the points of interest is ``pid``, ``edge_id``, " +"``side``, ``fraction``." msgstr "" msgid "" -"On this documentation there will be some 6 fixed points of interest and " -"they will be stored on a table." +"On this documentation there will be some 6 fixed points of interest and they " +"will be stored on a table." msgstr "" msgid "A unique identifier." msgstr "" -msgid "Identifier of the edge nearest edge that allows an arrival to the point." +msgid "" +"Identifier of the edge nearest edge that allows an arrival to the point." msgstr "" msgid "Is it on the left, right or both sides of the segment ``edge_id``" @@ -12977,8 +12891,8 @@ msgid "Points of interest fillup" msgstr "" msgid "" -"Using :doc:`pgr_findCloseEdges` Calculating for visual purposes the " -"points over the graph." +"Using :doc:`pgr_findCloseEdges` Calculating for visual purposes the points " +"over the graph." msgstr "" msgid "A special case to arrive from both sides of the edge." @@ -12988,42 +12902,39 @@ msgid "Points of interest data" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__ " -"`2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_floydWarshall``" msgstr "" 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." +"``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 "" 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," +"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 "" msgid "pgr floydWarshall(`Edges SQL`_, [``directed``])" @@ -13033,27 +12944,28 @@ msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" msgid "" -"Boost `floyd-Warshall " -"`_" +"Boost `floyd-Warshall `_" msgstr "" msgid "Queries uses the :doc:`sampledata` network." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_full_version``" msgstr "" -msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgid "" +"``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" msgid "New **official** function" @@ -13127,42 +13039,42 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_hawickCircuits - Experimental``" msgstr "" msgid "" -"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick " -"circuits algorithm." +"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " +"algorithm." msgstr "" msgid "``pgr_hawickCircuits``" msgstr "" msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health " -"A. James. This algorithm solves the problem of detecting and enumerating " +"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." +"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 "" 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." +"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 "" msgid "The algorithm implementation works only for directed graph" @@ -13207,15 +13119,14 @@ msgid "Identifier of the node in the path from a vid to next vid." msgstr "" msgid "" -"`Boost: Hawick Circuit Algorithm " -"`__" +"`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " "`__" msgstr "" @@ -13228,18 +13139,18 @@ msgid "" msgstr "" 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." +"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 "" msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "It will return a boolean value depending upon the planarity of the graph." +msgid "" +"It will return a boolean value depending upon the planarity of the graph." msgstr "" msgid "Applicable only for **undirected** graphs." @@ -13270,86 +13181,80 @@ msgid "`false` when the graph is not planar." msgstr "" msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16," -" 13} a :math:`K_1` graph." +"The following edges will make the subgraph with vertices {10, 15, 11, 16, " +"13} a :math:`K_1` graph." msgstr "" msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges " -"in blue represent :math:`K_5` subgraph." +"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " +"blue represent :math:`K_5` subgraph." msgstr "" msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " "`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__ " -"`2.0 " -"`__" +"`2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "``pgr_johnson``" msgstr "" msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for " -"each pair of nodes in the graph using Floyd-Warshall algorithm." +"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " +"pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" 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 usees the Boost's implementation which runs in :math:`O(V E " -"\\log V)` time," +"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 usees the Boost's implementation which runs in :math:`O(V E \\log V)` " +"time," msgstr "" msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" msgid "" -"Boost `Johnson " -"`_" +"Boost `Johnson `_" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_kruskal``" msgstr "" msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's " -"algorithm." +"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" msgid "" -"This algorithm finds the minimum spanning forest in a possibly " -"disconnected graph using Kruskal's algorithm." +"This algorithm finds the minimum spanning forest in a possibly disconnected " +"graph using Kruskal's algorithm." msgstr "" msgid "EMPTY SET is returned when there are no edges in the graph." @@ -13365,13 +13270,13 @@ msgid "Minimum spanning forest" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_kruskalBFS``" @@ -13383,8 +13288,8 @@ msgid "" msgstr "" msgid "" -"Visits and extracts the nodes information in Breath First Search ordering" -" of the Minimum Spanning Tree created using Kruskal's algorithm." +"Visits and extracts the nodes information in Breath First Search ordering of " +"the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Breath First Search order" @@ -13405,17 +13310,16 @@ msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with " -":math:`depth \\leq 3`" +"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" +"`depth \\leq 3`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgstr "" @@ -13426,9 +13330,9 @@ msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" 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." +"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 "" msgid "Returned tree nodes from a root vertex are on Depth First Search order." @@ -13446,23 +13350,23 @@ msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with " -":math:`distance \\leq 3.5`" +"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " +"\\leq 3.5`" msgstr "" msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with " -":math:`distance \\leq 3.5`" +"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" +"`distance \\leq 3.5`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_kruskalDFS``" @@ -13474,8 +13378,8 @@ msgid "" msgstr "" msgid "" -"Visits and extracts the nodes information in Depth First Search ordering " -"of the Minimum Spanning Tree created using Kruskal's algorithm." +"Visits and extracts the nodes information in Depth First Search ordering of " +"the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order" @@ -13490,28 +13394,25 @@ msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__" -" `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "pgr_lengauerTarjanDominatorTree -Experimental" msgstr "" msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of " -"all vertices." +"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " +"vertices." msgstr "" msgid "" "The algorithm calculates the *immidiate 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." +"**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 "" msgid "The algorithm works in directed graph only." @@ -13520,7 +13421,8 @@ msgstr "" msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "If the *root vertex* not present in the graph then it returns empty set." +msgid "" +"If the *root vertex* not present in the graph then it returns empty set." msgstr "" msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -13557,37 +13459,36 @@ msgid "Dominator tree of another component." msgstr "" msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm " -"`__" +"`Boost: Lengauer-Tarjan dominator tree algorithm `__" msgstr "" msgid "" -"`Wikipedia: dominator tree " -"`__" +"`Wikipedia: dominator tree `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) " +"`3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_lineGraph`` - Experimental" msgstr "" msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding " -"edge-based graph." +"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" +"based graph." msgstr "" msgid "Given a graph G, its line graph L(G) is a graph such that:" @@ -13597,8 +13498,8 @@ msgid "Each vertex of L(G) represents an edge of G" msgstr "" msgid "" -"Two vertices of L(G) are adjacent if and only if their corresponding " -"edges share a common endpoint in G." +"Two vertices of L(G) are adjacent if and only if their corresponding edges " +"share a common endpoint in G." msgstr "" #, fuzzy @@ -13646,41 +13547,41 @@ msgid "https://en.wikipedia.org/wiki/Line_graph" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__" +"**Unsupported versions:** `2.6 `__" msgstr "" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" 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." +"``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 "" msgid "Version 2.6.0" msgstr "" 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." +"``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 "" msgid "" -"A possible application of the resulting graph is **\"routing with two " -"edge restrictions\"**:" +"A possible application of the resulting graph is **\"routing with two edge " +"restrictions\"**:" msgstr "" msgid "" @@ -13701,13 +13602,11 @@ msgid "This function is for **directed** graphs." msgstr "" msgid "" -"Results are undefined when a negative vertex id is used in the input " -"graph." +"Results are undefined when a negative vertex id is used in the input graph." msgstr "" msgid "" -"Results are undefined when a duplicated edge id is used in the input " -"graph." +"Results are undefined when a duplicated edge id is used in the input graph." msgstr "" msgid "Running time: TBD" @@ -13723,8 +13622,8 @@ msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. " -"The examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples of this section are based on the :doc:`sampledata` network. The " +"examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" @@ -13752,28 +13651,27 @@ msgid "second" msgstr "" 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)." +"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 "" msgid "Creating table that identifies transformed vertices" msgstr "" 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." +"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 "" 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" +"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" @@ -13803,8 +13701,8 @@ 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." +"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" @@ -13828,8 +13726,8 @@ msgid "Idenifying the restriction" msgstr "" msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where " -"the cost will be increased" +"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " +"cost will be increased" msgstr "" msgid "" @@ -13852,7 +13750,8 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "In this example, there is no additional cost for traversing a leaf vertex." +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." @@ -13874,8 +13773,8 @@ msgid "Which can be removed" msgstr "" msgid "" -"Routing can be done now using the original vertices id using " -":doc:`pgr_dijkstra`" +"Routing can be done now using the original vertices id using :doc:" +"`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -13885,8 +13784,8 @@ 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" +"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" @@ -13910,11 +13809,11 @@ msgid "https://en.wikipedia.org/wiki/Complete_graph" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "``pgr_makeConnected`` - Experimental" @@ -13924,21 +13823,22 @@ msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" 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." +"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 "" msgid "" -"It will give a minimum list of all edges which are needed in the graph to" -" make connect it." +"It will give a minimum list of all edges which are needed in the graph to " +"make connect it." msgstr "" -msgid "The algorithm does not considers geometric topology in the calculations." +msgid "" +"The algorithm does not considers geometric topology in the calculations." msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" @@ -13959,31 +13859,29 @@ msgid "https://www.boost.org/libs/graph/doc/make_connected.html" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" -" `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "pgr_maxCardinalityMatch" msgstr "" msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching " -"in a graph." +"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " +"graph." msgstr "" msgid "Deprecated signature" @@ -14004,8 +13902,8 @@ msgid "" msgstr "" msgid "" -"A maximum matching is a matching that contains the largest possible " -"number of edges." +"A maximum matching is a matching that contains the largest possible number " +"of edges." msgstr "" msgid "There may be many maximum matchings." @@ -14026,7 +13924,8 @@ msgstr "" msgid "Using all edges." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" +msgid "" +"SQL query, which should return a set of rows with the following columns:" msgstr "" msgid "" @@ -14048,7 +13947,6 @@ msgstr "" msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "" @@ -14056,28 +13954,26 @@ msgid "https://en.wikipedia.org/wiki/Ackermann_function" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__" msgstr "" msgid "``pgr_maxFlow``" msgstr "" msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from " -"the source(s) to the targets(s) using the Push Relabel algorithm." +"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " +"source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" msgid "``pgr_maxFlow`` (`Combinations`_)" @@ -14090,8 +13986,7 @@ msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." msgstr "" msgid "" -"When the maximum flow is **0** then there is no flow and **0** is " -"returned." +"When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." @@ -14129,26 +14024,26 @@ msgstr "" msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" msgstr "" -#, python-format -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "" +"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total " -"cost of the maximum flow on a graph" +"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " +"of the maximum flow on a graph" msgstr "" msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" @@ -14173,8 +14068,8 @@ msgid "where :math:`U` is the value of the max flow." msgstr "" msgid "" -":math:`U` is upper bound on number of iterations. In many real world " -"cases number of iterations is much smaller than :math:`U`." +":math:`U` is upper bound on number of iterations. In many real world cases " +"number of iterations is much smaller than :math:`U`." msgstr "" #, fuzzy @@ -14199,18 +14094,19 @@ msgstr "" msgid "RETURNS SET OF |result-flow-mincost|" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/successive_shortest_path_nonnegative_weights.html" +msgid "" +"https://www.boost.org/libs/graph/doc/" +"successive_shortest_path_nonnegative_weights.html" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) `3.3" -" `__ `3.2" -" `__ `3.1" -" `__ `3.0" -" `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" @@ -14259,27 +14155,24 @@ msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "pgr_nodeNetwork" @@ -14301,8 +14194,8 @@ msgid "Nicolas Ribot, The source code is released under the MIT-X license." msgstr "" msgid "" -"The function reads edges from a not \"noded\" network table and writes " -"the \"noded\" edges into a new table." +"The function reads edges from a not \"noded\" network table and writes the " +"\"noded\" edges into a new table." msgstr "" msgid "" @@ -14312,19 +14205,19 @@ msgid "" msgstr "" msgid "" -"What we mean by \"noded\" is that at every intersection in the road " -"network all the edges will be broken into separate road segments. There " -"are cases like an over-pass and under-pass intersection where you can not" -" traverse from the over-pass to the under-pass, but this function does " -"not have the ability to detect and accommodate those situations." +"What we mean by \"noded\" is that at every intersection in the road network " +"all the edges will be broken into separate road segments. There are cases " +"like an over-pass and under-pass intersection where you can not traverse " +"from the over-pass to the under-pass, but this function does not have the " +"ability to detect and accommodate those situations." msgstr "" msgid "" -"This function reads the ``edge_table`` table, that has a primary key " -"column ``id`` and geometry column named ``the_geom`` and intersect all " -"the segments in it against all the other segments and then creates a " -"table ``edge_table_noded``. It uses the ``tolerance`` for deciding that " -"multiple nodes within the tolerance are considered the same node." +"This function reads the ``edge_table`` table, that has a primary key column " +"``id`` and geometry column named ``the_geom`` and intersect all the segments " +"in it against all the other segments and then creates a table " +"``edge_table_noded``. It uses the ``tolerance`` for deciding that multiple " +"nodes within the tolerance are considered the same node." msgstr "" msgid "``float8`` tolerance for coincident points (in projection unit)dd" @@ -14365,13 +14258,13 @@ msgid "``integer`` Segment number of the original edge" msgstr "" msgid "" -"``integer`` Empty source column to be used with :doc:`pgr_createTopology`" -" function" +"``integer`` Empty source column to be used with :doc:`pgr_createTopology` " +"function" msgstr "" msgid "" -"``integer`` Empty target column to be used with :doc:`pgr_createTopology`" -" function" +"``integer`` Empty target column to be used with :doc:`pgr_createTopology` " +"function" msgstr "" msgid "the geom" @@ -14390,13 +14283,13 @@ msgid "Now we can analyze the network." msgstr "" msgid "" -"The analysis tell us that the network has a gap and an intersection. We " -"try to fix the problem using:" +"The analysis tell us that the network has a gap and an intersection. We try " +"to fix the problem using:" msgstr "" msgid "" -"Inspecting the generated table, we can see that edges 13,14 and 18 has " -"been segmented" +"Inspecting the generated table, we can see that edges 13,14 and 18 has been " +"segmented" msgstr "" msgid "We can create the topology of the new network" @@ -14454,8 +14347,8 @@ msgid "Edges with 2 dead ends 17,18" msgstr "" msgid "" -"Edge 17's right node is a dead end because there is no other edge sharing" -" that same node. (cnt=1)" +"Edge 17's right node is a dead end because there is no other edge sharing " +"that same node. (cnt=1)" msgstr "" msgid "Edges with 1 dead end: 1-1 ,6-1,14-2, 18-1 17-1 18-2" @@ -14480,8 +14373,8 @@ msgid "Gaps" msgstr "" msgid "" -"There is a gap between edge 17 and 14 because edge 14 is near to the " -"right node of edge 17" +"There is a gap between edge 17 and 14 because edge 14 is near to the right " +"node of edge 17" msgstr "" msgid "" @@ -14496,19 +14389,19 @@ msgid "Edges 13 and 18 were intersecting" msgstr "" msgid "" -"Edges were segmented, So, now in the interection's point there is a node " -"and the following edges share it: 13-1 13-2 18-1 18-2" +"Edges were segmented, So, now in the interection's point there is a node and " +"the following edges share it: 13-1 13-2 18-1 18-2" msgstr "" msgid "" -"Now, we are going to include the segments 13-1, 13-2 14-1, 14-2 ,18-1 and" -" 18-2 into our edge-table, copying the data for dir,cost,and reverse cost" -" with tho following steps:" +"Now, we are going to include the segments 13-1, 13-2 14-1, 14-2 ,18-1 and " +"18-2 into our edge-table, copying the data for dir,cost,and reverse cost " +"with tho following steps:" msgstr "" msgid "" -"Add a column old_id into edge_table, this column is going to keep track " -"the id of the original edge" +"Add a column old_id into edge_table, this column is going to keep track the " +"id of the original edge" msgstr "" msgid "Insert only the segmented edges, that is, the ones whose max(sub_id) >1" @@ -14518,8 +14411,8 @@ msgid "We recreate the topology:" msgstr "" msgid "" -"To get the same analysis results as the topology of edge_table_noded, we " -"do the following query:" +"To get the same analysis results as the topology of edge_table_noded, we do " +"the following query:" msgstr "" msgid "" @@ -14528,27 +14421,27 @@ msgid "" msgstr "" msgid "" -"Or we can analyze everything because, maybe edge 18 is an overpass, edge " -"14 is an under pass and there is also a street level juction, and the " -"same happens with edges 17 and 13." +"Or we can analyze everything because, maybe edge 18 is an overpass, edge 14 " +"is an under pass and there is also a street level juction, and the same " +"happens with edges 17 and 13." msgstr "" msgid "" ":doc:`topology-functions` for an overview of a topology for routing " "algorithms. :doc:`pgr_analyzeOneWay` to analyze directionality of the " "edges. :doc:`pgr_createTopology` to create a topology based on the " -"geometry. :doc:`pgr_analyzeGraph` to analyze the edges and vertices of " -"the edge table." +"geometry. :doc:`pgr_analyzeGraph` to analyze the edges and vertices of the " +"edge table." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "``pgr_pickDeliver`` - Experimental" @@ -14558,8 +14451,8 @@ msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet " -"of vehicles." +"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " +"vehicles." msgstr "" msgid "Optimization problem is NP-hard." @@ -14617,16 +14510,15 @@ msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" msgid "" -"Six different initial will be optimized - the best solution found will be" -" result" +"Six different initial will be optimized - the best solution found will be " +"result" msgstr "" msgid "Signature" msgstr "" msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, " -"[**options**])" +"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -14669,32 +14561,30 @@ msgid "[end_node_id, end_open, end_close, end_service]" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ " -"current(`3.1 " -"`__) " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ current(`3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 `__ " -"`2.1 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__" msgstr "" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "" +"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "Replaces ``pgr_gsoc_vrppdtw``" @@ -14750,8 +14640,8 @@ 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/" +"This data example **lc101** is from data published at https://www.sintef.no/" +"projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehciles in the problem all with the same characteristics." @@ -14761,8 +14651,8 @@ msgid "The original orders" msgstr "" msgid "" -"The data comes in different rows for the pickup and the delivery of the " -"same order." +"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 appropiate table:" @@ -14773,8 +14663,8 @@ 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/" +"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" @@ -14784,24 +14674,24 @@ msgid "This implementation's travel time: 854.54" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_prim``" msgstr "" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "" +"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" msgid "" -"This algorithm finds the minimum spanning forest in a possibly " -"disconnected graph using Prim's algorithm." +"This algorithm finds the minimum spanning forest in a possibly disconnected " +"graph using Prim's algorithm." msgstr "" msgid "Prim's running time: :math:`O(E * log V)`" @@ -14814,18 +14704,17 @@ msgid "Minimum spanning forest of a subgraph" msgstr "" msgid "" -"`Boost: Prim's algorithm documentation " -"`__" +"`Boost: Prim's algorithm documentation `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_primBFS``" @@ -14837,8 +14726,8 @@ msgid "" msgstr "" msgid "" -"Visits and extracts the nodes information in Breath First Search ordering" -" of the Minimum Spanning Tree created with Prims's algorithm." +"Visits and extracts the nodes information in Breath First Search ordering of " +"the Minimum Spanning Tree created with Prims's algorithm." msgstr "" #, fuzzy @@ -14850,13 +14739,12 @@ msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_primDD``" @@ -14866,9 +14754,9 @@ msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" 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." +"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 "" #, fuzzy @@ -14880,26 +14768,25 @@ msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_primDFS``" msgstr "" msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " +"Search ordering." msgstr "" msgid "" -"Visits and extracts the nodes information in Depth First Search ordering " -"of the Minimum Spanning Tree created using Prims's algorithm." +"Visits and extracts the nodes information in Depth First Search ordering of " +"the Minimum Spanning Tree created using Prims's algorithm." msgstr "" #, fuzzy @@ -14911,30 +14798,29 @@ msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_pushRelabel``" msgstr "" msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Push Relabel " -"Algorithm." +"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " +"the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" msgid "``pgr_pushRelabel`` (`Combinations`_)" @@ -14963,14 +14849,11 @@ msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__" -" (`3.4 " -"`__)" -" `3.3 " -"`__ " -"`3.2 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "pgr_sequentialVertexColoring - Proposed" @@ -14985,18 +14868,16 @@ msgid "Promoted to **proposed** signature" msgstr "" 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." +"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 "" msgid "The implementation is applicable only for **undirected** graphs." msgstr "" msgid "" -"Provides the color to be assigned to all the vertices present in the " -"graph." +"Provides the color to be assigned to all the vertices present in the graph." msgstr "" msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -15008,9 +14889,9 @@ msgstr "" 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." +"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 "" msgid "The returned rows are ordered in ascending order of the vertex value." @@ -15029,13 +14910,13 @@ msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__) `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "pgr_stoerWagner - Experimental" @@ -15052,21 +14933,19 @@ 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." +"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 "" 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." +"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 "" msgid "Sum of the weights of all edges between the two sets is mincut." @@ -15085,9 +14964,8 @@ msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" 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." +"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 "" msgid "Running time: :math:`O(V*E + V^2*log V)`." @@ -15126,37 +15004,36 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4" -" `__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__" msgstr "" msgid "``pgr_strongComponents``" msgstr "" msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed " -"graph using Tarjan's algorithm based on DFS." +"``pgr_strongComponents`` — Strongly connected components of a directed graph " +"using Tarjan's algorithm based on DFS." msgstr "" msgid "" -"A strongly connected component of a directed graph is a set of vertices " -"that are all reachable from each other." +"A strongly connected component of a directed graph is a set of vertices that " +"are all reachable from each other." msgstr "" msgid "Works for **directed** graphs." @@ -15172,23 +15049,23 @@ msgid "The strong components of the graph" msgstr "" msgid "" -"Boost: `Strong components " -"`__" +"Boost: `Strong components `__" msgstr "" msgid "" -"wikipedia: `Strongly connected component " -"`__" +"wikipedia: `Strongly connected component `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_topologicalSort`` - Experimental" @@ -15201,16 +15078,17 @@ msgstr "" 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." +"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " +"before :math:`u` in the ordering." msgstr "" msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will " -"throw warnings." +"Process is valid for directed acyclic graphs only. otherwise it will throw " +"warnings." msgstr "" -msgid "For optimization purposes, if there are more than one answer, the function" +msgid "" +"For optimization purposes, if there are more than one answer, the function" msgstr "" msgid "will return one of them." @@ -15250,24 +15128,24 @@ msgid "Graph is not a DAG" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__) " -"`3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "" +"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" msgid "" -"Transforms the input directed graph into the transitive closure of the " -"graph." +"Transforms the input directed graph into the transitive closure of the graph." msgstr "" msgid "Process is valid for directed graphs." @@ -15278,8 +15156,7 @@ msgstr "" msgid "" "Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see " -":doc:`pgr_connectedComponents`)" +"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" @@ -15322,24 +15199,22 @@ msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "pgr_trsp - Proposed" @@ -15379,8 +15254,7 @@ msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" msgstr "" msgid "" -"``pgr_trspviaedges(text,integer[],double " -"precision[],boolean,boolean,text)``" +"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" msgstr "" msgid "New prototypes:" @@ -15399,8 +15273,7 @@ msgid "" msgstr "" msgid "" -"It does no guarantee the shortest path as it might contain restriction " -"paths." +"It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -15435,8 +15308,8 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**," -" [``directed``])" +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " +"[``directed``])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -15449,11 +15322,11 @@ msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected " -"graph." +"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." +msgid "" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" msgid "" @@ -15465,27 +15338,25 @@ msgid "Using a combinations table on an undirected graph." msgstr "" msgid "" -"`Deprecated documentation " -"`_" +"`Deprecated documentation `_" msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_trspVia`` - Proposed" msgstr "" msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with " -"restrictions." +"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" msgid "New proposed function:" @@ -15495,10 +15366,9 @@ msgid "``pgr_trspVia`` (`One Via`_)" 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." +"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." @@ -15508,8 +15378,7 @@ msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" msgid "" -"For the set of sub paths of the solution that pass through a restriction " -"then" +"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." @@ -15525,13 +15394,13 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that " -"order on an directed graph." +"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that order " +"on an directed graph." msgstr "" 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." +"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 "" msgid "Simulation of how algorithm works." @@ -15541,19 +15410,19 @@ 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 " +"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 "" #, fuzzy msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." -msgstr ":doc:'pgr_dijkstra' - 最短経路を求めるためのダイクストラ・アルゴリズム。" +msgstr "" +":doc:'pgr_dijkstra' - 最短経路を求めるためのダイクストラ・アルゴリズム。" 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:" +"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``:" @@ -15563,14 +15432,14 @@ 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." +"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." +"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " +"is no ``U_turn_on_edge`` flag." msgstr "" msgid "" @@ -15583,33 +15452,32 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_trspVia_withPoints`` - Proposed" msgstr "" msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices " -"and/or points with restrictions." +"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" +"or points with restrictions." msgstr "" msgid "``pgr_trspVia_withPoints`` (`One Via`_)" 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." +"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" @@ -15627,7 +15495,8 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "For the set of paths of the solution that pass through a restriction then" +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." @@ -15681,13 +15550,12 @@ msgid "When ``true`` the results will include the points that are in the path." msgstr "" msgid "" -"When ``false`` the results will not include the points that are in the " -"path." +"When ``false`` the results will not include the points that are in the path." msgstr "" msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative " -"values, the identifier is for a Point." +"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " +"the identifier is for a Point." msgstr "" msgid "Use ``pgr_findCloseEdges`` for points on the fly" @@ -15701,25 +15569,25 @@ msgid "" "`(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)`." +msgid "" +"Point :math:`-1` corresponds to the closest edge from point `(2.9,1.8)`." msgstr "" msgid "" -"Point :math:`-2` corresponds to the next close edge from point " -"`(2.9,1.8)`." +"Point :math:`-2` corresponds to the next close edge from point `(2.9,1.8)`." msgstr "" msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to " -"Point :math:`-1` (See row where :math:`seq = 4`)." +"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 "" 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." +"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." @@ -15729,52 +15597,51 @@ msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" 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 " +"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." +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:" +"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." +"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." +"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." +"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 "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "pgr_trsp_withPoints - Proposed" msgstr "" @@ -15828,7 +15695,8 @@ msgid "" "end_vids are ignored." msgstr "" -msgid "The returned values are ordered: - start_vid ascending - end_vid ascending" +msgid "" +"The returned values are ordered: - start_vid ascending - end_vid ascending" msgstr "" msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" @@ -15859,8 +15727,8 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations " -"SQL`_, `Points SQL`_, [**options**])" +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " +"`Points SQL`_, [**options**])" msgstr "" msgid "**options:** ``[directed, driving_side, details]``" @@ -15878,8 +15746,8 @@ msgid "From point :math:`1` and vertex :math:`6` to point :math:`3`." msgstr "" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex " -":math:`1`." +"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`." msgstr "" msgid "" @@ -15888,24 +15756,24 @@ msgid "" msgstr "" msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the" -" graph of point `(2.9, 1.8)`." +"Find the routes from vertex :math:`1` to the two closest locations on the " +"graph of point `(2.9, 1.8)`." msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "" +"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, " -"1.8)`." +"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" msgid "Pass in front or visits." msgstr "" msgid "" -"Which path (if any) passes in front of point :math:`6` or vertex " -":math:`11` with right side driving topology." +"Which path (if any) passes in front of point :math:`6` or vertex :math:`11` " +"with right side driving topology." msgstr "" #, fuzzy @@ -15913,26 +15781,26 @@ msgid "Show details on undirected graph." msgstr "導かれないグラフ" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` to vertex " -":math:`1` on an undirected graph, with details." +"From point :math:`1` and vertex :math:`6` to point :math:`3` to vertex :math:" +"`1` on an undirected graph, with details." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 `__)" -" `3.3 `__ " -"`3.2 `__ " -"`3.1 `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "pgr_turnRestrictedPath - Experimental" msgstr "" msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex -Vertex routing " -"with restrictions" +"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex -Vertex routing with " +"restrictions" msgstr "" #, fuzzy @@ -15940,8 +15808,8 @@ msgid "New experimental function" msgstr "新しい **公式** 機能" msgid "" -"Using Yen's algorithm to obtain K shortest paths and analyze the paths to" -" select the paths that do not use the restrictions" +"Using Yen's algorithm to obtain K shortest paths and analyze the paths to " +"select the paths that do not use the restrictions" msgstr "" #, fuzzy @@ -15962,7 +15830,8 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgid "" +"When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -15987,27 +15856,23 @@ msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ `2.2 " +"`__ `2.1 " +"`__ " +"`2.0 `__" msgstr "" msgid "``pgr_version``" @@ -16032,24 +15897,23 @@ msgid "pgRouting Version for this documentation" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" -" `2.1 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__" msgstr "" msgid "pgr_vrpOneDepot - Experimental" @@ -16062,31 +15926,30 @@ msgid "**TBD**" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "``pgr_withPoints`` - Proposed" msgstr "" msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional" -" temporary vertices." +"``pgr_withPoints`` - Returns the shortest path in a graph with additional " +"temporary vertices." msgstr "" msgid "pgr_withPoints(Combinations)" @@ -16099,13 +15962,13 @@ msgid "**negative** when it belongs to the points_sql" msgstr "" msgid "" -"When the starting vertex and ending vertex are the same, there is no " -"path. - The agg_cost the non included values (v, v) is 0" +"When the starting vertex and ending vertex are the same, there is no path. - " +"The agg_cost the non included values (v, v) is 0" msgstr "" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path: - The agg_cost the non included values (u, v) is ∞" +"When the starting vertex and ending vertex are the different and there is no " +"path: - The agg_cost the non included values (u, v) is ∞" msgstr "" #, fuzzy @@ -16128,8 +15991,8 @@ msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**," -" [**options**])" +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " +"[**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -16168,8 +16031,8 @@ msgid "RETURNS SET OF |pid-m-m|" msgstr "" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex " -":math:`1`" +"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`" msgstr "" msgid "Two combinations" @@ -16181,18 +16044,18 @@ msgid "" msgstr "" msgid "" -"Identifier of the starting vertex of the path. Negative value is for " -"point’s identifier." +"Identifier of the starting vertex of the path. Negative value is for point’s " +"identifier." msgstr "" msgid "" -"Array of identifiers of starting vertices. Negative values are for " -"point’s identifiers." +"Array of identifiers of starting vertices. Negative values are for point’s " +"identifiers." msgstr "" msgid "" -"Identifier of the ending vertex of the path. Negative value is for " -"point’s identifier." +"Identifier of the ending vertex of the path. Negative value is for point’s " +"identifier." msgstr "" msgid "" @@ -16216,9 +16079,8 @@ msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" 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\\}`" +"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 "" msgid "Passes in front or visits with right side driving." @@ -16231,32 +16093,31 @@ msgid "Passes in front or visits with left side driving." msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "``pgr_withPointsCost`` - Proposed" msgstr "" msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only " -"the aggregate cost of the shortest path(s) found, for the combination of " -"points given." +"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " +"aggregate cost of the shortest path(s) found, for the combination of points " +"given." msgstr "" msgid "pgr_withPointsCost(Combinations)" @@ -16268,8 +16129,8 @@ msgid "" msgstr "" msgid "" -"Returns the sum of the costs of the shortest path for pair combination of" -" vertices in the modified graph." +"Returns the sum of the costs of the shortest path for pair combination of " +"vertices in the modified graph." msgstr "" msgid "" @@ -16284,8 +16145,8 @@ msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" msgid "" -"If the values returned are stored in a table, the unique index would be " -"the pair: `(start_vid, end_vid)`." +"If the values returned are stored in a table, the unique index would be the " +"pair: `(start_vid, end_vid)`." msgstr "" msgid "For **undirected** graphs, the results are **symmetric**." @@ -16301,20 +16162,20 @@ msgstr "" #, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end " -"vid**, **[options**])" +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vid**, " +"**[options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end " -"vids**, **[options**])" +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vids**, " +"**[options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end " -"vid**, **[options**])" +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end vid**, " +"**[options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -16345,14 +16206,14 @@ msgstr "" #, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -"vids**, **[options**])" +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " +"**[options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vid**, **[options**])" +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " +"**[options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy @@ -16362,8 +16223,8 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"From point :math:`15` and vertex :math:`6` to point :math:`3` and vertex" -" :math:`1`" +"From point :math:`15` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`" msgstr "" #, fuzzy @@ -16396,8 +16257,8 @@ msgid "Right side driving topology" msgstr "" msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points " -":math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " +"3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" msgid "Left side driving topology" @@ -16407,32 +16268,29 @@ msgid "Does not matter driving side driving topology" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ " -"(`3.4 " -"`__) " -"`3.3 `__" -" `3.2 " -"`__ `3.1" -" `__ " -"`3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5" -" `__ " -"`2.4 `__" -" `2.3 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__" msgstr "" msgid "``pgr_withPointsCostMatrix`` - proposed" msgstr "" msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_withPoints`." +"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_withPoints`." msgstr "" msgid "" @@ -16441,8 +16299,8 @@ msgid "" msgstr "" msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, " -"11\\}` on an **undirected** graph" +"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " +"on an **undirected** graph" msgstr "" msgid "Returning a **symmetrical** cost matrix" @@ -16455,28 +16313,27 @@ msgid "Using the default ``driving_side`` value" msgstr "" 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)`." +"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 "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "``pgr_withPointsDD`` - Proposed" @@ -16488,22 +16345,22 @@ msgid "" msgstr "" 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." +"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 "" #, fuzzy msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**," -" [**options A**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " +"[**options A**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -"**distance**, [**options B**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " +"[**options B**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options A:** ``[directed, driving_side, details]``" @@ -16517,19 +16374,19 @@ msgstr "" #, fuzzy msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**," -" [**options**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " +"[**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Right side driving topology, from point :math:`1` within a distance of " -":math:`3.3` with details." +"Right side driving topology, from point :math:`1` within a distance of :math:" +"`3.3` with details." msgstr "" #, fuzzy msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -"**distance**, [**options**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " +"[**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options:** ``[directed, driving_side, details, equicost]``" @@ -16539,8 +16396,8 @@ msgid "RETURNS SET OF |result-m-1-no-seq|" msgstr "" msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of " -":math:`3.3` with ``equicost`` on a directed graph" +"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " +"with ``equicost`` on a directed graph" msgstr "" msgid "Negative values represent a point" @@ -16566,48 +16423,47 @@ msgid ":doc:`pgr_alphaShape`" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__" msgstr "" msgid "pgr_withPointsKSP - Proposed" msgstr "" msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using " -"Dijkstra." +"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and" -" using Yen algorithm, finds the :math:`K` shortest paths." +"Modifies the graph to include the points defined in the `Points SQL`_ and " +"using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" #, fuzzy msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_ **start vid**, **end vid**," -" **K**, [**options**])" +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_ **start vid**, **end vid**, " +"**K**, [**options**])" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "**options:** ``[directed, heap_paths, driving_side, details]``" msgstr "" -msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph." +msgid "" +"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph." msgstr "" msgid "For a directed graph." @@ -16632,54 +16488,53 @@ msgid "Identifier of the destination vertex." msgstr "開始ノードの識別子" 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)`." +"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 "" msgid "Left driving side" msgstr "" msgid "" -"Get :math:`2` paths using left side driving topology, from point " -":math:`1` to point :math:`2` with details." +"Get :math:`2` paths using left side driving topology, from point :math:`1` " +"to point :math:`2` with details." msgstr "" msgid "Right driving side" msgstr "" msgid "" -"Get :math:`2` paths using right side driving topology from, point " -":math:`1` to point :math:`2` with heap paths and details." +"Get :math:`2` paths using right side driving topology from, point :math:`1` " +"to point :math:`2` with heap paths and details." msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "``pgr_withPointsVia`` - Proposed" msgstr "" msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or" -" points." +"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " +"points." msgstr "" msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" msgstr "" 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)`." +"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 @@ -16689,26 +16544,25 @@ msgid "" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that" -" order on a **directed** graph." +"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " +"order on a **directed** graph." msgstr "" 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." +"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 "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "Prim - Family of functions" @@ -16716,21 +16570,20 @@ msgstr "" 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." +"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 "" 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." +"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 "" msgid "" @@ -16739,33 +16592,30 @@ msgid "" msgstr "" msgid "" -"Boost: `Prim's algorithm " -"`__" +"Boost: `Prim's algorithm `__" msgstr "" -#, python-format msgid "" -"Wikipedia: `Prim's algorithm " -"`__" +"Wikipedia: `Prim's algorithm `__" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__" msgstr "" msgid "Proposed Functions" @@ -16796,8 +16646,8 @@ msgid ":doc:`pgr_degree` - Calculates the degree of the vertices of a graph." msgstr "" msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the " -"edge table information." +":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " +"table information." msgstr "" msgid ":doc:`pgr_withPointsVia`" @@ -16823,46 +16673,44 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" #, fuzzy msgid "Reference" msgstr "参照" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 " "`__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" -" `2.2 `__" -" `2.1 `__" -" `2.0 `__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " +"`__ " +"`2.2 `__ " +"`2.1 `__ " +"`2.0 `__" msgstr "" msgid "Release Notes" msgstr "" msgid "" -"To see the full list of changes check the list of `Git commits " -"`_ on Github." +"To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" msgid "pgRouting 3.4.0 Release Notes" @@ -16981,11 +16829,10 @@ msgstr "" msgid "pgRouting 3.3.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.2 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.2 `_" msgstr "" msgid "Revised documentation" @@ -17031,12 +16878,10 @@ msgstr "" msgid "pgRouting 3.3.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.1 `_ on Github." msgstr "" msgid "" @@ -17052,17 +16897,15 @@ msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.0 `_ on Github." msgstr "" msgid "" -"`#2057 `__: " -"trspViaEdges columns in different order" +"`#2057 `__: trspViaEdges " +"columns in different order" msgstr "" msgid "" @@ -17145,36 +16988,32 @@ msgstr "" msgid "pgRouting 3.2.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.2 `_ on Github." msgstr "" msgid "Issues" msgstr "" msgid "" -"`#2093 `__: " -"Compilation on Visual Studio" +"`#2093 `__: Compilation " +"on Visual Studio" msgstr "" msgid "" -"`#2189 `__: Build " -"error on RHEL 7" +"`#2189 `__: Build error " +"on RHEL 7" msgstr "" msgid "pgRouting 3.2.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.1 `_ on Github." msgstr "" msgid "" @@ -17196,20 +17035,18 @@ msgstr "" msgid "pgRouting 3.2.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.0 `_ on Github." msgstr "" msgid "Build" msgstr "" msgid "" -"`#1850 `__: Change " -"Boost min version to 1.56" +"`#1850 `__: Change Boost " +"min version to 1.56" msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" @@ -17290,12 +17127,10 @@ msgstr "" msgid "pgRouting 3.1.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.4 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.4 `_ on Github." msgstr "" msgid "Issues fixes" @@ -17304,12 +17139,10 @@ msgstr "" msgid "pgRouting 3.1.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.3 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.3 `_ on Github." msgstr "" msgid "" @@ -17318,8 +17151,8 @@ msgid "" msgstr "" msgid "" -"`#1849 `__: Boost " -"1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +"`#1849 `__: Boost 1.75.0 " +"geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" msgid "" @@ -17330,32 +17163,30 @@ msgstr "" msgid "pgRouting 3.1.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.2 `_ on Github." msgstr "" msgid "" -"`#1304 `__: FreeBSD " -"12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +"`#1304 `__: FreeBSD 12 " +"64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" msgid "" -"`#1356 `__: " -"tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +"`#1356 `__: tools/" +"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" msgid "" -"`#1725 `__: Server " -"crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +"`#1725 `__: Server crash " +"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" msgid "" -"`#1760 `__: TSP " -"server crash on ubuntu 20.04 #1760" +"`#1760 `__: TSP server " +"crash on ubuntu 20.04 #1760" msgstr "" msgid "" @@ -17366,18 +17197,15 @@ msgstr "" msgid "pgRouting 3.1.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.1 `_ on Github." msgstr "" msgid "" -"`#1733 `__: " -"pgr_bdAstar fails when source or target vertex does not exist in the " -"graph" +"`#1733 `__: pgr_bdAstar " +"fails when source or target vertex does not exist in the graph" msgstr "" msgid "" @@ -17403,12 +17231,10 @@ msgstr "" msgid "pgRouting 3.1.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.0 `_ on Github." msgstr "" msgid "pgr_dijkstra(combinations)" @@ -17426,23 +17252,19 @@ msgstr "" msgid "pgRouting 3.0.6 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.6 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.6 `_ on Github." msgstr "" msgid "pgRouting 3.0.5 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.5 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.5 `_ on Github." msgstr "" msgid "Backport issues fixes" @@ -17451,12 +17273,10 @@ msgstr "" msgid "pgRouting 3.0.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.4 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.4 `_ on Github." msgstr "" msgid "pgRouting 3.0.3 Release Notes" @@ -17465,12 +17285,10 @@ msgstr "" msgid "pgRouting 3.0.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.2 `_ on Github." msgstr "" msgid "" @@ -17481,28 +17299,24 @@ msgstr "" msgid "pgRouting 3.0.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.1 `_ on Github." msgstr "" msgid "" -"`#232 `__: Honor " -"client cancel requests in C /C++ code" +"`#232 `__: Honor client " +"cancel requests in C /C++ code" msgstr "" msgid "pgRouting 3.0.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.0 `_ on Github." msgstr "" msgid "Fixed Issues" @@ -17514,8 +17328,8 @@ msgid "" msgstr "" msgid "" -"`#1188 `__: Removed " -"CGAL dependency" +"`#1188 `__: Removed CGAL " +"dependency" msgstr "" msgid "" @@ -17524,18 +17338,18 @@ msgid "" msgstr "" msgid "" -"`#1004 `__: Contracts" -" when forbidden vertices do not belong to graph" +"`#1004 `__: Contracts " +"when forbidden vertices do not belong to graph" msgstr "" msgid "" -"`#1005 `__: " -"Intermideate results eliminated" +"`#1005 `__: Intermideate " +"results eliminated" msgstr "" msgid "" -"`#1006 `__: No loss " -"of information" +"`#1006 `__: No loss of " +"information" msgstr "" msgid "New functions" @@ -17862,17 +17676,15 @@ msgstr "" msgid "pgRouting 2.6.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.3 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.3 `_ on Github." msgstr "" msgid "" -"`#1219 `__ Implicit " -"cast for via_path integer to text" +"`#1219 `__ Implicit cast " +"for via_path integer to text" msgstr "" msgid "" @@ -17888,38 +17700,34 @@ msgstr "" msgid "pgRouting 2.6.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.2 `_ on Github." msgstr "" msgid "" -"`#1152 `__ Fixes " -"driving distance when vertex is not part of the graph" +"`#1152 `__ Fixes driving " +"distance when vertex is not part of the graph" msgstr "" msgid "" -"`#1098 `__ Fixes " -"windows test" +"`#1098 `__ Fixes windows " +"test" msgstr "" msgid "" -"`#1165 `__ Fixes " -"build for python3 and perl5" +"`#1165 `__ Fixes build " +"for python3 and perl5" msgstr "" msgid "pgRouting 2.6.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.1 `_ on Github." msgstr "" msgid "Fixes server crash on several functions." @@ -18012,20 +17820,18 @@ msgstr "" msgid "pgRouting 2.6.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.0 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.0 `_ on Github." msgstr "" msgid "pgr_lineGraphFull" msgstr "" msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double " -"precision,boolean,boolean[,text])" +"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean[,text])" msgstr "" msgid "without restrictions" @@ -18047,8 +17853,8 @@ msgid "Internal code" msgstr "" msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [," -" text])" +"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " +"text])" msgstr "" msgid "Removed the use of pointers" @@ -18063,12 +17869,10 @@ msgstr "" msgid "pgRouting 2.5.5 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.5 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.5 `_ on Github." msgstr "" msgid "Fixes driving distance when vertex is not part of the graph" @@ -18083,23 +17887,19 @@ msgstr "" msgid "pgRouting 2.5.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.4 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.4 `_ on Github." msgstr "" msgid "pgRouting 2.5.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.3 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.3 `_ on Github." msgstr "" msgid "" @@ -18110,12 +17910,10 @@ msgstr "" msgid "pgRouting 2.5.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.2 `_ on Github." msgstr "" msgid "Fix for postgresql 10.1: Removed a compiler condition" @@ -18124,12 +17922,10 @@ msgstr "" msgid "pgRouting 2.5.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.1 `_ on Github." msgstr "" msgid "Fixed prerequisite minimum version of: cmake" @@ -18140,9 +17936,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.5.0 " -"`_" -" on Github." +"2.5.0 `_ on Github." msgstr "" msgid "enhancement:" @@ -18214,12 +18009,10 @@ msgstr "" msgid "pgRouting 2.4.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.4.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.4.2 `_ on Github." msgstr "" msgid "Improvement" @@ -18231,18 +18024,17 @@ msgstr "" msgid "Fixed: Unexpected error column \"cname\"" msgstr "" -msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgid "" +"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "" msgid "pgRouting 2.4.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.4.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.4.1 `_ on Github." msgstr "" msgid "Fixed compiling error on macOS" @@ -18256,9 +18048,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.4.0 " -"`_" -" on Github." +"2.4.0 `_ on Github." msgstr "" msgid "New Signatures" @@ -18317,9 +18108,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.2 " -"`_" -" on Github." +"2.3.2 `_ on Github." msgstr "" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." @@ -18339,9 +18129,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.1 " -"`_" -" on Github." +"2.3.1 `_ on Github." msgstr "" msgid "Leaks on proposed max_flow functions" @@ -18358,9 +18147,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.0 " -"`_" -" on Github." +"2.3.0 `_ on Github." msgstr "" msgid "pgr_TSP" @@ -18443,9 +18231,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.4 " -"`_" -" on Github." +"2.2.4 `_ on Github." msgstr "" msgid "Bogus uses of extern \"C\"" @@ -18462,9 +18249,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.3 " -"`_" -" on Github." +"2.2.3 `_ on Github." msgstr "" msgid "Fixed compatibility issues with PostgreSQL 9.6." @@ -18475,9 +18261,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.2 " -"`_" -" on Github." +"2.2.2 `_ on Github." msgstr "" msgid "Fixed regression error on pgr_drivingDistance" @@ -18488,9 +18273,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.1 " -"`_" -" on Github." +"2.2.1 `_ on Github." msgstr "" msgid "Server crash fix on pgr_alphaShape" @@ -18504,9 +18288,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.0 " -"`_" -" on Github." +"2.2.0 `_ on Github." msgstr "" msgid "Improvements" @@ -18601,9 +18384,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.1.0 " -"`_" -" on Github." +"2.1.0 `_ on Github." msgstr "" msgid "pgr_dijkstra(one to many)" @@ -18631,13 +18413,13 @@ msgid "pgr_drivingDistance(single vertex)" msgstr "" msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes" -" and alpha parameter." +"pgr_alphaShape function now can generate better (multi)polygon with holes " +"and alpha parameter." msgstr "" msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by " -"the author.)" +"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " +"author.)" msgstr "" msgid "" @@ -18646,8 +18428,8 @@ msgid "" msgstr "" msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect " -"end to end." +"pgr_flipEdges - flip the edges in an array of geometries so the connect end " +"to end." msgstr "" msgid "" @@ -18655,13 +18437,15 @@ msgid "" "geometries." msgstr "" -msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "" +"pgr_pointsToVids - convert an array of point geometries into vertex ids." msgstr "" msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." msgstr "" -msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "" +"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgstr "" msgid "Added proposed functions from GSoc Projects:" @@ -18734,8 +18518,8 @@ msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "" msgid "" -"Instead of generating many libraries: - All functions are encapsulated in" -" one library - The library has the prefix 2-1-0" +"Instead of generating many libraries: - All functions are encapsulated in " +"one library - The library has the prefix 2-1-0" msgstr "" msgid "pgRouting 2.0.1 Release Notes" @@ -18752,15 +18536,14 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.0.0 " -"`_" -" on Github." +"2.0.0 `_ on Github." msgstr "" msgid "" "With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.x Release Notes`_ releases. The main Goals " -"for this release are:" +"compatibility to `pgRouting 1.x Release Notes`_ releases. The main Goals for " +"this release are:" msgstr "" msgid "Major restructuring of pgRouting." @@ -18794,16 +18577,15 @@ msgid "Important Changes" msgstr "" msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems" -" in a graph" +"Graph Analytics - tools for detecting and fixing connection some problems in " +"a graph" msgstr "" msgid "A collection of useful utility functions" msgstr "" msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, " -"pgr_apspWarshall)" +"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" msgstr "" msgid "" @@ -18834,14 +18616,15 @@ msgid "" msgstr "" msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x " -"that existing in the 2.0-dev code base." +"Tested and fixed most all of the outstanding bugs reported against 1.x that " +"existing in the 2.0-dev code base." msgstr "" msgid "Improved build process for Windows" msgstr "" -msgid "Automated testing on Linux and Windows platforms trigger by every commit" +msgid "" +"Automated testing on Linux and Windows platforms trigger by every commit" msgstr "" msgid "Modular library design" @@ -18878,11 +18661,10 @@ msgid "pgRouting 1.x Release Notes" msgstr "" msgid "" -"To see the issues closed by this release see the `Git closed issues for " -"1.x " -"`_" -" on Github. The following release notes have been copied from the " -"previous ``RELEASE_NOTES`` file and are kept as a reference." +"To see the issues closed by this release see the `Git closed issues for 1.x " +"`_ on Github. The following release notes have been copied " +"from the previous ``RELEASE_NOTES`` file and are kept as a reference." msgstr "" msgid "Changes for release 1.05" @@ -18937,8 +18719,7 @@ msgid "PostgreSQL 8.2 support" msgstr "" msgid "" -"Shortest path functions return empty result if they could not find any " -"path" +"Shortest path functions return empty result if they could not find any path" msgstr "" msgid "Changes for release 0.9.8" @@ -18954,51 +18735,45 @@ msgid "routing_postgis.sql was modified to use dijkstra in TSP search" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ `2.2 " -"`__ `2.1 " -"`__ `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "Function Families" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 " +"`__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 " "`__ " -"`2.0 " -"`__" +"`2.0 `__" msgstr "" msgid "Sample Data" @@ -19006,8 +18781,8 @@ msgstr "サンプルデータ" msgid "" "The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the mayority " -"of the examples queries, follow the instructions bellow." +"sample network that resembles a city. To be able to execute the mayority of " +"the examples queries, follow the instructions bellow." msgstr "" msgid "Main graph" @@ -19020,25 +18795,23 @@ 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, cpacity values, category values and some locations that are not " -"in the graph." +"Information known at this point is the geometry of the edges, cost values, " +"cpacity 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." +"The process to have working topology starts by inserting the edges. After " +"that everything else is calculated." msgstr "" msgid "Edges" 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 oposite direction. Therfore some information has the ``reverse_`` " -"prefix which corresponds to the segment on the oposite direction of the " -"geometry." +"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 " +"oposite direction. Therfore some information has the ``reverse_`` prefix " +"which corresponds to the segment on the oposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -19088,19 +18861,20 @@ msgid "Starting on PostgreSQL 12::" msgstr "" msgid "" -"Optionally indexes on different columns can be created. The recomendation" -" is to have" +"Optionally indexes on different columns can be created. The recomendation is " +"to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "" +"``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" msgid "" -"``geom`` indexed to speed up gemetry processes that might be needed in " -"the front end." +"``geom`` indexed to speed up gemetry processes that might be needed in the " +"front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -19113,17 +18887,17 @@ 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." +"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`:" +"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 "" @@ -19163,13 +18937,13 @@ msgid "Support tables" msgstr "" msgid "" -"Many functions can be used with a combinations of ``(source, target)`` " -"pairs when wanting a route from ``source`` to ``target``." +"Many functions can be used with a combinations of ``(source, target)`` pairs " +"when wanting a route from ``source`` to ``target``." msgstr "" msgid "" -"For convinence of this documentations, some combinations will be stored " -"on a table:" +"For convinence of this documentations, some combinations will be stored on a " +"table:" msgstr "" msgid "Inserting the data:" @@ -19197,8 +18971,8 @@ msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "" msgid "" -"When working with city networks, this is recommended for point of view of" -" vehicles." +"When working with city networks, this is recommended for point of view of " +"vehicles." msgstr "" msgid "Directed, with cost and reverse_cost" @@ -19208,8 +18982,8 @@ msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "" msgid "" -"When working with city networks, this is recommended for point of view of" -" pedestrians." +"When working with city networks, this is recommended for point of view of " +"pedestrians." msgstr "" msgid "Undirected, with cost and reverse cost" @@ -19231,13 +19005,13 @@ msgid "Pick & Deliver Data" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "Spanning Tree - Category" @@ -19254,67 +19028,58 @@ msgid "" msgstr "" msgid "" -"**Supported versions:** `Latest " -"`__ (`3.4 " -"`__) `3.3 " -"`__ `3.2 " -"`__ `3.1 " -"`__ `3.0 " -"`__" +"**Supported versions:** `Latest `__ (`3.4 `__) " +"`3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 " -"`__ `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 " +"`__ `2.3 `__ `2.2 `__ `2.1 " "`__ " -"`2.0 " -"`__" +"`2.0 `__" msgstr "" msgid "" "pgRouting community support is available through the `pgRouting website " -"`_, `documentation " -"`_, tutorials, mailing lists and others. If " -"you’re looking for :ref:`commercial support `, find " -"below a list of companies providing pgRouting development and consulting " -"services." +"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " +"for :ref:`commercial support `, find below a list of " +"companies providing pgRouting development and consulting services." msgstr "" msgid "Reporting Problems" msgstr "" msgid "" -"Bugs are reported and managed in an `issue tracker " -"`_. Please follow these " -"steps:" +"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" 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." +"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 "" msgid "" -"If your problem is unreported, create a `new issue " -"`__ for it." +"If your problem is unreported, create a `new issue `__ for it." msgstr "" msgid "" -"In your report include explicit instructions to replicate your issue. The" -" best tickets include the exact SQL necessary to replicate a problem." +"In your report include explicit instructions to replicate your issue. The " +"best tickets include the exact SQL necessary to replicate a problem." msgstr "" msgid "" -"If you can test older versions of PostGIS for your problem, please do. On" -" your ticket, note the earliest version the problem appears." +"If you can test older versions of PostGIS for your problem, please do. On " +"your ticket, note the earliest version the problem appears." msgstr "" msgid "" @@ -19323,8 +19088,8 @@ msgid "" msgstr "" msgid "" -"It is recommended to use the following wrapper on the problem to pin " -"point the step that is causing the problem." +"It is recommended to use the following wrapper on the problem to pin point " +"the step that is causing the problem." msgstr "" msgid "Mailing List and GIS StackExchange" @@ -19336,27 +19101,25 @@ msgid "" msgstr "" msgid "" -"User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-" -"users" +"User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" msgstr "" msgid "" -"Developer mailing list: https://lists.osgeo.org/mailman/listinfo" -"/pgrouting-dev" +"Developer mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-" +"dev" msgstr "" msgid "" -"For general questions and topics about how to use pgRouting, please write" -" to the user mailing list." +"For general questions and topics about how to use pgRouting, please write to " +"the user mailing list." msgstr "" msgid "" -"You can also ask at `GIS StackExchange `_" -" 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 " -"`_." +"You can also ask at `GIS StackExchange `_ " +"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 `_." msgstr "" msgid "Commercial Support" @@ -19364,8 +19127,8 @@ msgstr "" 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:" +"services, consider contacting any of the following organizations, which have " +"significantly contributed to the development of pgRouting:" msgstr "" msgid "**Company**" @@ -19399,47 +19162,44 @@ msgid "https://www.osgeo.org/service-providers/netlab/" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__ " -"`2.2 " -"`__ " -"`2.1 " -"`__" -" `2.0 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 `__ `2.0 `__" msgstr "" msgid "Topology - Family of Functions" msgstr "" msgid "" -"The pgRouting's topology of a network represented with a graph in form of" -" two tables: and edge table and a vertex table." +"The pgRouting's topology of a network represented with a graph in form of " +"two tables: and edge table and a vertex table." msgstr "" msgid "" "Attributes associated to the tables help to indicate if the graph is " "directed or undirected, if an edge is one way on a directed graph, and " -"depending on the final application needs, suitable topology(s) need to be" -" created." +"depending on the final application needs, suitable topology(s) need to be " +"created." msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to " -"analyze the topology." +"pgRouting suplies some functions to create a routing topology and to analyze " +"the topology." msgstr "" msgid "Additional functions to create a graph:" @@ -19449,34 +19209,33 @@ msgid "Additional functions to analyze a graph:" msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__) `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__" +"**Unsupported versions:** `2.6 `__" msgstr "" msgid "Transformation - Family of functions (Experimental)" msgstr "" 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')`." +"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 "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__" msgstr "" msgid "Traversal - Family of functions" @@ -19487,14 +19246,14 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "Via - Category" msgstr "" @@ -19503,13 +19262,13 @@ msgid "This category intends to solve the general problem:" msgstr "" 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" +"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 "" msgid "" -"In other words, find a continuos route that visits all the vertices in " -"the order given." +"In other words, find a continuos route that visits all the vertices in the " +"order given." msgstr "" msgid "path" @@ -19544,14 +19303,14 @@ msgstr "" #, fuzzy msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__)" +"**Supported versions:** `Latest `__ (`3.4 `__)" msgstr "" -"**サポートされないバージョン:** `2.5 " -"`__ `2.4 " -"`__ `2.3 " -"`__" +"**サポートされないバージョン:** `2.5 `__ `2.4 `__ `2.3 `__" msgid "withPoints - Category" msgstr "" @@ -19560,8 +19319,8 @@ msgid "When points are added to the graph." msgstr "" msgid "" -"The **with points** category modifies the graph on the fly by adding " -"points on edges as required by the `Points SQL`_ query." +"The **with points** category modifies the graph on the fly by adding points " +"on edges as required by the `Points SQL`_ query." msgstr "" msgid "" @@ -19570,16 +19329,16 @@ msgid "" msgstr "" msgid "" -"This category of functions was thought for routing vehicles, but might as" -" well work for some other application not involving vehicles." +"This category of functions was thought for routing vehicles, but might as " +"well work for some other application not involving vehicles." msgstr "" 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." +"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 "" msgid "" @@ -19601,7 +19360,8 @@ msgstr "導かれないグラフ" msgid "Arriving at the point:" msgstr "" -msgid "Compulsory arrival on the side of the segment where the point is located." +msgid "" +"Compulsory arrival on the side of the segment where the point is located." msgstr "" msgid "On either side of the segment." @@ -19620,11 +19380,12 @@ msgid "Some points are:" msgstr "" msgid "" -"**Permanent**: for example the set of points of clients stored in a table" -" in the data base." +"**Permanent**: for example the set of points of clients stored in a table in " +"the data base." msgstr "" -msgid "The graph has been modified to permanently have those points as vertices." +msgid "" +"The graph has been modified to permanently have those points as vertices." msgstr "" msgid "There is a table on the database that describes the points" @@ -19637,8 +19398,8 @@ msgid "The numbering of the points are handled with negative sign." msgstr "" msgid "" -"This sign change is to avoid confusion when there is a vertex with the " -"same identifier as the point identifier." +"This sign change is to avoid confusion when there is a vertex with the same " +"identifier as the point identifier." msgstr "" msgid "Original point identifiers are to be positive." @@ -19660,9 +19421,9 @@ msgid "About points" msgstr "" msgid "" -"For this section the following city (see :doc:`sampledata`) some " -"interesing points such as restaurant, supermarket, post office, etc. will" -" be used as example." +"For this section the following city (see :doc:`sampledata`) some interesing " +"points such as restaurant, supermarket, post office, etc. will be used as " +"example." msgstr "" msgid "The graph is **directed**" @@ -19689,8 +19450,8 @@ msgid "On both sides for point **6**." msgstr "" msgid "" -"The representation on the data base follows the `Points SQL`_ " -"description, and for this example:" +"The representation on the data base follows the `Points SQL`_ description, " +"and for this example:" msgstr "" msgid "Driving side" @@ -19706,8 +19467,8 @@ msgid "The temporary vertices are added according to the driving side," msgstr "" msgid "" -"visually showing the differences on how depending on the driving side the" -" data is interpreted." +"visually showing the differences on how depending on the driving side the " +"data is interpreted." msgstr "" msgid "Point **1** located on edge ``(6, 5)``" @@ -19759,8 +19520,8 @@ msgid "Creating temporary vertices" msgstr "" msgid "" -"This section will demonstrate how a temporary vertex is created " -"internally on the graph." +"This section will demonstrate how a temporary vertex is created internally " +"on the graph." msgstr "" msgid "Problem" @@ -19788,8 +19549,8 @@ msgid "Create two new edges:" msgstr "" msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1" -" * 0.4`)" +"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " +"0.4`)" msgstr "" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" @@ -19798,7 +19559,8 @@ 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." +msgid "" +"If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" @@ -19814,21 +19576,21 @@ msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "" msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of" -" the original:" +"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." +"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." +"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " +"graph." msgstr "" msgid "When driving side does not matter" @@ -19855,41 +19617,40 @@ 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." +"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." +"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " +"graph." msgstr "" msgid "" -"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" +"**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" msgstr "" msgid "" -"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ `2.3 " -"`__" -" `2.2 " -"`__" +"**Unsupported versions:** `2.6 `__ `2.5 `__ `2.4 `__ " +"`2.3 `__ `2.2 `__" msgstr "" msgid "withPoints - Family of functions" msgstr "" 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 " +"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 "" @@ -19916,4 +19677,3 @@ msgstr "" msgid "Advanced Documentation" msgstr "" -