diff --git a/locale/es/LC_MESSAGES/index.po b/locale/es/LC_MESSAGES/index.po index 1f7a4e7c0e6..1785b2de1ee 100644 --- a/locale/es/LC_MESSAGES/index.po +++ b/locale/es/LC_MESSAGES/index.po @@ -19,560 +19,3 @@ msgstr "" "Plural-Forms: nplurals=2; plural=n != 1;\n" "X-Generator: Weblate 4.14.1\n" "Generated-By: Babel 2.10.3\n" - -#: ../../build/doc/index.rst:30 -msgid "Table of Contents" -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." -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 "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" - -#: ../../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 "" -"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 "General" - -#: ../../build/doc/index.rst:60 -msgid ":doc:`sampledata` that is used in the examples of this manual." -msgstr ":doc:`sampledata` es usado en los ejemplos de este manual." - -#: ../../build/doc/index.rst:68 -msgid "Pgrouting Concepts" -msgstr "Conceptos de pgRouting" - -#: ../../build/doc/index.rst:77 -msgid ":doc:`routingFunctions`" -msgstr ":doc:`routingFunctions`" - -#: ../../build/doc/routingFunctions.rst:4 -msgid ":doc:`allpairs-family`" -msgstr ":doc:`allpairs-family`" - -#: ../../build/doc/allpairs-family.rst:3 -msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm." -msgstr ":doc:`pgr_floydWarshall` - Algoritmo de Floyd-Warshall." - -#: ../../build/doc/allpairs-family.rst:4 -msgid ":doc:`pgr_johnson` - Johnson's algorithm" -msgstr ":doc:`pgr_johnson` - Algoritmo de Johnson" - -#: ../../build/doc/routingFunctions.rst:10 -msgid ":doc:`aStar-family`" -msgstr ":doc:`aStar-family`" - -#: ../../build/doc/aStar-family.rst:3 -msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." -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 ":doc:`bdAstar-family`" - -#: ../../build/doc/bdAstar-family.rst:3 -msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." -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." -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 ":doc:`bdDijkstra-family`" - -#: ../../build/doc/bdDijkstra-family.rst:3 -msgid "" -":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" -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 ":doc:`components-family`" - -#: ../../build/doc/components-family.rst:3 -msgid "" -":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." -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." -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." -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 ":doc:`pgr_bridges` - Puentes de un grafo no dirigido." - -#: ../../build/doc/routingFunctions.rst:35 -msgid ":doc:`contraction-family`" -msgstr ":doc:`contraction-family`" - -#: ../../build/doc/contraction-family.rst:3 -msgid ":doc:`pgr_contraction`" -msgstr ":doc:`pgr_contraction`" - -#: ../../build/doc/routingFunctions.rst:41 -msgid ":doc:`dijkstra-family`" -msgstr ":doc:`dijkstra-family`" - -#: ../../build/doc/dijkstra-family.rst:3 -msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -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." -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." -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 ":doc:`flow-family`" - -#: ../../build/doc/flow-family.rst:3 -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel" -" algorithm." -msgstr "" -":doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo " -"empuja y reetiquetado." - -#: ../../build/doc/flow-family.rst:5 -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow " -"on edges." -msgstr "" -":doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles " -"del flujo en aristas." - -#: ../../build/doc/flow-family.rst:7 -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow " -"on edges." -msgstr "" -":doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo " -"del flujo en aristas." - -#: ../../build/doc/flow-family.rst:9 -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow " -"on edges." -msgstr "" -":doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del" -" flujo en aristas." - -#: ../../build/doc/flow-family.rst:11 -msgid "Applications" -msgstr "Aplicaciones" - -#: ../../build/doc/flow-family.rst:13 -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two" -" groups of vertices." -msgstr "" -":doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre " -"dos grupos de vértices." - -#: ../../build/doc/flow-family.rst:15 -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality " -"matching in a graph." -msgstr "" -":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de " -"coincidencia dentro de un grafo." - -#: ../../build/doc/routingFunctions.rst:53 -#: ../../build/doc/spanningTree-family.rst:3 -msgid ":doc:`kruskal-family`" -msgstr ":doc:`kruskal-family`" - -#: ../../build/doc/kruskal-family.rst:3 -msgid ":doc:`pgr_kruskal`" -msgstr ":doc:`pgr_kruskal`" - -#: ../../build/doc/BFS-category.rst:3 ../../build/doc/kruskal-family.rst:4 -msgid ":doc:`pgr_kruskalBFS`" -msgstr ":doc:`pgr_kruskalBFS`" - -#: ../../build/doc/kruskal-family.rst:5 -msgid ":doc:`pgr_kruskalDD`" -msgstr ":doc:`pgr_kruskalDD`" - -#: ../../build/doc/DFS-category.rst:3 ../../build/doc/kruskal-family.rst:6 -msgid ":doc:`pgr_kruskalDFS`" -msgstr ":doc:`pgr_kruskalDFS`" - -#: ../../build/doc/routingFunctions.rst:59 -#: ../../build/doc/spanningTree-family.rst:4 -msgid ":doc:`prim-family`" -msgstr ":doc:`prim-family`" - -#: ../../build/doc/prim-family.rst:3 -msgid ":doc:`pgr_prim`" -msgstr ":doc:`pgr_prim`" - -#: ../../build/doc/BFS-category.rst:4 ../../build/doc/prim-family.rst:4 -msgid ":doc:`pgr_primBFS`" -msgstr ":doc:`pgr_primBFS`" - -#: ../../build/doc/prim-family.rst:5 -msgid ":doc:`pgr_primDD`" -msgstr ":doc:`pgr_primDD`" - -#: ../../build/doc/DFS-category.rst:4 ../../build/doc/prim-family.rst:6 -msgid ":doc:`pgr_primDFS`" -msgstr ":doc:`pgr_primDFS`" - -#: ../../build/doc/routingFunctions.rst:65 -msgid ":doc:`reference`" -msgstr ":doc:`reference`" - -#: ../../build/doc/reference.rst:3 -msgid ":doc:`pgr_version`" -msgstr ":doc:`pgr_version`" - -#: ../../build/doc/reference.rst:4 -msgid ":doc:`pgr_full_version`" -msgstr ":doc:`pgr_full_version`" - -#: ../../build/doc/routingFunctions.rst:71 -msgid ":doc:`topology-functions`" -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." -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." -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 ":doc:`pgr_nodeNetwork` - para crear nodos en una tabla de aristas." - -#: ../../build/doc/routingFunctions.rst:77 -msgid ":doc:`TSP-family`" -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 ":doc:`pgr_TSPeuclidean` - Cuando la información son coordenadas." - -#: ../../build/doc/routingFunctions.rst:83 -msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" -msgstr ":doc:`pgr_trsp` - Camino más corto con restricción de giros (TRSP)" - -#: ../../build/doc/routingFunctions.rst:87 -msgid "Functions by categories" -msgstr "Funciones por categorías" - -#: ../../build/doc/routingFunctions.rst:89 -msgid ":doc:`cost-category`" -msgstr ":doc:`cost-category`" - -#: ../../build/doc/cost-category.rst:3 -msgid ":doc:`pgr_aStarCost`" -msgstr ":doc:`pgr_aStarCost`" - -#: ../../build/doc/cost-category.rst:4 -msgid ":doc:`pgr_bdAstarCost`" -msgstr ":doc:`pgr_bdAstarCost`" - -#: ../../build/doc/cost-category.rst:5 -msgid ":doc:`pgr_dijkstraCost`" -msgstr ":doc:`pgr_dijkstraCost`" - -#: ../../build/doc/cost-category.rst:6 -msgid ":doc:`pgr_bdDijkstraCost`" -msgstr ":doc:`pgr_bdDijkstraCost`" - -#: ../../build/doc/cost-category.rst:7 -msgid ":doc:`pgr_dijkstraNearCost`" -msgstr ":doc:`pgr_dijkstraNearCost`" - -#: ../../build/doc/routingFunctions.rst:95 -msgid ":doc:`costMatrix-category`" -msgstr ":doc:`costMatrix-category`" - -#: ../../build/doc/costMatrix-category.rst:3 -msgid ":doc:`pgr_aStarCostMatrix`" -msgstr ":doc:`pgr_aStarCostMatrix`" - -#: ../../build/doc/costMatrix-category.rst:4 -msgid ":doc:`pgr_bdAstarCostMatrix`" -msgstr ":doc:`pgr_bdAstarCostMatrix`" - -#: ../../build/doc/costMatrix-category.rst:5 -#: ../../build/doc/costMatrix-category.rst:7 -msgid ":doc:`pgr_bdDijkstraCostMatrix`" -msgstr ":doc:`pgr_bdDijkstraCostMatrix`" - -#: ../../build/doc/costMatrix-category.rst:6 -msgid ":doc:`pgr_dijkstraCostMatrix`" -msgstr ":doc:`pgr_dijkstraCostMatrix`" - -#: ../../build/doc/routingFunctions.rst:102 -msgid ":doc:`drivingDistance-category`" -msgstr ":doc:`drivingDistance-category`" - -#: ../../build/doc/drivingDistance-category.rst:3 -msgid "" -":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 ":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 "Post procesamiento" - -#: ../../build/doc/drivingDistance-category.rst:8 -msgid ":doc:`pgr_alphaShape` - Alpha shape computation" -msgstr ":doc:`pgr_alphaShape` - Cálcular la forma Alpha" - -#: ../../build/doc/routingFunctions.rst:108 -msgid ":doc:`KSP-category`" -msgstr ":doc:`KSP-category`" - -#: ../../build/doc/KSP-category.rst:3 -msgid ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra" -msgstr ":doc:`pgr_KSP` - Algoritmo de Yen basado en pgr_dijkstra" - -#: ../../build/doc/routingFunctions.rst:114 -msgid ":doc:`spanningTree-family`" -msgstr ":doc:`spanningTree-family`" - -#: ../../build/doc/routingFunctions.rst:120 -msgid ":doc:`BFS-category`" -msgstr ":doc:`BFS-category`" - -#: ../../build/doc/routingFunctions.rst:126 -msgid ":doc:`DFS-category`" -msgstr ":doc:`DFS-category`" - -#: ../../build/doc/index.rst:91 -msgid "Available Functions but not official pgRouting functions" -msgstr "Funciones disponibles pero no oficiales de pgRouting" - -#: ../../build/doc/index.rst:93 -msgid ":doc:`proposed`" -msgstr ":doc:`proposed`" - -#: ../../build/doc/index.rst:94 -msgid ":doc:`experimental`" -msgstr ":doc:`experimental`" - -#: ../../build/doc/index.rst:105 -msgid ":doc:`release_notes`" -msgstr ":doc:`release_notes`" - -#: ../../build/doc/index.rst:119 -msgid "Indices and tables" -msgstr "Índices y tablas" - -#: ../../build/doc/index.rst:120 -msgid ":ref:`genindex`" -msgstr ":ref:`genindex`" - -#: ../../build/doc/index.rst:121 -msgid ":ref:`search`" -msgstr ":ref:`search`" - -msgid "**start vid**" -msgstr "**salida**" - -msgid "**start vids**" -msgstr "**salidas**" - -msgid "**end vid**" -msgstr "**destino**" - -msgid "**end vids**" -msgstr "**destinos**" - -msgid "**via vertices**" -msgstr "**vértices**" - -msgid "**Root vid**" -msgstr "**Raíz**" - -msgid "`Edges SQL`_" -msgstr "`SQL de aristas`_" - -msgid "**distance**" -msgstr "**distancia**" - -msgid "RETURNS SETOF" -msgstr "REGRESA CONJUNTO DE" - -msgid "edge" -msgstr "arista" - -msgid "RETURNS SET OF" -msgstr "REGRESA CONJUNTO DE" - -msgid "path" -msgstr "camino" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index a518ce74faf..c3c916f1a35 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -4,15 +4,15 @@ # FIRST AUTHOR , 2022. # Pedro Jose Rios Vergara , 2022. # Celia Virginia Vergara Castillo , 2022. -# Celia Virginia Vergara Castillo , 2023, 2024. -# DeepL , 2024. +# Celia Virginia Vergara Castillo , 2023, 2024, 2025. +# DeepL , 2024, 2025. msgid "" msgstr "" "Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-10-17 00:50+0000\n" -"PO-Revision-Date: 2024-10-10 19:43+0000\n" -"Last-Translator: DeepL \n" +"POT-Creation-Date: 2025-04-08 20:49+0000\n" +"PO-Revision-Date: 2025-04-09 00:16+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Spanish \n" "Language: es\n" @@ -313,9 +313,6 @@ msgstr ":doc:`pgr_kruskalDFS`" msgid ":doc:`pgr_primDFS`" msgstr ":doc:`pgr_primDFS`" -msgid "Proposed" -msgstr "Propuesto" - msgid "Proposed functions for next mayor release." msgstr "Funciones propuestas para la próxima versión mayor." @@ -387,9 +384,6 @@ msgstr "" "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" - msgid "Possible server crash" msgstr "Posible bloqueo del servidor" @@ -434,7 +428,7 @@ msgstr "" "Puede ser necesario que los ejemplos de documentación se generen " "automáticamente." -msgid "Might need a lot of feedback from the comunity." +msgid "Might need a lot of feedback from the community." msgstr "Puede ser necesaria retroalimentación por parte de la comunidad." msgid "Might depend on a proposed function of pgRouting" @@ -726,11 +720,11 @@ msgid "References" msgstr "Referencias" msgid "" -"`Boost's metric appro's metric approximation `__" +"`Boost: metric TSP approx `__" msgstr "" -"`Algoritmo Métrico de la Librería Boost `__" +"`Boost: aproximación métrica de TSP `__" msgid "`University of Waterloo TSP `__" msgstr "`Universided de Waterloo TSP `__" @@ -742,8 +736,8 @@ msgstr "" "`Wikipedia: Problema del viajante `__" -msgid "Vehicle Routing Functions - Category (Experimental)" -msgstr "Funciones de Ruteo de Vehículos - Categoría (Experimental)" +msgid "Vehicle Routing Functions - Category" +msgstr "Funciones de Ruteo de Vehículos - Categoría" msgid "Pickup and delivery problem" msgstr "Problema de recogida y entrega" @@ -1788,8 +1782,8 @@ msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem" -msgid "The queries use the :doc:`sampledata` network." -msgstr "Las consultas utilizan la red :doc:`sampledata` ." +msgid ":doc:`sampledata`" +msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - Familia de Funciones" @@ -1969,8 +1963,11 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" -msgstr "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search `__" +msgstr "" +"`Boost: Búsqueda A* `__" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2806,15 +2803,12 @@ msgstr "" "Para grandes gráficos donde hay un camino entre el vértice inicial y el " "vértice final:" -msgid "It is expected to terminate faster than pgr_astar" -msgstr "Se espera que termine más rápido que pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" +msgstr "Se espera que termine más rápido que pgr_aStar" msgid ":doc:`aStar-family`" msgstr ":doc:`aStar-family`" -msgid "Previous versions of this page" -msgstr "Versiones anteriores de esta página" - msgid "Bidirectional Dijkstra - Family of functions" msgstr "Bidirectional Dijkstra - Familia de funciones" @@ -2984,38 +2978,9 @@ msgid "Identifier of the color of the edge." msgstr "Identificador del color del segmento." msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" -"`Boost: Documentacion de Algoritmo de Coloración Secuencial de Vertices " -"`__" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" -"`Wikipedia: Coloración de grafos `__" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: es bipartido `__" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" -"`Wikipedia: grafo bipartito `__" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" +"`Boost: `__" msgstr "" -"`Boost: Algoritmo de Coloración de Segmentos `__" +"`Boost: `__" msgid "Components - Family of functions" msgstr "Componentes - Familia de funciones" @@ -3059,6 +3024,9 @@ msgstr "Contraction - Familia de funciones" msgid ":doc:`pgr_contraction`" msgstr ":doc:`pgr_contraction`" +msgid ":doc:`pgr_contractionDeadEnd`" +msgstr ":doc:`pgr_contractionDeadEnd`" + msgid "" "In large graphs, like the road graphs, or electric networks, graph " "contraction can be used to speed up some graph algorithms. Contraction " @@ -3099,2003 +3067,1802 @@ 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 "Contracción de los nodos de hoja del grafo." - -msgid "Dead end" -msgstr "Sin salida" - -msgid "A node is considered a **dead end** node when" -msgstr "Un nodo se considera **sin salida** cuando" - -msgid "On undirected graphs:" -msgstr "En grafos no dirigidos:" - -msgid "The number of adjacent vertices is 1." -msgstr "El número de vértices adyacentes es 1." - -msgid "On directed graphs:" -msgstr "En grafos dirigidos:" - -msgid "There are no outgoing edges and has at least one incoming edge." -msgstr "No hay aristas salientes y tiene al menos una arista entrante." - -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." +"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" +"lecture16.pdf" msgstr "" -"Cuando las condiciones son verdaderas, se puede hacer la `Operación: " -"Contracción de callejón sin salida`_." +"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" +"lecture16.pdf" -msgid "Dead end vertex on undirected graph" -msgstr "Vértice sin salida en un grafo sin dirigir" +msgid "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" +msgstr "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" -msgid "The green nodes are `dead end`_ nodes" -msgstr "Los nodos verdes son nodos `dead end`_" +msgid "Cost - Category" +msgstr "Costo - Categoría" -msgid "The blue nodes have an unlimited number of edges." -msgstr "Los nodos azules tienen un número ilimitado de aristas." +msgid ":doc:`pgr_aStarCost`" +msgstr ":doc:`pgr_aStarCost`" -msgid "Node" -msgstr "Nodo" +msgid ":doc:`pgr_bdAstarCost`" +msgstr ":doc:`pgr_bdAstarCost`" -msgid "Adjecent nodes" -msgstr "Nodos adyacentes" +msgid ":doc:`pgr_dijkstraCost`" +msgstr ":doc:`pgr_dijkstraCost`" -msgid "Number of adjacent nodes" -msgstr "Número de vértices adyacentes" +msgid ":doc:`pgr_bdDijkstraCost`" +msgstr ":doc:`pgr_bdDijkstraCost`" -msgid ":math:`a`" -msgstr ":math:`a`" +msgid ":doc:`pgr_dijkstraNearCost`" +msgstr ":doc:`pgr_dijkstraNearCost`" -msgid ":math:`\\{u\\}`" -msgstr ":math:`\\{u\\}`" +msgid ":doc:`pgr_withPointsCost`" +msgstr ":doc:`pgr_withPointsCost`" -msgid ":math:`b`" -msgstr ":math:`b`" +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 ":math:`\\{v\\}`" -msgstr ":math:`\\{v\\}`" +msgid "" +"Returns the sum of the costs of the shortest path of each pair combination " +"of nodes requested." +msgstr "" +"Devuelve la suma de los costos de la ruta más corta para cada par de " +"combinación de nodos requeridos." -msgid "Dead end vertex on directed graph" -msgstr "Vértice sin salida en un grafo dirigido" +msgid "" +"Let be the case the values returned are stored in a table, so the unique " +"index would be the pair: ``(start_vid, end_vid)``." +msgstr "" +"Sea el caso que los valores devueltos se almacenen en una tabla, el índice " +"único sería el par: `(start_vid, end_vid)`." msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." +"Depending on the function and its parameters, the results can be symmetric." msgstr "" -"Los nodos azules tienen un número ilimitado de aristas entrantes y/o " -"salientes." +"Dependiendo de la función y sus parámetros, los resultados pueden ser " +"simétricos." + +msgid "" +"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgstr "" +"El **costo agregado** de :math:`(u, v)` es el mismo que para :math:`(v, u)`." + +msgid "" +"Any duplicated value in the start or end vertex identifiers are ignored." +msgstr "" +"Se omite cualquier valor duplicado en los identificadores de vertices de " +"inicio y destino." -msgid "Number of incoming edges" -msgstr "Número de aristas entrantes" +msgid "The returned values are ordered:" +msgstr "Los valores regresados se ordenan:" -msgid "Number of outgoing edges" -msgstr "Número de aristas salientes" +msgid "``start_vid`` ascending" +msgstr "``start_vid`` ascendente" -msgid ":math:`c`" -msgstr ":math:`c`" +msgid "``end_vid`` ascending" +msgstr "``end_vid`` ascendente" -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`\\{v, w\\}`" +msgid "Cost Matrix - Category" +msgstr "Cost Matrix - Categoría" -msgid "2" -msgstr "2" +msgid ":doc:`pgr_aStarCostMatrix`" +msgstr ":doc:`pgr_aStarCostMatrix`" -msgid ":math:`d`" -msgstr ":math:`d`" +msgid ":doc:`pgr_dijkstraCostMatrix`" +msgstr ":doc:`pgr_dijkstraCostMatrix`" -msgid ":math:`\\{x\\}`" -msgstr ":math:`\\{x\\}`" +msgid ":doc:`pgr_bdAstarCostMatrix`" +msgstr ":doc:`pgr_bdAstarCostMatrix`" -msgid ":math:`e`" -msgstr ":math:`e`" +msgid ":doc:`pgr_bdDijkstraCostMatrix`" +msgstr ":doc:`pgr_bdDijkstraCostMatrix`" -msgid ":math:`\\{x, y\\}`" -msgstr ":math:`\\{x, y\\}`" +msgid ":doc:`pgr_withPointsCostMatrix`" +msgstr ":doc:`pgr_withPointsCostMatrix`" 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." +":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " +"v)` must value :math:`\\infty`." 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." +":doc:`TSP-family` necesita como entrada una matriz de costos simétrica y sin " +"borde `(u, v)`, debe valorar :math:`\\infty`." msgid "" -"On the following table, nodes :math:`\\{c, e\\}` because the even that the " -"number of adjacent vertices is not 1 for" +"This collection of functions will return a cost matrix in form of a table." msgstr "" -"En al siguiente tabla, nodos :math:`\\{c, e\\}` por que el par del numero de " -"vértices adyacentes no es 1 para" +"Esta colección de funciones devolverá una matriz de costes en forma de tabla." -msgid "Operation: Dead End Contraction" -msgstr "Operación: Contracción sin salida" +msgid "Can be used as input to :doc:`pgr_TSP`." +msgstr "Se puede utilizar como entrada para :doc:`pgr_TSP`." 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:" +"Use directly when the resulting matrix is symmetric and there is no :math:" +"`\\infty` value." msgstr "" -"La contracción sin salida se detendrá hasta que no haya más nodos sin " -"salida. Por ejemplo, del siguiente grafo donde :math:`w` es el nodo `dead " -"end`_:" +"Usar directamente cuando la matriz resultante es simétrica y no hay valor :" +"math:`\\infty`." -msgid "" -"After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and is " -"contracted:" +msgid "It will be the users responsibility to make the matrix symmetric." +msgstr "Es responsabilidad dels usuario hacer que la matriz sea simétrica." + +msgid "By using geometric or harmonic average of the non symmetric values." msgstr "" -"Después de contraer :math:`w`, el nodo ` :math:`v` es ahora un nodo `dead " -"end`_ y es contraído:" +"Mediante el uso de la media geométrica o armónica de los valores no " +"simétricos." + +msgid "By using max or min the non symmetric values." +msgstr "Mediante el uso de max o min, los valores no simétricos." msgid "" -"After contracting :math:`v`, stop. Node :math:`u` has the information of " -"nodes that were contrcted." +"By setting the upper triangle to be the mirror image of the lower triangle." msgstr "" -"Después de contraer math:`v`, detenerse El nodo math:`u` tiene la " -"información de los nodos que se contraen." +"Estableciendo el triángulo superior para que sea la imagen reflejada del " +"triángulo inferior." -msgid "Node :math:`u` has the information of nodes that were contracted." +msgid "" +"By setting the lower triangle to be the mirror image of the upper triangle." 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." +"Estableciendo el triángulo inferior para que sea la imagen reflejada del " +"triángulo superior." -msgid "Linear" -msgstr "Lineal" +msgid "It is also the users responsibility to fix an :math:`\\infty` value." +msgstr "" +"También es responsabilidad de los usuarios para fijar un valor :math:" +"`\\infty`." msgid "" -"In case of an undirected graph, a node is considered a `linear` node when" +"Returns the sum of the costs of the shortest path for pair combination of " +"nodes in the graph." msgstr "" -"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." - -msgid "In case of a directed graph, a node is considered a `linear` node when" -msgstr "En el caso de un grafo dirigido, un nodo se considera `lineal` cuando" - -msgid "Linearity is symmetrical" -msgstr "La linealidad es simétrica" +"Devuelve la suma de los costos de la ruta más corta para la combinación de " +"pares de nodos en el grafo." -msgid "Linear vertex on undirected graph" -msgstr "Vértice lineal en grafo no dirigido" +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 green nodes are `linear`_ nodes" -msgstr "Los nodos verdes son `lineales`_" +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 "The blue nodes have an unlimited number of incoming and outgoing edges." +msgid "" +"When the starting vertex and ending vertex are the different and there is no " +"path." msgstr "" -"Los nodos azules tienen un número ilimitado de aristas entrantes y salientes." - -msgid "Undirected" -msgstr "No dirigido" +"Cuando el vértice inicial y el vértice final son diferentes y no hay ruta." -msgid ":math:`v`" -msgstr ":math:`v`" +msgid "" +"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgstr "" +"El costo agregado de los valores no incluídos ``(u, v)`` es :math: `\\infty`." -msgid ":math:`\\{u, w\\}`" -msgstr ":math:`\\{u, w\\}`" +msgid "Let be the case the values returned are stored in a table:" +msgstr "Sea el caso, los valores devueltos se almacenan en una tabla:" -msgid "Linear vertex on directed graph" -msgstr "Vértice lineal en grafo dirigido" +msgid "The unique index would be the pair: ``(start_vid, end_vid)``." +msgstr "El índice único es el par: ``(start_vid, end_vid)``." -msgid "The white node is not linear because the linearity is not symetrical." -msgstr "El nodo blanco no es linero por que la linealidad no es simétrica." +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 "It is possible to go :math:`y \\rightarrow c \\rightarrow z`" -msgstr "Es posible ir a :math:`y \\rightarrow c \\rightarrow z`" +msgid "Any duplicated value in the **start vids** are ignored." +msgstr "Se omite cualquier valor duplicado en las **salidas**." -msgid "It's not possible to go :math:`z \\rightarrow c \\rightarrow y`" -msgstr "No es posible ir a :math:`z \\rightarrow c \\rightarrow y`" +msgid "Used in:" +msgstr "Usado en:" -msgid "Is symmetrical?" -msgstr "Es simétrico?" +msgid "`Edges SQL`_ as described below" +msgstr "`SQL de aristas`_ como se describe a continuación" -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`\\{u, v\\}`" +msgid "**start vids**" +msgstr "**salidas**" -msgid "yes" -msgstr "sí" +msgid "``ARRAY[BIGINT]``" +msgstr "``ARRAY[BIGINT]``" -msgid ":math:`\\{w, x\\}`" -msgstr ":math:`\\{w, x\\}`" +msgid "Array of identifiers of starting vertices." +msgstr "Arreglo de identificadores de vértices iniciales." -msgid ":math:`\\{y, z\\}`" -msgstr ":math:`\\{y, z\\}`" +msgid "`Points SQL`_" +msgstr "`SQL de puntos`_" -msgid "no" -msgstr "no" +msgid "`Points SQL`_ as described below" +msgstr "`SQL de puntos`_ como se describe abajo" -msgid "Operation: Linear Contraction" -msgstr "Operación: Contracción Lineal" +msgid "Points SQL" +msgstr "SQL de puntos" -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:" -msgstr "" -"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`_ :" +msgid "``pid``" +msgstr "``pid``" -msgid "Contracting :math:`w`," -msgstr "Contrayendo :math:`w`," +msgid "**value**" +msgstr "**valor**" -msgid "The vertex :math:`w` is removed from the graph" -msgstr "El vértice :math:`w` se elimina del grafo" +msgid "Identifier of the point." +msgstr "Identificador del punto." msgid "" -"The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are removed " -"from the graph." +"Use with positive value, as internally will be converted to negative value" msgstr "" -"Los aristas :math:`v \\rightarrow w` y :math:`w \\rightarrow z` fueron " -"eliminados del grafo." +"Use con un valor positivo, dado que internamente se convertirá a un valor " +"negativo" + +msgid "If column is present, it can not be NULL." +msgstr "Si columna esta presente, no puede ser NULL." msgid "" -"A new edge :math:`v \\rightarrow z` is inserted represented with red color." +"If column is not present, a sequential negative **value** will be given " +"automatically." msgstr "" -"Se inserta un nuevo arista :math:`v \\rightarrow z` y se representa con " -"color rojo." +"Si columna no esta presente, un **valor** secuencial negativo se otorgará " +"automáticamente." -msgid "Contracting :math:`v`:" -msgstr "Contrayendo :math:`v`:" +msgid "Identifier of the \"closest\" edge to the point." +msgstr "Identificador de la arista \"más cercana\" al punto." -msgid "The vertex :math:`v` is removed from the graph" -msgstr "El vértice :math:`v` se elimina del grafo" +msgid "``fraction``" +msgstr "``fraction``" msgid "" -"The edges :math:`u \\rightarrow v` and :math:`v \\rightarrow z` are removed " -"from the graph." +"Value in <0,1> that indicates the relative postition from the first end " +"point of the edge." msgstr "" -"Los aristas :math:`u \\rightarrow v` y :math:`v \\rightarrow z` son " -"removidos del grafo." +"El valor en <0,1> que indica la posición relativa desde el primer punto de " +"la arista." -msgid "" -"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." +msgid "``side``" +msgstr "``side``" -msgid "" -"Edge :math:`u \\rightarrow z` has the information of nodes that were " -"contracted." -msgstr "" -"El arista :math:`u \\rightarrow z` tiene la información de los nodos que " -"fueron contraídos." +msgid "``CHAR``" +msgstr "``CHAR``" -msgid "The cycle" -msgstr "El ciclo" - -msgid "" -"Contracting a graph, can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." -msgstr "" -"Contraer un grafo se puede hacer con más de una operación. El orden de las " -"operaciones afecta al 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 " -"``operations_order`` ." -msgstr "" -"Esta implementación alterna los tiempos `` max_cycles`` a través de `` " -"operations_order``." - -msgid "Contracting sample data" -msgstr "Contracción de los datos de muestra" - -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." -msgstr "" -"En esta sección, la creación y el uso de un grafo contraído se mostrarán en " -"el ejemplo." +msgid "``b``" +msgstr "``b``" -msgid "The :doc:`sampledata` for an undirected graph is used" -msgstr "Se usa :doc:`sampledata` para un grafo no dirigido" +msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:" +msgstr "Valor en [``b``, ``r``, ``l``, ``NULL``] que indica si el punto es:" -msgid "a dead end operation first followed by a linear operation." -msgstr "una operación sin salida primero seguida de una operación lineal." +msgid "In the right ``r``," +msgstr "A la derecha ``r``," -msgid "Construction of the graph in the database" -msgstr "Construcción del grafo en la base de datos" +msgid "In the left ``l``," +msgstr "A la izquierda `l`," -msgid "Original Data" -msgstr "Datos Originales" +msgid "In both sides ``b``, ``NULL``" +msgstr "En ambos lados ``b``, ``NULL``" -msgid "" -"The following query shows the original data involved in the contraction " -"operation." -msgstr "" -"La siguiente consulta muestra los datos originales implicados en la " -"operación de contracción." +msgid ":doc:`TSP-family`" +msgstr ":doc:`TSP-family`" -msgid "The original graph:" -msgstr "El grafo original:" +msgid "Dijkstra - Family of functions" +msgstr "Dijkstra - Familia de funciones" -msgid "Contraction results" -msgstr "Resultados de la Contracción" +msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." +msgstr ":doc:`pgr_dijkstra` - Algoritmo de Dijkstra para las rutas más cortas." -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm." +msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." 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." +":doc:`pgr_dijkstraCost` - Obtener el costo agregado de las rutas más cortas." msgid "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." +":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." msgstr "" -"Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los " -"resultados porque no se vieron afectados por el algoritmo de contracción." - -msgid "After doing the dead end contraction operation:" -msgstr "Después de realizar la operación de contracción sin salida:" - -msgid "After doing the linear contraction operation to the graph above:" -msgstr "Después de hacer la operación de contracción lineal al grafo anterior:" - -msgid "The process to create the contraction graph on the database:" -msgstr "El proceso para crear el grafo de contracción en la base de datos:" - -msgid "Add additional columns" -msgstr "Añadir columnas adicionales" +":doc:`pgr_dijkstraCostMatrix` - Usar pgr_dijkstra para crear una matriz de " +"costes." msgid "" -"Adding extra columns to the ``edge_table`` and ``edge_table_vertices_pgr`` " -"tables, where:" +":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " +"information." msgstr "" -"Agregar de columnas adicionales a las tablas ``edge_table`` y " -"``edge_table_vertices_pgr`` donde:" - -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" - -msgid "The vertices set belonging to the vertex/edge" -msgstr "El conjunto de vértices que pertenecen al vértice/arista" - -msgid "``is_contracted``" -msgstr "``is_contracted``" - -msgid "On the vertex table" -msgstr "En la tabla de vértices" +":doc:`pgr_drivingDistance` - Usar pgr_dijkstra para calcular información de " +"captación." msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." +":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " +"paths." msgstr "" -"En caso de ''true'' se contrae el vértice, no forma parte del grafo " -"contraído." +":doc:`pgr_KSP` - Usar el algoritmo Yen con pgr_dijkstra para obtener las K " +"rutas más cortas." -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." +msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." msgstr "" -"En caso de ''false'' el vértice no se contrae, su parte del grafo contraído." - -msgid "``is_new``" -msgstr "``is_new``" +":doc:`pgr_dijkstraVia` - Obtener una ruta para una secuencia de vértices." -msgid "On the edge table" -msgstr "En la tabla de aristas" +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 "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." +msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr "" -"En caso de `` true``, la arista se generó por el algoritmo de contracción. " -"Es parte del grafo contraído." +":doc:`pgr_dijkstraNearCost` - Consigue el costo del vértice más cercano." msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted 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 "" -"En caso de ``false`` , la arista es una arista original, podría ser o no " -"parte del grafo contraído." - -msgid "Store contraction information" -msgstr "Almacenar información de contracción" - -msgid "Store the `contraction results`_ in a table" -msgstr "Almacenar los `resultados de la contracción`_ en una tabla" - -msgid "The vertex table update" -msgstr "Actualización de la tabla de vértices" +"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 "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "" -"Usar la columna ``is_contracted`` para indicar los vértices contraídos." +msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" +msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V \\log V + E))`" -msgid "" -"Fill ``contracted_vertices`` with the information from the results tha " -"belong to the vertices." +msgid "The Dijkstra family functions are based on the Dijkstra algorithm." 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:" - -msgid "The edge table update" -msgstr "Actialización de la tabla de aristas" +"Las funciones de la familia de Dijkstra se basan en el algoritmo de Dijkstra." -msgid "Insert the new edges generated by pgr_contraction." -msgstr "Inserte las nuevas aristas generadas por pgr_contraction." +msgid "`Combinations SQL`_" +msgstr "`SQL de combinaciones`_" -msgid "The modified ``edge_table``." -msgstr "La modificada ``edge_table``." +msgid "`Combinations SQL`_ as described below" +msgstr "`SQL de combinaciones`_ como se describe a abajo" -msgid "The contracted graph" -msgstr "El grafo contraído" +msgid "**start vid**" +msgstr "**salida**" -msgid "Vertices that belong to the contracted graph." -msgstr "Vértices que pertenecen al grafo contraído." +msgid "Identifier of the starting vertex of the path." +msgstr "Identificador del vértice inicial de la ruta." -msgid "Edges that belong to the contracted graph." -msgstr "Aristas que pertenecen al grafo contraído." +msgid "**end vid**" +msgstr "**destino**" -msgid "Contracted graph" -msgstr "Grafo contraído" +msgid "Identifier of the ending vertex of the path." +msgstr "Identificador del vértice final de la ruta." -msgid "Using the contracted graph" -msgstr "Usando el grafo contraído" +msgid "**end vids**" +msgstr "**destinos**" -msgid "Using the contracted graph with ``pgr_dijkstra``" -msgstr "Uso del grafo contraído con ``pgr_dijkstra``" +msgid "Array of identifiers of ending vertices." +msgstr "Arreglo de identificadores de vértices finales." -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" -msgstr "" -"Hay tres casos al calcular la ruta más corta entre un origen y un destino " -"determinados en un grafo contraído:" +msgid "Combinations SQL" +msgstr "SQL Combinaciones" -msgid "Case 1: Both source and target belong to the contracted graph." -msgstr "Caso 1: Tanto el origen como el destino pertenecen al grafo contraído." +msgid "Identifier of the departure vertex." +msgstr "Identificador del vértice de partida." -msgid "Case 2: Source and/or target belong to an edge subgraph." -msgstr "Caso 2: El origen y/o el destino pertenecen a un subgrafo de aristas." +msgid "Identifier of the arrival vertex." +msgstr "Identificador del vértice de llegada." -msgid "Case 3: Source and/or target belong to a vertex." -msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice." +msgid "The problem definition (Advanced documentation)" +msgstr "La definición de problema (Documentación avanzada)" -msgid "" -"Using the `Edges that belong to the contracted graph.`_ on lines 11 to 20." -msgstr "" -"Usando las `Aristas que pertenecen al grafo contraído.`_ en las líneas 11 a " -"20." +msgid "Given the following query:" +msgstr "Dada la siguiente consulta:" -msgid "Case 1" -msgstr "Caso 1" +msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"When both source and target belong to the contracted graph, a path is found." +"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" +"`" msgstr "" -"Cuando el origen y el destino pertenecen al grafo contraído, se encuentra " -"ruta." +"Donde :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" +"`" -msgid "Case 2" -msgstr "Caso 2" +msgid "and" +msgstr "y" -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." +msgid ":math:`source = \\bigcup source_i`," +msgstr ":math:`source = \\bigcup source_i`," -msgid "" -"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`." +msgid ":math:`target = \\bigcup target_i`," +msgstr ":math:`target = \\bigcup target_i`," -msgid "Case 3" -msgstr "Caso 3" +msgid "The graphs are defined as follows:" +msgstr "Los gráficos se definen como sigue:" -msgid "When source and/or target belong to a vertex then a path is not found." -msgstr "" -"Cuando el origen y/o el destino pertenecen a un vértice, no se encuentra " -"ruta." +msgid "Directed graph" +msgstr "Grafo dirigido" -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." -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." +msgid "The weighted directed graph, :math:`G_d(V,E)`, is defined by:" +msgstr "El ponderado del grafo dirigido, :math:`G_d(V,E)`, se define por:" -msgid "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." +msgid "the set of vertices :math:`V`" +msgstr "el conjunto de vértices :math:`V`" -msgid "The vertices that need to be expanded are calculated on lines 11 to 17." -msgstr "Los vértices que deben ampliarse se calculan en las líneas 11 a 17." +msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" +msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" -msgid "" -"Adding to the contracted graph that additional section on lines 26 to 28." -msgstr "" -"Añadiendo al grafo contraído esa sección adicional en las líneas 26 a 28." +msgid "the set of edges :math:`E`" +msgstr "El conjunto de aristas :math:`E`" msgid "" -"When source and/or target belong to an edge subgraph, now, a path is found." +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " +"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " +"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " +"\\neq \\varnothing \\\\ \\end{cases}`" msgstr "" -"Cuando el origen y/o el destino pertenecen a un subgrafo de arista, entonces " -"se encuentra una ruta." +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " +"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " +"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " +"\\neq \\varnothing \\\\ \\end{cases}`" -msgid "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`." +msgid "Undirected graph" +msgstr "Grafo no dirigido" -msgid "" -"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`." +msgid "The weighted undirected graph, :math:`G_u(V,E)`, is defined by:" +msgstr "El grafo ponderado no dirigido, :math:`G_u(V,E)`, es definido por:" -msgid "The vertices that need to be expanded are calculated on lines 19 to 24." -msgstr "Los vértices que deben ampliarse se calculan en las líneas 19 a 24." +msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" +msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgid "" -"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." +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " +"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " +"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " +"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " +"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " +"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " +"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" msgstr "" -"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." +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " +"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " +"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " +"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " +"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " +"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " +"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" -msgid "When source and/or target belong to a vertex, now, a path is found." -msgstr "" -"Cuando el origen y/o el destino pertenecen a un vértice, entonces se " -"encuentra ruta." +msgid "The problem" +msgstr "El problema" -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`." +msgid "Given:" +msgstr "Dado:" -msgid ":doc:`sampledata`" -msgstr ":doc:`sampledata`" +msgid ":math:`start_{vid} \\in V` a starting vertex" +msgstr ":math:`start_{vid} \\in V` un vértice inicial" + +msgid ":math:`end_{vid} \\in V` an ending vertex" +msgstr ":math:`end_{vid} \\in V` un vértice final" msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +":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 "" -"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" +":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 "Cost - Category" -msgstr "Costo - Categoría" +msgid "Then:" +msgstr "Entonces:" -msgid ":doc:`pgr_aStarCost`" -msgstr ":doc:`pgr_aStarCost`" +msgid "" +":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " +"agg\\_cost_i)\\}`" +msgstr "" +":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " +"agg\\_cost_i)\\}`" -msgid ":doc:`pgr_bdAstarCost`" -msgstr ":doc:`pgr_bdAstarCost`" +msgid "where:" +msgstr "donde:" -msgid ":doc:`pgr_dijkstraCost`" -msgstr ":doc:`pgr_dijkstraCost`" +msgid ":math:`path\\_seq_i = i`" +msgstr ":math:`path\\_seq_i = i`" -msgid ":doc:`pgr_bdDijkstraCost`" -msgstr ":doc:`pgr_bdDijkstraCost`" +msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`" +msgstr ":math:`path\\_seq_{| \\pi |} = | \\pi |`" -msgid ":doc:`pgr_dijkstraNearCost`" -msgstr ":doc:`pgr_dijkstraNearCost`" +msgid ":math:`node_i \\in V`" +msgstr ":math:`node_i \\in V`" -msgid ":doc:`pgr_withPointsCost`" -msgstr ":doc:`pgr_withPointsCost`" +msgid ":math:`node_1 = start_{vid}`" +msgstr ":math:`node_1 = start_{vid}`" -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 ":math:`node_{| \\pi |} = end_{vid}`" +msgstr ":math:`node_{| \\pi |} = end_{vid}`" msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." +":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" msgstr "" -"Devuelve la suma de los costos de la ruta más corta para cada par de " -"combinación de nodos requeridos." +":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" 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)``." +":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 "" -"Sea el caso que los valores devueltos se almacenen en una tabla, el índice " -"único sería el par: `(start_vid, end_vid)`." +":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " +"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" +"\\ \\end{cases}`" + +msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" +msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`" msgid "" -"Depending on the function and its parameters, the results can be symmetric." +":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 "" -"Dependiendo de la función y sus parámetros, los resultados pueden ser " -"simétricos." +":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 "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +"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 "" -"El **costo agregado** de :math:`(u, v)` es el mismo que para :math:`(v, u)`." +"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 "" -"Any duplicated value in the start or end vertex identifiers are ignored." +":math:`path\\_seq` indicates the relative position in the path of the :math:" +"`node` or :math:`edge`." msgstr "" -"Se omite cualquier valor duplicado en los identificadores de vertices de " -"inicio y destino." - -msgid "The returned values are ordered:" -msgstr "Los valores regresados se ordenan:" - -msgid "``start_vid`` ascending" -msgstr "``start_vid`` ascendente" - -msgid "``end_vid`` ascending" -msgstr "``end_vid`` ascendente" - -msgid "Cost Matrix - Category" -msgstr "Cost Matrix - Categoría" - -msgid ":doc:`pgr_aStarCostMatrix`" -msgstr ":doc:`pgr_aStarCostMatrix`" - -msgid ":doc:`pgr_dijkstraCostMatrix`" -msgstr ":doc:`pgr_dijkstraCostMatrix`" - -msgid ":doc:`pgr_bdAstarCostMatrix`" -msgstr ":doc:`pgr_bdAstarCostMatrix`" - -msgid ":doc:`pgr_bdDijkstraCostMatrix`" -msgstr ":doc:`pgr_bdDijkstraCostMatrix`" - -msgid "proposed" -msgstr "propuesta" - -msgid ":doc:`pgr_withPointsCostMatrix`" -msgstr ":doc:`pgr_withPointsCostMatrix`" +":math:`path\\_seq` indica la posición relativa en el camino de :math:`node` " +"o :math:`edge`." -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." +msgid ":math:`cost` is the cost of the edge to be used to go to the next node." msgstr "" -":doc:`TSP-family` necesita como entrada una matriz de costos simétrica y sin " -"borde `(u, v)`, debe valorar :math:`\\infty`." +":math:`cost` es el coste del borde que se utilizará para ir al siguiente " +"nodo." msgid "" -"This collection of functions will return a cost matrix in form of a table." +":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." msgstr "" -"Esta colección de funciones devolverá una matriz de costes en forma de tabla." +":math:`agg\\_cost` es el costo desde el :math:`start_{vid}` hasta el nodo." -msgid "Can be used as input to :doc:`pgr_TSP`." -msgstr "Se puede utilizar como entrada para :doc:`pgr_TSP`." +msgid "If there is no path, the resulting set is empty." +msgstr "Si no hay ruta, el conjunto resultante estará vacío." + +msgid "Driving Distance - Category" +msgstr "Distancia Manejando - Categoría" msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." +":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" -"Usar directamente cuando la matriz resultante es simétrica y no hay valor :" -"math:`\\infty`." +":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo de " +"Dijkstra" -msgid "It will be the users responsibility to make the matrix symmetric." -msgstr "Es responsabilidad dels usuario hacer que la matriz sea simétrica." +msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" +msgstr ":doc:`pgr_primDD` - Distancia de manejo basada en el algoritmo de Prim" -msgid "By using geometric or harmonic average of the non symmetric values." +msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" msgstr "" -"Mediante el uso de la media geométrica o armónica de los valores no " -"simétricos." +":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal" -msgid "By using max or min the non symmetric values." -msgstr "Mediante el uso de max o min, los valores no simétricos." +msgid "Post processing" +msgstr "Post procesamiento" -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." -msgstr "" -"Estableciendo el triángulo superior para que sea la imagen reflejada del " -"triángulo inferior." +msgid ":doc:`pgr_alphaShape` - Alpha shape computation" +msgstr ":doc:`pgr_alphaShape` - Cálcular la forma Alpha" -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." -msgstr "" -"Estableciendo el triángulo inferior para que sea la imagen reflejada del " -"triángulo superior." +msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" +msgstr ":doc:`pgr_withPointsDD` - Distancia Manejando basada en pgr_withPoints" -msgid "It is also the users responsibility to fix an :math:`\\infty` value." -msgstr "" -"También es responsabilidad de los usuarios para fijar un valor :math:" -"`\\infty`." +msgid "Calculate nodes that are within a distance." +msgstr "Calcular nodos que están dentro de una distancia." msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." +"Extracts all the nodes that have costs less than or equal to the value " +"distance." msgstr "" -"Devuelve la suma de los costos de la ruta más corta para la combinación de " -"pares de nodos en el grafo." +"Extrae todos los nodos que tienen costos menor o igual al valor de la " +"distancia." -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." +msgid "The edges extracted will conform to the corresponding spanning tree." msgstr "" -"Cuando el vértice inicial y el vértice final son iguales, no hay camino." +"Las aristas extraídas conformarán el correspondiente árbol de expansión." -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 "Edge :math:`(u, v)` will not be included when:" +msgstr "Arista :math:`(u, v)` no se incluye cuando:" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." -msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y no hay ruta." +msgid "The distance from the **root** to :math:`u` > limit distance." +msgstr "La distancia de la **raiz** a:math:`u` > límite de la distancia." + +msgid "The distance from the **root** to :math:`v` > limit distance." +msgstr "La distancia de la **raiz** a :math:`v` > límite de la distancia." msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +"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 "" -"El costo agregado de los valores no incluídos ``(u, v)`` es :math: `\\infty`." +"No se crean nuevos nodos en el grafo, por lo que cuando el vértice está " +"dentro de los límites y parte de la arista no está dentro de los límites, la " +"arsta no se incluye." -msgid "Let be the case the values returned are stored in a table:" -msgstr "Sea el caso, los valores devueltos se almacenan en una tabla:" +msgid "Edges SQL as described below." +msgstr "SQL de aristas como se describen abajo." -msgid "The unique index would be the pair: ``(start_vid, end_vid)``." -msgstr "El índice único es el par: ``(start_vid, end_vid)``." +msgid "**Root vid**" +msgstr "**Raíz**" -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 "**Root vids**" +msgstr "**Raíces**" -msgid "Any duplicated value in the **start vids** are ignored." -msgstr "Se omite cualquier valor duplicado en las **salidas**." +msgid "``ARRAY[ANY-INTEGER]``" +msgstr "``ARREGLO[ENTEROS]``" -msgid "Used in:" -msgstr "Usado en:" +msgid "**distance**" +msgstr "**distancia**" -msgid "`Edges SQL`_ as described below" -msgstr "`SQL de aristas`_ como se describe a continuación" +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 "**start vids**" -msgstr "**salidas**" +msgid "Returns set of |result-spantree|" +msgstr "Regresa el conjunto de |result-spantree|" -msgid "``ARRAY[BIGINT]``" -msgstr "``ARRAY[BIGINT]``" +msgid ":math:`depth-1` is the depth of ``pred``" +msgstr ":math:`depth-1` es la profundidad de ``pred``" -msgid "Array of identifiers of starting vertices." -msgstr "Arreglo de identificadores de vértices iniciales." +msgid "``pred``" +msgstr "``pred``" -msgid "`Points SQL`_" -msgstr "`SQL de puntos`_" +msgid "Predecessor of ``node``." +msgstr "Presdecesor de ``node``." -msgid "`Points SQL`_ as described below" -msgstr "`SQL de puntos`_ como se describe abajo" +msgid "When ``node`` = ``start_vid`` then has the value ``node``." +msgstr "Cuando ``node`` = ``start_vid`` entonces tiene el valor ``node``." -msgid "Points SQL" -msgstr "SQL de puntos" +msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." +msgstr "" +"Identificador del ``edge`` utilizado para llegar desde ``pred`` hasta " +"``node``." -msgid "``pid``" -msgstr "``pid``" +msgid "Experimental Functions" +msgstr "Funciones Experimentales" -msgid "**value**" -msgstr "**valor**" +msgid "Families" +msgstr "Familias" -msgid "Identifier of the point." -msgstr "Identificador del punto." +msgid ":doc:`flow-family`" +msgstr ":doc:`flow-family`" + +msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." +msgstr "" +":doc:`pgr_maxFlowMinCost` - Detalles del flujo y el coste en los bordes." + +msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." +msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Solo el cálculo del Coste Mínimo." + +msgid ":doc:`chinesePostmanProblem-family`" +msgstr ":doc:`chinesePostmanProblem-family`" + +msgid ":doc:`coloring-family`" +msgstr ":doc:`coloring-family`" + +msgid ":doc:`transformation-family`" +msgstr ":doc:`transformation-family`" msgid "" -"Use with positive value, as internally will be converted to negative value" +":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " +"Graph out of each vertex in the input graph." msgstr "" -"Use con un valor positivo, dado que internamente se convertirá a un valor " -"negativo" +":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 "If column is present, it can not be NULL." -msgstr "Si columna esta presente, no puede ser NULL." +msgid ":doc:`traversal-family`" +msgstr ":doc:`traversal-family`" msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." +":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" -"Si columna no esta presente, un **valor** secuencial negativo se otorgará " -"automáticamente." +":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del grafo." -msgid "Identifier of the \"closest\" edge to the point." -msgstr "Identificador de la arista \"más cercana\" al punto." +msgid "" +":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " +"graph." +msgstr "" +":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura del " +"grafo." -msgid "``fraction``" -msgstr "``fraction``" +msgid ":doc:`components-family`" +msgstr ":doc:`components-family`" + +msgid ":doc:`ordering-family`" +msgstr ":doc:`ordering-family`" msgid "" -"Value in <0,1> that indicates the relative postition from the first end " -"point of the edge." +":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " +"an undirected graph." msgstr "" -"El valor en <0,1> que indica la posición relativa desde el primer punto de " -"la arista." +":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no " +"dirigido." -msgid "``side``" -msgstr "``side``" +msgid "" +":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " +"acyclic graph." +msgstr "" +":doc:`pgr_topologicalSort` - Orden lineal de los vértices para grafos " +"acíclicos dirigidos." -msgid "``CHAR``" -msgstr "``CHAR``" +msgid ":doc:`metrics-family`" +msgstr ":doc:`metrics-family`" -msgid "``b``" -msgstr "``b``" +msgid "" +":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " +"centrality using Brandes Algorithm" +msgstr "" +":doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia " +"relativa mediante el algoritmo de Brandes" -msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:" -msgstr "Valor en [``b``, ``r``, ``l``, ``NULL``] que indica si el punto es:" +msgid ":doc:`TRSP-family`" +msgstr ":doc:`TRSP-family`" -msgid "In the right ``r``," -msgstr "A la derecha ``r``," +msgid "categories" +msgstr "Categorías" -msgid "In the left ``l``," -msgstr "A la izquierda `l`," +msgid ":doc:`VRP-category`" +msgstr ":doc:`VRP-category`" -msgid "In both sides ``b``, ``NULL``" -msgstr "En ambos lados ``b``, ``NULL``" +msgid "Shortest Path Category" +msgstr "Rutas más cortas Categoría" -msgid ":doc:`TSP-family`" -msgstr ":doc:`TSP-family`" +msgid ":doc:`pgr_bellmanFord`" +msgstr ":doc:`pgr_bellmanFord`" -msgid "Dijkstra - Family of functions" -msgstr "Dijkstra - Familia de funciones" +msgid ":doc:`pgr_dagShortestPath`" +msgstr ":doc:`pgr_dagShortestPath`" -msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr ":doc:`pgr_dijkstra` - Algoritmo de Dijkstra para las rutas más cortas." +msgid ":doc:`pgr_edwardMoore`" +msgstr ":doc:`pgr_edwardMoore`" -msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgstr "" -":doc:`pgr_dijkstraCost` - Obtener el costo agregado de las rutas más cortas." +msgid "Planar Family" +msgstr "Familia Planar" + +msgid ":doc:`pgr_isPlanar`" +msgstr ":doc:`pgr_isPlanar`" + +msgid "Miscellaneous Algorithms" +msgstr "Algoritmos Diversos" + +msgid ":doc:`pgr_lengauerTarjanDominatorTree`" +msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" + +msgid ":doc:`pgr_stoerWagner`" +msgstr ":doc:`pgr_stoerWagner`" + +msgid ":doc:`pgr_transitiveClosure`" +msgstr ":doc:`pgr_transitiveClosure`" + +msgid ":doc:`pgr_hawickCircuits`" +msgstr ":doc:`pgr_hawickCircuits`" + +msgid "Flow - Family of functions" +msgstr "Flow - Familia de funciones" msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " +"algorithm." msgstr "" -":doc:`pgr_dijkstraCostMatrix` - Usar pgr_dijkstra para crear una matriz de " -"costes." +":doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo " +"empuja y reetiquetado." msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." +":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " +"edges." msgstr "" -":doc:`pgr_drivingDistance` - Usar pgr_dijkstra para calcular información de " -"captación." +":doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles del " +"flujo en aristas." msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." +":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " +"edges." msgstr "" -":doc:`pgr_KSP` - Usar el algoritmo Yen con pgr_dijkstra para obtener las K " -"rutas más cortas." +":doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo del " +"flujo en aristas." -msgid ":doc:`pgr_dijkstraVia` - Get a route of a seuence of vertices." +msgid "" +":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " +"edges." msgstr "" -":doc:`pgr_dijkstraVia` - Obtenga una ruta a partir de una secuencia de " -"vértices." +":doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del " +"flujo en aristas." -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 "Applications" +msgstr "Aplicaciones" -msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." +msgid "" +":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " +"groups of vertices." msgstr "" -":doc:`pgr_dijkstraNearCost` - Consigue el costo del vértice más cercano." +":doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre dos " +"grupos de vértices." 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." +":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " +"in a 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." +":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de " +"coincidencia dentro de un grafo." -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 "Flow Functions General Information" +msgstr "Información General de las Funciones de Flujo" -msgid "The Dijkstra family functions are based on the Dijkstra algorithm." -msgstr "" -"Las funciones de la familia de Dijkstra se basan en el algoritmo de Dijkstra." +msgid "The graph is **directed**." +msgstr "El grafo es **dirigido**." -msgid "`Combinations SQL`_" -msgstr "`SQL de combinaciones`_" +msgid "Process is done only on edges with positive capacities." +msgstr "El proceso se realiza sólo en aristas con capacidades positivas." -msgid "`Combinations SQL`_ as described below" -msgstr "`SQL de combinaciones`_ como se describe a abajo" +msgid "" +"When the maximum flow is 0 then there is no flow and **EMPTY SET** is " +"returned." +msgstr "" +"Cuando el flujo máximo es 0 entonces no hay flujo, se devolverá: **EMPTY " +"SET**." -msgid "**start vid**" -msgstr "**salida**" +msgid "There is no flow when source has the same value as target." +msgstr "No hay flujo cuando el origen tiene el mismo valor que el destino." -msgid "Identifier of the starting vertex of the path." -msgstr "Identificador del vértice inicial de la ruta." +msgid "Any duplicated values in source or target are ignored." +msgstr "Los valores duplicados en origen o destino se ignoran." -msgid "**end vid**" -msgstr "**destino**" +msgid "Calculates the flow/residual capacity for each edge. In the output" +msgstr "Calcula la capacidad de flujo/residuo para cada arista. En la salida" -msgid "Identifier of the ending vertex of the path." -msgstr "Identificador del vértice final de la ruta." - -msgid "**end vids**" -msgstr "**destinos**" - -msgid "Array of identifiers of ending vertices." -msgstr "Arreglo de identificadores de vértices finales." +msgid "Edges with zero flow are omitted." +msgstr "Se omiten las aristas con flujo cero." -msgid "Combinations SQL" -msgstr "SQL Combinaciones" +msgid "Creates" +msgstr "Crea" -msgid "Identifier of the departure vertex." -msgstr "Identificador del vértice de partida." +msgid "a **super source** and edges from it to all the sources," +msgstr "una **super fuente** y aristas desde ella a todas las fuentes," -msgid "Identifier of the arrival vertex." -msgstr "Identificador del vértice de llegada." +msgid "a **super target** and edges from it to all the targetss." +msgstr "un **super objetivo** y aristas desde él a todos los objetivos." -msgid "The problem definition (Advanced documentation)" -msgstr "La definición de problema (Documentación avanzada)" +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:" +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 " +"parámetros y se puede calcular:" -msgid "Given the following query:" -msgstr "Dada la siguiente consulta:" +msgid "By aggregation of the outgoing flow from the sources" +msgstr "Mediante la suma de los flujos salientes de las fuentes" -msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "By aggregation of the incoming flow to the targets" +msgstr "Mediante la suma de los flujos llegantes a los destinos" msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" +":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 "" -"Donde :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" +":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 "and" -msgstr "y" +msgid "Capacity edges" +msgstr "Aristas de capacidad" -msgid ":math:`source = \\bigcup source_i`," -msgstr ":math:`source = \\bigcup source_i`," +msgid ":doc:`pgr_pushRelabel`" +msgstr ":doc:`pgr_pushRelabel`" -msgid ":math:`target = \\bigcup target_i`," -msgstr ":math:`target = \\bigcup target_i`," +msgid ":doc:`pgr_edmondsKarp`" +msgstr ":doc:`pgr_edmondsKarp`" -msgid "The graphs are defined as follows:" -msgstr "Los gráficos se definen como sigue:" +msgid ":doc:`pgr_boykovKolmogorov`" +msgstr ":doc:`pgr_boykovKolmogorov`" -msgid "Directed graph" -msgstr "Grafo dirigido" +msgid "``reverse_capacity``" +msgstr "``reverse_capacity``" -msgid "The weighted directed graph, :math:`G_d(V,E)`, is definied by:" -msgstr "El gráfico dirigido ponderado, :math:`G_d(V,E)`, se define por:" +msgid "Capacity-Cost edges" +msgstr "Aristas Capacidad-Costo" -msgid "the set of vertices :math:`V`" -msgstr "el conjunto de vértices :math:`V`" +msgid ":doc:`pgr_maxFlowMinCost`" +msgstr ":doc:`pgr_maxFlowMinCost`" -msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" -msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" +msgid ":doc:`pgr_maxFlowMinCost_Cost`" +msgstr ":doc:`pgr_maxFlowMinCost_Cost`" -msgid "the set of edges :math:`E`" -msgstr "El conjunto de aristas :math:`E`" +msgid "Capacity of the edge (``source``, ``target``)" +msgstr "Capacidad de la arista (``source``, ``target``)" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " -"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " -"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " -"\\neq \\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " -"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " -"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " -"\\neq \\varnothing \\\\ \\end{cases}`" +msgid "Capacity of the edge (``target``, ``source``)" +msgstr "Capacidad de la arista (``target``, ``source``)" -msgid "Undirected graph" -msgstr "Grafo no dirigido" +msgid "Weight of the edge (``source``, ``target``) if it exist" +msgstr "Peso de la arista (``source``, ``target``) si existe" -msgid "The weighted undirected graph, :math:`G_u(V,E)`, is definied by:" -msgstr "El grafo ponderado no dirigido :math:`G_u(V,E)`, es definido por:" +msgid "Weight of the edge (``target``, ``source``) if it exist" +msgstr "Peso de la arista (``target``, ``source``) si existe" -msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" -msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" +msgid "Cost edges" +msgstr "Aristas de costo" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " -"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " -"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " -"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " -"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " -"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " -"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " -"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " -"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" +msgid ":doc:`pgr_edgeDisjointPaths`" +msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "The problem" -msgstr "El problema" +msgid "Used in" +msgstr "Usado en" -msgid "Given:" -msgstr "Dado:" +msgid "**seq**" +msgstr "**seq**" -msgid ":math:`start_{vid} \\in V` a starting vertex" -msgstr ":math:`start_{vid} \\in V` un vértice inicial" +msgid "``INT``" +msgstr "``INT``" -msgid ":math:`end_{vid} \\in V` an ending vertex" -msgstr ":math:`end_{vid} \\in V` un vértice final" +msgid "**edge**" +msgstr "**arista**" -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}`" +msgid "Identifier of the edge in the original query (edges_sql)." +msgstr "Identificador de la arista en la consulta original(edges_sql)." + +msgid "**start_vid**" +msgstr "**start_vid**" + +msgid "**end_vid**" +msgstr "**end_vid**" + +msgid "**flow**" +msgstr "**flujo**" + +msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" -":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}`" +"Flujo a través del arista en la dirección (``start_vid``, ``end_vid``)." -msgid "Then:" -msgstr "Entonces:" +msgid "**residual_capacity**" +msgstr "**residual_capacity**" msgid "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" +"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" +"Capacidad residual del arista en la dirección (``start_vid``, ``end_vid``)." -msgid "where:" -msgstr "donde:" +msgid "For :doc:`pgr_maxFlowMinCost`" +msgstr "Para :doc:`pgr_maxFlowMinCost`" -msgid ":math:`path\\_seq_i = i`" -msgstr ":math:`path\\_seq_i = i`" +msgid "**source**" +msgstr "**origen**" -msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`" -msgstr ":math:`path\\_seq_{| \\pi |} = | \\pi |`" +msgid "**target**" +msgstr "**objetivo**" -msgid ":math:`node_i \\in V`" -msgstr ":math:`node_i \\in V`" +msgid "Flow through the edge in the direction (source, target)." +msgstr "Flujo a través de la arista en la dirección (origen, destino)." -msgid ":math:`node_1 = start_{vid}`" -msgstr ":math:`node_1 = start_{vid}`" +msgid "Residual capacity of the edge in the direction (source, target)." +msgstr "Capacidad residual de la arista en la dirección (origen, destino)." -msgid ":math:`node_{| \\pi |} = end_{vid}`" -msgstr ":math:`node_{| \\pi |} = end_{vid}`" +msgid "**cost**" +msgstr "**costo**" msgid "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" +"The cost of sending this flow through the edge in the direction (source, " +"target)." msgstr "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" +"El costo de enviar este flujo a través de la arista en la dirección (origen, " +"destino)." -msgid "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " -"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" -"\\ \\end{cases}`" -msgstr "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " -"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" -"\\ \\end{cases}`" +msgid "**agg_cost**" +msgstr "**agg_cost**" -msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" -msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`" +msgid "The aggregate cost." +msgstr "El costo agregado." + +msgid "Advanced Documentation" +msgstr "Documentación Avanzada" 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}`" +"A flow network is a directed graph where each edge has a capacity and a " +"flow. The flow through an edge must not exceed the capacity of the edge. " +"Additionally, the incoming and outgoing flow of a node must be equal except " +"for source which only has outgoing flow, and the destination(sink) which " +"only has incoming flow." msgstr "" -":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}`" +"Una red de flujo es un gráfico dirigido donde cada arista tiene una " +"capacidad y un flujo. El flujo a través de una arista no debe exceder la " +"capacidad de la misma. Además, el flujo entrante y saliente de un nodo debe " +"ser igual, excepto para el origen que solo tiene flujo saliente, y el " +"destino (receptor) que solo tiene flujo entrante." msgid "" -"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," +"Maximum flow algorithms calculate the maximum flow through the graph and the " +"flow of each edge." 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," +"Los algoritmos de Flujo Máximo se calculan a través del grafo del flujo " +"máximo y el flujo de cada arista." msgid "" -":math:`path\\_seq` indicates the relative position in the path of the :math:" -"`node` or :math:`edge`." +"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 "" -":math:`path\\_seq` indica la posición relativa en el camino de :math:`node` " -"o :math:`edge`." +"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 ":math:`cost` is the cost of the edge to be used to go to the next node." -msgstr "" -":math:`cost` es el coste del borde que se utilizará para ir al siguiente " -"nodo." +msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" +msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " +"reverse\\_capacity_i)\\}`" msgstr "" -":math:`agg\\_cost` es el costo desde el :math:`start_{vid}` hasta el nodo." +"donde: :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " +"reverse\\_capacity_i)\\}`" -msgid "If there is no path, the resulting set is empty." -msgstr "Si no hay ruta, el conjunto resultante estará vacío." +msgid "Graph definition" +msgstr "Definición de grafo" -msgid "Driving Distance - Category" -msgstr "Distancia Manejando - Categoría" +msgid "The weighted directed graph, :math:`G(V,E)`, is defined as:" +msgstr "El grafo ponderado dirigido, :math:`G(V,E)`, se define como:" + +msgid "the set of vertices :math:`V`" +msgstr "Conjunto de vértices :math:`V`" msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " +"target_i`" msgstr "" -":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo de " -"Dijkstra" - -msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" -msgstr ":doc:`pgr_primDD` - Distancia de manejo basada en el algoritmo de Prim" +":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i " +"\\bigcuptarget_i`" -msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" +msgid "" +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " +"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " +"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " +"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " +"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " +"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " +"\\varnothing \\\\ \\end{cases}`" msgstr "" -":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal" +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " +"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " +"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " +"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " +"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " +"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " +"\\varnothing \\\\ \\end{cases}`" -msgid "Post pocessing" -msgstr "Post procesamiento" +msgid "Maximum flow problem" +msgstr "Problema de Flujo Máximo" -msgid ":doc:`pgr_alphaShape` - Alpha shape computation" -msgstr ":doc:`pgr_alphaShape` - Cálcular la forma Alpha" +msgid ":math:`G(V,E)`" +msgstr ":math:`G(V,E)`" -msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" -msgstr ":doc:`pgr_withPointsDD` - Distancia Manejando basada en pgr_withPoints" +msgid ":math:`source\\_vertex \\in V` the source vertex" +msgstr ":math:`source\\_vertex \\in V` el vértice de origen" -msgid "Calculate nodes that are within a distance." -msgstr "Calcular nodos que están dentro de una distancia." +msgid ":math:`sink\\_vertex \\in V` the sink vertex" +msgstr ":math:`sink\\_vertex \\in V` el vértice pozo" + +msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" +msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgid "" -"Extracts all the nodes that have costs less than or equal to the value " -"distance." +":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " +"flow_i, residual\\_capacity_i)}`" msgstr "" -"Extrae todos los nodos que tienen costos menor o igual al valor de la " -"distancia." +":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " +"flow_i, residual\\_capacity_i)}`" -msgid "The edges extracted will conform to the corresponding spanning tree." +msgid "" +":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " +"residual capacity and flow. The maximum flow through the graph can be " +"obtained by aggregating on the source or sink and summing the flow from/to " +"it. In particular:" msgstr "" -"Las aristas extraídas conformarán el correspondiente árbol de expansión." +":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 "Edge :math:`(u, v)` will not be included when:" -msgstr "Arista :math:`(u, v)` no se incluye cuando:" +msgid ":math:`id_i = i`" +msgstr ":math:`id_i = i`" -msgid "The distance from the **root** to :math:`u` > limit distance." -msgstr "La distancia de la **raiz** a:math:`u` > límite de la distancia." +msgid ":math:`edge\\_id = id_i` in edges_sql" +msgstr ":math:`edge\\_id = id_i` en edges_sql" -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 ":math:`residual\\_capacity_i = capacity_i - flow_i`" +msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`" + +msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" +msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgid "" -"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." +"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " +"other network analysis functionality." msgstr "" -"No se crean nuevos nodos en el grafo, por lo que cuando el vértice está " -"dentro de los límites y parte de la arista no está dentro de los límites, la " -"arsta no se incluye." - -msgid "Edges SQL as described below." -msgstr "SQL de aristas como se describen abajo." +"pgRouting extiende la base de datos geospacial de `PostGIS `__/`PostgreSQL `__ para proporcionar " +"enrutamiento geoespacial y otras funciones de análisis de red." -msgid "**Root vid**" -msgstr "**Raíz**" +msgid "This is the manual for pgRouting |release|." +msgstr "Este es el manual para la version |release| de pgRouting." -msgid "**Root vids**" -msgstr "**Raíces**" +msgid "Creative Commons Attribution-Share Alike 3.0 License" +msgstr "Licencia de Creative Commons Attribution-Share Alike 3.0" -msgid "``ARRAY[ANY-INTEGER]``" -msgstr "``ARREGLO[ENTEROS]``" +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 "" +"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` ." -msgid "**distance**" -msgstr "**distancia**" +msgid "General" +msgstr "General" -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 ":doc:`sampledata` that is used in the examples of this manual." +msgstr ":doc:`sampledata` es usado en los ejemplos de este manual." -msgid "Returns set of |result-spantree|" -msgstr "Regresa el conjunto de |result-spantree|" +msgid "Pgrouting Concepts" +msgstr "Conceptos de pgRouting" -msgid ":math:`depth-1` is the depth of ``pred``" -msgstr ":math:`depth-1` es la profundidad de ``pred``" +msgid ":doc:`routingFunctions`" +msgstr ":doc:`routingFunctions`" -msgid "``pred``" -msgstr "``pred``" +msgid ":doc:`allpairs-family`" +msgstr ":doc:`allpairs-family`" -msgid "Predecessor of ``node``." -msgstr "Presdecesor de ``node``." +msgid ":doc:`bdDijkstra-family`" +msgstr ":doc:`bdDijkstra-family`" -msgid "When ``node`` = ``start_vid`` then has the value ``node``." -msgstr "Cuando ``node`` = ``start_vid`` entonces tiene el valor ``node``." +msgid ":doc:`contraction-family`" +msgstr ":doc:`contraction-family`" -msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." -msgstr "" -"Identificador del ``edge`` utilizado para llegar desde ``pred`` hasta " -"``node``." +msgid ":doc:`dijkstra-family`" +msgstr ":doc:`dijkstra-family`" -msgid "Experimental Functions" -msgstr "Funciones Experimentales" +msgid ":doc:`kruskal-family`" +msgstr ":doc:`kruskal-family`" -msgid "Families" -msgstr "Familias" +msgid ":doc:`pgr_kruskal`" +msgstr ":doc:`pgr_kruskal`" -msgid ":doc:`flow-family`" -msgstr ":doc:`flow-family`" +msgid ":doc:`pgr_kruskalDD`" +msgstr ":doc:`pgr_kruskalDD`" -msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." +msgid "" +":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " +"incident edges to the vertex." msgstr "" -":doc:`pgr_maxFlowMinCost` - Detalles del flujo y el coste en los bordes." +":doc:`pgr_degree` - Regresa un conjunto de vertices y la cantidad de aristas " +"incidentes al vértice." -msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." -msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Solo el cálculo del Coste Mínimo." +msgid ":doc:`prim-family`" +msgstr ":doc:`prim-family`" -msgid ":doc:`chinesePostmanProblem-family`" -msgstr ":doc:`chinesePostmanProblem-family`" +msgid ":doc:`pgr_prim`" +msgstr ":doc:`pgr_prim`" -msgid ":doc:`coloring-family`" -msgstr ":doc:`coloring-family`" +msgid ":doc:`pgr_primDD`" +msgstr ":doc:`pgr_primDD`" -msgid ":doc:`transformation-family`" -msgstr ":doc:`transformation-family`" +msgid ":doc:`reference`" +msgstr ":doc:`reference`" + +msgid ":doc:`pgr_version`" +msgstr ":doc:`pgr_version`" + +msgid ":doc:`pgr_full_version`" +msgstr ":doc:`pgr_full_version`" + +msgid ":doc:`topology-functions`" +msgstr ":doc:`topology-functions`" msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." +"The following functions modify the database directly therefore the user must " +"have special permissions given by the administrators to use them." 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." +"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:`traversal-family`" -msgstr ":doc:`traversal-family`" +msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." +msgstr "" +":doc:`pgr_createTopology` - crear una topología basada en la geometría." msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " +"source and target information." msgstr "" -":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del grafo." +":doc:`pgr_createVerticesTable` - reconstruir la tabla de vértices en base a " +"la información de origen y destino." msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." +":doc:`pgr_analyzeGraph` - to analyze the edges and vertices of the edge " +"table." msgstr "" -":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura del " -"grafo." +":doc:`pgr_analyzeGraph` - para analizar los bordes y vértices de la tabla de " +"aristas." -msgid ":doc:`components-family`" -msgstr ":doc:`components-family`" +msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." +msgstr "" +":doc:`pgr_analyzeOneWay` - para analizar la direccionalidad de las aristas." -msgid ":doc:`ordering-family`" -msgstr ":doc:`ordering-family`" - -msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " -"an undirected graph." +msgid ":doc:`pgr_nodeNetwork` - to create nodes to a not noded edge table." msgstr "" -":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no " -"dirigido." - -msgid ":doc:`metrics-family`" -msgstr ":doc:`metrics-family`" +":doc:`pgr_nodeNetwork` - para crear nodos a una tabla de aristas sin nodos." msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" +":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " +"table information." msgstr "" -":doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia " -"relativa mediante el algoritmo de Brandes" - -msgid ":doc:`TRSP-family`" -msgstr ":doc:`TRSP-family`" +":doc:`pgr_extractVertices` - Extrae información de vértices basada en la " +"tabla de aristas." -msgid "categories" -msgstr "Categorías" +msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" +msgstr ":doc:`pgr_trsp` - Camino más corto con restricción de giros (TRSP)" -msgid ":doc:`VRP-category`" -msgstr ":doc:`VRP-category`" +msgid "Utilities family" +msgstr "Utilidades - familia" -msgid "Unclassified" -msgstr "No clasificado" +msgid ":doc:`pgr_findCloseEdges`" +msgstr ":doc:`pgr_findCloseEdges`" -msgid ":doc:`pgr_bellmanFord`" -msgstr ":doc:`pgr_bellmanFord`" +msgid "Functions by categories" +msgstr "Funciones por categorías" -msgid ":doc:`pgr_dagShortestPath`" -msgstr ":doc:`pgr_dagShortestPath`" +msgid ":doc:`cost-category`" +msgstr ":doc:`cost-category`" -msgid ":doc:`pgr_edwardMoore`" -msgstr ":doc:`pgr_edwardMoore`" +msgid ":doc:`costMatrix-category`" +msgstr ":doc:`costMatrix-category`" -msgid ":doc:`pgr_isPlanar`" -msgstr ":doc:`pgr_isPlanar`" +msgid ":doc:`drivingDistance-category`" +msgstr ":doc:`drivingDistance-category`" -msgid ":doc:`pgr_stoerWagner`" -msgstr ":doc:`pgr_stoerWagner`" +msgid ":doc:`KSP-category`" +msgstr ":doc:`KSP-category`" -msgid ":doc:`pgr_topologicalSort`" -msgstr ":doc:`pgr_topologicalSort`" +msgid ":doc:`spanningTree-category`" +msgstr ":doc:`spanningTree-category`" -msgid ":doc:`pgr_transitiveClosure`" -msgstr ":doc:`pgr_transitiveClosure`" +msgid ":doc:`BFS-category`" +msgstr ":doc:`BFS-category`" -msgid ":doc:`pgr_lengauerTarjanDominatorTree`" -msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" +msgid ":doc:`DFS-category`" +msgstr ":doc:`DFS-category`" -msgid ":doc:`pgr_hawickCircuits`" -msgstr ":doc:`pgr_hawickCircuits`" +msgid "Available Functions but not official pgRouting functions" +msgstr "Funciones disponibles pero no oficiales de pgRouting" -msgid "Flow - Family of functions" -msgstr "Flow - Familia de funciones" +msgid ":doc:`proposed`" +msgstr ":doc:`proposed`" -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." -msgstr "" -":doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo " -"empuja y reetiquetado." +msgid ":doc:`experimental`" +msgstr ":doc:`experimental`" -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." -msgstr "" -":doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles del " -"flujo en aristas." +msgid ":doc:`release_notes`" +msgstr ":doc:`release_notes`" -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." -msgstr "" -":doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo del " -"flujo en aristas." +msgid "pgRouting 4.0.0 Release Notes" +msgstr "Notas de la versión de pgRouting 4.0.0" msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.0.0 `__" msgstr "" -":doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del " -"flujo en aristas." +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 4.0.0 `__" -msgid "Applications" -msgstr "Aplicaciones" +msgid "Functions promoted to official" +msgstr "Funciones promovidas a oficial" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." -msgstr "" -":doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre dos " -"grupos de vértices." +msgid "pgr_trsp" +msgstr "pgr_trsp" -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." -msgstr "" -":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de " -"coincidencia dentro de un grafo." +msgid "pgr_trspVia" +msgstr "pgr_trspVia" -msgid "Flow Functions General Information" -msgstr "Información General de las Funciones de Flujo" +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" -msgid "The graph is **directed**." -msgstr "El grafo es **dirigido**." +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" -msgid "Process is done only on edges with positive capacities." -msgstr "El proceso se realiza sólo en aristas con capacidades positivas." +msgid "pgr_withPoints" +msgstr "pgr_withPoints" -msgid "" -"When the maximum flow is 0 then there is no flow and **EMPTY SET** is " -"returned." -msgstr "" -"Cuando el flujo máximo es 0 entonces no hay flujo, se devolverá: **EMPTY " -"SET**." +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" -msgid "There is no flow when source has the same vaule as target." -msgstr "No hay flujo cuando el origen tiene el mismo valor que el destino." +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" -msgid "Any duplicated values in source or target are ignored." -msgstr "Los valores duplicados en origen o destino se ignoran." +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" -msgid "Calculates the flow/residual capacity for each edge. In the output" -msgstr "Calcula la capacidad de flujo/residuo para cada arista. En la salida" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" -msgid "Edges with zero flow are omitted." -msgstr "Se omiten las aristas con flujo cero." +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" -msgid "Creates" -msgstr "Crea" +msgid "Signatures promoted to official" +msgstr "Firmas promovidas a oficial" -msgid "a **super source** and edges from it to all the sources," -msgstr "una **super fuente** y aristas desde ella a todas las fuentes," +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(Combinaciones)" -msgid "a **super target** and edges from it to all the targetss." -msgstr "un **super objetivo** y aristas desde él a todos los objetivos." +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(Combinaciones)" -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:" -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 " -"parámetros y se puede calcular:" +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(Combinaciones)" -msgid "By aggregation of the outgoing flow from the sources" -msgstr "Mediante la suma de los flujos salientes de las fuentes" +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(Combinaciones)" -msgid "By aggregation of the incoming flow to the targets" -msgstr "Mediante la suma de los flujos llegantes a los destinos" +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(Combinaciones)" -msgid "" -":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be " -"the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :" -"doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary." -msgstr "" -":doc:`pgr_maxFlow` es el flujo máximo y este máximo tiene garantía de ser el " -"mismo en las funciones :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:" -"`pgr_boykovKolmogorov`, pero el flujo actual para cada arista puede variar." +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(Combinaciones)" -msgid "Capacity edges" -msgstr "Aristas de capacidad" +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(Combinaciones)" -msgid ":doc:`pgr_pushRelabel`" -msgstr ":doc:`pgr_pushRelabel`" +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(Combinaciones)" -msgid ":doc:`pgr_edmondsKarp`" -msgstr ":doc:`pgr_edmondsKarp`" +msgid "pgr_KSP(All signatures)" +msgstr "pgr_KSP(todas las firmas)" -msgid ":doc:`pgr_boykovKolmogorov`" -msgstr ":doc:`pgr_boykovKolmogorov`" +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov(Combinaciones)" -msgid "``reverse_capacity``" -msgstr "``reverse_capacity``" +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(Combinaciones)" -msgid "Capacity-Cost edges" -msgstr "Aristas Capacidad-Costo" +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(Combinaciones)" -msgid ":doc:`pgr_maxFlowMinCost`" -msgstr ":doc:`pgr_maxFlowMinCost`" +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(Combinaciones)" -msgid ":doc:`pgr_maxFlowMinCost_Cost`" -msgstr ":doc:`pgr_maxFlowMinCost_Cost`" +msgid "code enhancements:" +msgstr "Mejora del código:" -msgid "Capacity of the edge (``source``, ``target``)" -msgstr "Capacidad de la arista (``source``, ``target``)" +msgid "Removal of unused C/C++ code" +msgstr "Eliminación de código C/C++ no utilizado" -msgid "Capacity of the edge (``target``, ``source``)" -msgstr "Capacidad de la arista (``target``, ``source``)" +msgid "Removal of SQL deprecated functions" +msgstr "Eliminación de funciones obsoletas" -msgid "Weight of the edge (``source``, ``target``) if it exist" -msgstr "Peso de la arista (``source``, ``target``) si existe" +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "Weight of the edge (``target``, ``source``) if it exist" -msgstr "Peso de la arista (``target``, ``source``) si existe" +msgid "" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" -msgid "Cost edges" -msgstr "Aristas de costo" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid ":doc:`pgr_edgeDisjointPaths`" -msgstr ":doc:`pgr_edgeDisjointPaths`" +msgid "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "Used in" -msgstr "Usado en" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgid "**seq**" -msgstr "**seq**" +msgid "Removal of SQL deprecated internal functions" +msgstr "Eliminación de funciones internas SQL obsoletas" -msgid "``INT``" -msgstr "``INT``" +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" -msgid "**edge**" -msgstr "**arista**" +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" -msgid "Identifier of the edge in the original query (edges_sql)." -msgstr "Identificador de la arista en la consulta original(edges_sql)." +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -msgid "**start_vid**" -msgstr "**start_vid**" +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgid "**end_vid**" -msgstr "**end_vid**" +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "_pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgid "**flow**" -msgstr "**flujo**" +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" -msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)." -msgstr "" -"Flujo a través del arista en la dirección (``start_vid``, ``end_vid``)." +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgid "**residual_capacity**" -msgstr "**residual_capacity**" +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_prim(text,anyarray,text,bigint,double precision)" msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" msgstr "" -"Capacidad residual del arista en la dirección (``start_vid``, ``end_vid``)." +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" -msgid "For :doc:`pgr_maxFlowMinCost`" -msgstr "Para :doc:`pgr_maxFlowMinCost`" +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgid "**source**" -msgstr "**origen**" +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" -msgid "**target**" -msgstr "**objetivo**" +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" -msgid "Flow through the edge in the direction (source, target)." -msgstr "Flujo a través de la arista en la dirección (origen, destino)." +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "_pgr_trsp(text,text,bigint,bigint,boolean)" -msgid "Residual capacity of the edge in the direction (source, target)." -msgstr "Capacidad residual de la arista en la dirección (origen, destino)." +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" -msgid "**cost**" -msgstr "**costo**" +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." -msgstr "" -"El costo de enviar este flujo a través de la arista en la dirección (origen, " -"destino)." +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_trsp(text,text,anyarray,anyarray,boolean)" -msgid "**agg_cost**" -msgstr "**agg_cost**" +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_v4trsp(text,text,anyarray,anyarray,boolean)" -msgid "The aggregate cost." -msgstr "El costo agregado." +msgid "_v4trsp(text,text,text,boolean)" +msgstr "_v4trsp(text,text,text,boolean)" -msgid "Advanced Documentation" -msgstr "Documentación Avanzada" +msgid "Deprecation of internal C/C++ functions" +msgstr "Obsolescencia de funciones internas C/C++" + +msgid "Internal C/C++ functions in legacy" +msgstr "Funciones C/C++ internas en legado" + +msgid "All releases" +msgstr "Todas las versiones" + +msgid "Kruskal - Family of functions" +msgstr "Kruskal - Familia de funciones" 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." +"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 "" -"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." +"Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo " +"que en cada ciclo encuentra y agrega la arista del menor peso posible que " +"conecta dos árboles en el bosque." + +msgid "**The main Characteristics are:**" +msgstr "**Las características principales son:**" + +msgid "The total weight of all the edges in the tree or forest is minimized." +msgstr "Se minimiza el peso total de todos los bordes del árbol o bosque." + +msgid "Kruskal's running time: :math:`O(E * log E)`" +msgstr "Tiempo de ejecución de Kruskal: :math:`O(E * log E)`" + +msgid "Metrics - Family of functions" +msgstr "Métricas - Familia de funciones" + +msgid "Migration guide" +msgstr "Guía de migración" msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." +"Several functions are having changes on the signatures, and/or have been " +"replaced by new functions." msgstr "" -"Los algoritmos de Flujo Máximo se calculan a través del grafo del flujo " -"máximo y el flujo de cada arista." +"Varias funciones están teniendo cambios en las firmas, y/o han sido " +"remplazadas por nuevas funciones." + +msgid "Results can be different because of the changes." +msgstr "Resultados pueden ser diferentes dado los cambios." + +msgid "All deprecated functions will be removed on next major version 4.0.0" +msgstr "" +"Todas las funciones obsoletas serán removidas en las siguiente versión mayor " +"4.0.0" + +msgid "Migration of ``pgr_alphaShape``" +msgstr "Migración de ``pgr_alphaShape``" 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." +"Starting from `v3.8.0 `__" 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." +"Comenzando en `v3.8.0 `__" -msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" -msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" +msgid "**Before Deprecation:** The following was calculated:" +msgstr "**Antes de la Depreciación:** Se calculó lo siguiente:" + +msgid "An alphaShape was calculated" +msgstr "Se ha calculado un alphaShape" + +#, fuzzy +msgid "**After Deprecation:**" +msgstr "Después de la migración" + +msgid "PostGIS has two ways of generating alphaShape." +msgstr "" + +msgid "If you have SFCGAL, which you can install using" +msgstr "" msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +"Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" -"donde: :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" -msgid "Graph definition" -msgstr "Definición de grafo" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgstr "" -msgid "The weighted directed graph, :math:`G(V,E)`, is defined as:" -msgstr "El grafo ponderado dirigido, :math:`G(V,E)`, se define como:" +#, fuzzy +msgid "" +"Other PostGIS options are * `ST_ConvexHull `__ * `ST_ConcaveHull `__" +msgstr "" +"Se pueden utilizar varias funciones de PostGIS: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgid "the set of vertices :math:`V`" -msgstr "Conjunto de vértices :math:`V`" +msgid "Migration of ``pgr_createTopology``" +msgstr "Migración de ``pgr_createTopology``" + +msgid "A table with `_vertices_pgr` was created." +msgstr "Se ha creado una tabla con `_vertices_pgr`." msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" +"**After Deprecation:** The user is responsible to create the complete " +"topology." msgstr "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i " -"\\bigcuptarget_i`" +"**Después de la depreciación** El usuario es responsable de crear la " +"topología completa." + +msgid "Build a routing topology" +msgstr "Construir una topología de ruteo" msgid "" -":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}`" +"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 "" -":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}`" +"La información básica para usar la mayoría de las funciones de pgRouting " +"``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama " +"topología de ruteo." -msgid "Maximum flow problem" -msgstr "Problema de Flujo Máximo" +msgid "" +"``reverse_cost`` is optional but strongly recommended to have in order to " +"reduce the size of the database due to the size of the geometry columns. " +"Having said that, in this documentation ``reverse_cost`` is used in this " +"documentation." +msgstr "" +"``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para " +"reducir el tamaño de la base de datos debido al tamaño de las columnas de " +"geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``." -msgid ":math:`G(V,E)`" -msgstr ":math:`G(V,E)`" +msgid "" +"When the data comes with geometries and there is no routing topology, then " +"this step is needed." +msgstr "" +"Cuando los datos vienen con geometrías y no hay topología de ruteo, entonces " +"este paso es necesario." -msgid ":math:`source\\_vertex \\in V` the source vertex" -msgstr ":math:`source\\_vertex \\in V` el vértice de origen" +msgid "" +"All the start and end vertices of the geometries need an identifier that is " +"to be stored in a ``source`` and ``target`` columns of the table of the " +"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " +"traversing the edge in both directions." +msgstr "" +"Todos los vértices iniciales y finales de las geometrías necesitan un " +"identificador que se almacenará en las columnas ``source`` y ``target`` de " +"la tabla de los datos. Del mismo modo, ``cost`` y ``reverse_cost`` necesitan " +"tener el valor de atravesar la arista en ambas direcciones." -msgid ":math:`sink\\_vertex \\in V` the sink vertex" -msgstr ":math:`sink\\_vertex \\in V` el vértice pozo" +msgid "" +"If the columns do not exist they need to be added to the table in question. " +"(see `ALTER TABLE `__)" +msgstr "" +"Si las columnas no existen, hay que añadirlas a la tabla en cuestión. (véase " +"`ALTER TABLE `__)" -msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" -msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" +msgid "" +"The function :doc:`pgr_extractVertices` is used to create a vertices table " +"based on the edge identifier and the geometry of the edge of the graph." +msgstr "" +"La función :doc:`pgr_extractVertices` se utiliza para crear una tabla de " +"vértices basada en el identificador de arista y la geometría de la arista " +"del grafo." msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +"Finally using the data stored on the vertices tables the ``source`` and " +"``target`` are filled up." msgstr "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +"Finalmente, utilizando los datos almacenados en las tablas de vértices, se " +"rellenan los campos ``source`` y ``target``." + +msgid "Migration of ``pgr_createVerticesTable``" +msgstr "Migracion de ``pgr_createVerticesTable``" msgid "" -":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:" +"**After Deprecation:** The user is responsible to create the vertices table, " +"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." 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:" +"**Después de la depreciación:** El usuario es responsable de crear la tabla " +"de vértices, índices, etc. Para ello puede utilizar :doc:" +"`pgr_extractVertices`." -msgid ":math:`id_i = i`" -msgstr ":math:`id_i = i`" +msgid "Migration of ``pgr_analyzeOneWay``" +msgstr "Migración de ``pgr_analyzeOneWay``" -msgid ":math:`edge\\_id = id_i` in edges_sql" -msgstr ":math:`edge\\_id = id_i` en edges_sql" +msgid "Number of potential problems in directionality" +msgstr "Número de problemas potenciales en la dirección" -msgid ":math:`residual\\_capacity_i = capacity_i - flow_i`" -msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`" +msgid "WHERE" +msgstr "Donde" -msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" -msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" +msgid "Directionality problems were calculated based on codes." +msgstr "Los problemas de dirección se calcularon a partir de códigos." + +msgid "Dead ends." +msgstr "Callejones sin salida." msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " -"other network analysis functionality." +"A routing problem can arise when from a vertex there is only a way on or a " +"way out but not both:" msgstr "" -"pgRouting extiende la base de datos geospacial de `PostGIS `__/`PostgreSQL `__ para proporcionar " -"enrutamiento geoespacial y otras funciones de análisis de red." +"Un problema de ruteo puede surgir cuando desde un vértice sólo hay una " +"salida o una entrada, pero no ambas:" -msgid "This is the manual for pgRouting |release|." -msgstr "Este es el manual para la version |release| de pgRouting." +msgid "" +"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " +"information and determine if the adjacent edge is one way or not." +msgstr "" +"Guardando o usando directamente :doc:`pgr_extractVertices` se obtiene la " +"información de los callejones sin salida y se determina si la arista " +"adyacente es unidireccional o no." -msgid "Creative Commons Attribution-Share Alike 3.0 License" -msgstr "Licencia de Creative Commons Attribution-Share Alike 3.0" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgstr "En este ejemplo :doc:`pgr_extractVertices` ya se ha aplicado." + +msgid "Bridges." +msgstr "Puentes." msgid "" -"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." +"Another routing problem can arise when there is an edge of an undirected " +"graph whose deletion increases its number of connected components, and the " +"bridge is only one way." msgstr "" -"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` ." +"Otro problema para ruteo puede surgir cuando en un grafo no dirigido hay una " +"arista cuya eliminación aumenta el numero de componentes conectados, y el " +"puente es solo de un sentido." -msgid "General" -msgstr "General" +msgid "To determine if the bridges are or not one way." +msgstr "Para determinar si los puentes son o no unidireccionales." -msgid ":doc:`sampledata` that is used in the examples of this manual." -msgstr ":doc:`sampledata` es usado en los ejemplos de este manual." +msgid "Migration of ``pgr_analyzeGraph``" +msgstr "Migración de ``pgr_analyzeGraph``" -msgid "Pgrouting Concepts" -msgstr "Conceptos de pgRouting" +msgid "Number of isolated segments." +msgstr "Número de segmentos aislados." -msgid ":doc:`routingFunctions`" -msgstr ":doc:`routingFunctions`" +msgid "Number of dead ends." +msgstr "Cantidad de callejones sin salida." -msgid ":doc:`allpairs-family`" -msgstr ":doc:`allpairs-family`" +msgid "Number of potential gaps found near dead ends." +msgstr "" +"Número de huecos potenciales encontrados cerca de callejones sin salida." -msgid ":doc:`bdDijkstra-family`" -msgstr ":doc:`bdDijkstra-family`" +msgid "Number of intersections. (between 2 edges)" +msgstr "Número de intersecciones. (entre 2 aristas)" -msgid ":doc:`contraction-family`" -msgstr ":doc:`contraction-family`" +msgid "Graph component" +msgstr "Componente de grafo" -msgid ":doc:`dijkstra-family`" -msgstr ":doc:`dijkstra-family`" +msgid "A connected subgraph that is not part of any larger connected subgraph." +msgstr "Un sub-grafo conectando no es parte de un grafo conectado mas grande." -msgid ":doc:`kruskal-family`" -msgstr ":doc:`kruskal-family`" +msgid "Isolated segment" +msgstr "Segmento aislado" -msgid ":doc:`pgr_kruskal`" -msgstr ":doc:`pgr_kruskal`" +msgid "A graph component with only one segment." +msgstr "Un componente de grafo con un solo segmento." -msgid ":doc:`pgr_kruskalDD`" -msgstr ":doc:`pgr_kruskalDD`" +msgid "Dead ends" +msgstr "Callejones sin salida" -msgid ":doc:`prim-family`" -msgstr ":doc:`prim-family`" +msgid "A vertex that participates in only one edge." +msgstr "Un vértice que participa en una sola arista." -msgid ":doc:`pgr_prim`" -msgstr ":doc:`pgr_prim`" +msgid "gaps" +msgstr "Espacios" -msgid ":doc:`pgr_primDD`" -msgstr ":doc:`pgr_primDD`" +msgid "Space between two geometries." +msgstr "Espacio entre dos geometrías." -msgid ":doc:`reference`" -msgstr ":doc:`reference`" +msgid "Intersection" +msgstr "Intersección" -msgid ":doc:`pgr_version`" -msgstr ":doc:`pgr_version`" +msgid "Is a topological relationship between two geometries." +msgstr "Es una relación topológica entre dos geometrías." -msgid ":doc:`pgr_full_version`" -msgstr ":doc:`pgr_full_version`" +msgid "Migration." +msgstr "Migración." -msgid ":doc:`topology-functions`" -msgstr ":doc:`topology-functions`" +msgid "Components." +msgstr "Componentes." msgid "" -"The following functions modify the database directly therefore the user must " -"have special permissions given by the administrators to use them." +"Instead of counting only isolated segments, determine all the components of " +"the graph." 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." - -msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." -msgstr "" -":doc:`pgr_createTopology` - crear una topología basada en la geometría." - -msgid "" -":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." - -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." - -msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." -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 a una tabla de aristas sin nodos." - -msgid ":doc:`pgr_trsp` - 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" - -msgid ":doc:`cost-category`" -msgstr ":doc:`cost-category`" - -msgid ":doc:`costMatrix-category`" -msgstr ":doc:`costMatrix-category`" - -msgid ":doc:`drivingDistance-category`" -msgstr ":doc:`drivingDistance-category`" - -msgid ":doc:`KSP-category`" -msgstr ":doc:`KSP-category`" - -msgid ":doc:`spanningTree-family`" -msgstr ":doc:`spanningTree-family`" - -msgid ":doc:`BFS-category`" -msgstr ":doc:`BFS-category`" - -msgid ":doc:`DFS-category`" -msgstr ":doc:`DFS-category`" - -msgid "Available Functions but not official pgRouting functions" -msgstr "Funciones disponibles pero no oficiales de pgRouting" - -msgid ":doc:`proposed`" -msgstr ":doc:`proposed`" - -msgid ":doc:`experimental`" -msgstr ":doc:`experimental`" - -msgid ":doc:`release_notes`" -msgstr ":doc:`release_notes`" - -msgid "pgRouting 3.7.0 Release Notes" -msgstr "Notas de la versión de pgRouting 3.7.0" - -msgid "" -"To see all issues & pull requests closed by this release see the `Git closed " -"milestone for 3.7.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.0 `_" - -msgid "Support" -msgstr "Soporte" - -msgid "" -"`#2656 `__ Stop support of " -"PostgreSQL12 on pgrouting v3.7" -msgstr "" -"`#2656 `__ PostgreSQL 12 " -"no se apya en pgrouting v3.7" - -msgid "Stopping support of PostgreSQL 12" -msgstr "PostgreSQL 12 ya no es soportado" - -msgid "CI does not test for PostgreSQL 12" -msgstr "CI no hace pruebas con PostgreSQL 12" - -msgid "New experimental functions" -msgstr "Nuevas funciones experimentales" - -msgid "Metrics" -msgstr "Métricas" - -msgid "pgr_betweennessCentrality" -msgstr "pgr_betweennessCentrality" - -msgid "Official functions changes" -msgstr "Cambios en las funciones oficiales" - -msgid "" -"`#2605 `__ Standarize " -"spanning tree functions output" -msgstr "" -"`#2605 `__ Estandarización " -"de las salida de las funciones de árbol de expansión" - -msgid "Functions:" -msgstr "Funciones:" - -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" - -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" - -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" - -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" - -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" - -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" - -msgid "Standarizing output columns to |result-spantree|" -msgstr "Estandarización de columnas de resultados a |result-spantree|" - -msgid "Added ``pred`` result columns." -msgstr "Agregado columna de resultados ``pred``." - -msgid "Experimental promoted to proposed." -msgstr "Experimental promovido a propuesto." +"En lugar de contar sólo segmentos aislados, determinar todos los componentes " +"del grafo." -msgid "" -"`#2635 `__ pgr_LineGraph " -"ignores directed flag and use negative values for identifiers." -msgstr "" -"`#2635 `__ pgr_LineGraph " -"ignora la bandera directed y usa valores negatives para identificadores." +msgid "Depending of the final application requirements use:" +msgstr "Dependiendo de los requisitos de la aplicación final utilizar:" -msgid "``pgr_lineGraph``" -msgstr "``pgr_lineGraph``" +msgid ":doc:`pgr_connectedComponents`" +msgstr ":doc:`pgr_connectedComponents`" -msgid "Promoted to **proposed** signature." -msgstr "Promovido a firma **propuesta**." +msgid ":doc:`pgr_strongComponents`" +msgstr ":doc:`pgr_strongComponents`" -msgid "Works for directed and undirected graphs." -msgstr "Funciona para grafos dirigidos y no dirigidos." +msgid ":doc:`pgr_biconnectedComponents`" +msgstr ":doc:`pgr_biconnectedComponents`" -msgid "Code enhancement" -msgstr "Mejora del código" +msgid "For example:" +msgstr "Por ejemplo:" msgid "" -"`#2599 `__ Driving " -"distance cleanup" +"Instead of counting the dead ends, determine all the dead ends of the graph " +"using :doc:`pgr_degree`." msgstr "" -"`#2599 `__ Limpieza de la " -"distancia de conducción" +"En lugar de contar los callejones sin salida, determine todos los callejones " +"sin salida del grafo utilizando :doc:`pgr_degree`." -msgid "" -"`#2607 `__ Read postgresql " -"data on C++" +msgid "Potential gaps near dead ends." msgstr "" -"`#2607 `__ Leer datos " -"postgresql en C++" msgid "" -"`#2614 `__ Clang tidy does " -"not work" +"Instead of counting potential gaps between geometries, determine the " +"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" -"`#2614 `__ Clang tidy no " -"funciona" - -msgid "All releases" -msgstr "Todas las versiones" - -msgid "Kruskal - Family of functions" -msgstr "Kruskal - Familia de funciones" -msgid "Boost Graph Inside" -msgstr "Adentro: Boost Graph" +msgid "Topological relationships." +msgstr "Relaciones topológicas." 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." +"Instead of counting intersections, determine topological relationships " +"between geometries." msgstr "" -"Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo " -"que en cada ciclo encuentra y agrega la arista del menor peso posible que " -"conecta dos árboles en el bosque." - -msgid "**The main Characteristics are:**" -msgstr "**Las características principales son:**" - -msgid "The total weight of all the edges in the tree or forest is minimized." -msgstr "Se minimiza el peso total de todos los bordes del árbol o bosque." - -msgid "Kruskal's running time: :math:`O(E * log E)`" -msgstr "Tiempo de ejecución de Kruskal: :math:`O(E * log E)`" - -msgid "Metrics - Family of functions" -msgstr "Métricas - Familia de funciones" - -msgid "Migration guide" -msgstr "Guía de migración" msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." -msgstr "" -"Varias funciones están teniendo cambios en las firmas, y/o han sido " -"remplazadas por nuevas funciones." - -msgid "Results can be different because of the changes." -msgstr "Resultados pueden ser diferentes dado los cambios." - -msgid "All deprecated functions will be removed on next mayor version 4.0.0" +"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgstr "" -"Todas las funciones obsoletas serán removidas en las siguiente versión mayor " -"4.0.0" - -msgid "Migration of functions" -msgstr "Migración de funciones" - -msgid "Migrating functions" -msgstr "Migrando funciones" +"Se pueden utilizar varias funciones de PostGIS: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgid "Migration of ``pgr_aStar``" msgstr "Migración de ``pgr_aStar``" @@ -5263,7 +5030,7 @@ msgstr "En ``pgr_dijkstra`` (`Muchos a Uno`)" msgid "If needed add the new columns, for example:" msgstr "Si es necesario, añadir las nuevas columnas, por ejemplo:" -msgid "Migration of ``pgr_drivingdistance``" +msgid "Migration of ``pgr_drivingDistance``" msgstr "Migración de ``pgr_drivingDistance``" msgid "" @@ -5285,11 +5052,11 @@ msgstr "a" msgid "|result-spantree|" msgstr "|result-spantree|" -msgid "``pgr_drivingdistance`` (Single vertex)" -msgstr "``pgr_drivingDistance`` (Vértice único)" +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance(Vértice único)" -msgid "``pgr_drivingdistance`` (Multiple vertices)" -msgstr "``pgr_drivingDistance`` (Múltiples vértices)" +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance(Múltiples vértices)" msgid "Output columns were |result-dij-dd|" msgstr "Columnas de resultados eran |old-generic-result|" @@ -5363,12 +5130,21 @@ msgstr "" msgid "|result-bfs|" msgstr "|result-bfs|" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" + msgid "Single vertex" msgstr "Vértice único" msgid "Multiple vertices" msgstr "Múltiples vértices" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" + +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" + msgid "Output columns were |result-bfs|" msgstr "Las columnas de salida fueron |result-bfs|" @@ -5550,6 +5326,15 @@ msgstr "" "estandarizan las columnas de resultados :doc:`pgr_primDD`, :doc:" "`pgr_primBFS` y :doc:`pgr_primDFS`." +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" + +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" + +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" + msgid "Prim single vertex" msgstr "Prim vértice único" @@ -5779,43 +5564,160 @@ msgstr "" "Si es necesario, filtrar las columnas adicionales, por ejemplo, para " "devolver las columnas originales:" -msgid "Migration of turn restrictions" -msgstr "Migración de las restricciones de giro" +msgid "Migration of ``pgr_trsp`` (Vertices)" +msgstr "Migración de `pgr_trsp`` (Vértices)" -msgid "Migration of restrictions" -msgstr "Migración de restricciones" +msgid "Signature:" +msgstr "Firma:" -msgid "The structure of the restrictions have changed:" -msgstr "La estructura de las restricciones ha cambiado:" +msgid "Deprecated" +msgstr "Obsoleto" -msgid "Old restrictions structure" -msgstr "Estructura de restricciones vieja" +msgid "`v3.4.0 `__" +msgstr "`v3.4.0 `__" -msgid "On the deprecated signatures:" -msgstr "Sobre las firmas obsoletas:" +msgid "Removed" +msgstr "Eliminado" -msgid "Column ``rid`` is ignored" -msgstr "La columna ``rid`` es ignorada" +msgid "`v4.0.0 `__" +msgstr "`v4.0.0 `__" -msgid "``via_path``" -msgstr "``via_path``" +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_dijkstra`" -msgid "Must be in reverse order." -msgstr "Debe de estar en orden reverso." +msgid ":doc:`pgr_trsp`" +msgstr ":doc:`pgr_trsp`" -msgid "Is of type ``TEXT``." -msgstr "Es de tipo ``TEXT``." +msgid "`Migration of restrictions`_" +msgstr "`Migración de restricciones`_" -msgid "When more than one via edge must be separated with ``,``." -msgstr "Cuando hay más de una arista debe de ser separada con ``,``." +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr "Usar ``pgr_dijkstra`` cuando no hay restricciones." -msgid "``target_id``" -msgstr "``target_id``" +msgid "Use :doc:`pgr_dijkstra` instead." +msgstr "Usa en vez :doc:`pgr_dijkstra`." -msgid "Is the last edge of the forbidden path." -msgstr "Es la última arista del camino prohibido." +msgid "To get the original column names:" +msgstr "Para obtener los nombres originales de las columnas:" -msgid "Is of type ``INTEGER``." +msgid "``id1`` is the node" +msgstr "``id1`` es el nodo" + +msgid "``id2`` is the edge" +msgstr "``id2`` es la arista" + +msgid "Use ``pgr_trsp`` when there are restrictions." +msgstr "Usar ``pgr_trspVia`` cuando hay restricciones." + +msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)." + +msgid "Migration of ``pgr_trsp`` (Edges)" +msgstr "Migración de ``pgr_trsp`` (Aristas)" + +msgid ":doc:`pgr_withPoints`" +msgstr ":doc:`pgr_withPoints`" + +msgid ":doc:`pgr_trsp_withPoints`" +msgstr ":doc:`pgr_trsp_withPoints`" + +msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgstr "Usar ``pgr_withPoints`` cuando no hay restricciones." + +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "Utilizar en su lugar :doc:`pgr_withPoints` (Uno a Uno)." + +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgstr "Usar ``pgr_trsp_withPoints`` cuando hay restricciones." + +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`." + +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "Migraciones de ``pgr_trspViaVertices``" + +msgid ":doc:`pgr_dijkstraVia`" +msgstr ":doc:`pgr_dijkstraVia`" + +msgid ":doc:`pgr_trspVia`" +msgstr ":doc:`pgr_trspVia`" + +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr "Usar ``pgr_dijkstraVia`` cuando no hay restricciones" + +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "Usar :doc:`pgr_dijkstraVia` en su lugar." + +msgid "``id1`` is the path identifier" +msgstr "``id1`` es el identificador de camino" + +msgid "``id2`` is the node" +msgstr "``id2`` es el nodo" + +msgid "``id3`` is the edge" +msgstr "``id3`` es la arista" + +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "Usar ``pgr_trspVia`` cuando hay restricciones" + +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "Usar :doc:`pgr_trspVia` en su lugar." + +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "Migración de ``pgr_trspViaEdges``" + +msgid ":doc:`pgr_withPointsVia`" +msgstr ":doc:`pgr_withPointsVia`" + +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" + +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr "Usar ``pgr_withPointsVia`` cuando no hay restricciones" + +msgid "Use :doc:`pgr_withPointsVia` instead." +msgstr "Usar :doc:`pgr_withPointsVia` en su lugar." + +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "Usar ``pgr_trspVia_withPoints`` cuando hay restricciones" + +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "Usar :doc:`pgr_trspVia_withPoints` en su lugar." + +msgid "Migration of restrictions" +msgstr "Migración de restricciones" + +msgid "The structure of the restrictions have changed:" +msgstr "La estructura de las restricciones ha cambiado:" + +msgid "Old restrictions structure" +msgstr "Estructura de restricciones vieja" + +msgid "On the deprecated signatures:" +msgstr "Sobre las firmas obsoletas:" + +msgid "Column ``rid`` is ignored" +msgstr "La columna ``rid`` es ignorada" + +msgid "``via_path``" +msgstr "``via_path``" + +msgid "Must be in reverse order." +msgstr "Debe de estar en orden reverso." + +msgid "Is of type ``TEXT``." +msgstr "Es de tipo ``TEXT``." + +msgid "When more than one via edge must be separated with ``,``." +msgstr "Cuando hay más de una arista debe de ser separada con ``,``." + +msgid "``target_id``" +msgstr "``target_id``" + +msgid "Is the last edge of the forbidden path." +msgstr "Es la última arista del camino prohibido." + +msgid "Is of type ``INTEGER``." msgstr "Es de tipo de ``INTEGER``." msgid "``to_cost``" @@ -5935,257 +5837,6 @@ msgstr "Se eliminara en la próxima versión mayor 4.0.0" msgid "The migrated table contents:" msgstr "El contenido de la tabla de migración:" -msgid "Migration of ``pgr_trsp`` (Vertices)" -msgstr "Migración de `pgr_trsp`` (Vértices)" - -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 " -"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 "The integral type of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "El tipo integral de ``Edges SQL`` sólo puede ser ``INTEGER``." - -msgid "The floating point type of the ``Edges SQL`` can only be ``FLOAT``." -msgstr "El tipo de punto flotante del ``Edges SQL`` solo puede ser ``FLOAT``." - -msgid "``directed`` flag is compulsory." -msgstr "La bandera ``directed`` es obligatoria." - -msgid "Does not autodetect if ``reverse_cost`` column exist." -msgstr "No auto-detecta si la columna``reverse_cost`` existe." - -msgid "" -"User must be careful to match the existence of the column with the value of " -"``has_rcost`` parameter." -msgstr "" -"El usuario debe de tener cuidado al coincidir la existencia de la columna " -"con el valor del parámetro ``has_rcost``." - -msgid "The restrictions inner query is optional." -msgstr "Las restricciones de consulta interna son opcionales." - -msgid "The output column names are meaningless" -msgstr "Los nombres de la columna de salida no tienen importancia" - -msgid "Migrate by using:" -msgstr "Migra al user:" - -msgid ":doc:`pgr_dijkstra` when there are no restrictions," -msgstr ":doc:`pgr_dijkstra` cuando no hay restricciones," - -msgid ":doc:`pgr_trsp` (One to One) when there are restrictions." -msgstr ":doc:`pgr_trsp` (Uno a Uno) cuando hay restricciones." - -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_dijkstra``" -msgstr "Migrar ``pgr_trsp`` (Vértices) usando ``pgr_dijkstra``" - -msgid "The following query does not have restrictions." -msgstr "La siguiente consulta no tiene restricciones." - -msgid "A message about deprecation is shown" -msgstr "Un mensaje sobre lo obsoleto se enseña" - -msgid "Deprecated functions will be removed on the next mayor version 4.0.0" -msgstr "Funciones obsoletas se eliminaran en la siguiente versión mayor 4.0.0" - -msgid "Use :doc:`pgr_dijkstra` instead." -msgstr "Usa en vez :doc:`pgr_dijkstra`." - -msgid "The types casting has been removed." -msgstr "Se han eliminado la fundición de tipos." - -msgid ":doc:`pgr_dijkstra`:" -msgstr ":doc:`pgr_dijkstra`:" - -msgid "Autodetects if ``reverse_cost`` column is in the edges SQL." -msgstr "Auto-detecta si la columna``reverse_cost`` está en la SQL de aristas." - -msgid "Accepts ``ANY-INTEGER`` on integral types" -msgstr "Acepta ``ANY-INTEGER`` sobre tipos integrales" - -msgid "Accepts ``ANY-NUMERICAL`` on floating point types" -msgstr "Acepta ``ANY-NUMERICAL`` sobre tipos de puntos flotantes" - -msgid "``directed`` flag has a default value of ``true``." -msgstr "La bandera ``directed`` tiene valor de facto de ``true``." - -msgid "Use the same value that on the original query." -msgstr "Usa el mismo valor de la consulta original." - -msgid "In this example it is ``true`` which is the default value." -msgstr "En este ejemplo ``true`` que es el valor de facto." - -msgid "The flag has been omitted and the default is been used." -msgstr "Se ha omitido la bandera y se ha utilizado el valor por defecto." - -msgid "" -"When the need of using strictly the same (meaningless) names and types of " -"the function been migrated then:" -msgstr "" -"Cuando la necesidad de utilizar estrictamente los mismos nombres (sin " -"importancia) y los tipos de la función han sido migradas entonces:" - -msgid "``id1`` is the node" -msgstr "``id1`` es el nodo" - -msgid "``id2`` is the edge" -msgstr "``id2`` es la arista" - -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_trsp``" -msgstr "Migrando ``pgr_trsp`` (Vértices) usando ``pgr_trsp``" - -msgid "The following query has restrictions." -msgstr "La siguiente consulta tiene restricciones." - -msgid "The restrictions are the last parameter of the function" -msgstr "Las restricciones son el último parámetro de la función" - -msgid "Using the old structure of restrictions" -msgstr "Usando la antigua estructura de restricciones" - -msgid "Use :doc:`pgr_trsp` (One to One) instead." -msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)." - -msgid "The new structure of restrictions is been used." -msgstr "La nueva estructura de restricciones han sido utilizados." - -msgid "It is the second parameter." -msgstr "Es el segundo parámetro." - -msgid ":doc:`pgr_trsp`:" -msgstr ":doc:`pgr_trsp`:" - -msgid "Migration of ``pgr_trsp`` (Edges)" -msgstr "Migración de ``pgr_trsp`` (Aristas)" - -msgid "The integral types of the ``sql`` can only be ``INTEGER``." -msgstr "Los tipos integrales de ``sql`` solo pueden ser ``INTEGER``." - -msgid "The floating point type of the ``sql`` can only be ``FLOAT``." -msgstr "El tipo de punto flotante del ``sql`` solo pueden ser ``FLOAT``." - -msgid "For these migration guide the following points will be used:" -msgstr "Para los siguientes puntos la guía de migración se utilizara:" - -msgid ":doc:`pgr_withPoints` when there are no restrictions," -msgstr ":doc:`pgr_withPoints` cuando no hay restricciones," - -msgid ":doc:`pgr_trsp_withPoints` (One to One) when there are restrictions." -msgstr ":doc:`pgr_trsp_withPoints` (Uno a Uno) cuando hay restricciones." - -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_withPoints``" -msgstr "Migrando ``pgr_trsp`` (Aristas) usando ``pgr_withPoints``" - -msgid "Use :doc:`pgr_withPoints` instead." -msgstr "Utilizar en su lugar :doc:`pgr_withPoints`." - -msgid "Do not show details, as the deprecated function does not show details." -msgstr "No enseña detalles, pues las funciones obsoletas no enseñan detalles." - -msgid ":doc:`pgr_withPoints`:" -msgstr ":doc:`pgr_withPoints`:" - -msgid "On the points query do not include the ``side`` column." -msgstr "La consulta de puntos con incluye la columna ``side``." - -msgid "" -"When the need of using strictly the same (meaningless) names and types, and " -"node values of the function been migrated then:" -msgstr "" -"Cuando la necesidad de utilizar estrictamente los mismos nombres (sin " -"importancia) y tipos , y los valores de nodo de la función han sido migradas " -"entonces:" - -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints``" -msgstr "Migrando``pgr_trsp`` (Aristas) utilizando ``pgr_trsp_withPoints``" - -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`." - -msgid ":doc:`pgr_trsp_withPoints`:" -msgstr ":doc:`pgr_trsp_withPoints`:" - -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "Migraciones de ``pgr_trspViaVertices``" - -msgid "The integral types of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "" -"Los tipos enteros de las ``Consultas de Aristas`` solo pueden ser " -"``ENTEROS``." - -msgid ":doc:`pgr_dijkstraVia` when there are no restrictions," -msgstr ":doc:`pgr_dijkstraVia` cuando no hay restricciones," - -msgid ":doc:`pgr_trspVia` when there are restrictions." -msgstr ":doc:`pgr_trspVia` cuando hay restricciones." - -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_dijkstraVia``" -msgstr "Migrando ``pgr_trspViaVertices`` usando ``pgr_dijkstraVia``" - -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "Usar :doc:`pgr_dijkstraVia` en su lugar." - -msgid ":doc:`pgr_dijkstraVia`:" -msgstr ":doc:`pgr_dijkstraVia`:" - -msgid "``id1`` is the path identifier" -msgstr "``id1`` es el identificador de camino" - -msgid "``id2`` is the node" -msgstr "``id2`` es el nodo" - -msgid "``id3`` is the edge" -msgstr "``id3`` es la arista" - -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_trspVia``" -msgstr "Migrando ``pgr_trspViaVertices`` usando ``pgr_trspVia``" - -msgid "Use :doc:`pgr_trspVia` instead." -msgstr "Usar :doc:`pgr_trspVia` en su lugar." - -msgid ":doc:`pgr_trspVia`:" -msgstr ":doc:`pgr_trspVia`:" - -msgid "Migration of ``pgr_trspViaEdges``" -msgstr "Migración de ``pgr_trspViaEdges``" - -msgid "" -"And will travel thru the following Via points :math:" -"`4\\rightarrow3\\rightarrow6`" -msgstr "" -"Viajará a travez de los siguientes puntos de la vía :math:" -"`4\\rightarrow3\\rightarrow6`" - -msgid ":doc:`pgr_withPointsVia` when there are no restrictions," -msgstr ":doc:`pgr_withPointsVia` cuando no hay restricciones," - -msgid ":doc:`pgr_trspVia_withPoints` when there are restrictions." -msgstr ":doc:`pgr_trspVia_withPoints` cuando hay restricciones." - -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_withPointsVia``" -msgstr "Migrando ``pgr_trspViaEdges`` usando ``pgr_withPointsVia``" - -msgid "Use :doc:`pgr_withPointsVia` instead." -msgstr "Usar :doc:`pgr_withPointsVia` en su lugar." - -msgid ":doc:`pgr_withPointsVia`:" -msgstr ":doc:`pgr_withPointsVia`:" - -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_trspVia_withPoints``" -msgstr "Migrando ``pgr_trspViaEdges`` usando ``pgr_trspVia_withPoints``" - -msgid "Use :doc:`pgr_trspVia_withPoints` instead." -msgstr "Usar :doc:`pgr_trspVia_withPoints` en su lugar." - -msgid ":doc:`pgr_trspVia_withPoints`:" -msgstr ":doc:`pgr_trspVia_withPoints`:" - msgid ":doc:`withPoints-category`" msgstr ":doc:`withPoints-category`" @@ -6370,9 +6021,6 @@ msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" msgstr "Grafo con ``cost`` y ``reverse_cost``" -msgid "The weighted directed graph, :math:`G_d(V,E)`, is defined by:" -msgstr "El ponderado del grafo dirigido, :math:`G_d(V,E)`, se define por:" - msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" @@ -6717,98 +6365,29 @@ msgstr "" "Consultar la documentación de `PostgreSQL `__ y la documentación de `PostGIS `__." -msgid "Build a routing topology" -msgstr "Construir una topología de ruteo" - msgid "" -"The basic information to use the majority of the pgRouting functions ``id, " -"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " -"routing topology." +"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 "" -"La información básica para usar la mayoría de las funciones de pgRouting " -"``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama " -"topología de ruteo." +"Los datos procedentes de OSM y utilizando ``osm2pgrouting `__ como herramienta de importación, vienen con " +"la topología de ruteo. Ver un ejemplo de uso de ``osm2pgrouting`` en el " +"`workshop `__." + +msgid "Adjust costs" +msgstr "Ajustar los costes" 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." +"For this example the ``cost`` and ``reverse_cost`` values are going to be " +"the double of the length of the geometry." msgstr "" -"``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para " -"reducir el tamaño de la base de datos debido al tamaño de las columnas de " -"geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``." - -msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." -msgstr "" -"Cuando los datos vienen con geometrías y no hay topología de ruteo, entonces " -"este paso es necesario." - -msgid "" -"All the start and end vertices of the geometries need an identifier that is " -"to be stored in a ``source`` and ``target`` columns of the table of the " -"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " -"traversing the edge in both directions." -msgstr "" -"Todos los vértices iniciales y finales de las geometrías necesitan un " -"identificador que se almacenará en las columnas ``source`` y ``target`` de " -"la tabla de los datos. Del mismo modo, ``cost`` y ``reverse_cost`` necesitan " -"tener el valor de atravesar la arista en ambas direcciones." - -msgid "" -"If the columns do not exist they need to be added to the table in question. " -"(see `ALTER TABLE `__)" -msgstr "" -"Si las columnas no existen, hay que añadirlas a la tabla en cuestión. (véase " -"`ALTER TABLE `__)" - -msgid "" -"The function :doc:`pgr_extractVertices` is used to create a vertices table " -"based on the edge identifier and the geometry of the edge of the graph." -msgstr "" -"La función :doc:`pgr_extractVertices` se utiliza para crear una tabla de " -"vértices basada en el identificador de arista y la geometría de la arista " -"del grafo." - -msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." -msgstr "" -"Finalmente, utilizando los datos almacenados en las tablas de vértices, se " -"rellenan los campos ``source`` y ``target``." - -msgid "See :doc:`sampledata` for an example for building a topology." -msgstr "" -"Consulte :doc:`sampledata` para ver un ejemplo de construcción de una " -"topología." - -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 `__." -msgstr "" -"Los datos procedentes de OSM y utilizando ``osm2pgrouting `__ como herramienta de importación, vienen con " -"la topología de ruteo. Ver un ejemplo de uso de ``osm2pgrouting`` en el " -"`workshop `__." - -msgid "Adjust costs" -msgstr "Ajustar los costes" - -msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." -msgstr "" -"Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el " -"doble de la longitud de la geometría." - -msgid "Update costs to length of geometry" -msgstr "Actualizar los costes a la longitud de la geometría" +"Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el " +"doble de la longitud de la geometría." + +msgid "Update costs to length of geometry" +msgstr "Actualizar los costes a la longitud de la geometría" msgid "" "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " @@ -7173,28 +6752,38 @@ msgstr "" "En :doc:`contraction-family` se describe un método completo sobre cómo " "contraer y cómo utilizar el grafo contraído" -msgid "Dead ends" -msgstr "Callejones sin salida" - msgid "To get the dead ends:" msgstr "Para obtener los callejones sin salida:" +msgid "A dead end happens when" +msgstr "Un callejón sin salida se produce cuando" + msgid "" -"That information is correct, for example, when the dead end is on the limit " -"of the imported graph." +"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" -"Esa información es correcta, por ejemplo, cuando el punto muerto está en el " -"límite del gráfico importado." +"El vértice es el límite de un callejón sin salida, una vía de no paso o una " +"vía de no salida." + +msgid "The vertex is on the limit of the imported graph." +msgstr "El vértice esta en el limite del grafo importado." + +msgid "If a larger graph is imported then the vertex might not be a dead end" +msgstr "" +"Si se importa un grafo más grande, puede que el vértice no sea un callejón " +"sin salida." msgid "" -"Visually node :math:`4` looks to be as start/ending of 3 edges, but it is " -"not." +"Node :math:`4`, is a dead end on the query, even that it visually looks like " +"an end point of 3 edges." msgstr "" -"Visualmente el nodo :math:`4` parece ser el inicio/final de 3 aristas, pero " -"no lo es." +"El nodo :math:`4`, es un callejón sin salida en la consulta, aunque " +"visualmente parezca un punto final de 3 aristas." + +msgid "Is node :math:`4` a dead end or not?" +msgstr "¿Es el nodo :math:`4` un callejón sin salida o no?" -msgid "Is that correct?" -msgstr "¿Es correcto?" +msgid "The answer to that question will depend on the application." +msgstr "La respuesta a esta pregunta dependerá de la aplicación." msgid "Is there such a small curb:" msgstr "Hay un bordillo tan pequeño:" @@ -7223,12 +6812,16 @@ msgstr "" "¿Hay un gran acantilado y desde la vista de las águilas parece que el " "callejón sin salida está cerca del segmento?" +msgid "Depending on the answer, modification of the data might be needed." +msgstr "Dependiendo de la respuesta, será necesario la modificación de datos." + msgid "" -"When there are many dead ends, to speed up, the :doc:`contraction-family` " -"functions can be used to divide the problem." +"When there are many dead ends, to speed up processing, the :doc:`contraction-" +"family` functions can be used to contract the graph." msgstr "" -"Cuando hay muchos callejones sin salida, para acelerar, se pueden utilizar " -"las funciones de :doc:`contraction-family` para dividir el problema." +"Cuando hay muchos callejones sin salida, para acelerar el procesamiento, se " +"pueden utilizar las funciones de :doc:`contraction-family` para contraer el " +"grafo." msgid "Linear edges" msgstr "Bordes lineales" @@ -7237,18 +6830,20 @@ msgid "To get the linear edges:" msgstr "Para obtener las aristas lineales:" msgid "" -"This information is correct, for example, when the application is taking " -"into account speed bumps, stop signals." +"These linear vertices are correct, for example, when those the vertices are " +"speed bumps, stop signals and the application is taking them into account." msgstr "" -"Esta información es correcta, por ejemplo, cuando la aplicación tiene en " -"cuenta los topes o las señales de stop." +"Estos vértices lineales son correctos, por ejemplo, cuando esos vértices son " +"badenes, señales de alto y la aplicación los tiene en cuenta." msgid "" -"When there are many linear edges, to speed up, the :doc:`contraction-family` " -"functions can be used to divide the problem." +"When there are many linear vertices, that need not to be taken into account, " +"to speed up the processing, the :doc:`contraction-family` functions can be " +"used to contract the problem." msgstr "" -"Cuando hay muchas aristas lineales, para acelerar, se pueden utilizar las " -"funciones :doc:`contraction-family` para dividir el problema." +"Cuando hay muchas aristas lineales, que no necesitan tomarse en cuenta, para " +"acelerar el procesamiento se pueden utilizar las funciones :doc:`contraction-" +"family` para contraer el grafo." msgid "Function's structure" msgstr "Estructura de la función" @@ -7546,9 +7141,6 @@ msgstr "" msgid "Parameters for the Via functions" msgstr "Párametros para las funciones Via" -msgid ":doc:`pgr_dijkstraVia`" -msgstr ":doc:`pgr_dijkstraVia`" - msgid "SQL query as described." msgstr "Consulta SQL como se describe." @@ -7597,9 +7189,6 @@ msgstr "" msgid "For the TRSP functions" msgstr "Para las funciones de TRSP" -msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_trsp`" - msgid "Array of identifiers of destination vertices." msgstr "Arreglo de identificadores de vértices destino." @@ -7663,9 +7252,6 @@ msgstr "" msgid "Used in functions the following:" msgstr "Se utiliza en las funciones siguientes:" -msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_withPoints`" - msgid "" "Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " "agg_cost)``" @@ -7832,6 +7418,12 @@ msgstr "" "En este ejemplo, usar una consulta SQL interna que no incluya algunas " "aristas en la función de ruteo y dentro del área de los resultados." +msgid "Given this area:" +msgstr "Dada esta área:" + +msgid "Calculate a route:" +msgstr "Calcular una ruta:" + msgid "How to contribute" msgstr "Cómo contribuir" @@ -7865,8 +7457,8 @@ msgstr "" "`Ejemplo `__" -msgid "Adding Functionaity to pgRouting" -msgstr "Agregar funcionalidad a pgRouting" +msgid "Adding Functionality to pgRouting" +msgstr "Agregando Funcionalidad a pgRouting" msgid "" "Consult the `developer's documentation `__" +msgstr "" +"Usando `Boost: Algoritmo de aproximación Métrica de TSP `__" msgid "" "The Simulated Annealing Algorithm related parameters are ignored: " @@ -9016,8 +8627,8 @@ msgstr "Versión 3.0.0" msgid "Name change from pgr_eucledianTSP" msgstr "Cambio de nombre de pgr_eucledianTSP" -msgid "New **Official** function" -msgstr "Nueva función **Oficial**" +msgid "New official function." +msgstr "Nueva función oficial." msgid "" "Any duplicated identifier will be ignored. The coordinates that will be kept" @@ -9112,59 +8723,51 @@ msgstr "" "uwaterloo.ca/tsp/world/witour.html>`__ y la segunda imagen es la solución " "obtenida con ``pgr_TSPeuclidean``." -msgid ":doc:`sampledata` network." -msgstr ":doc:`sampledata` ." - msgid "``pgr_aStar``" msgstr "``pgr_aStar``" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "``pgr_aStar`` — La ruta más corta utilizando el algoritmo A*." +msgid "Combinations signature promoted to official." +msgstr "Firmas de combinaciones promovidas a oficial." + msgid "Standarizing output columns to |short-generic-result|" msgstr "Estandarización de las columnas de salida a |short-generic-result|" -msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -"``pgr_aStar`` (`Uno a Uno`_) ha añadido las columnas ``start_vid`` y " -"``end_vid``." +"pgr_aStar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_aStar`` (`Uno a Muchos`_) ha añadido la columna ``end_vid``." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(Uno a Muchos) ha añadido la columna ``end_vid``." -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`Muchos a Uno`_) ha añadido la columna ``start_vid``." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(Muchos a Uno) ha añadido la columna ``start_vid``." msgid "Version 3.2.0" msgstr "Versión 3.2.0" -msgid "New **proposed** signature:" -msgstr "Nueva firma **propuesta**:" +msgid "New proposed signature:" +msgstr "Nuevas firmas propuesta:" -msgid "``pgr_aStar`` (`Combinations`_)" -msgstr "``pgr_aStar`` (`Combinaciones`_)" +msgid "Function promoted to official." +msgstr "Función promovida a oficial." msgid "Version 2.4.0" msgstr "Versión 2.4.0" -msgid "New **Proposed** signatures:" -msgstr "Nuevas firmas **propuestas**:" - -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "``pgr_aStar`` (`Uno a Muchos`_)" - -msgid "``pgr_aStar`` (`Many to One`_)" -msgstr "``pgr_aStar`` (`Muchos a Uno`_)" +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(Uno a Muchos)" -msgid "``pgr_aStar`` (`Many to Many`_)" -msgstr "``pgr_aStar`` (`Muchos a Muchos`_)" +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(Muchos a Uno)" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" -msgstr "Cambio de firma en ``pgr_astar`` (`Uno a Uno`_)" +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(Muchos a Muchos)" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" -msgstr "**Oficial** ``pgr_aStar`` (`Uno a Uno`_)" +msgid "Signature change on pgr_aStar(One to One)" +msgstr "Cambio de firma en pgr_aStar(Uno a Uno)" msgid "" "The results are equivalent to the union of the results of the `pgr_aStar(` " @@ -9256,8 +8859,8 @@ msgstr "Ejemplo 3" msgid "Manually assigned vertex combinations." msgstr "Manualmente asignar combinaciones de vértices." -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" msgid "" "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." @@ -9265,11 +8868,8 @@ msgstr "" "``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo " "A*." -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" - -msgid "New **proposed** function" -msgstr "Nueva función **propuesta**" +msgid "New proposed function." +msgstr "Nueva función propuesta." msgid "" "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " @@ -9381,6 +8981,12 @@ msgstr "``pgr_alphaShape``" msgid "``pgr_alphaShape`` — Polygon part of an alpha shape." msgstr "``pgr_alphaShape`` —Parte poligonal de una forma alfa." +msgid "Version 3.8.0" +msgstr "Versión 3.8.0" + +msgid "Deprecated function." +msgstr "Función obsoleta." + msgid "Breaking change on signature" msgstr "Cambio de ruptura en la firma" @@ -9476,1944 +9082,2404 @@ msgstr "GEOMETRY COLLECTION" msgid "A Geometry collection of Polygons" msgstr "Una colección de Geometría de Polígonos" -msgid ":doc:`pgr_drivingDistance`" -msgstr ":doc:`pgr_drivingDistance`" +msgid ":doc:`pgr_drivingDistance`" +msgstr ":doc:`pgr_drivingDistance`" + +msgid "`ST_ConcaveHull `__" +msgstr "`ST_ConcaveHull `__" + +msgid "``pgr_analyzeGraph`` -- Deprecated since 3.8.0" +msgstr "``pgr_analyzeGraph`` -- Obsoleto desde 3.8.0" + +msgid "``pgr_analyzeGraph`` — Analyzes the network topology." +msgstr "``pgr_analyzeGraph`` — analiza la topología de red." + +msgid "The function returns:" +msgstr "La función devuelve:" + +msgid "``OK`` after the analysis has finished." +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." + +msgid "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" +msgstr "pgr_analyzeGraph(**edge_table**, **tolerancia**, [**opciones**])" + +msgid "**options:** ``[the_geom, id, source, target, rows_where]``" +msgstr "**opcionales:** ``[the_geom, id, source, target, rows_where]``" + +msgid "RETURNS ``VARCHAR``" +msgstr "DEVUELVE ``VARCHAR``" + +msgid "Prerequisites" +msgstr "Pre-requisitos" + +msgid "" +"The edge table to be analyzed must contain a source column and a target " +"column filled with id's of the vertices of the segments and the " +"corresponding vertices table _vertices_pgr that stores the " +"vertices information." +msgstr "" +"La tabla de aristas a analizar debe contener una columna origen y una " +"columna destino rellenas con identificadores de los vértices de los " +"segmentos y la correspondiente tabla de vértices _vertices_pgr " +"que almacena la información de los vértices." + +msgid "The analyze graph function accepts the following parameters:" +msgstr "La función de análisis gráfico acepta los siguientes parámetros:" + +msgid "edge_table" +msgstr "edge_table" + +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 "tolerance" +msgstr "tolerancia" + +msgid "" +"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" +msgstr "" +"``float8`` ajuste tolerancia de bordes desconectados. (en la unidad de " +"proyección)" + +msgid "the_geom" +msgstr "the_geom" + +msgid "" +"``text`` Geometry column name of the network table. Default value is " +"``the_geom``." +msgstr "" +"``text`` nombre de la columna de la geometría en la tabla de la red. El " +"valor por defecto es `the_geom``." + +msgid "id" +msgstr "id" + +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``'." + +msgid "source" +msgstr "source" + +msgid "" +"``text`` Source column name of the network table. Default value is " +"``source``." +msgstr "" +"``id``Nombre de columna de origen de la tabla de red. El valor " +"predeterminado es``source``." + +msgid "target" +msgstr "target" + +msgid "" +"``text`` Target column name of the network table. Default value is " +"``target``." +msgstr "" +"``text`` El nombre de la columna del destino 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." +msgstr "" +"``text`` Condición para seleccionar un subconjunto o filas. Valor " +"predeterminado es ``true`` para indicar todas las filas." + +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." + +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``" + +msgid "The vertices table is not found." +msgstr "No se encuentra en la tabla de los vértices." + +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." + +msgid "The condition is not well formed." +msgstr "La condición no está bien formada." + +msgid "The names of source , target or id are the same." +msgstr "Los nombres de origen, destino o id son las mismos." + +msgid "The SRID of the geometry could not be determined." +msgstr "No pudo determinarse el SRID de la geometría." + +msgid "The Vertices Table" +msgstr "La tabla de vértices" + +msgid "The structure of the vertices table is:" +msgstr "La estructura de la tabla de los vértices es:" + +msgid "``bigint`` Identifier of the vertex." +msgstr "``bigint`` identificador del vértice." + +msgid "cnt" +msgstr "cnt" + +msgid "" +"``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." + +msgid "chk" +msgstr "chk" + +msgid "``integer`` Indicator that the vertex might have a problem." +msgstr "``integer`` Indicador de que el vértice puede tener un problema." + +msgid "ein" +msgstr "ein" + +msgid "" +"``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." + +msgid "eout" +msgstr "eout" + +msgid "" +"``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." + +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:" + +msgid "The simplest way to use pgr_analyzeGraph is:" +msgstr "La forma más sencilla de usar pgr_analyzeGraph es:" + +msgid "Arguments are given in the order described in the parameters:" +msgstr "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 "" +"Obtenemos el mismo resultado que la forma más sencilla de utilizar la " +"función." + +msgid "An error would occur when" +msgstr "Un error puede ocurrir cuando" + +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." +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``." + +msgid "When using the named notation" +msgstr "Cuando se utiliza la notación por nombre" + +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:" +msgstr "" +"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." +msgstr "" +"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" + +msgid "" +"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``." + +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:" + +msgid "For the following table" +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:" +msgstr "Las discusiones deben recibir 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 ``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 "" +"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." + +msgid "Selecting rows based on the id." +msgstr "La selección de filas basadas en el id." + +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 ." + +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)" + +msgid ":doc:`pgr_analyzeOneWay`" +msgstr ":doc:`pgr_analyzeOneWay`" + +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 "``pgr_analyzeOneWay`` - Deprecated since 3.8.0" +msgstr "``pgr_analyzeOneWay`` - Obsoleto desde 3.8.0" + +msgid "" +"``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " +"segments." +msgstr "" +"``pgr_analyzeOneWay`` — Analiza las calles de sentido unidireccional e " +"identifica los segmentos volteados." + +msgid "" +"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." + +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." + +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." +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." + +msgid "" +"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " +"**t_in_rules**, **t_out_rules**, [**options**])" +msgstr "" +"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " +"**t_in_rules**, **t_out_rules**, [**opciones**])" + +msgid "**options:** ``[oneway, source, target, two_way_if_null]``" +msgstr "**opcionales:** ``[oneway, source, target, two_way_if_null]``" + +msgid "RETURNS ``TEXT``" +msgstr "DEVUELVE ``TEXT``" + +msgid "s_in_rules" +msgstr "s_in_rules" + +msgid "``text[]`` source node **in** rules" +msgstr "``text[]`` reglas de **entrada** del nodo inicial" + +msgid "s_out_rules" +msgstr "s_out_rules" + +msgid "``text[]`` source node **out** rules" +msgstr "``text[]`` reglas de **salida** del nodo inicial" + +msgid "t_in_rules" +msgstr "t_in_rules" + +msgid "``text[]`` target node **in** rules" +msgstr "``text[]`` reglas de **entrada** del nodo final" + +msgid "t_out_rules" +msgstr "t_out_rules" + +msgid "``text[]`` target node **out** rules" +msgstr "``text[]`` reglas de **salida** del nodo final" + +msgid "oneway" +msgstr "oneway" + +msgid "" +"``text`` oneway column name name of the network table. Default value is " +"``oneway``." +msgstr "" +"``text`` El nombre de la columna del sentido. El valor por defecto es " +"``oneway``." + +msgid "two_way_if_null" +msgstr "two_way_if_null" + +msgid "" +"``boolean`` flag to treat oneway NULL values as bi-directional. Default " +"value is ``true``." +msgstr "" +"``boolean`` bandera para tratar los valores NULL de oneway como " +"bidireccional. Valor predeterminado es``true``." + +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``." + +msgid "The names of source , target or oneway are the same." +msgstr "Los nombres de origen, destino o oneway son las mismos." + +msgid "" +"The rules are defined as an array of text strings that if match the " +"``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** ." + +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" + +msgid "" +"``pgr_articulationPoints`` - Return the articulation points of an undirected " +"graph." +msgstr "" +"``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo " +"no dirigido." + +msgid "Result columns change: ``seq`` is removed" +msgstr "Cambio de columnas de resultados: ``seq`` se elimina" + +msgid "Version 2.5.0" +msgstr "Versión 2.5.0" + +msgid "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." +msgstr "" +"Los vértices que pertenecen a más de un componente biconectado se denominan " +"puntos de articulación o, equivalentemente, corte de vértices. Los puntos de " +"articulación son vértices cuya eliminación aumentaría el número de " +"componentes conectados en el grafo. Esta implementación solo se puede " +"utilizar con un grafo no dirigido." + +msgid "Works for **undirected** graphs." +msgstr "Funciona para grafos **no dirigidos**." -msgid "`ST_ConcaveHull `__" -msgstr "`ST_ConcaveHull `__" +msgid "``node`` ascending" +msgstr "``node`` ascendente" -msgid "pgr_analyzeGraph" -msgstr "pgr_analyzeGraph" +msgid "Running time: :math:`O(V + E)`" +msgstr "Tiempo de ejecución: :math:`O(V + E)`" -msgid "``pgr_analyzeGraph`` — Analyzes the network topology." -msgstr "``pgr_analyzeGraph`` — analiza la topología de red." +msgid "pgr_articulationPoints(`Edges SQL`_)" +msgstr "pgr_articulationPoints(`SQL de aristas`_)" -msgid "The function returns:" -msgstr "La función devuelve:" +msgid "Returns set of |result-node|" +msgstr "Regresa conjunto de |result-node|" -msgid "``OK`` after the analysis has finished." -msgstr "``OK`` Cuando el análisis ha terminado." +msgid "The articulation points of the graph" +msgstr "Los puntos de articulación del grafo" -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." +msgid "Nodes in red are the articulation points." +msgstr "Nodos en rojo son los puntos de articulación." -msgid "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" -msgstr "pgr_analyzeGraph(**edge_table**, **tolerancia**, [**opciones**])" +msgid "" +"`Boost: Biconnected components & articulation points `__" +msgstr "" +"`Boost: Componentes biconectados y puntos de articulación `__" -msgid "**options:** ``[the_geom, id, source, target, rows_where]``" -msgstr "**opcionales:** ``[the_geom, id, source, target, rows_where]``" +msgid "" +"wikipedia: `Biconnected component `__" +msgstr "" +"wikipedia: `Componentes biconnectados `__" -msgid "RETURNS ``VARCHAR``" -msgstr "DEVUELVE ``VARCHAR``" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" -msgid "Prerequisites" -msgstr "Pre-requisitos" +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgstr "" +"``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo " +"Bidireccional A*." -msgid "" -"The edge table to be analyzed must contain a source column and a target " -"column filled with id's of the vertices of the segments and the " -"corresponding vertices table _vertices_pgr that stores the " -"vertices information." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -"La tabla de aristas a analizar debe contener una columna origen y una " -"columna destino rellenas con identificadores de los vértices de los " -"segmentos y la correspondiente tabla de vértices _vertices_pgr " -"que almacena la información de los vértices." +"pgr_bdAstar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." -msgid "Use :doc:`pgr_createVerticesTable` to create the vertices table." -msgstr "Use :doc:`pgr_createVerticesTable` para crear la tabla de vértices." +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgstr "pgr_bdAstar(Uno a Muchos) ha añadido la columna ``end_vid``." -msgid "" -"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 "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgstr "pgr_bdAstar(Muchos a Uno) ha añadido la columna ``start_vid``." -msgid "The analyze graph function accepts the following parameters:" -msgstr "La función de análisis gráfico acepta los siguientes parámetros:" +msgid "pgr_bdAstar(One to Many)" +msgstr "pgr_bdAstar(Uno a Muchos)" -msgid "edge_table" -msgstr "edge_table" +msgid "pgr_bdAstar(Many to One)" +msgstr "pgr_bdAstar(Muchos a Uno)" -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 "pgr_bdAstar(Many to Many)" +msgstr "pgr_bdAstar(Muchos a Muchos)" -msgid "tolerance" -msgstr "tolerancia" +msgid "Signature change on pgr_bdAstar(One to One)" +msgstr "Cambio de firma en pgr_bdAstar(Uno a Uno)" msgid "" -"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" +"The results are equivalent to the union of the results of the " +"pgr_bdAStar(One to One) on the:" msgstr "" -"``float8`` ajuste tolerancia de bordes desconectados. (en la unidad de " -"proyección)" - -msgid "the_geom" -msgstr "the_geom" +"Los resultados son equivalentes a la unión de los resultados de " +"pgr_bdAStar(Uno a Uno) en:" -msgid "" -"``text`` Geometry column name of the network table. Default value is " -"``the_geom``." +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -"``text`` nombre de la columna de la geometría en la tabla de la red. El " -"valor por defecto es `the_geom``." +"pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -msgid "id" -msgstr "id" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "" -"``text`` Primary key column name of the network table. Default value is " -"``id``." +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -"``text``Nombre de la columna de la clave principal de la tabla de red. Valor " -"por defecto es ``id``'." +"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "source" -msgstr "source" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -msgid "" -"``text`` Source column name of the network table. Default value is " -"``source``." +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -"``id``Nombre de columna de origen de la tabla de red. El valor " -"predeterminado es``source``." +"pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "target" -msgstr "target" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" msgid "" -"``text`` Target column name of the network table. Default value is " -"``target``." +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " +"bidirectional A* algorithm." msgstr "" -"``text`` El nombre de la columna del destino del segmento. El valor por " -"defecto es ``target``." - -msgid "rows_where" -msgstr "rows_where" +"``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el " +"algoritmo bidireccional A*." msgid "" -"``text`` Condition to select a subset or rows. Default value is ``true`` to " -"indicate all rows." +"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." msgstr "" -"``text`` Condición para seleccionar un subconjunto o filas. Valor " -"predeterminado es ``true`` para indicar todas las filas." - -msgid "Uses the vertices table: _vertices_pgr." -msgstr "Utiliza la tabla de los vértices: _vertices_pgr." +"La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando " +"el algoritmo bidireccional A*." -msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -"Llena totalmente las columnas ``cnt`` y ``chk`` de la tabla de vértices." +"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" msgid "" -"Returns the analysis of the section of the network defined by ``rows_where``" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" 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." +"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" msgid "" -"A required column of the Network table is not found or is not of the " -"appropriate type." +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -"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." +"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "The names of source , target or id are the same." -msgstr "Los nombres de origen, destino o id son las mismos." +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" -msgid "The SRID of the geometry could not be determined." -msgstr "No pudo determinarse el SRID de la geometría." +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "" +"pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "The Vertices Table" -msgstr "La tabla de vértices" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" msgid "" -"The vertices table can be created with :doc:`pgr_createVerticesTable " -"` or :doc:`pgr_createTopology `" +"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" -"Los vértices pueden ser creados con :doc:`pgr_createVerticesTable " -"` o :doc:`pgr_createTopology `" +"``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" +"`pgr_aStar`." -msgid "The structure of the vertices table is:" -msgstr "La estructura de la tabla de los vértices es:" +msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" +msgstr "Usando internamente el algoritmo :doc:`pgr_bdAstar`" -msgid "``bigint`` Identifier of the vertex." -msgstr "``bigint`` identificador del vértice." +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" -msgid "cnt" -msgstr "cnt" +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex." +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." msgstr "" -"``integer`` Número de vértices en edge_table que hacen referencia a este " -"vértice." +"``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo " +"Bidireccional de Dijkstra." -msgid "chk" -msgstr "chk" +msgid "pgr_bdDijkstra(One to Many)" +msgstr "pgr_bdDijkstra(Uno a Muchos)" -msgid "``integer`` Indicator that the vertex might have a problem." -msgstr "``integer`` Indicador de que el vértice puede tener un problema." +msgid "pgr_bdDijkstra(Many to One)" +msgstr "pgr_bdDijkstra(Muchos a Uno)" -msgid "ein" -msgstr "ein" +msgid "pgr_bdDijkstra(Many to Many)" +msgstr "pgr_bdDijkstra(Muchos a Muchos)" + +msgid "Signature change on pgr_bdDijsktra(One to One)" +msgstr "La firma cambió en pgr_bdDijsktra(Uno a Uno)" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as incoming. See :doc:`pgr_analyzeOneWay `." +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"``integer`` Número de vértices en edge_table que hacen referencia a este " -"vértice como entrante. Consulte :doc:`pgr_analyzeOneWay`." +"pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "eout" -msgstr "eout" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as outgoing. See :doc:`pgr_analyzeOneWay `." +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"``integer`` Número de vértices en edge_table que hacen referencia a este " -"vértice como saliente. Consulte :doc:`pgr_analyzeOneWay `." +"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "``geometry`` Point geometry of the vertex." -msgstr "``geometry`` Valor de la geometría POINT del vértice." +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" +"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "Usage when the edge table's columns MATCH the default values:" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -"Uso cuando las columnas de la tabla de borde coinciden con los valores por " -"defecto:" +"pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "The simplest way to use pgr_analyzeGraph is:" -msgstr "La forma más sencilla de usar pgr_analyzeGraph es:" +msgid "Returns set of |old-generic-result|" +msgstr "Regresa el conjunto de |old-generic-result|" -msgid "Arguments are given in the order described in the parameters:" -msgstr "Los argumentos se escriben en el orden descrito en los parámetros:" +msgid "Returns set of |result-1-1|" +msgstr "Regresa el conjunto de |result-1-1|" -msgid "We get the same result as the simplest way to use the function." +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 "Returns set of |result-1-m|" +msgstr "Regresa el conjunto de |result-1-m|" + +msgid "" +"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " +"graph" msgstr "" -"Obtenemos el mismo resultado que la forma más sencilla de utilizar la " -"función." +"Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo " +"**dirigido**" -msgid "An error would occur when" -msgstr "Un error puede ocurrir cuando" +msgid "Returns set of |result-m-1|" +msgstr "Regresa el conjunto de |result-m-1|" -msgid "the arguments are not given in the appropriate order:" -msgstr "los argumentos se no se escriben en el orden apropiado:" +msgid "" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "" +"De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo " +"**dirigido**" msgid "" -"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." +"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " +"**undirected** graph" 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``." +"De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un " +"grafo **no dirigido**" -msgid "When using the named notation" -msgstr "Cuando se utiliza la notación por nombre" +msgid "Using a combinations table on an **undirected** graph" +msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" -msgid "The order of the parameters do not matter:" -msgstr "No importa el orden de los parámetros:" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" + +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" msgid "" -"Parameters defined with a default value can be omitted, as long as the value " -"matches the default:" +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " +"Bidirectional Dijkstra algorithm." msgstr "" -"Parámetros definidos con un valor predeterminado se pueden omitir, siempre y " -"cuando el valor coincida con el valor por defecto:" +"``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando " +"el algoritmo Bidireccional de Dijkstra." -msgid "Selecting rows using rows_where parameter" -msgstr "Seleccionar filas utilizando el parámetro rows_where" +msgid "" +"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." msgid "" -"Selecting rows based on the id. Displays the analysis a the section of the " -"network." +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -"La selección de filas basadas en el id. El análisis muestra una parte de la " -"red." +"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, " +"[``directed``])" msgid "" -"Selecting the rows where the geometry is near the geometry of row with " -"``id`` = 5" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la " -"fila con ``id`` = 5" +"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, " +"[``directed``])" msgid "" -"Selecting the rows where the geometry is near the geometry of the row with " -"``gid`` =100 of the table ``othertable``." +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " +"[``directed``])" msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la " -"fila con``gid`` =100 de la tabla ``othertable``." +"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, " +"[``directed``])" -msgid "Usage when the edge table's columns DO NOT MATCH the default values:" +msgid "" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " +"[``directed``])" msgstr "" -"Uso cuando las columnas de la tabla de borde NO COINCIDEN con los valores " -"por defecto:" +"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, " +"[``directed``])" -msgid "For the following table" -msgstr "Para la siguiente tabla" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " +"[ ``directed``])" -msgid "Using positional notation:" -msgstr "Usando notación posicional:" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " +"[``directed``])" -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 "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" msgid "" -"An error would occur when the arguments are not given in the appropriate " -"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." +"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_bdDijkstra`." 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``." +"``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:" +"`pgr_bdDijkstra`." 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." +"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." 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." - -msgid "Selecting rows based on the id." -msgstr "La selección de filas basadas en el id." +"Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una " +"matriz de costos." -msgid "" -"Selecting the rows WHERE the geometry is near the geometry of row with " -"``id`` =5 ." +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -"Seleccionar las filas donde la geometría está cerca de la geometría de la " -"fila con ``id`` =5 ." +"pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" msgid "" -"Selecting the rows WHERE the geometry is near the place='myhouse' of the " -"table ``othertable``. (note the use of quote_literal)" +"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " +"**undirected** graph" 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)" - -msgid "The examples use the :doc:`sampledata` network." -msgstr "Los ejemplos usan la red de ejemplo :doc:`sampledata`." +"Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un " +"grafo **no dirigido**" -msgid ":doc:`pgr_analyzeOneWay`" -msgstr ":doc:`pgr_analyzeOneWay`" +msgid "Use with :doc:`pgr_TSP`." +msgstr "Usar con :doc:`pgr_TSP`." -msgid ":doc:`pgr_createVerticesTable`" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "``pgr_bellmanFord - Experimental``" +msgstr "``pgr_bellmanFord`` - Experimental" -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 "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgstr "" +"``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-" +"Ford." -msgid "pgr_analyzeOneWay" -msgstr "pgr_analyzeOneWay" +msgid "New experimental signature:" +msgstr "Nueva firma experimental:" -msgid "" -"``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " -"segments." -msgstr "" -"``pgr_analyzeOneWay`` — Analiza las calles de sentido unidireccional e " -"identifica los segmentos volteados." +msgid "pgr_bellmanFord(Combinations)" +msgstr "pgr_bellmanFord(Combinaciones)" msgid "" -"This function analyzes oneway streets in a graph and identifies any flipped " -"segments." +"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 "" -"Esta función analiza las calles unidireccionales en un gráfico e identifica " -"cualquier segmentos invertido." +"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 "" -"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." +"Process is valid for edges with both positive and negative edge weights." 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." +"El proceso es válido para aristas con grosores de arista positivos y " +"negativos." 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." +"When the start vertex and the end vertex are the same, there is no path. The " +"agg_cost would be :math:`0`." 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." +"Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El " +"agg_cost sería :math:`0`." 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." +"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 "" -"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." +"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 "" -"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " -"**t_in_rules**, **t_out_rules**, [**options**])" -msgstr "" -"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " -"**t_in_rules**, **t_out_rules**, [**opciones**])" - -msgid "**options:** ``[oneway, source, target, two_way_if_null]``" -msgstr "**opcionales:** ``[oneway, source, target, two_way_if_null]``" - -msgid "RETURNS ``TEXT``" -msgstr "DEVUELVE ``TEXT``" - -msgid "s_in_rules" -msgstr "s_in_rules" - -msgid "``text[]`` source node **in** rules" -msgstr "``text[]`` reglas de **entrada** del nodo inicial" - -msgid "s_out_rules" -msgstr "s_out_rules" - -msgid "``text[]`` source node **out** rules" -msgstr "``text[]`` reglas de **salida** del nodo inicial" - -msgid "t_in_rules" -msgstr "t_in_rules" - -msgid "``text[]`` target node **in** rules" -msgstr "``text[]`` reglas de **entrada** del nodo final" +"When the start vertex and the end vertex are different, and there exists a " +"path between them, but it contains a *negative cycle*. In such case, " +"agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost " +"can’t be defined for them." +msgstr "" +"Cuando el vértice inicial y el vértice final son diferentes y existe una " +"ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost " +"para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se " +"puede definir para ellos." -msgid "t_out_rules" -msgstr "t_out_rules" +msgid "" +"When the start vertex and the end vertex are different, and there is no " +"path. The agg_cost is :math:`\\infty`." +msgstr "" +"Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. " +"El agg_cost es :math:`\\infty`." -msgid "``text[]`` target node **out** rules" -msgstr "``text[]`` reglas de **salida** del nodo final" +msgid "" +"For optimization purposes, any duplicated value in the `start_vids` or " +"`end_vids` are ignored." +msgstr "" +"Para fines de optimización, se ignora cualquier valor duplicado en " +"`start_vids` o `end_vids`." -msgid "oneway" -msgstr "oneway" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`" msgid "" -"``text`` oneway column name name of the network table. Default value is " -"``oneway``." +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"``text`` El nombre de la columna del sentido. El valor por defecto es " -"``oneway``." - -msgid "two_way_if_null" -msgstr "two_way_if_null" +"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" msgid "" -"``boolean`` flag to treat oneway NULL values as bi-directional. Default " -"value is ``true``." +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -"``boolean`` bandera para tratar los valores NULL de oneway como " -"bidireccional. Valor predeterminado es``true``." +"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" msgid "" -"It is strongly recommended to use the named notation. See :doc:" -"`pgr_createVerticesTable` or :doc:`pgr_createTopology` for examples." +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"Es ampliamente recomendable usar la notación nombrada . Ver ejemplos en: :" -"doc:`pgr_createVerticesTable` o :doc:`pgr_createTopology`." +"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" msgid "" -"Fills completely the ``ein`` and ``eout`` columns of the vertices table." +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -"Se llena completamente las columnas de la tabla de vértices ``ein`` y " -"``eout``." +"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "The names of source , target or oneway are the same." -msgstr "Los nombres de origen, destino o oneway son las mismos." +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "" +"pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "" -"The rules are defined as an array of text strings that if match the " -"``oneway`` value would be counted as ``true`` for the source or target " -"**in** or **out** condition." +"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " +"graph" 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** ." +"Desde el vértice :math:`6` a los vértices :math:`\\{ 10, 17\\}` en un grafo " +"**dirigido**" + +msgid "Using a combinations table on an **undirected** graph." +msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**." msgid "" -"The vertices table can be created with :doc:`pgr_createVerticesTable` or :" -"doc:`pgr_createTopology`" +"`Boost: Bellman Ford `__" msgstr "" -"Los vértices pueden ser creados con :doc:`pgr_createVerticesTable` o :doc:" -"`pgr_createTopology`" +"`Boost: Bellman Ford `__" + +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" + +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "``pgr_betweennessCentrality`` - Experimental" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex. " -"See :doc:`pgr_analyzeGgraph `." +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " +"centrality using Brandes Algorithm" msgstr "" -"``integer`` Número de vértices en edge_table que hacen referencia a este " -"vértice. Consulte :doc:`pgr_analyzeGgraph `." +"``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa " +"mediante el algoritmo de Brandes" + +msgid "Version 3.7.0" +msgstr "Versión 3.7.0" msgid "" -"``integer`` Indicator that the vertex might have a problem. See :doc:" -"`pgr_analyzeGraph `." +"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " +"the betweenness centrality score of all vertices." msgstr "" -"``integer`` Indicador de que el vértice podría tener un problema. Consulte :" -"doc:`pgr_analyzeGraph `." +"El algoritmo Brandes aprovecha los grafos dispersos para evaluar la " +"puntuación de centralidad intermedia de todos los vértices." msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as incoming." +"Betweenness centrality measures the extent to which a vertex lies on the " +"shortest paths between all other pairs of vertices. Vertices with a high " +"betweenness centrality score may have considerable influence in a network by " +"the virtue of their control over the shortest paths passing between them." msgstr "" -"``integer`` número de vértices en la edge_table que hacen referencia a este " -"vértice como entrante." +"La centralidad de interrelación mide hasta qué punto un vértice se encuentra " +"en las rutas más cortas entre todos los demás pares de vértices. Los " +"vértices con una alta centralidad entre pares pueden tener una influencia " +"considerable en una red gracias a su control sobre los caminos más cortos " +"que pasan entre ellos." msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as outgoing." +"The removal of these vertices will affect the network by disrupting the it, " +"as most of the shortest paths between vertices pass through them." msgstr "" -"``integer`` número de vértices en la edge_table que hacen referencia a este " -"vértice como saliente." +"La eliminación de estos vértices afectará a la red al perturbarla, ya que la " +"mayoría de los caminos más cortos entre vértices pasan por ellos." -msgid ":doc:`pgr_analyzeGraph`" -msgstr ":doc:`pgr_analyzeGraph`" +msgid "This implementation work for both directed and undirected graphs." +msgstr "" +"Esta implementación funciona tanto para grafos dirigidos como no dirigidos." -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "Running time: :math:`\\Theta(VE)`" +msgstr "Tiempo de ejecución: :math:`\\Theta(VE)`" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." -msgstr "" -"``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo " -"no dirigido." +msgid "Running space: :math:`\\Theta(VE)`" +msgstr "Espacio de ejecución: :math:`\\Theta(VE)`" -msgid "Result columns change: ``seq`` is removed" -msgstr "Cambio de columnas de resultados: ``seq`` se elimina" +msgid "Throws when there are no edges in the graph" +msgstr "Lanza cuando no hay aristas en el grafo" -msgid "Version 2.5.0" -msgstr "Versión 2.5.0" +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "pgr_betweennessCentrality(`SQL de aristas`_, [``directed``])" -msgid "New **experimental** function" -msgstr "Nueva función **experimental**" +msgid "Returns set of ``(vid, centrality)``" +msgstr "Regresa el conjunto de ``(vid, centrality)``" -msgid "" -"Those vertices that belong to more than one biconnected component are called " -"articulation points or, equivalently, cut vertices. Articulation points are " -"vertices whose removal would increase the number of connected components in " -"the graph. This implementation can only be used with an undirected graph." -msgstr "" -"Los vértices que pertenecen a más de un componente biconectado se denominan " -"puntos de articulación o, equivalentemente, corte de vértices. Los puntos de " -"articulación son vértices cuya eliminación aumentaría el número de " -"componentes conectados en el grafo. Esta implementación solo se puede " -"utilizar con un grafo no dirigido." +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "Para un grafo dirigido con aristas :math:`\\{1, 2, 3, 4\\}`." -msgid "Works for **undirected** graphs." -msgstr "Funciona para grafos **no dirigidos**." +msgid "Explanation" +msgstr "Explicación" -msgid "``node`` ascending" -msgstr "``node`` ascendente" +msgid "The betweenness centrality are between parenthesis." +msgstr "La centralidad intermedia está entre paréntesis." -msgid "Running time: :math:`O(V + E)`" -msgstr "Tiempo de ejecución: :math:`O(V + E)`" +msgid "The leaf vertices have betweenness centrality :math:`0`." +msgstr "Los vértices de las hojas tienen una centralidad intermedia :math:`0`." -msgid "pgr_articulationPoints(`Edges SQL`_)" -msgstr "pgr_articulationPoints(`SQL de aristas`_)" +msgid "" +"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" +"`10`." +msgstr "" +"La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del " +"vértice :math:`10`." -msgid "Returns set of |result-node|" -msgstr "Regresa conjunto de |result-node|" +msgid "Removing vertex :math:`6` will create three graph components." +msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes." -msgid "The articulation points of the graph" -msgstr "Los puntos de articulación del grafo" +msgid "Removing vertex :math:`10` will create two graph components." +msgstr "" +"Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." -msgid "Nodes in red are the articulation points." -msgstr "Nodos en rojo son los puntos de articulación." +msgid "``vid``" +msgstr "``vid``" + +msgid "``centrality``" +msgstr "``centrality``" msgid "" -"Boost: `Biconnected components & articulation points `__" +"Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -"Boost: `Componentes biconectados & y puntos de articulación `__" +"Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" msgid "" -"wikipedia: `Biconnected component `__" +"`Boost: betweenness centrality `_" msgstr "" -"wikipedia: `Componentes biconnectados `__" +"`Boost: Centralidad de intermediación `__" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgid "" +"``pgr_biconnectedComponents`` — Biconnected components of an undirected " +"graph." msgstr "" -"``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo " -"Bidireccional A*." +"``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no " +"dirigido." + +msgid "Result columns change:" +msgstr "Las columnas de resultados cambian:" + +msgid "``n_seq`` is removed" +msgstr "``n_seq`` se elimina" + +msgid "``seq`` changed type to ``BIGINT``" +msgstr "``seq`` cambió el tipo a ``BIGINT``'" msgid "" -"``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +"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 "" -"``pgr_bdAstar`` (`Uno a Uno`_) ha añadido las columnas ``start_vid`` y " -"``end_vid``." +"Los componentes biconectados de un grafo no dirigido son los subconjuntos " +"máximos de vértices de modo que la eliminación de un vértice de un " +"componente determinado no desconectará el mismo. A diferencia de los " +"componentes conectados, los vértices pueden pertenecer a varios componentes " +"biconectados. Los vértices pueden estar presentes en varios componentes " +"biconectados, pero cada arista solo puede estar contenida en un único " +"componente biconectado." + +msgid "Components are described by edges." +msgstr "Los componentes se describen mediante aristas." + +msgid "``component`` ascending." +msgstr "``componente`` ascendente." + +msgid "``edge`` ascending." +msgstr "``edge`` ascendente." + +msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgstr "pgr_biconnectedComponents(`SQL de aristas`_)" + +msgid "Returns set of |result-component-E|" +msgstr "Regresa conjunto de |result-component-E|" + +msgid "The biconnected components of the graph" +msgstr "Los componentes biconectados del grafo" -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_bdAstar`` (`Uno a Muchos`_) ha añadido la columna ``end_vid``." +msgid "``component``" +msgstr "``component``" -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_bdAstar`` (`Muchos a Uno`_) ha añadido la columna ``start_vid``." +msgid "Component identifier." +msgstr "Identificador de componente." -msgid "``pgr_bdAstar`` (`Combinations`_)" -msgstr "``pgr_bdAstar`` (`Combinaciones`_)" +msgid "Has the value of the minimum edge identifier in the component." +msgstr "Contiene el identificador mínimo de arista en el componente." -msgid "``pgr_bdAstar`` (`One to Many`_)" -msgstr "``pgr_bdAstar`` (`Uno a Muchos`_)" +msgid "Identifier of the edge that belongs to the ``component``." +msgstr "Identificador de arista que pertenece a ``component``." -msgid "``pgr_bdAstar`` (`Many to One`_)" -msgstr "``pgr_bdAstar`` (`Muchos a Uno`_)" +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgid "``pgr_bdAstar`` (`Many to Many`_)" -msgstr "``pgr_bdAstar`` (`Muchos a Muchos`_)" +msgid "" +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " +"graph." +msgstr "" +"``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo " +"binario." -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" -msgstr "Cambio de firma en ``pgr_bdAstar`` (`Uno a Uno`_)" +msgid "" +"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" +"negative integer, is termed as a 'binary graph'." +msgstr "" +"Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' " +"es un entero no negativo, se le llama 'grafo binario'." -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" -msgstr "**Oficial** ``pgr_bdAstar`` (`Uno a Uno`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" msgid "" -"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:" - -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +"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 "" -"pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +"Es bien sabido que los caminos más cortos entre un único origen y todos los " +"demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:" +"`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número " +"mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. " +"Podemos interpretar este grafo también como un grafo ponderado, en el que " +"cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo " +"tienen el mismo peso, necesitaremos un algoritmo más general, como el " +"Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`." -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +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 "" -"pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +"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 "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +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 "" -"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +"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 "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * |E|)`" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " +"[``directed``])" msgstr "" -"pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" - -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, " +"[``directed``])" msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " +"[``directed``])" msgstr "" -"``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el " -"algoritmo bidireccional A*." - -msgid "``pgr_bdAstarCost`` (`Combinations`_)" -msgstr "``pgr_bdAstarCost`` (`Combinaciones`_)" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, " +"[``directed``])" msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " -"using the bidirectional A* algorithm." +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " +"[``directed``])" msgstr "" -"La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando " -"el algoritmo bidireccional A*." +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, " +"[``directed``])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " +"[``directed``])" msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, " +"[``directed``])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " +"[``directed``])" msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, " +"[``directed``])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" +"math:`1``)" msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +"**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los " +"mismos (i.e :math:`1``)" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +"`Boost: Breadth First Search `__" msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +"`Boost: Primera búsqueda en amplitud `__" -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgstr "https://cp-algorithms.com/graph/01_bfs.html" + +msgid "" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +msgid "``pgr_bipartite`` - Experimental" +msgstr "``pgr_bipartite`` - Experimental" msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." +"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " +"within the same set are adjacent." msgstr "" -"``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" -"`pgr_aStar`." +"``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el " +"mismo conjunto son adjacentes." -msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" -msgstr "Usando internamente el algoritmo :doc:`pgr_bdAstar`" +msgid "" +"A bipartite graph is a graph with two sets of vertices which are connected " +"to each other, but not within themselves. A bipartite graph is possible if " +"the graph coloring is possible using two colors such that vertices in a set " +"are colored with the same color." +msgstr "" +"Un grafo bipartito es un grafo con dos conjuntos de vértices que están " +"conectados entre sí, pero no dentro de sí mismos. Un gráfico bipartito es " +"posible si el color del gráfico es posible utilizando dos colores, de modo " +"que los vértices de un conjunto se colorean con el mismo color." -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" +msgid "The algorithm works in undirected graph only." +msgstr "El algoritmo solo funciona en un grafo no dirigido." -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "The returned values are not ordered." +msgstr "Los valores devueltos no están ordenados." msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." +"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 "" -"``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo " -"Bidireccional de Dijkstra." - -msgid "pgr_bdDijkstra(`Combinations`_)" -msgstr "pgr_bdDijkstra(`Combinaciones`_)" +"El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito " +"entonces devuelve el nodo junto con dos colores `0` y `1` que representan " +"dos conjuntos diferentes." -msgid "New **Proposed** functions:" -msgstr "Nuevas funciones **Propuestas**:" +msgid "If graph is not bipartite then algorithm returns empty set." +msgstr "Si el grafo no es bipartito, el algoritmo devuelve un conjunto vacío." -msgid "``pgr_bdDijkstra`` (`One to Many`_)" -msgstr "``pgr_bdDijkstra`` (`Uno a Muchos`_)" +msgid "pgr_bipartite(`Edges SQL`_)" +msgstr "pgr_bipartite(`SQL de aristas`_)" -msgid "``pgr_bdDijkstra`` (`Many to One`_)" -msgstr "``pgr_bdDijkstra`` (`Muchos a Uno`_)" +msgid "Returns set of |result-node-color|" +msgstr "Regresa el conjunto de |result-node-color|" -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" -msgstr "``pgr_bdDijkstra`` (`Muchos a Muchos`_)" +msgid "When the graph is bipartite" +msgstr "Cuando el grafo es bi-partido" -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" -msgstr "La firma cambió en ``pgr_bdDijsktra`` (`Uno a Uno`_)" +msgid "Additional Example" +msgstr "Ejemplo Adicional" -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" -msgstr "**Oficial** ``pgr_bdDijkstra`` (`Uno a Uno`_)" +msgid "The odd length cyclic graph can not be bipartite." +msgstr "El gráfico cíclico de longitud impar no puede ser bipartito." msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +"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 "" -"pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +"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 "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "Edges in blue represent odd length cycle subgraph." +msgstr "Aristas en azul representan un grafo de ciclo impar." msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +"`Boost: is_bipartite `__" msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +"`Boost: es bipartido `__" msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +"`Wikipedia: bipartite graph `__" msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +"`Wikipedia: grafo bipartito `__" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" + +msgid "" +"``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " +"maximizes the flow from the sources to the targets using Boykov Kolmogorov " +"algorithm." msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +"``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que " +"maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo " +"Boykov Kolmogorov." -msgid "Returns set of |old-generic-result|" -msgstr "Regresa el conjunto de |old-generic-result|" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``" -msgid "Returns set of |result-1-1|" -msgstr "Regresa el conjunto de |result-1-1|" +msgid "Function promoted to proposed." +msgstr "Función promovida a propuesta." -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 "Running time: Polynomial" +msgstr "Tiempo de ejecución: Polinomio" -msgid "Returns set of |result-1-m|" -msgstr "Regresa el conjunto de |result-1-m|" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destino**)" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" -msgstr "" -"Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo " -"**dirigido**" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destinos**)" -msgid "Returns set of |result-m-1|" -msgstr "Regresa el conjunto de |result-m-1|" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destino**)" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "" -"De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo " -"**dirigido**" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destinos**)" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" -msgstr "" -"De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un " -"grafo **no dirigido**" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "Using a combinations table on an **undirected** graph" -msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" +msgid "Returns set of |result-flow|" +msgstr "Regresa el conjunto de |result-flow|" -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 "From vertex :math:`11` to vertex :math:`12`" +msgstr "Del vértice :math:`11` al vértice :math:`12`" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" -msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "Desde el vértice :math:`11` a los vértices :math:`\\{5, 10, 12\\}`" -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +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 "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." +"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -"``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando " -"el algoritmo Bidireccional de Dijkstra." - -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" -msgstr "``pgr_bdDijkstraCost`` (`Combinaciones`_)" +"De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}" +"`" msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " -"path using the bidirectional Dijkstra Algorithm." +"Using a combinations table, equivalent to calculating result from vertices :" +"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -"La función ``pgr_bdDijkstraCost`` sumarisa el costo de la ruta más corta " -"utilizando el algoritmo de bidirecional de Dijkstra." +"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 "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +"`Boost: Boykov Kolmogorov max flow `__" msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, " -"[``directed``])" +"`Boost: Flujo máximo Boykov Kolmogorov `__" + +msgid "``pgr_breadthFirstSearch`` - Experimental" +msgstr "``pgr_breadthFirstSearch`` - Experimental" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " +"First Search algorithm." msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, " -"[``directed``])" +"``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante " +"el algoritmo Breadth First Search." msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +"Provides the Breadth First Search traversal order from a root vertex to a " +"particular depth." msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, " -"[``directed``])" +"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 "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"Provides the Breadth First Search traversal order from a source node to a " +"target depth level." msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, " -"[``directed``])" +"Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un " +"nodo de origen a un nivel de profundidad objetivo." -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " -"[ ``directed``])" +msgid "Running time: :math:`O(E + V)`" +msgstr "Tiempo de ejecución: :math:`O(E + V)`" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " -"[``directed``])" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raíz**, [**options**])" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])" + +msgid "**options:** ``[max_depth, directed]``" +msgstr "**opcionales:** ``[max_depth, directed]``" + +msgid "Returns set of |result-bfs|" +msgstr "Regresa el conjunto de |result-bfs|" msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." +"From root vertex :math:`6` on a **directed** graph with edges in ascending " +"order of ``id``" msgstr "" -"``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:" -"`pgr_bdDijkstra`." +"Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en " +"orden ascendente de ``id``" msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " +"**depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" -"Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una " -"matriz de costos." +"A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no " +"dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas " +"ascendentemente in términos de ``id``" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" +msgid "DFS optional parameters" +msgstr "Parámetros opcionales de DFS" + +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgstr "Igual que `Vértice único`_ con aritas en orden ascendente de ``id``." + +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgstr "Igual que `Vértice único`_ con aritas en orden descendente de ``id``." + +msgid "The resulting traversal is different." +msgstr "El recorrido resultante es diferente." msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" +"The left image shows the result with ascending order of ids and the right " +"image shows with descending order of the edge identifiers." msgstr "" -"Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un " -"grafo **no dirigido**" +"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 "Use with :doc:`pgr_TSP`." -msgstr "Usar con :doc:`pgr_TSP`." +msgid "|ascending| |descending|" +msgstr "|ascending| |descending|" -msgid "``pgr_bellmanFord - Experimental``" -msgstr "``pgr_bellmanFord`` - Experimental" +msgid "ascending" +msgstr "ascendente" -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgid "descending" +msgstr "descendente" + +msgid "" +"`Wikipedia: Breadth First Search algorithm `__" msgstr "" -"``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-" -"Ford." +"`Wikipedia: Breadth First Search `__" -msgid "New **experimental** signature:" -msgstr "Nueva firma **experimental**:" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "``pgr_bellmanFord`` (`Combinaciones`_)" +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgstr "``pgr_bridges`` - Calcula los puentes de un grafo no dirigido." -msgid "New **experimental** signatures:" -msgstr "Nuevas firmas **experimental**:" +msgid "" +"A bridge is an edge of an undirected graph whose deletion increases its " +"number of connected components. This implementation can only be used with an " +"undirected graph." +msgstr "" +"Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su " +"número de componentes conectados. Esta implementación solo se puede utilizar " +"con un grafo no dirigido." -msgid "``pgr_bellmanFord`` (`One to One`_)" -msgstr "``pgr_bellmanFord`` (`Uno a Uno`_)" +msgid "``edge`` ascending" +msgstr "``edge`` ascendente" -msgid "``pgr_bellmanFord`` (`One to Many`_)" -msgstr "``pgr_bellmanFord`` (`Uno a Muchos`_)" +msgid "Running time: :math:`O(E * (V + E))`" +msgstr "Tiempo de ejecución: :math:`O(E * (V + E))`" -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "``pgr_bellmanFord`` (`Muchos a uno`_)" +msgid "pgr_bridges(`Edges SQL`_)" +msgstr "pgr_bridges(`SQL de aristas`_)" -msgid "``pgr_bellmanFord`` (`Many to Many`_)" -msgstr "``pgr_bellmanFord`` (`Muchos a Muchos`_)" +msgid "Returns set of |result-edge|" +msgstr "Regresa conjunto de |result-edge|" -msgid "" -"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, " -"who first published it in 1958 and 1956, respectively.It is a graph search " -"algorithm that computes shortest paths from a starting vertex " -"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some of " -"the edge weights may be negative. Though it is more versatile, it is slower " -"than Dijkstra's algorithm.This implementation can be used with a directed " -"graph and an undirected graph." -msgstr "" -"El algoritmo de Bellman-Ford, lleva el nombre de Richard Bellman y Lester " -"Ford, quienes lo publicaron por primera vez en 1958 y 1956, respectivamente. " -"Es un algoritmo de búsqueda de grafos que calcula las rutas más cortas desde " -"un vértice inicial (``start_vid``) hasta un vértice final (``end_vid``) en " -"un grafo donde algunos de los pesos de borde pueden ser números negativos. " -"Aunque es más versátil, es más lento que el algoritmo de Dijkstra/ Esta " -"implementación se puede utilizar con un grafo dirigido y un grafo no " -"dirigido." +msgid "The bridges of the graph" +msgstr "Los puentes del grafo" -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 "Identifier of the edge that is a bridge." +msgstr "Identificador del borde que es un puente." -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." -msgstr "" -"Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El " -"agg_cost sería :math:`0`." +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" 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." +"`Boost: Connected components `__" 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." +"`Boost: Componentes conectados `__" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them, but it contains a *negative cycle*. In such case, " -"agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost " -"can’t be defined for them." -msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y existe una " -"ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost " -"para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se " -"puede definir para ellos." +msgid "``pgr_chinesePostman`` - Experimental" +msgstr "``pgr_chinesePostman`` - Experimental" msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." +"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " +"every edge in a directed graph and starts and ends on the same vertex." msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. " -"El agg_cost es :math:`\\infty`." +"``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 "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." -msgstr "" -"Para fines de optimización, se ignora cualquier valor duplicado en " -"`start_vids` o `end_vids`." +msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgstr "Devuelve ``EMPTY SET`` en un grafo desconectado" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" -msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`" +msgid "pgr_chinesePostman(`Edges SQL`_)" +msgstr "pgr_chinesePostman(`SQL de aristas`_)" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "Returns set of |result-1-1-no-seq|" +msgstr "Regresa el conjunto de |result-1-1-no-seq|" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "Sequential value starting from ``1``" +msgstr "Valor secuencial a partir de ``1``" msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +"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 "" -"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +"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 "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgid "Aggregate cost from ``start_v`` to ``node``." +msgstr "Coste agregado de ``start_v`` to ``node``." + +msgid "``pgr_chinesePostmanCost`` - Experimental" +msgstr "``pgr_chinesePostmanCost`` - Experimental" msgid "" -"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " -"graph" +"``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 "" -"Desde el vértice :math:`6` a los vértices :math:`\\{ 10, 17\\}` en un grafo " -"**dirigido**" - -msgid "Using a combinations table on an **undirected** graph." -msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**." +"``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de " +"circuito que contiene cada arista de un grafo dirigido y comienza y termina " +"en el mismo vértice." -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "Return value when the graph if disconnected" +msgstr "Valor devuelto cuando el grafo está desconectado" -msgid "``pgr_betweennessCentrality``" -msgstr "``pgr_betweennessCentrality``" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgstr "pgr_chinesePostmanCost(`SQL de aristas`_)" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " -"centrality using Brandes Algorithm" -msgstr "" -"``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa " -"mediante el algoritmo de Brandes" +msgid "RETURNS ``FLOAT``" +msgstr "DEVUELVE ``FLOAT``" -msgid "Version 3.7.0" -msgstr "Versión 3.7.0" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" -msgid "New **experimental** function:" -msgstr "Nueva función **experimental**:" +msgid "Minimum costs of a circuit path." +msgstr "Costes mínimos de una trayectoria de circuito." -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." -msgstr "" -"El algoritmo Brandes aprovecha los grafos dispersos para evaluar la " -"puntuación de centralidad intermedia de todos los vértices." +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" msgid "" -"Betweenness centrality measures the extent to which a vertex lies on the " -"shortest paths between all other pairs of vertices. Vertices with a high " -"betweenness centrality score may have considerable influence in a network by " -"the virtue of their control over the shortest paths passing between them." +"``pgr_connectedComponents`` — Connected components of an undirected graph " +"using a DFS-based approach." msgstr "" -"La centralidad de interrelación mide hasta qué punto un vértice se encuentra " -"en las rutas más cortas entre todos los demás pares de vértices. Los " -"vértices con una alta centralidad entre pares pueden tener una influencia " -"considerable en una red gracias a su control sobre los caminos más cortos " -"que pasan entre ellos." +"``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido " +"mediante un enfoque basado en DFS." msgid "" -"The removal of these vertices will affect the network by disrupting the it, " -"as most of the shortest paths between vertices pass through them." -msgstr "" -"La eliminación de estos vértices afectará a la red al perturbarla, ya que la " -"mayoría de los caminos más cortos entre vértices pasan por ellos." - -msgid "This implementation work for both directed and undirected graphs." +"A connected component of an undirected graph is a set of vertices that are " +"all reachable from each other." msgstr "" -"Esta implementación funciona tanto para grafos dirigidos como no dirigidos." - -msgid "Running time: :math:`\\Theta(VE)`" -msgstr "Tiempo de ejecución: :math:`\\Theta(VE)`" +"Un componente conectado de un gráfico no direccionado es un conjunto de " +"vértices que son todos accesibles entre sí." -msgid "Running space: :math:`\\Theta(VE)`" -msgstr "Espacio de ejecución: :math:`\\Theta(VE)`" +msgid "Components are described by vertices" +msgstr "Los componentes se describen mediante vértices" -msgid "Throws when there are no edges in the graph" -msgstr "Lanza cuando no hay aristas en el grafo" +msgid "``component`` ascending" +msgstr "``component`` ascendente" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgstr "pgr_betweennessCentrality(`SQL de aristas`_, [``directed``])" +msgid "pgr_connectedComponents(`Edges SQL`_)" +msgstr "pgr_connectedComponents(`SQL de aristas`_)" -msgid "Returns set of ``(vid, centrality)``" -msgstr "Regresa el conjunto de ``(vid, centrality)``" +msgid "Returns set of |result-component-V|" +msgstr "Regresa conjunto de |result-component-V|" -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "Para un grafo dirigido con aristas :math:`\\{1, 2, 3, 4\\}`." +msgid "The connected components of the graph" +msgstr "Los componentes conectados del grafo" -msgid "Explanation" -msgstr "Explicación" +msgid "Has the value of the minimum node identifier in the component." +msgstr "Continene le valor mínimo de identificador de nodo en el componente." -msgid "The betweenness centrality are between parenthesis." -msgstr "La centralidad intermedia está entre paréntesis." +msgid "Identifier of the vertex that belongs to the ``component``." +msgstr "Identificador del vértice que pertenece al ``component``." -msgid "The leaf vertices have betweenness centrality :math:`0`." -msgstr "Los vértices de las hojas tienen una centralidad intermedia :math:`0`." +msgid "Connecting disconnected components" +msgstr "Conectando componentes desconectados" msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." +"wikipedia: `Connected component `__" msgstr "" -"La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del " -"vértice :math:`10`." +"wikipedia: `Componente conectado `__" -msgid "Removing vertex :math:`6` will create three graph components." -msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes." +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" -msgid "Removing vertex :math:`10` will create two graph components." +msgid "" +"``pgr_contraction`` — Performs graph contraction and returns the contracted " +"vertices and edges." msgstr "" -"Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." - -msgid "``vid``" -msgstr "``vid``" +"``pgr_contraction`` — Realiza la contracción del grafo y devuelve los " +"vértices y aristas contraídos.." -msgid "``centrality``" -msgstr "``centrality``" +msgid "New signature:" +msgstr "Nueva firma:" msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" +"Previously compulsory parameter **Contraction order** is now optional with " +"name ``methods``." msgstr "" -"Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" +"El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional " +"con el nombre ``methods``." + +msgid "New name and order of optional parameters." +msgstr "Nuevo nombre y orden de parámetros opcionales." msgid "" -"Boost's `betweenness_centrality `_" -msgstr "" -"`Boost: Centralidad de intermediación `__" +"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "Queries use the :doc:`sampledata` network." -msgstr "Las consultas utilizan la red :doc:`sampledata`." +msgid "Name change from ``pgr_contractGraph``" +msgstr "Cambio de nombre de ``pgr_contractGraph``" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +msgid "Bug fixes" +msgstr "Correcciones" msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." +"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 "" -"``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no " -"dirigido." +"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 "Result columns change:" -msgstr "Las columnas de resultados cambian:" +msgid "Does not return the full contracted graph." +msgstr "No devuelve el grafo contraído completo." -msgid "``n_seq`` is removed" -msgstr "``n_seq`` se elimina" +msgid "Only changes on the graph are returned." +msgstr "Solo se devuelven los cambios en el grafo." -msgid "``seq`` changed type to ``BIGINT``" -msgstr "``seq`` cambió el tipo a ``BIGINT``'" +msgid "The returned values include:" +msgstr "Los valores devueltos incluyen:" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." -msgstr "" -"Los componentes biconectados de un grafo no dirigido son los subconjuntos " -"máximos de vértices de modo que la eliminación de un vértice de un " -"componente determinado no desconectará el mismo. A diferencia de los " -"componentes conectados, los vértices pueden pertenecer a varios componentes " -"biconectados. Los vértices pueden estar presentes en varios componentes " -"biconectados, pero cada arista solo puede estar contenida en un único " -"componente biconectado." +msgid "The new edges generated by linear contraction." +msgstr "Las nuevas aristas generadas por la contracción lineal." -msgid "Components are described by edges." -msgstr "Los componentes se describen mediante aristas." +msgid "The modified vertices generated by dead end contraction." +msgstr "Los vértices modificados por contracción sin salida." -msgid "``component`` ascending." -msgstr "``componente`` ascendente." +msgid "The returned values are ordered as follows:" +msgstr "Los valores devueltos se ordenan de la siguiente manera:" -msgid "``edge`` ascending." -msgstr "``edge`` ascendente." +msgid "column ``id`` ascending when its a modified vertex." +msgstr "columna ``id`` ascendente cuando es un vértice modificado." -msgid "pgr_biconnectedComponents(`Edges SQL`_)" -msgstr "pgr_biconnectedComponents(`SQL de aristas`_)" +msgid "column ``id`` with negative numbers descending when its a new edge." +msgstr "" +"columna ``id`` con números negativos descendentes cuando es una nueva arista." -msgid "Returns set of |result-component-E|" -msgstr "Regresa conjunto de |result-component-E|" +msgid "" +"Currently there are two types of contraction methods included in this " +"function:" +msgstr "" +"Actualmente hay dos tipos de métodos de contracción incluidos en esta " +"función:" -msgid "The biconnected components of the graph" -msgstr "Los componentes biconectados del grafo" +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgstr "Contracción sin salida. Véase :doc:`pgr_contractionDeadEnd`." -msgid "``component``" -msgstr "``component``" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgstr "" -msgid "Component identifier." -msgstr "Identificador de componente." +msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgstr "pgr_contraction(`SQL de aristas`_, [**opciones**])" -msgid "Has the value of the minimum edge identifier in the component." -msgstr "Contiene el identificador mínimo de arista en el componente." +msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgstr "**opciones:** ``[directed, methods, cycles, forbidden]``" -msgid "Identifier of the edge that belongs to the ``component``." -msgstr "Identificador de arista que pertenece a ``component``." +msgid "Returns set of |result-contract|" +msgstr "Regresa conjunto de |result-contract|" -msgid "" -"Boost: `Biconnected components `__" +msgid "Dead end and linear contraction in that order on an undirected graph." msgstr "" -"Boost: `Componentes Biconectados `__" +"Hacer una contracción de callejón sin salida y una contracción lineal en ese " +"orden en un grafo no dirigido." -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgid "Contraction optional parameters" +msgstr "Parámetros opcionales de Contracción" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." +msgid "``methods``" msgstr "" -"``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo " -"binario." -msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" -"negative integer, is termed as a 'binary graph'." -msgstr "" -"Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' " -"es un entero no negativo, se le llama 'grafo binario'." +msgid "``INTEGER[]``" +msgstr "``INTEGER[]``" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Combinaciones`_)" +msgid "``ARRAY[1,2]``" +msgstr "``ARRAY[1,2]``" -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Uno a Uno`_)" +msgid "Ordered contraction operations." +msgstr "Operaciones de contracción ordenadas." -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Uno a Muchos`_)" +msgid "1 = Dead end contraction" +msgstr "1 = Contracción sin salida" -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Uno`_)" +msgid "2 = Linear contraction" +msgstr "2 - Contracción lineal" -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Muchos`_)" +msgid "``cycles``" +msgstr "``cycles``" -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 los caminos más cortos entre un único origen y todos los " -"demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:" -"`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número " -"mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. " -"Podemos interpretar este grafo también como un grafo ponderado, en el que " -"cada arista tiene el peso :math:`1`. Si no todas las aristas del grafo " -"tienen el mismo peso, necesitaremos un algoritmo más general, como el " -"Algoritmo de Dijkstra, que se ejecuta en tiempo :math:`O(|E|log|V|)`." +msgid ":math:`1`" +msgstr ":math:`1`" -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 "Number of times the contraction methods will be performed." +msgstr "Número de veces que se realizarán las operaciones de contracción." + +msgid "``forbidden``" +msgstr "``forbidden``" + +msgid "``BIGINT[]``" +msgstr "``BIGINT[]``" + +msgid "``ARRAY[]::BIGINT[]``" +msgstr "``ARRAY[]::BIGINT[]``" -msgid "" -"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 "Identifiers of vertices forbidden for contraction." +msgstr "Identificadores de vértices prohibidos para contracción." -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" -msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * |E|)`" +msgid "The function returns a single row. The columns of the row are:" +msgstr "La función devuelve una sola fila. Las columnas de la fila son:" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, " -"[``directed``])" +msgid "``type``" +msgstr "``type``" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, " -"[``directed``])" +msgid "Type of the row." +msgstr "Tipo de la fila." -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, " -"[``directed``])" +msgid "``v`` when the row is a vertex." +msgstr "``v`` cuando la fila es un vértice." -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, " -"[``directed``])" +msgid "Column ``id`` has a positive value." +msgstr "Columna ``id`` tiene valor positivo." -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, " -"[``directed``])" +msgid "``e`` when the row is an edge." +msgstr "``e`` cuando la fila es una arista." -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" -msgstr "" -"**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los " -"mismos (i.e :math:`1``)" +msgid "Column ``id`` has a negative value." +msgstr "Columna ``id`` tiene valor negativo." -msgid "https://cp-algorithms.com/graph/01_bfs.html" -msgstr "https://cp-algorithms.com/graph/01_bfs.html" +msgid "All numbers on this column are ``DISTINCT``" +msgstr "Todos los números de esta columna son ''DISTINTOS''" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "When ``type`` = **'v'**." +msgstr "En caso de ``type`` = **'v'**." -msgid "pgr_bipartite -Experimental" -msgstr "pgr_bipartite - Experimental" +msgid "Identifier of the modified vertex." +msgstr "Identificador del vértice modificado." -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." -msgstr "" -"``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el " -"mismo conjunto son adjacentes." +msgid "When ``type`` = **'e'**." +msgstr "En caso de ``type`` = **'e'**." -msgid "New **experimental** signature" -msgstr "Nueva firma **experimental**" +msgid "Decreasing sequence starting from **-1**." +msgstr "Disminución de la secuencia a partir de **-1**." 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." +"Representing a pseudo `id` as is not incorporated in the set of original " +"edges." 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." +"Representando un pseudo `id` como no incorporado en el conjunto de aristas " +"originales." -msgid "The algorithm works in undirected graph only." -msgstr "El algoritmo solo funciona en un grafo no dirigido." +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" -msgid "The returned values are not ordered." -msgstr "Los valores devueltos no están ordenados." +msgid "Array of contracted vertex identifiers." +msgstr "Arreglo de identificadores de vértices contraídos." + +msgid "When ``type`` = **'v'**: :math:`-1`" +msgstr "En caso de ``type`` = **'v'**: :math:`-1`" msgid "" -"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." +"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " +"(``source``, ``target``)." msgstr "" -"El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito " -"entonces devuelve el nodo junto con dos colores `0` y `1` que representan " -"dos conjuntos diferentes." - -msgid "If graph is not bipartite then algorithm returns empty set." -msgstr "Si el grafo no es bipartito, el algoritmo devuelve un conjunto vacío." +"En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual " +"(``source``, ``target``)." -msgid "pgr_bipartite(`Edges SQL`_)" -msgstr "pgr_bipartite(`SQL de aristas`_)" +msgid "" +"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " +"(``source``, ``target``)." +msgstr "" +"En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la " +"arista actual (``source``, ``target``)." -msgid "Returns set of |result-node-color|" -msgstr "Regresa el conjunto de |result-node-color|" +msgid "" +"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "" +"En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, " +"``target``)." -msgid "When the graph is bipartite" -msgstr "Cuando el grafo es bi-partido" +msgid "Only dead end contraction" +msgstr "Sólo contracción sin salida" -msgid "Additional Example" -msgstr "Ejemplo Adicional" +msgid "Only linear contraction" +msgstr "Sólo contracción lineal" -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 cycle" +msgstr "El ciclo" 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." +"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 "" -"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." +"Contraer un grafo se puede hacer con más de una operación. El orden de las " +"operaciones afecta al grafo contraído resultante, después de aplicar una " +"operación, el conjunto de vértices que se pueden contraer con otra operación " +"cambia." -msgid "Edges in blue represent odd length cycle subgraph." -msgstr "Aristas en azul representan un grafo de ciclo impar." +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgstr "" +"Esta implementación cicla `` cycles`` veces a través de los ``methods``." -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid "Contracting sample data" +msgstr "Contracción de los datos de muestra" msgid "" -"``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Boykov Kolmogorov " -"algorithm." +"In this section, building and using a contracted graph will be shown by " +"example." msgstr "" -"``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que " -"maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo " -"Boykov Kolmogorov." +"En esta sección, la creación y el uso de un grafo contraído se mostrarán en " +"el ejemplo." -msgid "New **proposed** signature" -msgstr "Nueva firma **propuesta**" +msgid "The :doc:`sampledata` for an undirected graph is used" +msgstr "Se usa :doc:`sampledata` para un grafo no dirigido" -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" -msgstr "``pgr_boykovKolmogorov`` (`Combinaciones`_)" +msgid "a dead end operation first followed by a linear operation." +msgstr "una operación sin salida primero seguida de una operación lineal." -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" -msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``" +msgid "Construction of the graph in the database" +msgstr "Construcción del grafo en la base de datos" -msgid "**Proposed** function" -msgstr "Función **propuesta**" +msgid "The original graph:" +msgstr "El grafo original:" -msgid "New **Experimental** function" -msgstr "Nueva función **Experimental**" +msgid "" +"The results do not represent the contracted graph. They represent the " +"changes that need to be done to the graph after applying the contraction " +"methods." +msgstr "" +"Los resultados no representan al grafo contraído. Representan los cambios " +"que necesitan hacerse en el grafo después de aplicar los métodos de " +"contracción." -msgid "Running time: Polynomial" -msgstr "Tiempo de ejecución: Polinomio" +msgid "" +"Observe that vertices, for example, :math:`6` do not appear in the results " +"because it was not affected by the contraction algorithm." +msgstr "" +"Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los " +"resultados porque no se vieron afectados por el algoritmo de contracción." -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destino**)" +msgid "After doing the dead end contraction operation:" +msgstr "Después de realizar la operación de contracción sin salida:" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salida**, **destinos**)" +msgid "After doing the linear contraction operation to the graph above:" +msgstr "Después de hacer la operación de contracción lineal al grafo anterior:" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destino**)" +msgid "The process to create the contraction graph on the database:" +msgstr "El proceso para crear el grafo de contracción en la base de datos:" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, **salidas**, **destinos**)" +msgid "Add additional columns" +msgstr "Añadir columnas adicionales" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_boykovKolmogorov(`SQL de aristas`_, `SQL de combinaciones`_)" +msgid "" +"Adding extra columns to the edges and vertices tables. In this documentation " +"the following will be used:" +msgstr "" -msgid "Returns set of |result-flow|" -msgstr "Regresa el conjunto de |result-flow|" +msgid "Column." +msgstr "Columna." -msgid "From vertex :math:`11` to vertex :math:`12`" -msgstr "Del vértice :math:`11` al vértice :math:`12`" +msgid "The vertices set belonging to the vertex/edge" +msgstr "El conjunto de vértices que pertenecen al vértice/arista" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "Desde el vértice :math:`11` a los vértices :math:`\\{5, 10, 12\\}`" +msgid "``is_contracted``" +msgstr "``is_contracted``" -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 "On the vertex table" +msgstr "En la tabla de vértices" msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +"when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" -"De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}" -"`" +"En caso de ''true'' se contrae el vértice, no forma parte del grafo " +"contraído." msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +"when ``false`` the vertex is not contracted, its part of the contracted " +"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 caso de ''false'' el vértice no se contrae, su parte del grafo contraído." + +msgid "``is_new``" +msgstr "``is_new``" -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 "On the edge table" +msgstr "En la tabla de aristas" -msgid "``pgr_breadthFirstSearch`` - Experimental" -msgstr "``pgr_breadthFirstSearch`` - Experimental" +msgid "" +"when ``true`` the edge was generated by the contraction algorithm. its part " +"of the contracted graph." +msgstr "" +"En caso de `` true``, la arista se generó por el algoritmo de contracción. " +"Es parte del grafo contraído." msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." +"when ``false`` the edge is an original edge, might be or not part of the " +"contracted graph." msgstr "" -"``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante " -"el algoritmo Breadth First Search." +"En caso de ``false`` , la arista es una arista original, podría ser o no " +"parte del grafo contraído." -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_breadthFirstSearch`` (`Vértice único`_)" +msgid "Store contraction information" +msgstr "Almacenar información de contracción" -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_breadthFirstSearch`` (`Múltiples Vértices`_)" +msgid "Store the contraction results in a table." +msgstr "Almacenar los resultados de la contracción en una tabla." + +msgid "Update the edges and vertices tables" +msgstr "Actualizar las tablas de aristas y vértices" msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." +"Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -"Proporciona el orden transversal de Primera Búsqueda de Amplitud desde un " -"vértice raíz hasta una profundidad particular." - -msgid "The implementation will work on any type of graph." -msgstr "La implementación funcionará en cualquier tipo de grafo." +"Usar la columna ``is_contracted`` para indicar los vértices contraídos." msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." +"Fill ``contracted_vertices`` with the information from the results that " +"belong to the vertices." msgstr "" -"Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un " -"nodo de origen a un nivel de profundidad objetivo." +"Llenar ``contracted_vertices`` con la información de los resultados que " +"pertenecen a los vértices." -msgid "Running time: :math:`O(E + V)`" -msgstr "Tiempo de ejecución: :math:`O(E + V)`" +msgid "Insert the new edges generated by pgr_contraction." +msgstr "Inserte las nuevas aristas generadas por pgr_contraction." -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raíz**, [**options**])" +msgid "The contracted graph" +msgstr "El grafo contraído" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])" +msgid "Vertices that belong to the contracted graph." +msgstr "Vértices que pertenecen al grafo contraído." -msgid "**options:** ``[max_depth, directed]``" -msgstr "**opcionales:** ``[max_depth, directed]``" +msgid "Edges that belong to the contracted graph." +msgstr "Aristas que pertenecen al grafo contraído." -msgid "Returns set of |result-bfs|" -msgstr "Regresa el conjunto de |result-bfs|" +msgid "Visually:" +msgstr "Visualmente:" + +msgid "Using the contracted graph" +msgstr "Usando el grafo contraído" msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" +"Depending on the final application the graph is to be prepared. In this " +"example the final application will be to calculate the cost from two " +"vertices in the original graph by using the contracted graph with " +"``pgr_dijkstraCost``" msgstr "" -"Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en " -"orden ascendente de ``id``" msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" +"There are three cases when calculating the shortest path between a given " +"source and target in a contracted graph:" msgstr "" -"A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no " -"dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas " -"ascendentemente in términos de ``id``" - -msgid "DFS optional parameters" -msgstr "Parámetros opcionales de DFS" +"Hay tres casos al calcular la ruta más corta entre un origen y un destino " +"determinados en un grafo contraído:" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." -msgstr "Igual que `Vértice único`_ con aritas en orden ascendente de ``id``." +msgid "Case 1: Both source and target belong to the contracted graph." +msgstr "Caso 1: Tanto el origen como el destino pertenecen al grafo contraído." -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." -msgstr "Igual que `Vértice único`_ con aritas en orden descendente de ``id``." +msgid "Case 2: Source and/or target belong to an edge subgraph." +msgstr "Caso 2: El origen y/o el destino pertenecen a un subgrafo de aristas." -msgid "The resulting traversal is different." -msgstr "El recorrido resultante es diferente." +msgid "Case 3: Source and/or target belong to a vertex." +msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice." -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." +msgid "The final application should consider all of those cases." msgstr "" -"La imagen izquierda muestra el resultado con el orden ascendente de los ids " -"y la imagen derecha muestra con el orden descendente de los identificadores " -"de aristas." -msgid "|ascending| |descending|" -msgstr "|ascending| |descending|" +msgid "Create a view (or table) of the contracted graph:" +msgstr "Crear una vista (o tabla) del grafo Contraído:" -msgid "ascending" -msgstr "ascendente" +msgid "Create the function that will use the contracted graph." +msgstr "Crear la función que va a utilizar el grafo contraído." -msgid "descending" -msgstr "descendente" +msgid "" +"Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "" +"Caso 2: El origen y/o el destino pertenecen a una arista que ha contraído " +"vertices." msgid "" -"`Boost: Breadth First Search algorithm documentation `__" +"Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" -"`Boost: Breadth First Search `__" +"Caso 3: El origen y/o el destino pertenecen a un vértice que ha sido " +"contraído." + +msgid "``pgr_contractionDeadEnd`` - Proposed" +msgstr "``pgr_contractionDeadEnd`` - Propuesto" msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " +"contracted vertices and edges." msgstr "" -"`Wikipedia: Breadth First Search `__" +"``pgr_contractionDeadEnd`` — Realiza la contracción del grafo y devuelve los " +"vértices y aristas contraídos.." -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +msgid "A node is considered a dead end node when:" +msgstr "Un nodo se considera sin salida cuando:" -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." -msgstr "``pgr_bridges`` - Calcula los puentes de un grafo no dirigido." +msgid "On undirected graphs:" +msgstr "En grafos no dirigidos:" + +msgid "The number of adjacent vertices is 1." +msgstr "El número de vértices adyacentes es 1." + +msgid "On directed graphs:" +msgstr "En grafos dirigidos:" + +msgid "When there is only one adjacent vertex or" +msgstr "Cuando hay solo un vértice adyacente o" msgid "" -"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." +"When all edges are incoming regardless of the number of adjacent vertices." msgstr "" -"Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su " -"número de componentes conectados. Esta implementación solo se puede utilizar " -"con un grafo no dirigido." -msgid "``edge`` ascending" -msgstr "``edge`` ascendente" +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionDeadEnd(`SQL de aristas`_, [**opciones**])" -msgid "Running time: :math:`O(E * (V + E))`" -msgstr "Tiempo de ejecución: :math:`O(E * (V + E))`" +msgid "**options:** ``[directed, forbidden]``" +msgstr "**opciones:** ``[directed, forbidden]``" -msgid "pgr_bridges(`Edges SQL`_)" -msgstr "pgr_bridges(`SQL de aristas`_)" +msgid "Dead end contraction on an undirected graph." +msgstr "Contracción de vértice sin salida en un grafo no dirigido." -msgid "Returns set of |result-edge|" -msgstr "Regresa conjunto de |result-edge|" +msgid "The green nodes are dead end nodes." +msgstr "Los nodos verdes son nodos sin salida." -msgid "The bridges of the graph" -msgstr "Los puentes del grafo" +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgstr "" +"El nodo :math:`3` es sin salida después de haberse contraído el nodo :math:" +"`1`." -msgid "Identifier of the edge that is a bridge." -msgstr "Identificador del borde que es un puente." +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "**Empty**" +msgstr "**vacío**" -msgid "**Supported versions**" -msgstr "** Versions soportadas**" +msgid "Value = ``e`` indicating the row is an edge." +msgstr "Valor = ``e`` cuando la fila es una arista." -msgid "``pgr_chinesePostman`` - Experimental" -msgstr "``pgr_chinesePostman`` - Experimental" +msgid "A pseudo `id` of the edge." +msgstr "Un pseudo `identificador` de la arista." -msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " -"every edge in a directed graph and starts and ends on the same vertex." -msgstr "" -"``pgr_chinesePostman`` — Calcula la ruta de circuito más corta que contiene " -"cada arista en un grafo dirigido y comienza y termina en el mismo vértice." +msgid "Identifier of the source vertex of the current edge." +msgstr "Identificador del vértice de origen de la arista actual." -msgid "Returns ``EMPTY SET`` on a disconnected graph" -msgstr "Devuelve ``EMPTY SET`` en un grafo desconectado" +msgid "Identifier of the target vertex of the current edge." +msgstr "Identificador del vértice destino de la arista actual." -msgid "pgr_chinesePostman(`Edges SQL`_)" -msgstr "pgr_chinesePostman(`SQL de aristas`_)" +msgid "Weight of the current edge." +msgstr "Peso de la arista actual." -msgid "Returns set of |result-1-1-no-seq|" -msgstr "Regresa el conjunto de |result-1-1-no-seq|" +msgid "Dead end vertex on undirected graph" +msgstr "Vértice sin salida en un grafo sin dirigir" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" -msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" +msgid "They have only one adjacent node." +msgstr "" -msgid "Sequential value starting from ``1``" -msgstr "Valor secuencial a partir de ``1``" +msgid "Dead end vertex on directed graph" +msgstr "Vértice sin salida en un grafo dirigido" + +msgid "The green nodes are dead end nodes" +msgstr "Los nodos verdes son nodos sin salida" msgid "" -"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." +"The blue nodes have an unlimited number of incoming and/or outgoing edges." 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." +"Los nodos azules tienen un número ilimitado de aristas entrantes y/o " +"salientes." -msgid "Aggregate cost from ``start_v`` to ``node``." -msgstr "Coste agregado de ``start_v`` to ``node``." +msgid "Node" +msgstr "Nodo" -msgid "``pgr_chinesePostmanCost`` - Experimental" -msgstr "``pgr_chinesePostmanCost`` - Experimental" +msgid "Adjacent nodes" +msgstr "Nodos adyacentes" -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." +msgid "Dead end" +msgstr "Sin salida" + +msgid "Reason" msgstr "" -"``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de " -"circuito que contiene cada arista de un grafo dirigido y comienza y termina " -"en el mismo vértice." -msgid "Return value when the graph if disconnected" -msgstr "Valor devuelto cuando el grafo está desconectado" +msgid ":math:`6`" +msgstr ":math:`6`" -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" -msgstr "pgr_chinesePostmanCost(`SQL de aristas`_)" +msgid ":math:`\\{1\\}`" +msgstr ":math:`\\{1\\}`" -msgid "RETURNS ``FLOAT``" -msgstr "DEVUELVE ``FLOAT``" +msgid "Yes" +msgstr "Si" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +msgid "Has only one adjacent node." +msgstr "Solo tiene un nodo adyacente." -msgid "Minimum costs of a circuit path." -msgstr "Costes mínimos de una trayectoria de circuito." +msgid ":math:`7`" +msgstr ":math:`7`" -msgid "pgr_connectedComponents" -msgstr "pgr_connectedComponents" +msgid ":math:`\\{2\\}`" +msgstr ":math:`\\{2\\}`" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." -msgstr "" -"``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido " -"mediante un enfoque basado en DFS." +msgid ":math:`8`" +msgstr ":math:`8`" -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." -msgstr "" -"Un componente conectado de un gráfico no direccionado es un conjunto de " -"vértices que son todos accesibles entre sí." +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`\\{2, 3\\}`" -msgid "Components are described by vertices" -msgstr "Los componentes se describen mediante vértices" +msgid "Has more than one adjacent node and all edges are incoming." +msgstr "" -msgid "``component`` ascending" -msgstr "``component`` ascendente" +msgid ":math:`\\{4\\}`" +msgstr ":math:`\\{4\\}`" -msgid "pgr_connectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents(`SQL de aristas`_)" +msgid ":math:`10`" +msgstr ":math:`10`" -msgid "Returns set of |result-component-V|" -msgstr "Regresa conjunto de |result-component-V|" +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`\\{4, 5\\}`" -msgid "The connected components of the graph" -msgstr "Los componentes conectados del grafo" +msgid "No" +msgstr "No" -msgid "Has the value of the minimum node identifier in the component." -msgstr "Continene le valor mínimo de identificador de nodo en el componente." +msgid "Has more than one adjacent node and all edges are outgoing." +msgstr "" -msgid "Identifier of the vertex that belongs to the ``component``." -msgstr "Identificador del vértice que pertenece al ``component``." +msgid ":math:`1,2,3,4,5`" +msgstr ":math:`1,2,3,4,5`" -msgid "Connecting disconnected components" -msgstr "Conectando componentes desconectados" +msgid "Many adjacent nodes." +msgstr "Muchos nodos adyacentes." msgid "" -"Boost: `Connected components `__" +"Has more than one adjacent node and some edges are incoming and some are " +"outgoing." msgstr "" -"Boost: `Componente conectado `__" msgid "" -"wikipedia: `Connected component `__" +"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " +"number of adjacent vertices is one." msgstr "" -"wikipedia: `Componente conectado `__" - -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +"De arriba, nodes :math:`\\{6, 7, 9\\}` son sin salida por que el número de " +"vértices adyacentes es 1." msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." +"When there are more than one adjacent vertex, all edges need to be all " +"incoming edges otherwise it is not a dead end." msgstr "" -"``pgr_contraction`` — Realiza la contracción del grafo y devuelve los " -"vértices y aristas contraídos.." - -msgid "Name change from ``pgr_contractGraph``" -msgstr "Cambio de nombre de ``pgr_contractGraph``" -msgid "Bug fixes" -msgstr "Correcciones" +msgid "Step by step dead end contraction" +msgstr "Paso a paso contracción sin salida" 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." +"The dead end contraction will stop until there are no more dead end nodes. " +"For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -"La contracción 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" +"La contracción sin salida se detendrá hasta que no haya más nodos sin " +"salida. Por ejemplo, del siguiente grafo donde :math:`3` es el nodo sin " +"salida:" -msgid "Only changes on the graph are returned" -msgstr "Solo se devuelven los cambios en el gráfico" +msgid "" +"After contracting :math:`3`, node :math:`2` is now a dead end node and is " +"contracted:" +msgstr "" +"Después de contraer :math:`3`, el nodo ` :math:`2` es ahora un nodo sin " +"salida y es contraído:" -msgid "Currnetly there are two types of contraction methods" -msgstr "Actualmente hay dos tipos de métodos de contracción" +msgid "" +"After contracting :math:`2`, stop. Node :math:`1` has the information of " +"nodes that were contracted." +msgstr "" +"Después de contraer :math:`2`, detener. El nodo :math:`1` tiene la " +"información de los nodos que se contraen." -msgid "Dead End Contraction" -msgstr "Contracción Sin Salida" +msgid "Creating the contracted graph" +msgstr "Creando el grafo contraído" -msgid "Linear Contraction" -msgstr "Contracción Lineal" +msgid "Steps for the creation of the contracted graph" +msgstr "Pasos para la creación del grafo contraído" -msgid "The returned values include" -msgstr "Los valores devueltos incluyen" +msgid "Add additional columns." +msgstr "Añadir columnas adicionales." -msgid "the added edges by linear contraction." -msgstr "las aristas añadidas por contracción lineal." +msgid "Save results into a table." +msgstr "Almacenar los resultados en una tabla." -msgid "the modified vertices by dead end contraction." -msgstr "los vértices modificados por contracción sin salida." +msgid "The contracted vertices are not part of the contracted graph." +msgstr "Los vértices contraído no forman parte del grafo contraído." -msgid "The returned values are ordered as follows:" -msgstr "Los valores devueltos se ordenan de la siguiente manera:" +msgid "Using when departure and destination are in the contracted graph" +msgstr "Usando cuando la salida como el destino pertenecen al grafo contraído" -msgid "column ``id`` ascending when type is ``v``" -msgstr "columna ``id`` ascendente cuando el tipo = ``v``" +msgid "Using when departure/destination is not in the contracted graph" +msgstr "Usando cuando la salida /destino no pertenecen al grafo contraído" -msgid "column ``id`` descending when type is ``e``" -msgstr "columna ``id`` descendente cuando el tipo = ``e``" +msgid "Using when departure and destination are not in the contracted graph" +msgstr "Usando cuando la salida y el destino no están en el grafo contraído" -msgid "The pgr_contraction function has the following signature:" -msgstr "La función pgr_contraction tiene la siguiente firma:" +msgid "``pgr_contractionLinear`` - Proposed" +msgstr "``pgr_contractionLinear`` - Propuesto" -msgid "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" +msgid "" +"``pgr_contractionLinear`` — Performs graph contraction and returns the " +"contracted vertices and edges." msgstr "" -"pgr_contraction(`SQL de aristas`_, **orden de contracción**, [**opciones**])" +"``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los " +"vértices y aristas contraídos.." -msgid "**options:** ``[ max_cycles, forbidden_vertices, directed]``" -msgstr "**opcionales:** ``[ max_cycles, forbidden_vertices, directed]``" +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" +msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])" -msgid "Returns set of |result-contract|" -msgstr "Regresa conjunto de |result-contract|" +msgid "Linear contraction on an undirected graph." +msgstr "Contracción lineal en un grafo no dirigido." msgid "" -"Making a dead end and linear contraction in that order on an undirected " +"The green nodes are linear nodes and will not be part of the contracted " "graph." -msgstr "" -"Hacer una contracción de callejón sin salida y una contracción lineal en ese " -"orden en un grafo no dirigido." +msgstr "Los nodos verdes son lineales y no forman parte del grafo contraído." + +msgid "All edges adjacent will not be part of the contracted graph." +msgstr "Aristas adyacentes no forman parte del grafo contraído." + +msgid "The red lines will be new edges of the contracted graph." +msgstr "Las lineas verdes son aristas que pertenecen al grafo contraído." msgid "**contraction Order**" msgstr "**Orden de contracciones**" -msgid "Ordered contraction operations." -msgstr "Operaciones de contracción ordenadas." - -msgid "1 = Dead end contraction" -msgstr "1 = Contracción sin salida" +msgid "" +"Number of times the contraction operations on ``contraction_order`` will be " +"performed." +msgstr "" +"Número de veces que se realizarán las operaciones de contracción en el orden " +"``contraction_order``." -msgid "2 = Linear contraction" -msgstr "2 - Contracción lineal" +msgid "A node connects two (or more) `linear` edges when" +msgstr "" -msgid "Contraction optional parameters" -msgstr "Parámetros opcionales de Contracción" +msgid "The number of adjacent vertices is 2." +msgstr "El número de vértices adyacentes es 2." -msgid "``forbidden_vertices``" -msgstr "``forbidden_vertices``" +msgid "In case of a directed graph, a node is considered a `linear` node when" +msgstr "En el caso de un grafo dirigido, un nodo se considera `lineal` cuando" -msgid "**Empty**" -msgstr "**vacío**" +msgid "Linearity is symmetrical." +msgstr "La linealidad es simétrica." -msgid "Identifiers of vertices forbidden for contraction." -msgstr "Identificadores de vértices prohibidos para contracción." +msgid "Linearity is not symmetrical" +msgstr "La linealidad no es simétrica" -msgid ":math:`1`" -msgstr ":math:`1`" +msgid "Graph where linearity is not symmetrical." +msgstr "Grafo cuando la linealidad no es simétrica." msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." +"When the graph is processed as a directed graph, linearity is not " +"symmetrical, therefore the graph can not be contracted." msgstr "" -"Número de veces que se realizarán las operaciones de contracción en el orden " -"``contraction_order``." -msgid "The function returns a single row. The columns of the row are:" -msgstr "La función devuelve una sola fila. Las columnas de la fila son:" +msgid "" +"When the same graph is processed as an undirected graph, linearity is " +"symmetrical, therefore the graph can be contracted." +msgstr "" -msgid "``type``" -msgstr "``type``" +msgid "The three edges can be replaced by one undirected edge" +msgstr "Las tres aristas pueden ser reemplazadas por una arista no dirigida" -msgid "Type of the ``id``." -msgstr "Tipo del ``id``." +msgid "Edge :math:`1 - 3`." +msgstr "Arista :math:`1 - 3`." -msgid "``v`` when the row is a vertex." -msgstr "``v`` cuando la fila es un vértice." +msgid "With cost: :math:`4`." +msgstr "Con costo: :math:`4`." -msgid "Column ``id`` has a positive value" -msgstr "Columna ``id`` tiene valor positivo" +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgstr "Vértices contraídos en la arista: :math:`\\{2\\}`." -msgid "``e`` when the row is an edge." -msgstr "``e`` cuando la fila es una arista." +msgid "Linearity is symmetrical" +msgstr "La linealidad es simétrica" -msgid "Column ``id`` has a negative value" -msgstr "Columna ``id`` tiene valor negativo" +msgid "Graph where linearity is symmetrical." +msgstr "Grafo donde la linealidad es simétrica." -msgid "All numbers on this column are ``DISTINCT``" -msgstr "Todos los números de esta columna son ''DISTINTOS''" +msgid "The four edges can be replaced by two directed edges." +msgstr "Las cuatro aristas pueden ser reemplazadas con dos aristas dirigidas." -msgid "When ``type`` = **'v'**." -msgstr "En caso de ``type`` = **'v'**." +msgid "Edge :math:`3 - 1`." +msgstr "Arista :math:`3 - 1`." -msgid "Identifier of the modified vertex." -msgstr "Identificador del vértice modificado." +msgid "With cost: :math:`6`." +msgstr "Con costo: :math:`6`." -msgid "When ``type`` = **'e'**." -msgstr "En caso de ``type`` = **'e'**." +msgid "The four edges can be replaced by one undirected edge." +msgstr "Las cuatro aristas pueden ser reemplazadas con una arista no dirigida." -msgid "Decreasing sequence starting from **-1**." -msgstr "Disminución de la secuencia a partir de **-1**." +msgid "Step by step linear contraction" +msgstr "Contracción lineal, paso a paso" msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." +"The linear contraction will stop when there are no more linear edges. For " +"example from the following graph there are linear edges" msgstr "" -"Representando un pseudo `id` como no incorporado en el conjunto de aristas " -"originales." +"La contracción lineal se detendrá hasta que no hayan más aristas lineales. " +"Por ejemplo, en el siguiente grafo hay aristas lineales" -msgid "Array of contracted vertex identifiers." -msgstr "Arreglo de identificadores de vértices contraídos." +msgid "Contracting vertex :math:`3`," +msgstr "Contrayendo el vértice :math:`3`," -msgid "When ``type`` = **'v'**: :math:`-1`" -msgstr "En caso de ``type`` = **'v'**: :math:`-1`" +msgid "The vertex :math:`3` is removed from the graph" +msgstr "El vértice :math:`3` se elimina del grafo" msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." +"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " +"from the graph." msgstr "" -"En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual " -"(``source``, ``target``)." +"Los aristas :math:`2 \\rightarrow 3` y :math:`w \\rightarrow z` fueron " +"eliminados del grafo." msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." +"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" -"En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la " -"arista actual (``source``, ``target``)." +"Se inserta una nuevo arista :math:`2 \\rightarrow 4` y se representa con " +"color rojo." + +msgid "Contracting vertex :math:`2`:" +msgstr "Contrayendo el vértice :math:`2`:" + +msgid "The vertex :math:`2` is removed from the graph" +msgstr "El vértice :math:`2` se elimina del grafo" msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " +"from the graph." msgstr "" -"En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, " -"``target``)." +"Los aristas :math:`1 \\rightarrow 2` y :math:`2 \\rightarrow 3` son " +"eliminados del grafo." -msgid "Only dead end contraction" -msgstr "Sólo contracción sin salida" +msgid "" +"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "" +"Se inserta una nuevo arista :math:`1 \\rightarrow 3` y se representa con " +"color rojo." -msgid "Only linear contraction" -msgstr "Sólo contracción lineal" +msgid "" +"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " +"were contracted." +msgstr "" +"El arista :math:`1 \\rightarrow 3` tiene la información de los costos y " +"nodos que fueron contraídos." + +msgid "Create the contracted graph." +msgstr "Crear el grafo contraído." -msgid "pgr_createTopology" -msgstr "pgr_createTopology" +msgid "``pgr_createTopology`` - Deprecated since v3.8.0" +msgstr "``pgr_createTopology`` - Obsoleto desde 3.8.0" msgid "" "``pgr_createTopology`` — Builds a network topology based on the geometry " @@ -11498,40 +11564,19 @@ msgstr "" 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." -msgstr "" -"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`." -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`." -msgstr "" -"``integer`` Indicador de que el vértice puede tener un problema. Véase :doc:" -"`pgr_analyzeGraph`." - msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " -"AS incoming. See :doc:`pgr_analyzeOneWay`." +"AS incoming." 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 la tabla de aristas que hacen referencia a " +"este vértice como entrante." msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " -"AS outgoing. See :doc:`pgr_analyzeOneWay`." +"AS outgoing." 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 la tabla de aristas que hacen referencia a " +"este vértice como saliente." msgid "The simplest way to use pgr_createTopology is:" msgstr "La forma más sencilla de utilizar pgr_createTopology es:" @@ -11667,11 +11712,8 @@ msgstr "" "En este ejemplo se inicia una topología limpia, con 5 aristas y, a " "continuación, se incrementa al resto de los bordes." -msgid "The example uses the :doc:`sampledata` network." -msgstr "En el ejemplo se utiliza la red :doc:`sampledata`." - -msgid "pgr_createVerticesTable" -msgstr "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable`` - Deprecated since 3.8.0" +msgstr "``pgr_createVerticesTable`` - Obsoleto desde 3.8.0" msgid "" "``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " @@ -11718,20 +11760,6 @@ msgstr "" msgid "The names of source, target are the same." msgstr "Los nombres de los campos de origen y destino son las mismos." -msgid "" -"``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`." -msgstr "" -"``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" @@ -11836,23 +11864,6 @@ msgstr "" ":doc:`topology-functions` para una visión general de una topología para " "algoritmos de enrutamiento." -msgid "" -":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." - -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." - -msgid ":doc:`pgr_analyzeOneWay` to analyze directionality of the edges." -msgstr "" -":doc:`pgr_analyzeOneWay` para analizar la direccionalidad de los bordes." - msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" @@ -11936,8 +11947,8 @@ msgstr "" "`Wikipedia: Ordenamiento Cuthill-McKee `__" -msgid "pgr_dagShortestPath - Experimental" -msgstr "pgr_dagShortestPath - Experimental" +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimental" msgid "" "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " @@ -12032,11 +12043,18 @@ msgstr "Columnas de Resultados" msgid "Making **start_vids** the same as **end_vids**" msgstr "Haciendo **vértices de salida** igual que **vértices destino**" +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" +"`Boost: Caminos mas cortos en DAG `__" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" -msgid "``pgr_degree`` -- Proposed" -msgstr "``pgr_degree`` -- Propuesto" +msgid "``pgr_degree``" +msgstr "``pgr_degree``" msgid "" "``pgr_degree`` — For each vertex in an undirected graph, return the count of " @@ -12045,8 +12063,52 @@ msgstr "" "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el " "número de aristas incidentes en el vértice." -msgid "Calculates the degree of the vertices of an **undirected** graph" -msgstr "Calcula el grado de los vértices de un grafo **no dirigido**" +msgid "Error messages adjustment." +msgstr "" + +msgid "New signature with only Edges SQL." +msgstr "" + +msgid "Calculates the degree of the vertices of an undirected graph" +msgstr "Calcula el grado de los vértices de un grafo no dirigido" + +msgid "" +"The degree (or valency) of a vertex of a graph is the number of edges that " +"are incident to the vertex." +msgstr "" +"El grado (o valencia) de un vértice de un grafo es el número de aristas " +"incidentes al vértice." + +msgid "A loop contributes 2 to a vertex's degree." +msgstr "" + +msgid "A vertex with degree 0 is called an isolated vertex." +msgstr "" + +msgid "Isolated vertex is not part of the result" +msgstr "Vértice aislado no forma parte del resultado" + +msgid "" +"Vertex not participating on the subgraph is considered and isolated vertex." +msgstr "" + +msgid "" +"There can be a ``dryrun`` execution and the code used to get the answer will " +"be shown in a PostgreSQL ``NOTICE``." +msgstr "" +"Dado que se trata de una ejecución ``dryrun``, el código de todos los " +"cálculos se muestra en el ``NOTICE`` de PostgreSQL." + +msgid "" +"The code can be used as base code for the particular application " +"requirements." +msgstr "" + +msgid "No ordering is performed." +msgstr "No se realiza ningún ordenamiento." + +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "pgr_degree(`Edges SQL`_ , [``dryrun``])" msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgstr "pgr_degree(`SQL de aristas`_ , `SQL de vértices`_, [``dryrun``])" @@ -12054,19 +12116,31 @@ msgstr "pgr_degree(`SQL de aristas`_ , `SQL de vértices`_, [``dryrun``])" msgid "RETURNS SETOF |result-degree|" msgstr "REGRESA CONJUNTO DE |result-degree|" +msgid "Edges" +msgstr "" + +msgid "example" +msgstr "ejemplo" + +msgid "Get the degree of the vertices defined on the edges table" +msgstr "Obtener el grado de los vértices definidos en la tabla de aristas" + +msgid "Edges and Vertices" +msgstr "Aristas y Vértices" + msgid "Extracting the vertex information" msgstr "Extraer la información del vértice" +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgstr "" + msgid "" -"pgr_degree can utilize output from `pgr_extractVertices` or can have " -"`pgr_extractVertices` embedded in the call. For decent size networks, it is " -"best to prep your vertices table before hand and use that vertices table for " -"pgr_degree calls." +"For decent size networks, it is best to prepare your vertices table before " +"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" -"pgr_degree puede utilizar la salida de `pgr_extractVertices` o puede tener " -"`pgr_extractVertices` incrustado en la llamada. Para redes de tamaño " -"decente, lo mejor es preparar la tabla de vértices de antemano y utilizar " -"esa tabla de vértices para las llamadas pgr_degree." + +msgid "Calculate the degree of the nodes:" +msgstr "Calcula el grado de los vértices:" msgid "`Vertex SQL`_" msgstr "`SQL de vértices`_" @@ -12081,15 +12155,18 @@ msgid "When true do not process and get in a NOTICE the resulting query." msgstr "" "Cuando verdadero, no procesar y recibir un AVISO de la consulta resultante." +msgid "For the `Edges and Vertices`_ signature:" +msgstr "Para la firma `Aristas y Vértices`_:" + +msgid "For the `Edges`_ signature:" +msgstr "Para la firma `Aristas`_:" + msgid "Vertex SQL" msgstr "SQL de vértices" msgid "``in_edges``" msgstr "``in_edges``" -msgid "``BIGINT[]``" -msgstr "``BIGINT[]``" - msgid "" "Array of identifiers of the edges that have the vertex ``id`` as *first end " "point*." @@ -12122,9 +12199,49 @@ msgstr "``degree``" msgid "Number of edges that are incident to the vertex ``id``" msgstr "Número de aristas incidentes al vértice ``id``" +msgid "Degree of a loop" +msgstr "Grado de un bucle" + +msgid "Using the `Edges`_ signature." +msgstr "Usando la firma `Aristas`_." + +msgid "Using the `Edges and Vertices`_ signature." +msgstr "" + msgid "Degree of a sub graph" msgstr "Grado de un subgrafo" +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "Para el siguiente sub-grafo de :doc:`sampledata`:" + +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr "" + +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr "" + +msgid "The vertices not participating on the edge are considered isolated" +msgstr "" + +msgid "their degree is 0 in the subgraph and" +msgstr "" + +msgid "their degree is not shown in the output." +msgstr "" + +msgid "Using a vertex table" +msgstr "Usando una tabla de vértices" + +msgid "" +"For decent size networks, it is best to prepare your vertices table before " +"hand and use it on ``pgr_degree`` calls." +msgstr "" +"Para un tamaño de red razonable, es mejor preparar previamente una tabla de " +"vértices y utilizarla en las llamadas a ``pgr_degree``." + +msgid "Extract the vertex information and save into a table:" +msgstr "Extraer la información del vértice y almacenar en una tabla:" + msgid "Dry run execution" msgstr "Ejecución de prueba" @@ -12142,19 +12259,34 @@ msgstr "" "Los resultados se pueden usar como código base para realizar un refinamiento " "basado en las necesidades de desarrollo de back-end." -msgid "Degree from an existing table" -msgstr "Grado a partir de una tabla existente" +msgid "Finding dead ends" +msgstr "Encontrando callejones sin salida" msgid "" -"If you have a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, you can forgo using " -"pgr_degree and work with the ``in_edges`` and ``out_edges`` columns directly." +"If there is a vertices table already built using ``pgr_extractVertices`` and " +"want the degree of the whole graph rather than a subset, it can be forgo " +"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " +"columns directly." msgstr "" "Si se tiene una tabla de vértices ya construida usando " "``pgr_extractVertices`` y se quiere el grado de todo el grafo en lugar de un " "subconjunto, se puede trabajar con las columnas ``in_edges`` y ``out_edges`` " "directamente." +msgid "The degree of a dead end is 1." +msgstr "El grado de un sin salida es 1." + +msgid "Finding linear vertices" +msgstr "Encontrando vértices lineales" + +msgid "The degree of a linear vertex is 2." +msgstr "El grado de un vértice lineal es 2." + +msgid "" +"If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "" +"Cuando hay una tabla de vértices construida usando ``pgr_extractVertices``" + msgid ":doc:`pgr_extractVertices`" msgstr ":doc:`pgr_extractVertices`" @@ -12171,15 +12303,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "Versión 3.3.0" -msgid "Promoted to **proposed** function" -msgstr "Promovido a función **propuesta**" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_depthFirstSearch`` (`Vértice único`_)" - -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 " @@ -12249,18 +12372,18 @@ msgstr "" "Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" -"`Boost: Documentación del algoritmo de Primera Búsqueda de Profundidad " -"`__" +"`Boost: Primera Búsqueda de Profundidad `__" msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" -"`Boost: Documentación del algoritmo DFS No dirigido `__" +"`Boost: DFS No dirigido `__" msgid "" "`Wikipedia: Depth First Search algorithm `__" +msgstr "" +"`Boost: Camino mas corto Dijkstra `__" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -12546,9 +12661,6 @@ msgstr "" "``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el " "algoritmo de Dijkstra." -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "``pgr_dijkstraCost`` (`Combinaciones`_)" - msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " "using Dijkstra Algorithm." @@ -12906,9 +13018,6 @@ msgstr "Cuando ``true``: solo se devolverán los resultados del límite ``cap``" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "Cuando ``false``: ``cap`` límite por ``Start vid`` será devuelto" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -13113,6 +13222,9 @@ msgstr "" "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de " "inicio." +msgid "Standarizing output columns to |result-spantree|" +msgstr "Estandarización de columnas de resultados a |result-spantree|" + msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "Agregado las columnas de resultados``depth`` y ``start_vid``." @@ -13123,14 +13235,17 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "Agregado las columnas de resultados``depth`` y ``pred``." -msgid "Signature change pgr_drivingDistance(single vertex)" -msgstr "Cambio de firma pgr_drivingDistance(vértice único)" +msgid "Signature change:" +msgstr "Cambio de firma:" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" -msgstr "Nuevo **Oficial** pgr_drivingDistance(multiples vértices)" +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance(vértice único)" -msgid "Official:: pgr_drivingDistance(single vertex)" -msgstr "Oficial:: pgr_drivingDistance(vértice único)" +msgid "New official signature:" +msgstr "Nueva firma oficial:" + +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance(múltiples vértices)" msgid "" "Using the Dijkstra algorithm, extracts all the nodes that have costs less " @@ -13199,8 +13314,8 @@ msgstr "" "Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un " "grafo no dirigido" -msgid "pgr_edgeColoring - Experimental" -msgstr "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" +msgstr "``pgr_edgeColoring`` - Experimental" msgid "" "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " @@ -13286,6 +13401,19 @@ msgstr "Regresa el conjunto de |result-edge-color|" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" +"`Boost: Coloración de Segmentos `__" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "" +"`Wikipedia: Coloración de grafos `__" + msgid "``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" @@ -13296,9 +13424,6 @@ msgstr "" "``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas " "entre dos grupos de vértices." -msgid "New **proposed** function:" -msgstr "Nueva función **propuesta**:" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(Combinaciones)" @@ -13403,9 +13528,6 @@ msgstr "" "maximizan el flujo de las fuentes a los destinos usando el algoritmo de " "Edmonds Karp." -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "``pgr_edmondsKarp`` (`Combinaciones`_)" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "Renombrado desde ``pgr_maxFlowEdmondsKarp``" @@ -13427,13 +13549,17 @@ msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "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" +msgid "" +"`Boost: Edmonds Karp max flow `__" +msgstr "" +"`Boost: Edmonds Karp max flow `__" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "``pgr_edwardMoore - Experimental``" +msgid "``pgr_edwardMoore`` - Experimental" msgstr "``pgr_edwardMoore`` - Experimental" msgid "" @@ -13442,20 +13568,8 @@ msgstr "" "``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-" "Moore." -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "``pgr_edwardMoore`` (`Combinaciones`_)" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "``pgr_edwardMoore`` (`Uno a Uno`_)" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "``pgr_edwardMoore`` (`Uno a Muchos`_)" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "``pgr_edwardMoore`` (`Muchos a Uno`_)" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" -msgstr "``pgr_edwardMoore`` (`Muchos a Muchos`_)" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(Combinaciones)" msgid "" "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " @@ -13537,15 +13651,12 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "pgr_extractVertices -- Proposed" -msgstr "pgr_extractVertices -- Propuesto" +msgid "``pgr_extractVertices``" +msgstr "``pgr_extractVertices``" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` — Extrae la información de los vértices" -msgid "Classified as **proposed** function" -msgstr "Clasicado como función **propuesta**" - msgid "" "This is an auxiliary function for extracting the vertex information of the " "set of edges of a graph." @@ -13662,14 +13773,8 @@ msgstr "" "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría " "puntual." -msgid "New **proposed** signatures:" -msgstr "Nuevas firmas **propuestas**:" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "``pgr_findCloseEdges`` (`Un punto`_)" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "``pgr_findCloseEdges`` (`Muchos puntos`_)" +msgid "``partial`` option is removed." +msgstr "Opción ``partial`` se elimina." msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " @@ -13691,8 +13796,8 @@ msgstr "" "El código para realizar los cálculos puede obtenerse para realizar los " "ajustes específicos que necesite la aplicación." -msgid "``EMTPY SET`` is returned on dryrun executions" -msgstr "``EMTPY SET`` se devuelve en ejecuciones en seco" +msgid "``EMPTY SET`` is returned on dryrun executions" +msgstr "``EMPTY SET`` se devuelve en ejecuciones en seco" msgid "" "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" @@ -13704,8 +13809,8 @@ msgid "" msgstr "" "pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])" -msgid "**options:** ``[cap, partial, dryrun]``" -msgstr "**opcionales:** ``[cap, partial, dryrun]``" +msgid "**options:** ``[cap, dryrun]``" +msgstr "**opciones:** ``[cap, dryrun]``" msgid "Returns set of |result-find|" msgstr "Regresa conjunto de |result-find|" @@ -13713,59 +13818,17 @@ msgstr "Regresa conjunto de |result-find|" msgid "One point" msgstr "Un punto" -msgid "Default: ``cap => 1``" -msgstr "Por defecto: ``cap => 1``" - -msgid "Maximum one row answer." -msgstr "Respuesta de una fila como máximo." - -msgid "Default: ``partial => true``" -msgstr "Por defecto: ``partial => true``" - -msgid "With less calculations as possible." -msgstr "Con menos cálculos posibles." - -msgid "Default: ``dryrun => false``" -msgstr "Por defecto: ``dryrun => false``" - -msgid "Process query" -msgstr "Consulta del proceso" - -msgid "Returns" -msgstr "Devuelve" - -msgid "values on ``edge_id``, ``fraction``, ``side`` columns." -msgstr "valores en las columnas ``edge_id``, ``fraction``, ``side``." - -msgid "``NULL`` on ``distance``, ``geom``, ``edge`` columns." -msgstr "``NULL`` en las columnas ``distance``, ``geom``, ``edge``." - -msgid "Many points" -msgstr "Muchos puntos" - -msgid "" -"Find at most :math:`2` edges close to all vertices on the points of interest " -"table." +msgid "Get two close edges to points of interest with :math:`pid = 5`" msgstr "" -"Encuentra como máximo :math:`2` aristas cercanas a todos los vértices de la " -"tabla de puntos de interés." -msgid "One answer per point, as small as possible." -msgstr "Una respuesta por punto, lo más pequeña posible." +msgid "``cap => 2``" +msgstr "``cap => 2``" -msgid "" -"Columns ``edge_id``, ``fraction``, ``side`` and ``geom`` are returned with " -"values." -msgstr "" -"Las columnas ``edge_id``, ``fraction``, ``side`` y ``geom`` se devuelven con " -"valores." +msgid "Many points" +msgstr "Muchos puntos" -msgid "" -"``geom`` contains the original point geometry to assist on deterpartialing " -"to which point geometry the row belongs to." +msgid "For each points of interests, find the closest edge." msgstr "" -"``geom`` contiene la geometría de puntos original para ayudar a determinar a " -"qué geometría de puntos pertenece la fila." msgid "**point**" msgstr "**punto**" @@ -13791,19 +13854,6 @@ msgstr "Distancia máxima entre geometrías" msgid "Limit output rows" msgstr "Limitar las filas de salida" -msgid "``partial``" -msgstr "``parcial``" - -msgid "" -"When ``true`` only columns needed for :doc:`withPoints-category` are " -"calculated." -msgstr "" -"Cuando ``true`` sólo se calculan las columnas necesarias para :doc:" -"`withPoints-category`." - -msgid "When ``false`` all columns are calculated" -msgstr "Cuando ``false`` se calculan todas las columnas" - msgid "When ``false`` calculations are performed." msgstr "Cuando ``false`` se realizan los cálculos." @@ -13821,73 +13871,81 @@ msgid "When :math:`cap = 1`, it is the closest edge." msgstr "Cuando :math:`cap = 1`, es la arista más cercana." msgid "" -"Value in <0,1> that indicates the relative postition from the first end-" -"point of the edge." +"Value in <0,1> that indicates the relative position from the first end-point " +"of the edge." msgstr "" -"El valor entre <0,1> indica la posición relativa desde el primer punto de la " +"Valor entre <0,1> indica la posición relativa desde el primer punto de la " "arista." msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "Valor en ``[r, l]`` que indica si el punto es:" -msgid "In the right ``r``." -msgstr "A la derecha ``r``." - -msgid "In the left ``l``." -msgstr "A la izquierda ``l``." +msgid "At the right ``r`` of the segment." +msgstr "A la derecha ``r`` del segmento." msgid "When the point is on the line it is considered to be on the right." msgstr "Cuando el punto está en la línea se considera que está a la derecha." +msgid "At the left ``l`` of the segment." +msgstr "A la izquierda ``l`` del segmento." + msgid "``distance``" msgstr "``distancia``" -msgid "Distance from point to edge." +msgid "Distance from the point to the edge." msgstr "Distancia del punto a la arista." -msgid "``NULL`` when ``cap = 1`` on the `One point`_ signature" -msgstr "``NULL`` cuando ``cap = 1`` en la firma de `Un punto`_" - -msgid "``POINT`` geometry" -msgstr "geometría ``POINT``" +msgid "Original ``POINT`` geometry." +msgstr "Geometría original ``POINT``." msgid "" -"`One Point`_: Contains the point on the edge that is ``fraction`` away from " -"the starting point of the edge." +"``LINESTRING`` geometry that connects the original **point** to the closest " +"point of the edge with identifier ``edge_id``" msgstr "" -"`Un Punto`_: Contiene el punto de la arista que está a ``fraction`` del " -"punto inicial de la arista." +"Geometría ``LINESTRING`` desde el **punto** original hasta el punto más " +"cercano de la arista con identificador ``edge_id``" -msgid "`Many Points`_: Contains the corresponding **original point**" -msgstr "`Muchos Puntos`_: Contiene el **punto original** correspondiente" +msgid "One point in an edge" +msgstr "Un punto en la arista" + +msgid "The green node is the original point." +msgstr "El nodo verde es el punto original." + +msgid "``geom`` has the value of the original point." +msgstr "``geom`` Tiene el valor del punto original." msgid "" -"``LINESTRING`` geometry from the **original point** to the closest point of " -"the edge with identifier ``edge_id``" +"The geometry ``edge`` is a line that connects the original point with the " +"edge :math:`sp \\rightarrow ep` edge." msgstr "" -"Geometría ``LINESTRING`` desde el **punto original** hasta el punto más " -"cercano de la arista con identificador ``edge_id``" +"La geometría ``edge``, es una línea que conecta al punto original con el " +"punto más cercano de la arista :math:`sp \\rightarrow ep`." + +msgid "The point is located at the left of the edge." +msgstr "El punto original está situado a la izquierda de la arista." -msgid "One point results" -msgstr "Resultados de un punto" +msgid "One point dry run execution" +msgstr "Ejecución en seco de un punto" -msgid "The green nodes is the **original point**" -msgstr "Los nodos verdes son el **punto original**" +msgid "Using the query from the previous example:" +msgstr "Usando la consulta del ejemplo anterior:" -msgid "" -"The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." -msgstr "" -"La geometría ``geom`` es un punto en la arista :math:`sp \\rightarrow ep`." +msgid "Returns ``EMPTY SET``." +msgstr "Devuelve ``CONJUNTO VACÍO``." + +msgid "``dryrun => true``" +msgstr "``dryrun => true``" + +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." +msgstr "Genera un ``NOTICE`` de PostgreSQL con el código utilizado." msgid "" -"The geometry ``edge`` is a line that connects the **original point** with " -"``geom``" +"The generated code can be used as a starting base code for additional " +"requirements, like taking into consideration the SRID." msgstr "" -"La geometría ``edge`` es una línea que conecta el **punto original** con " -"``geom``" -msgid "Many point results" -msgstr "Resultados de muchos puntos" +msgid "Many points in an edge" +msgstr "Ejemplos de muchos puntos en una arista" msgid "The green nodes are the **original points**" msgstr "Los nodos verdes son los **puntos originales**" @@ -13908,158 +13966,8 @@ msgstr "" "conecta el **punto original** con el punto más cercano de la arista :math:" "`sp \\rightarrow ep`." -msgid "One point examples" -msgstr "Ejemplos de un punto" - -msgid "At most two answers" -msgstr "Como máximo dos respuestas" - -msgid "``cap => 2``" -msgstr "``cap => 2``" - -msgid "Maximum two row answer." -msgstr "Respuesta de dos filas como máximo." - -msgid "Understanding the result" -msgstr "Comprendiendo el resultado" - -msgid "``NULL`` on ``geom``, ``edge``" -msgstr "``NULL`` en ``geom``, ``edge``" - -msgid "``edge_id`` identifier of the edge close to the **original point**" -msgstr "``edge_id`` identificador de la arista cercana al **punto original**" - -msgid "" -"Two edges are withing :math:`0.5` distance units from the **original " -"point**: :math:`{5, 8}`" -msgstr "" -"Dos aristas están a menos de :math:`0.5` unidades de distancia del **punto " -"original**: :math:`{5, 8}`" - -msgid "For edge :math:`5`:" -msgstr "Para la arista :math:`5`:" - -msgid "" -"``fraction``: The closest point from the **original point** is at the :math:" -"`0.8` fraction of the edge :math:`5`." -msgstr "" -"``fraction``: El punto más cercano desde el **punto original** está en la " -"fracción :math:`0.8` del borde :math:`5`." - -msgid "" -"``side``: The **original point** is located to the left side of edge :math:" -"`5`." -msgstr "" -"``side``: El **punto original** está situado a la izquierda de la arista :" -"math:`5`." - -msgid "" -"``distance``: The **original point** is located :math:`0.1` length units " -"from edge :math:`5`." -msgstr "" -"``distance``: El **punto original** está situado a :math:`0.1` unidades de " -"longitud de la arista :math:`5`." - -msgid "For edge :math:`8`:" -msgstr "Para la arista :math:`8`:" - -msgid "" -"``fraction``: The closest point from the **original point** is at the :math:" -"`0.89..` fraction of the edge :math:`8`." -msgstr "" -"``fraction``: El punto más cercano desde el **punto original** está en la " -"fracción :math:`0.89..` del borde :math:`8`." - -msgid "" -"``side``: The **original point** is located to the right side of edge :math:" -"`8`." -msgstr "" -"``side``: El **punto original** está situado a la derecha de la arista :math:" -"`8`." - -msgid "" -"``distance``: The **original point** is located :math:`0.19..` length units " -"from edge :math:`8`." -msgstr "" -"``distance``: El **punto original** se encuentra a :math:`0.19..` unidades " -"de longitud de la arista :math:`8`." - -msgid "One answer, all columns" -msgstr "Una respuesta, todas las columnas" - -msgid "``partial => false``" -msgstr "``partial => false``" - -msgid "Calculate all columns" -msgstr "Calcular todas las columnas" - -msgid "" -"``edge_id`` identifier of the edge **closest** to the **original point**" -msgstr "" -"``edge_id`` identificador de la arista **más cercana** al **punto original**" - -msgid "" -"From all edges within :math:`0.5` distance units from the **original " -"point**: :math:`{5}` is the closest one." -msgstr "" -"De todos los bordes dentro de :math:`0.5` unidades de distancia desde el " -"**punto original**: :math:`{5}` es el más cercano." - -msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`5` from " -"the **original point**." -msgstr "" -"``geom``: Contiene la geometría del punto más cercano de la arista :math:`5` " -"desde el **punto original**." - -msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " -"the closest point on on edge :math:`5` ``geom``" -msgstr "" -"``edge``: Contiene la geometría ``LINESTRING`` del **punto original** al " -"punto más cercano de la arista :math:`5` ``geom``" - -msgid "At most two answers with all columns" -msgstr "Como máximo dos respuestas con todas las columnas" - -msgid "Understanding the result:" -msgstr "Comprender el resultado:" - -msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`8` from " -"the **original point**." -msgstr "" -"``geom``: Contiene la geometría del punto más cercano de la arista :math:`8` " -"desde el **punto original**." - -msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " -"the closest point on on edge :math:`8` ``geom``" -msgstr "" -"``borde``: Contiene la geometría ``LINESTRING`` del **punto original** al " -"punto más cercano de la arista :math:`8` ``geom``" - -msgid "One point dry run execution" -msgstr "Ejecución en seco de un punto" - -msgid "Returns ``EMPTY SET``." -msgstr "Devuelve ``CONJUNTO VACÍO``." - -msgid "``partial => true``" -msgstr "``partial => true``" - -msgid "Is ignored" -msgstr "Se ignora" - -msgid "" -"Because it is a **dry run** excecution, the code for all calculations are " -"shown on the PostgreSQL ``NOTICE``." -msgstr "" -"Dado que se trata de una ejecución **dry run**, el código de todos los " -"cálculos se muestra en el ``NOTICE`` de PostgreSQL." - -msgid "``dryrun => true``" -msgstr "``dryrun => true``" +msgid "Many points dry run execution" +msgstr "Ejecución en seco de muchos puntos" msgid "Do not process query" msgstr "No procesar la consulta" @@ -14070,72 +13978,6 @@ msgstr "" "Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular " "todas las columnas" -msgid "``cap`` and **original point** are used in the code" -msgstr "``cap`` y **punto original** se utilizan en el código" - -msgid "Many points examples" -msgstr "Ejemplos de muchos puntos" - -msgid "At most two answers per point" -msgstr "Un máximo de dos respuestas por punto" - -msgid "``NULL`` on ``edge``" -msgstr "``NULL`` en ``edge``" - -msgid "" -"``edge_id`` identifier of the edge close to a **original point** (``geom``)" -msgstr "" -"``edge_id`` identificador de la arista cercana a un **punto original** " -"(``geom``)" - -msgid "" -"Two edges at most withing :math:`0.5` distance units from each of the " -"**original points**:" -msgstr "" -"Dos aristas a un máximo de :math:`0.5` unidades de distancia de cada uno de " -"los **puntos originales**:" - -msgid "For ``POINT(1.8 0.4)`` and ``POINT(0.3 1.8)`` only one edge was found." -msgstr "" -"Para ``POINT(1.8 0.4)`` y ``POINT(0.3 1.8)`` sólo se encontró una arista." - -msgid "For the rest of the points two edges were found." -msgstr "Para el resto de los puntos se encontraron dos aristas." - -msgid "For point ``POINT(2.9 1.8)``" -msgstr "Para el punto ``POINT(2.9 1.8)``" - -msgid "" -"Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the shortest " -"distance to ``POINT(2.9 1.8)``." -msgstr "" -"La arista :math:`5` está antes que la arista :math:`8` por lo tanto la " -"arista :math:`5` tiene la distancia más corta a ``POINT(2.9 1.8)``." - -msgid "One answer per point, all columns" -msgstr "Una respuesta por punto, todas las columnas" - -msgid "For the **original point** ``POINT(2.9 1.8)``" -msgstr "Para el **punto original** ``POINT(2.9 1.8)``" - -msgid "Edge :math:`5` is the closest edge to the **original point**" -msgstr "La arista :math:`5` es la más cercana al **punto original**" - -msgid "" -"``geom``: Contains the geometry of the **original point** ``POINT(2.9 1.8)``" -msgstr "" -"``geom``: Contiene la geometría del **punto original** ``POINT(2.9 1.8)``" - -msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** " -"(``geom``) to the closest point on on edge." -msgstr "" -"``edge``: Contiene la geometría ``LINESTRING`` del **punto original** " -"(``geom``) al punto más cercano en el borde." - -msgid "Many points dry run execution" -msgstr "Ejecución en seco de muchos puntos" - msgid "Find at most two routes to a given point" msgstr "Encontrar como máximo dos rutas a un punto dado" @@ -14177,14 +14019,12 @@ msgstr "" msgid "A unique identifier." msgstr "Un identificador único." -msgid "" -"Identifier of the edge nearest edge that allows an arrival to the point." -msgstr "" -"Identificador de la arista más cercana que permite una llegada al punto." +msgid "Identifier of the nearest segment." +msgstr "Identificador del segmento mas próximo." -msgid "Is it on the left, right or both sides of the segment ``edge_id``" +msgid "Is it on the left, right or both sides of the segment ``edge_id``." msgstr "" -"Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``" +"Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``." msgid "Where in the segment is the point located." msgstr "En qué parte del segmento se encuentra el punto." @@ -14192,14 +14032,38 @@ msgstr "En qué parte del segmento se encuentra el punto." msgid "The geometry of the points." msgstr "La geometría de los puntos." +msgid "The distance between ``geom`` and the segment ``edge_id``." +msgstr "La distancia entre ``geom`` y el segmento ``edge_id``." + +msgid "" +"A segment that connects the ``geom`` of the point to the closest point on " +"the segment ``edge_id``." +msgstr "" +"Un segmento que conecta la ``geom`` del punto al punto mas cercano al " +"segmento ``edge_id``." + msgid "``newPoint``" msgstr "``newPoint``" -msgid "The geometry of the points moved on top of the segment." -msgstr "La geometría de los puntos desplazados sobre el segmento." +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgstr "" + +msgid "Points of interest fill up" +msgstr "Llenado de puntos de interés" + +msgid "Inserting the points of interest." +msgstr "Insertando los puntos de interés." + +msgid "Filling the rest of the table." +msgstr "Llenando el resto de la tabla." -msgid "Points of interest fillup" -msgstr "LLenado de puntos de interés" +msgid "" +"Any other additional modification: In this manual, point :math:`6` can be " +"reached from both sides." +msgstr "" + +msgid "The points of interest:" +msgstr "Los puntos de interés:" msgid "``pgr_floydWarshall``" msgstr "``pgr_floydWarshall``" @@ -14235,9 +14099,6 @@ msgstr "" "Boost `Algoritmo floyd-Warshall `_" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "Consultas utilizan la red :doc:`sampledata`." - msgid "``pgr_full_version``" msgstr "``pgr_full_version``" @@ -14247,9 +14108,6 @@ msgstr "" "``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**" - msgid "Get complete details of pgRouting version information" msgstr "Obtener los detalles de la información de la versión de pgRouting" @@ -14316,19 +14174,16 @@ msgstr "``hash``" msgid "Git hash of pgRouting build" msgstr "Hash de Git de pgRouting" -msgid "``pgr_hawickCircuits - Experimental``" -msgstr "``pgr_hawickCircuits - Experimental``" +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "``pgr_hawickCircuits`` - Experimental" msgid "" -"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " +"``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits " "algorithm." msgstr "" -"``pgr_hawickCircuits`` — Enumeración de los circuitos usando el algoritmo de " +"``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de " "circutos de Hawick." -msgid "``pgr_hawickCircuits``" -msgstr "``pgr_hawickCircuits``" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -14480,8 +14335,12 @@ msgstr "" "El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las " "aristas en azul representan el subgrafo :math:`K_5`." -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" -msgstr "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "" +"`Boost: Boyer Myrvold `__" +msgstr "" +"`Boost: Boyer Myrvold `__" msgid "``pgr_johnson``" msgstr "``pgr_johnson``" @@ -14549,6 +14408,9 @@ msgstr "" "``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo " "con orden de Primera Búsqueda en Anchura." +msgid "Added ``pred`` result columns." +msgstr "Agregado columna de resultados ``pred``." + msgid "" "Visits and extracts the nodes information in Breath First Search ordering of " "the Minimum Spanning Tree created using Kruskal's algorithm." @@ -14648,8 +14510,8 @@ msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" -msgstr "pgr_lengauerTarjanDominatorTree -Experimental" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgid "" "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " @@ -14714,11 +14576,11 @@ msgid "Dominator tree of another component." msgstr "Árbnol dominante de otro componente." msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" -"`Boost: Algoritmo Lengauer-Tarjan de árbol dominante `__" +"`Boost: Árbol dominante Lengauer-Tarjan `__" msgid "" "`Wikipedia: dominator tree `__" -msgid "pgr_lineGraph - Proposed" -msgstr "pgr_lineGraph - Propuesto" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - Propuesto" msgid "" "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" @@ -14737,6 +14599,9 @@ msgstr "" "``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente " "basado en aristas." +msgid "Works for directed and undirected graphs." +msgstr "Funciona para grafos dirigidos y no dirigidos." + msgid "" "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" @@ -14787,16 +14652,10 @@ msgstr "Para un grafo no dirigido con aristas :math:'{2,4,5,8}'" msgid "Gives a local identifier for the edge" msgstr "Da un identificador local de la arista" -msgid "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." -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." @@ -15054,16 +14913,14 @@ msgstr "" "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 include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" -"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 " +"Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con " "``reverse_cost``." msgid "The data" -msgstr "" +msgstr "Los datos" msgid "" "This example displays how this graph transformation works to create " @@ -15079,7 +14936,7 @@ msgid "first" msgstr "primero" msgid "The transformation" -msgstr "" +msgstr "La transformación" msgid "|second|" msgstr "|second|" @@ -15122,7 +14979,7 @@ msgid "" msgstr "" msgid "Store edge results" -msgstr "" +msgstr "Almacenar resultados de aristas" msgid "" "The first step is to store the results of the ``pgr_lineGraphFull`` call " @@ -15136,7 +14993,7 @@ msgid "From the original graph's vertex information" msgstr "" msgid "Add the new vertices" -msgstr "" +msgstr "Agregar nuevos vértices" msgid "Filling the mapping table" msgstr "" @@ -15156,7 +15013,7 @@ msgid "Updating values from self loops" msgstr "" msgid "Inspecting the vertices table" -msgstr "" +msgstr "Inspeccionando la tabla de vértices" msgid "Updating from inner self loops" msgstr "" @@ -15298,18 +15155,18 @@ msgstr "pgr_makeConnected(`SQL de aristas`_)" msgid "Returns set of |result-component-make|" msgstr "Regresa conjunto de |result-component-make|" +msgid "List of edges that are needed to connect the graph." +msgstr "Lista de aristas que se necesitan para conectar el grafo." + msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +"`Boost: make connected `__" msgstr "" -"La consulta realizada en la red de :doc:`sampledata` proporciona la lista de " -"aristas que se necesitan en el grafo para conectarlo." - -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" -msgstr "https://www.boost.org/libs/graph/doc/make_connected.html" +"`Boost: conectar `__" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" msgid "" "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " @@ -15318,14 +15175,17 @@ msgstr "" "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad " "máxima en un grafo." +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "pgr_maxCardinalityMatch(text) regresa solamente la columna ``edge``." + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "``directed => false`` when used." -msgstr "" +msgid "directed => ``false`` when used." +msgstr "Con directed => `` false`` cuando se usa." msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "Renombrado de ``pgr_maximumCardinalityMatching``" @@ -15385,8 +15245,12 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "Identificador de la arista en la consulta original." -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" -msgstr "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "" +"`Boost: maximum_matching `__" +msgstr "" +"`Boost: Coincidencia máxima `__" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -15404,12 +15268,6 @@ msgstr "" "``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los " "orígene(s) a los destino(s) mediante el algoritmo Push Relabel." -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "``pgr_maxFlow`` (`Combinaciones`_)" - -msgid "New **Proposed** function" -msgstr "Nueva función **Propuesta**" - msgid "Calculates the maximum flow from the sources to the targets." msgstr "Calcula el flujo máximo de las fuentes a los objetivos." @@ -15445,8 +15303,12 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)" -msgid "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" +msgid "" +"`Boost: push relabel max flow `__" +msgstr "" +"`Boost: Flujo máximo empujar reetiquetar `__" msgid "" "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" @@ -15463,8 +15325,11 @@ msgstr "" "``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo " "maximo en un grafo" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost`` (`Combinaciones`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(Combinaciones)" + +msgid "|boost| graph inside." +msgstr "|boost| graph adentro." msgid "**TODO** check which statement is true:" msgstr "**Por hacer** comprobar qué declaración es verdadera:" @@ -15513,13 +15378,6 @@ msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "Returns set of |result-flow-mincost|" msgstr "Regresa el conjunto de |result-flow-mincost|" -msgid "" -"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 "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental" @@ -15530,8 +15388,8 @@ msgstr "" "``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo " "en un grafo" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost_Cost`` (`Combinaciones`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" msgid "**The cost value of all input edges must be nonnegative.**" msgstr "" @@ -15567,8 +15425,8 @@ msgstr "" "Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los " "objetivo(s)" -msgid "pgr_nodeNetwork" -msgstr "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" +msgstr "``pgr_nodeNetwork``" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." msgstr "" @@ -15629,246 +15487,107 @@ msgstr "" "``tolerance`` para decidir cuáles nodos son considerados como mismo nodo." msgid "``float8`` tolerance for coincident points (in projection unit)dd" -msgstr "" -"``float8`` tolerancia para puntos de coincidencia (en la unidad de " -"proyección)" - -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``." - -msgid "The output table will have for ``edge_table_noded``" -msgstr "La tabla de salida que tendrá para ``edge_table_noded``" - -msgid "``bigint`` Unique identifier for the table" -msgstr "``bigint`` identificador único del vértice" - -msgid "old_id" -msgstr "old_id" - -msgid "``bigint`` Identifier of the edge in original table" -msgstr "``bigint`` Identificador de la arista en la tabla original" - -msgid "sub_id" -msgstr "sub_id" - -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" -msgstr "" -"``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" -msgstr "" -"``integer`` Columna vacía de destino que se utilizará con la función :doc:" -"`pgr_createTopology`" - -msgid "the geom" -msgstr "la geom" - -msgid "``geometry`` Geometry column of the noded network" -msgstr "``geometry`` Columna de geometría de la red discontínua" - -msgid "Examples" -msgstr "Ejemplos" - -msgid "Let's create the topology for the data in :doc:`sampledata`" -msgstr "Vamos a crear la topología para los datos en :doc:`sampledata`" - -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:" -msgstr "" -"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" -msgstr "" -"Inspeccionar la tabla generada, podemos ver que los bordes 13,14 y 18 ha " -"sido segmentado" - -msgid "We can create the topology of the new network" -msgstr "Podemos crear la topología de la nueva red" - -msgid "Now let's analyze the new topology" -msgstr "Ahora analicemos la nueva topología" - -msgid "Images" -msgstr "Imágenes" - -msgid "Before Image" -msgstr "Imágen del Antes" - -msgid "Before image" -msgstr "Imágen del antes" - -msgid "After Image" -msgstr "Imágen del Después" - -msgid "After image" -msgstr "Imágen del después" - -msgid "Comparing the results" -msgstr "Comparando los resultados" - -msgid "Comparing with the Analysis in the original edge_table, we see that." -msgstr "Comparando con el análisis del edge_table original, vemos que." - -msgid "Before" -msgstr "Antes de" +msgstr "" +"``float8`` tolerancia para puntos de coincidencia (en la unidad de " +"proyección)" -msgid "After" -msgstr "Después de" +msgid "table_ending" +msgstr "table_ending" -msgid "Table name" -msgstr "Nombre de la tabla" +msgid "``text`` Suffix for the new table's. Default value is ``noded``." +msgstr "" +"``text`` sufijo para la nueva tabla. El valor predeterminado es ``noded``." -msgid "edge_table_noded" -msgstr "edge_table_noded" +msgid "The output table will have for ``edge_table_noded``" +msgstr "La tabla de salida que tendrá para ``edge_table_noded``" -msgid "Fields" -msgstr "Campos" +msgid "``bigint`` Unique identifier for the table" +msgstr "``bigint`` identificador único del vértice" -msgid "All original fields" -msgstr "Todos los campos originales" +msgid "old_id" +msgstr "old_id" -msgid "Has only basic fields to do a topology analysis" -msgstr "Tiene solamente campos básicos para hacer un análisis de topología" +msgid "``bigint`` Identifier of the edge in original table" +msgstr "``bigint`` Identificador de la arista en la tabla original" -msgid "Edges with 1 dead end: 1,6,24" -msgstr "Los bordes con 1 callejón sin salida: 1,6,24" +msgid "sub_id" +msgstr "sub_id" -msgid "Edges with 2 dead ends: 17,18" -msgstr "Aristas con 2 callejones sin salida: 17,18" +msgid "``integer`` Segment number of the original edge" +msgstr "``integer`` número del segmento del borde original" -msgid "" -"Edge 17's right node is a dead end because there is no other edge sharing " -"that same node. (cnt=1)" +msgid "``integer`` Empty source column" 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)" -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" +msgid "``integer`` Empty target column" +msgstr "" -msgid "Isolated segments" -msgstr "Segmentos aislados" +msgid "the geom" +msgstr "la geom" -msgid "two isolated segments: 17 and 18 both they have 2 dead ends" -msgstr "dos segmentos aislados: 17 y 18 ambos tienen 2 callejones sin salida" +msgid "``geometry`` Geometry column of the noded network" +msgstr "``geometry`` Columna de geometría de la red discontínua" -msgid "No Isolated segments" -msgstr "Segmentos no aislados" +msgid "Examples" +msgstr "Ejemplos" -msgid "Edge 17 now shares a node with edges 14-1 and 14-2" -msgstr "Borde 17 ahora comparte un nodo con bordes 14-1 y 14-2" +msgid "Create the topology for the data in :doc:`sampledata`" +msgstr "Crear la topología para los datos en :doc:`sampledata`" -msgid "Edges 18-1 and 18-2 share a node with edges 13-1 and 13-2" -msgstr "Bordes 18-1 y 18-2 compartir un nodo con bordes 13-1 y 13-2" +msgid "Analyze the network for intersections." +msgstr "" -msgid "Gaps" -msgstr "Espacios" +msgid "Analyze the network for gaps." +msgstr "Analizar la red por espacios." -msgid "" -"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" +msgid "The analysis tell us that the network has a gap and an intersection." +msgstr "El análisis dice que la red tiene un hueco y una intersección." -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" +msgid "Fixing an intersection" +msgstr "Encontrando una intersección" -msgid "Intersections" -msgstr "Intersecciones" +msgid "Storing the intersections." +msgstr "Almacenando las intersecciones." -msgid "Edges 13 and 18 were intersecting" -msgstr "Bordes 13 y 18 años se intersectan" +msgid "Calling ``pgr_nodeNetwork``." +msgstr "Llamando a ``pgr_nodeNetwork``." 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" +"Inspecting the generated table, we can see that edges 13 and 18 have been " +"segmented." 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" +"Inspeccionar la tabla generada, podemos ver que las aristas 13 y 18 ha sido " +"segmentados." -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:" -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:" +msgid "Update the topology" +msgstr "Actualizar la topología" -msgid "" -"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" +msgid "Add new segments to the edges table." +msgstr "Agregar segmentos a la tabla de aristas." -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" +msgid "Insert the intersection as new vertices." +msgstr "Insertar las intersecciones como nuevos vértices." -msgid "We recreate the topology:" -msgstr "Recreamos la topología:" +msgid "Update source and target information on the edges table." +msgstr "Actualizar la salida y el destino en la tabla de aristas." -msgid "" -"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:" +msgid "Delete original edge." +msgstr "Eliminar la arista original original." -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:" +msgid "Update the vertex topology" +msgstr "Actualizar la topología de vértices" -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." +msgid "Fixing a gap" 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." + +msgid "Store the deadends" +msgstr "Almacenar los callejones sin salida" 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." +"Inspecting the generated table, we can see that edge 14 has been segmented." 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." +"Inspeccionar la tabla generada, podemos ver que la arista 14 ha sido " +"segmentado." msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - Experimental" @@ -15952,6 +15671,8 @@ msgstr "Firma" msgid "" "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" +"pgr_pickDeliver(`SQL de ordenes`_, `SQL de vehículos`_, `SQL de matriz`_, " +"[**opciones**])" msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "**opcionales:** ``[factor, max_cycles, initial_sol]``" @@ -16060,7 +15781,7 @@ msgid "" "projectweb/top/pdptw/li-lim-benchmark/" msgstr "" -msgid "There are 25 vehciles in the problem all with the same characteristics." +msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "" msgid "The original orders" @@ -16071,7 +15792,7 @@ msgid "" "order." msgstr "" -msgid "The original data needs to be converted to an appropiate table:" +msgid "The original data needs to be converted to an appropriate table:" msgstr "" msgid "The query" @@ -16191,9 +15912,6 @@ msgstr "" "``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza " "el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel." -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "``pgr_pushRelabel`` (`Combinaciones`_)" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "Renombrado de ``pgr_maxFlowPushRelabel``" @@ -16212,8 +15930,8 @@ msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destinos**)" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "pgr_sequentialVertexColoring - Proposed" -msgstr "pgr_sequentialVertexColoring - Propuesto" +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "``pgr_sequentialVertexColoring`` - Propuesto" msgid "" "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " @@ -16222,9 +15940,6 @@ msgstr "" "``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 " @@ -16283,8 +15998,15 @@ msgstr ":math:`k` es el número de colores utilizados." msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`SQL de aristas`_)" -msgid "pgr_stoerWagner - Experimental" -msgstr "pgr_stoerWagner - Experimental" +msgid "" +"`Boost: Sequential Vertex Coloring `__" +msgstr "" +"`Boost: Coloración Secuencial de Vértices `__" + +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - Experimental" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "" @@ -16390,6 +16112,13 @@ msgstr "corte mínimo de una arista" msgid "Using :doc:`pgr_connectedComponents`" msgstr "Usando :doc:`pgr_connectedComponents`" +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" +"`Boost: Corte mínimo Stoer Wagner `__" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -16423,10 +16152,10 @@ msgid "The strong components of the graph" msgstr "Los componentes fuertes del grafo" msgid "" -"Boost: `Strong components `__" msgstr "" -"Boost: `Components fuertemente conectados `__" msgid "" @@ -16499,6 +16228,13 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "" +"`Boost: topological sort `__" +msgstr "" +"`Boost: Ordenamiento topológico `__" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - Experimental" @@ -16555,57 +16291,54 @@ msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" "Identificadores de los vértices que son alcanzables desde el vértice v." +msgid "" +"`Boost: transitive closure `__" +msgstr "" +"`Boost: Cierre transitivo `__" + msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "pgr_trsp - Proposed" -msgstr "" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "``pgr_trsp`` - Ruteo con restricciones." -msgid "New proposed signatures" -msgstr "Nuevas firmas propuestas" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp(Uno a Uno)" -msgid "``pgr_trsp`` (`One to One`_)" -msgstr "``pgr_trsp`` (`Uno a Uno`_)" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp(Uno a Muchos)" -msgid "``pgr_trsp`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp`` (`Many to One`_)" -msgstr "" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp(Muchos a Uno)" -msgid "``pgr_trsp`` (`Many to Many`_)" -msgstr "" +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp(Muchos a Muchos)" -msgid "``pgr_trsp`` (`Combinations`_)" -msgstr "" +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp(Combinaciones)" msgid "Deprecated signatures" msgstr "Firmas obsoletas" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" - -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" -msgstr "" - -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" -msgstr "" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" -msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" -msgstr "" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgid "New prototypes" msgstr "Nuevos prototipos" -msgid "``pgr_trspViaVertices``" -msgstr "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "``pgr_trspViaEdges``" -msgstr "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" msgid "" "Turn restricted shortest path (TRSP) is an algorithm that receives turn " @@ -16686,20 +16419,15 @@ msgstr "Usando una tabla de combinaciones en un grafo no dirigido." msgid "" "`Deprecated documentation `_" msgstr "" +"`Documentación obsoleta `_" -msgid "``pgr_trspVia`` - Proposed" -msgstr "" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -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 :" @@ -16710,7 +16438,7 @@ msgid "The paths represents the sections of the route." msgstr "Las trayectorias representan los tramos de la ruta." msgid "Execute a :doc:`pgr_dijkstraVia`." -msgstr "" +msgstr "Ejecutar un :doc:`pgr_dijkstraVia`." msgid "" "For the set of sub paths of the solution that pass through a restriction then" @@ -16781,17 +16509,14 @@ msgstr "" msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints`` - Proposed" -msgstr "" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" msgid "" "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" "or points with restrictions." msgstr "" -msgid "``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 " @@ -16888,7 +16613,7 @@ msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "" msgid "Using :doc:`pgr_findCloseEdges`:" -msgstr "Usa :doc:`pgr_findCloseEdges`:" +msgstr "Usando :doc:`pgr_findCloseEdges`:" msgid "" "Visit from vertex :math:`1` to the two locations on the graph of point " @@ -16923,7 +16648,7 @@ msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" -msgstr "" +msgstr "El algoritmo realiza una :doc:`pgr_withPointsVia`" msgid "" "Detects which of the paths pass through a restriction in this case is for " @@ -16961,30 +16686,12 @@ msgid "" "`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" -msgstr "" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "``pgr_trsp_withPoints`` (`Uno a Uno`_)" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -17128,16 +16835,15 @@ msgstr "" "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el " "vértice :math:`1` en un grafo no dirigido, con detalles." -msgid "pgr_turnRestrictedPath - Experimental" -msgstr "pgr_turnRestrictedPath - Experimental" +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 "" - -msgid "New experimental function" -msgstr "Nueva función Experimental" +"``pgr_turnRestrictedPath`` Usando el algoritmo vértice -vértice de Yen para " +"ruteo con restricciones" msgid "" "Using Yen's algorithm to obtain K shortest paths and analyze the paths to " @@ -17213,8 +16919,8 @@ msgstr "pgr_version()" msgid "pgRouting Version for this documentation" msgstr "Versión de pgRouting para esta documentación" -msgid "pgr_vrpOneDepot - Experimental" -msgstr "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - Experimental" msgid "**No documentation available**" msgstr "**No hay documentación disponible**" @@ -17222,8 +16928,8 @@ msgstr "**No hay documentación disponible**" msgid "**TBD**" msgstr "**TBD**" -msgid "``pgr_withPoints`` - Proposed" -msgstr "``pgr_withPoints`` - Propuesto" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -17398,8 +17104,8 @@ msgstr "Del punto :math:`6` al vértice :math:`11`." msgid "Passes in front or visits with left side driving." msgstr "Pasa enfrente o visita con lado izquierdo de manejo." -msgid "``pgr_withPointsCost`` - Proposed" -msgstr "``pgr_withPointsCost`` - Propuesto" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -17582,8 +17288,8 @@ msgstr "Topología de manejo del lado izquierdo" msgid "Does not matter driving side driving topology" msgstr "No importa el lado de manejo" -msgid "``pgr_withPointsCostMatrix`` - proposed" -msgstr "``pgr_withPointsCostMatrix`` - propuesto" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -17622,8 +17328,8 @@ msgstr "" "Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las " "dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`." -msgid "``pgr_withPointsDD`` - Proposed" -msgstr "``pgr_withPointsDD`` - Propuesto" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -17637,8 +17343,11 @@ msgid "" "unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" -msgstr "``pgr_withPointsDD`` (`Vértice único`)" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "pgr_withPointsDD(Vértice único)" + +msgid "pgr_withPointsDD(Multiple vertices)" +msgstr "pgr_withPointsDD(Múltiples vértices)" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." msgstr "Agregado las columnas ``depth``, ``pred`` y ``start_vid``." @@ -17655,18 +17364,16 @@ msgid "" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgid "" "Modify the graph to include points and using Dijkstra algorithm, extracts " @@ -17795,11 +17502,8 @@ msgstr "" "Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin " "importar el lado de manejo, detallada." -msgid ":doc:`pgr_alphaShape`" -msgstr ":doc:`pgr_alphaShape`" - -msgid "pgr_withPointsKSP - Proposed" -msgstr "pgr_withPointsKSP - Propuesto" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -17810,29 +17514,26 @@ msgstr "" msgid "Standarizing output columns to |nksp-result|" msgstr "" -msgid "``pgr_withPointsKSP`` (One to One)" -msgstr "``pgr_withPointsKSP`` (Uno a Uno)" - -msgid "New overload functions" -msgstr "Nuevas funciones de sobrecarga" +msgid "pgr_withPointsKSP(One to One)" +msgstr "pgr_withPointsKSP(Uno a Uno)" -msgid "``pgr_withPointsKSP`` (One to Many)" -msgstr "``pgr_withPointsKSP`` (Uno a Muchos)" +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP(Uno a Muchos)" -msgid "``pgr_withPointsKSP`` (Many to One)" -msgstr "``pgr_withPointsKSP`` (Muchos a Uno)" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(Muchos a Uno)" -msgid "``pgr_withPointsKSP`` (Many to Many)" -msgstr "``pgr_withPointsKSP`` (Muchos a Muchos)" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(Muchos a Muchos)" -msgid "``pgr_withPointsKSP`` (Combinations)" -msgstr "``pgr_withPointsKSP`` (Combinaciones)" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP(Combinaciones)" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgid "" @@ -17985,16 +17686,14 @@ msgstr "" "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el " "punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." -msgid "``pgr_withPointsVia`` - Proposed" -msgstr "" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " "points." msgstr "" - -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "" +"``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos." msgid "" "Given a graph, a set of points on the graphs edges and a list of vertices, " @@ -18100,72 +17799,334 @@ msgstr ":doc:`pgr_withPointsDD` - Distancia de conducción." msgid ":doc:`pgr_withPointsVia` - Via routing" msgstr ":doc:`pgr_withPointsVia` - Ruteo vía ubicaciones" -msgid "These proposed functions do not modify the database." -msgstr "Estas funciones propuestas no modifican la base de datos." +msgid "" +":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr "" +":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de " +"líneas." + +msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." +msgstr ":doc:`withPoints-family` - Funciones basadas en el algoritmo Dijkstra." + +msgid "From the :doc:`TRSP-family`:" +msgstr "Desde :doc:`TRSP-family` :" + +msgid "Reference" +msgstr "Referencia" + +msgid "Release Notes" +msgstr "Notas de versión" msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incidet edges to the vertex." +"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." + +msgid "Mayors" +msgstr "" + +msgid "pgRouting 4" +msgstr "pgRouting 4" + +msgid "Minors 4.x" +msgstr "" + +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" + +msgid "pgRouting 3" +msgstr "pgRouting 3" + +msgid "Minors 3.x" +msgstr "" + +msgid "pgRouting 3.8" +msgstr "pgRouting 3.8" + +msgid "pgRouting 3.8.0 Release Notes" +msgstr "Notas de la versión de pgRouting 3.8.0" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.8.0 `__" +msgstr "" +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 3.8.0 `_" + +msgid "Promotion to official function of pgRouting." +msgstr "Promoción a función oficial de pgRouting." + +msgid "" +"`#2772 `__: " +"pgr_extractVertices" +msgstr "" +"`#2772 `__: " +"pgr_extractVertices" + +msgid "" +"`#2760 `__: pgr_degree" +msgstr "" +"`#2760 `__: pgr_degree" + +msgid "" +"`#2774 `__: " +"pgr_findCloseEdges" +msgstr "" +"`#2774 `__: " +"pgr_findCloseEdges" + +msgid "Deprecation of functions." +msgstr "Funciones obsoletas." + +#, fuzzy +msgid "" +"`#2749 `__: " +"pgr_alphaShape" +msgstr "" +"`#2754 `__: " +"pgr_analyzeOneWay" + +msgid "" +"`#2754 `__: " +"pgr_analyzeOneWay" +msgstr "" +"`#2754 `__: " +"pgr_analyzeOneWay" + +msgid "" +"`#2753 `__: " +"pgr_analyzeGraph" +msgstr "" +"`#2753 `__: " +"pgr_analyzeGraph" + +msgid "" +"`#2750 `__: " +"pgr_createTopology" +msgstr "" +"`#2750 `__: " +"pgr_createTopology" + +msgid "" +"`#2826 `__: " +"pgr_createVerticesTable" +msgstr "" +"`#2826 `__: " +"pgr_createVerticesTable" + +msgid "Official functions changes" +msgstr "Cambios en las funciones oficiales" + +msgid "" +"`#2786 `__: " +"pgr_contraction" +msgstr "" +"`#2786 `__: " +"pgr_contraction" + +msgid "New proposed functions" +msgstr "Nuevas funciones propuestas" + +msgid "Contraction" +msgstr "Contracción" + +msgid "" +"`#2790 `__: " +"pgr_contractionDeadEnd" +msgstr "" +"`#2790 `__: " +"pgr_contractionDeadEnd" + +msgid "" +"`#2791 `__: " +"pgr_contractionLinear" +msgstr "" +"`#2791 `__: " +"pgr_contractionLinear" + +msgid "pgRouting 3.7" +msgstr "pgRouting 3.7" + +msgid "pgRouting 3.7.3 Release Notes" +msgstr "Notas de la versión de pgRouting 3.7.3" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.3 `__" +msgstr "" +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 3.7.3 `__" + +msgid "" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" +"`#2731 `__ Construcción " +"falla en Ubuntu 22" + +msgid "pgRouting 3.7.2 Release Notes" +msgstr "Notas de la versión de pgRouting 3.7.2" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.2 `__" +msgstr "" +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 3.7.2 `__" + +msgid "Build" +msgstr "Construir" + +msgid "" +"`#2713 `__ cmake missing " +"some policies and min version" +msgstr "" +"`#2713 `__ cmake le falta " +"algunas políticas y versión minima" + +msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" +msgstr "" + +msgid "Minimum cmake version 3.12" +msgstr "" + +msgid "" +"`#2707 `__ Build failure " +"in pgRouting 3.7.1 on Alpine" msgstr "" +"`#2707 `__ Falla de " +"construcción en Alpine para pgRouting 3.7.1" + +msgid "" +"`#2706 `__ winnie crashing " +"on pgr_betweennessCentrality" +msgstr "" +"`#2706 `__ winnie falla en " +"pgr_betweennessCentrality" + +msgid "pgRouting 3.7.1 Release Notes" +msgstr "Notas de la versión de pgRouting 3.7.1" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.1 `__" +msgstr "" +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 3.7.1 `__" + +msgid "" +"`#2680 `__ fails to " +"compile under mingw64 gcc 13.2" +msgstr "" +"`#2680 `__ Compilación " +"falla bajo mingw64 gcc 13.2" + +msgid "" +"`#2689 `__ When point is a " +"vertex, the withPoints family do not return results." +msgstr "" +"`#2689 `__ Cuando el punto " +"es un vértice, la familia withPoints no devuelve resultados." + +msgid "C/C++ code enhancemet" +msgstr "Mejora del código C/C++" + +msgid "TRSP family" +msgstr "Familia TRSP" + +msgid "pgRouting 3.7.0 Release Notes" +msgstr "Notas de la versión de pgRouting 3.7.0" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.0 `__" +msgstr "" +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 3.7.0 `_" + +msgid "Support" +msgstr "Soporte" msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." +"`#2656 `__ Stop support of " +"PostgreSQL12 on pgrouting v3.7" msgstr "" -":doc:`pgr_extractVertices` - Extrae información de vértices basada en la " -"tabla de aristas." +"`#2656 `__ PostgreSQL 12 " +"no se apya en pgrouting v3.7" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr "" -":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de " -"líneas." +msgid "Stopping support of PostgreSQL 12" +msgstr "PostgreSQL 12 ya no es soportado" -msgid ":doc:`pgr_withPointsVia`" -msgstr ":doc:`pgr_withPointsVia`" +msgid "CI does not test for PostgreSQL 12" +msgstr "CI no hace pruebas con PostgreSQL 12" -msgid ":doc:`pgr_trspVia`" -msgstr ":doc:`pgr_trspVia`" +msgid "New experimental functions" +msgstr "Nuevas funciones experimentales" -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "Metrics" +msgstr "Métricas" -msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." -msgstr ":doc:`withPoints-family` - Funciones basadas en el algoritmo Dijkstra." +msgid "pgr_betweennessCentrality" +msgstr "pgr_betweennessCentrality" -msgid "From the :doc:`TRSP-family`:" -msgstr "Desde :doc:`TRSP-family` :" +msgid "" +"`#2605 `__ Standardize " +"spanning tree functions output" +msgstr "" +"`#2605 `__ Estandarización " +"de resultados de las funciones de árbol de expansión" -msgid "Utilities" -msgstr "Utilidades" +msgid "Functions:" +msgstr "Funciones:" -msgid ":doc:`pgr_findCloseEdges`" -msgstr ":doc:`pgr_findCloseEdges`" +msgid "Experimental promoted to proposed." +msgstr "Experimental promovido a propuesto." -msgid "Reference" -msgstr "Referencia" +msgid "" +"`#2635 `__ pgr_LineGraph " +"ignores directed flag and use negative values for identifiers." +msgstr "" +"`#2635 `__ pgr_LineGraph " +"ignora la bandera directed y usa valores negatives para identificadores." -msgid "Release Notes" -msgstr "Notas de versión" +msgid "``pgr_lineGraph``" +msgstr "``pgr_lineGraph``" + +msgid "Code enhancement" +msgstr "Mejora del código" msgid "" -"To see the full list of changes check the list of `Git commits `_ on Github." +"`#2599 `__ Driving " +"distance cleanup" msgstr "" -"Para ver la lista completa de cambios, consulte la lista de `Git commits " -"`_ en Github." +"`#2599 `__ Limpieza de la " +"distancia de conducción" -msgid "Mayors" +msgid "" +"`#2607 `__ Read postgresql " +"data on C++" msgstr "" +"`#2607 `__ Leer datos " +"postgresql en C++" -msgid "pgRouting 3" -msgstr "pgRouting 3" - -msgid "Minors 3.x" +msgid "" +"`#2614 `__ Clang tidy does " +"not work" msgstr "" - -msgid "pgRouting 3.7" -msgstr "pgRouting 3.7" +"`#2614 `__ Clang tidy no " +"funciona" msgid "pgRouting 3.6" msgstr "pgRouting 3.6" @@ -18182,9 +18143,6 @@ msgstr "" "consulte `Git closed milestone for 3.6.3 `__" -msgid "Build" -msgstr "Construir" - msgid "Explicit minimum requirements:" msgstr "" @@ -18297,69 +18255,48 @@ msgstr "" "pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`_" msgid "" -"`#2516 `__ Standarize " +"`#2516 `__ Standardize " "output pgr_aStar" msgstr "" -"`#2516 `__ estandarización " +"`#2516 `__ Estandarización " "de resultados de pgr_aStar" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"``pgr_aStar`` (`Uno a Uno`) ha añadido las columnas ``start_vid`` y " -"``end_vid``." - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_aStar`` (`Uno a Muchos`) ha añadido la columna ``end_vid``." - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`Muchos a Uno`) ha añadido la columna ``start_vid``." +msgid "Standardize output columns to |short-generic-result|" +msgstr "Estandard de las columnas de salida a |short-generic-result|" msgid "" -"`#2523 `__ Standarize " +"`#2523 `__ Standardize " "output pgr_bdAstar" msgstr "" "`#2523 `__ Estandarización " "de resultados de pgr_bdAstar" msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"``pgr_bdAstar`` (`Uno a Uno`) ha añadido las columnas ``start_vid`` y " -"``end_vid``." - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_bdAstar`` (`Uno a Muchos`) ha añadido la columna ``end_vid``." - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_bdAstar`` (`Muchos a Uno`) ha añadido la columna ``start_vid``." - -msgid "" -"`#2547 `__ Standarize " +"`#2547 `__ Standardize " "output and modifying signature pgr_KSP" msgstr "" "`#2547 `__ Estandarización " "de resultados y modificación de firmas de pgr_KSP" msgid "" -"`#2548 `__ Standarize " -"output pgr_drivingdistance" +"`#2548 `__ Standardize " +"output pgr_drivingDistance" msgstr "" "`#2548 `__ Estandarización " -"de resultados de pgr_drivingdistance" +"de resultados de pgr_drivingDistance" msgid "Proposed functions changes" msgstr "Cambios en funciones propuestas" msgid "" -"`#2544 `__ Standarize " +"`#2544 `__ Standardize " "output and modifying signature pgr_withPointsDD" msgstr "" "`#2544 `__ Estandarización " "de resultados y modificación de firmas de pgr_withPointsDD" msgid "" -"`#2546 `__ Standarize " +"`#2546 `__ Standardize " "output and modifying signature pgr_withPointsKSP" msgstr "" "`#2546 `__ Estandarización " @@ -18419,15 +18356,15 @@ msgstr "" "`#2490 `__ Lígas " "automáticas historiales." -msgid "..rubric:: SQL standarization" +msgid "..rubric:: Standardize SQL" msgstr "" msgid "" -"`#2555 `__ standarize " +"`#2555 `__ Standardize " "deprecated messages" msgstr "" "`#2555 `__ Estandarización " -"de mesajes de depreciación" +"de mensajes de depreciación" msgid "" "On new internal function: do not use named parameters and default parameters." @@ -18474,10 +18411,10 @@ msgstr "Corrección de problema" msgid "" "`#2565 `__ " -"pgr_pgr_lengauerTarjanDominatorTree triggers an assertion" +"pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" "`#2565 `__ " -"pgr_pgr_lengauerTarjanDominatorTree genera un error de afirmación" +"pgr_lengauerTarjanDominatorTree genera un error de afirmación" msgid "SQL enhancements" msgstr "Mejoras SQL" @@ -18523,18 +18460,6 @@ msgstr "" msgid "Dijkstra" msgstr "Dijkstra" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"``pgr_dijkstra`` (`Uno a Uno`) ha añadido las columnas ``start_vid`` y " -"``end_vid``." - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_dijkstra`` (`Uno a Muchos`) ha añadido la columna ``end_vid``." - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_dijkstra`` (`Muchos a Uno`) ha añadido la columna ``start_vid``." - msgid "pgRouting 3.4" msgstr "pgRouting 3.4" @@ -18609,14 +18534,14 @@ msgid "" "doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" -msgstr "Nuevas funciones propuestas" +msgid "New proposed functions." +msgstr "Nuevas funciones propuestas." msgid "With points" msgstr "Con puntos" -msgid "``pgr_withPointsVia`` (One Via)" -msgstr "``pgr_withPointsVia`` (Una trayectoria)" +msgid "pgr_withPointsVia(One Via)" +msgstr "pgr_withPointsVia(Una Vía)" msgid "Turn Restrictions" msgstr "Restricciones de giro" @@ -18624,83 +18549,68 @@ msgstr "Restricciones de giro" msgid "Via with turn restrictions" msgstr "Trayectoria con restricciones de giro" -msgid "``pgr_trspVia`` (One Via)" -msgstr "" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "``pgr_trspVia_withPoints`` (Muchas trayectorias)" - -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" - -msgid "``pgr_trsp`` (One to One)" -msgstr "``pgr_trsp`` (Uno a Uno)" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "``pgr_trsp`` (Uno a Muchos)" +msgid "pgr_trspVia(One Via)" +msgstr "pgr_trspVia(Una Vía)" -msgid "``pgr_trsp`` (Many to One)" -msgstr "``pgr_trsp`` (Muchos a Uno)" +msgid "pgr_trspVia_withPoints(One Via)" +msgstr "pgr_trspVia_withPoints(Una Vía)" -msgid "``pgr_trsp`` (Many to Many)" -msgstr "``pgr_trsp`` (Muchos a Muchos)" +msgid "pgr_trsp_withPoints(One to One)" +msgstr "pgr_trsp_withPoints(Uno a Uno)" -msgid "``pgr_trsp`` (Combinations)" -msgstr "``pgr_trsp`` (Combinaciones)" +msgid "pgr_trsp_withPoints(One to Many)" +msgstr "pgr_trsp_withPoints(Uno a Muchos)" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" - -msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "``pgr_trsp_withPoints`` (Uno a Uno)" - -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "``pgr_trsp_withPoints`` (Uno a Muchos)" +msgid "pgr_trsp_withPoints(Many to One)" +msgstr "pgr_trsp_withPoints(Muchos a Uno)" -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "``pgr_trsp_withPoints`` (Muchos a Uno)" +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr "pgr_trsp_withPoints(Muchos a Muchos)" -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "``pgr_trsp_withPoints`` (Muchos a Muchos)" - -msgid "``pgr_trsp_withPoints`` (Combinations)" -msgstr "``pgr_trsp_withPoints`` (Combinaciones)" +msgid "pgr_trsp_withPoints(Combinations)" +msgstr "pgr_trsp_withPoints(Combinaciones)" msgid "Topology" msgstr "Topología" -msgid "``pgr_degree``" -msgstr "" +msgid "Utilities" +msgstr "Utilidades" -msgid "``pgr_findCloseEdges`` (One point)" -msgstr "" +msgid "pgr_findCloseEdges(One point)" +msgstr "pgr_findCloseEdges(Un punto)" -msgid "``pgr_findCloseEdges`` (Many points)" -msgstr "" +msgid "pgr_findCloseEdges(Many points)" +msgstr "pgr_findCloseEdges(Muchos puntos)" msgid "Ordering" msgstr "Ordenamiento" -msgid "``pgr_cuthillMckeeOrdering``" -msgstr "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" +msgstr "pgr_cuthillMckeeOrdering" + +msgid "Unclassified" +msgstr "No clasificado" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" msgid "Flow functions" msgstr "Funciones de flujo" -msgid "``pgr_maxCardinalityMatch(text)``" -msgstr "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" +msgstr "pgr_maxCardinalityMatch(text)" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" +msgstr "Ossoleto: pgr_maxCardinalityMatch(text,boolean)" msgid "Deprecated Functions" msgstr "Funciones obsoletas" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" -msgstr "" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" +msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgid "pgRouting 3.3" msgstr "pgRouting 3.3" @@ -19018,12 +18928,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "Eliminación de soporte para Boost v1.53, v1.54 & v1.55" -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(Combinaciones)" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" - msgid "pgr_bipartite" msgstr "pgr_bipartite" @@ -19033,9 +18937,6 @@ msgstr "pgr_depthFirstSearch" msgid "Dijkstra Near" msgstr "Dijkstra Cercano" -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(Combinaciones)" - msgid "pgr_isPlanar" msgstr "pgr_isPlanar" @@ -19045,51 +18946,15 @@ msgstr "pgr_lengauerTarjanDominatorTree" msgid "pgr_makeConnected" msgstr "pgr_makeConnected" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(Combinaciones)" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" - msgid "Astar" msgstr "Astar" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(Combinaciones)" - -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(Combinaciones)" - msgid "Bidirectional Astar" msgstr "Astar Bidireccional" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(Combinaciones)" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(Combinaciones)" - msgid "Bidirectional Dijkstra" msgstr "Dijkstra Bidireccional" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(Combinaciones)" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(Combinaciones)" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov(Combinaciones)" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(Combinaciones)" - -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(Combinaciones)" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(Combinaciones)" - msgid "pgRouting 3.1" msgstr "pgRouting 3.1" @@ -19407,8 +19272,8 @@ msgstr "" "`#1006 `__: No hay " "pérdida de información2" -msgid "New functions" -msgstr "Nuevas funciones" +msgid "New Functions" +msgstr "Nuevas Funciones" msgid "Kruskal family" msgstr "Familia Kruskal" @@ -19446,149 +19311,95 @@ msgstr "Propuesta cambió a oficial en pgRouting" msgid "aStar Family" msgstr "Familia aStar" -msgid "pgr_aStar(one to many)" -msgstr "pgr_aStar(Uno a Muchos)" - -msgid "pgr_aStar(many to one)" -msgstr "pgr_aStar(muchos a uno)" - -msgid "pgr_aStar(many to many)" -msgstr "pgr_aStar(muchos a muchos)" - -msgid "pgr_aStarCost(one to one)" +msgid "pgr_aStarCost(One to One)" msgstr "pgr_aStarCost(Uno a Uno)" -msgid "pgr_aStarCost(one to many)" +msgid "pgr_aStarCost(One to Many)" msgstr "pgr_aStarCost(Uno a Muchos)" -msgid "pgr_aStarCost(many to one)" -msgstr "pgr_aStarCost(muchos a uno)" +msgid "pgr_aStarCost(Many to One)" +msgstr "pgr_aStarCost(Muchos a Uno)" -msgid "pgr_aStarCost(many to many)" -msgstr "pgr_aStarCost(muchos a muchos)" +msgid "pgr_aStarCost(Many to Many)" +msgstr "pgr_aStarCost(Muchos a Muchos)" -msgid "pgr_aStarCostMatrix(one to one)" -msgstr "pgr_aStarCostMatrix(Uno a Uno)" - -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "pgr_aStarCostMatrix(Uno a Muchos)" - -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "pgr_aStarCostMatrix(muchos a uno)" - -msgid "pgr_aStarCostMatrix(many to many)" -msgstr "pgr_aStarCostMatrix(muchos a muchos)" +msgid "pgr_aStarCostMatrix" +msgstr "pgr_aStarCostMatrix" msgid "bdAstar Family" msgstr "Familia bdAstar" -msgid "pgr_bdAstar(one to many)" -msgstr "pgr_bdAstar(Uno a Muchos)" - -msgid "pgr_bdAstar(many to one)" -msgstr "pgr_bdAstar(muchos a uno)" - -msgid "pgr_bdAstar(many to many)" -msgstr "pgr_bdAstar(muchos a muchos)" - -msgid "pgr_bdAstarCost(one to one)" +msgid "pgr_bdAstarCost(One to One)" msgstr "pgr_bdAstarCost(Uno a Uno)" -msgid "pgr_bdAstarCost(one to many)" +msgid "pgr_bdAstarCost(One to Many)" msgstr "pgr_bdAstarCost(Uno a Muchos)" -msgid "pgr_bdAstarCost(many to one)" -msgstr "pgr_bdAstarCost(muchos a uno)" - -msgid "pgr_bdAstarCost(many to many)" -msgstr "pgr_bdAstarCost(muchos a muchos)" +msgid "pgr_bdAstarCost(Many to One)" +msgstr "pgr_bdAstarCost(Muchos a Uno)" -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "pgr_bdAstarCostMatrix(Uno a Uno)" +msgid "pgr_bdAstarCost(Many to Many)" +msgstr "pgr_bdAstarCost(Muchos a Muchos)" -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "pgr_bdAstarCostMatrix(Uno a Muchos)" - -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "pgr_bdAstarCostMatrix(muchos a uno)" - -msgid "pgr_bdAstarCostMatrix(many to many)" -msgstr "pgr_bdAstarCostMatrix(muchos a muchos)" +msgid "pgr_bdAstarCostMatrix" +msgstr "pgr_bdAstarCostMatrix" msgid "bdDijkstra Family" msgstr "bdDijkstra Familia" -msgid "pgr_bdDijkstra(one to many)" -msgstr "pgr_bdDijkstra(Uno a Muchos)" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "pgr_bdDijkstra(muchos a uno)" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "pgr_bdDijkstra(muchos a muchos)" - -msgid "pgr_bdDijkstraCost(one to one)" -msgstr "pgr_bdDijkstraCost(uno a uno)" +msgid "pgr_bdDijkstraCost(One to One)" +msgstr "pgr_bdDijkstraCost(Uno a Uno)" -msgid "pgr_bdDijkstraCost(one to many)" -msgstr "pgr_bdDijkstraCost(uno a muchos)" +msgid "pgr_bdDijkstraCost(One to Many)" +msgstr "pgr_bdDijkstraCost(Uno a Muchos)" -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "pgr_bdDijkstraCost(muchos a uno)" +msgid "pgr_bdDijkstraCost(Many to One)" +msgstr "pgr_bdDijkstraCost(Muchos a Uno)" -msgid "pgr_bdDijkstraCost(many to many)" -msgstr "pgr_bdDijkstraCost(muchos a muchos)" +msgid "pgr_bdDijkstraCost(Many to Many)" +msgstr "pgr_bdDijkstraCost(Muchos a Muchos)" -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "pgr_bdDijkstraCostMatrix(uno a uno)" - -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "pgr_bdDijkstraCostMatrix(uno a muchos)" - -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "pgr_bdDijkstraCostMatrix(muchos a uno)" - -msgid "pgr_bdDijkstraCostMatrix(many to many)" -msgstr "pgr_bdDijkstraCostMatrix(muchos a muchos)" +msgid "pgr_bdDijkstraCostMatrix" +msgstr "pgr_bdDijkstraCostMatrix" msgid "Flow Family" msgstr "Familia Flow" -msgid "pgr_pushRelabel(one to one)" +msgid "pgr_pushRelabel(One to One)" msgstr "pgr_pushRelabel(Uno a Uno)" -msgid "pgr_pushRelabel(one to many)" +msgid "pgr_pushRelabel(One to Many)" msgstr "pgr_pushRelabel(Uno a Muchos)" -msgid "pgr_pushRelabel(many to one)" -msgstr "pgr_pushRelabel(muchos a uno)" +msgid "pgr_pushRelabel(Many to One)" +msgstr "pgr_pushRelabel(Muchos a Uno)" -msgid "pgr_pushRelabel(many to many)" -msgstr "pgr_pushRelabel(muchos a muchos)" +msgid "pgr_pushRelabel(Many to Many)" +msgstr "pgr_pushRelabel(Muchos a Muchos)" -msgid "pgr_edmondsKarp(one to one)" +msgid "pgr_edmondsKarp(One to One)" msgstr "pgr_edmondsKarp(Uno a Uno)" -msgid "pgr_edmondsKarp(one to many)" +msgid "pgr_edmondsKarp(One to Many)" msgstr "pgr_edmondsKarp(Uno a Muchos)" -msgid "pgr_edmondsKarp(many to one)" -msgstr "pgr_edmondsKarp(muchos a uno)" +msgid "pgr_edmondsKarp(Many to One)" +msgstr "pgr_edmondsKarp(Muchos a Uno)" -msgid "pgr_edmondsKarp(many to many)" -msgstr "pgr_edmondsKarp(muchos a muchos)" +msgid "pgr_edmondsKarp(Many to Many)" +msgstr "pgr_edmondsKarp(Muchos a Muchos)" -msgid "pgr_boykovKolmogorov (one to one)" +msgid "pgr_boykovKolmogorov (One to One)" msgstr "pgr_boykovKolmogorov(Uno a Uno)" -msgid "pgr_boykovKolmogorov (one to many)" +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "pgr_boykovKolmogorov(Uno a Muchos)" -msgid "pgr_boykovKolmogorov (many to one)" -msgstr "pgr_boykovKolmogorov (muchos a uno)" +msgid "pgr_boykovKolmogorov (Many to One)" +msgstr "pgr_boykovKolmogorov (Muchos a Uno)" -msgid "pgr_boykovKolmogorov (many to many)" -msgstr "pgr_boykovKolmogorov (muchos a muchos)" +msgid "pgr_boykovKolmogorov (Many to Many)" +msgstr "pgr_boykovKolmogorov (Muchos a Muchos)" msgid "pgr_maxCardinalityMatching" msgstr "pgr_maxCardinalityMatching" @@ -19596,21 +19407,24 @@ msgstr "pgr_maxCardinalityMatching" msgid "pgr_maxFlow" msgstr "pgr_maxFlow" -msgid "pgr_edgeDisjointPaths(one to one)" +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "pgr_edgeDisjointPaths(Uno a Uno)" -msgid "pgr_edgeDisjointPaths(one to many)" +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "pgr_edgeDisjointPaths(Uno a Muchos)" -msgid "pgr_edgeDisjointPaths(many to one)" -msgstr "pgr_edgeDisjointPaths(muchos a uno)" +msgid "pgr_edgeDisjointPaths(Many to One)" +msgstr "pgr_edgeDisjointPaths(Muchos a Uno)" -msgid "pgr_edgeDisjointPaths(many to many)" -msgstr "pgr_edgeDisjointPaths(muchos a muchos)" +msgid "pgr_edgeDisjointPaths(Many to Many)" +msgstr "pgr_edgeDisjointPaths(Muchos a Muchos)" msgid "Components family" msgstr "Familia de Componentes" +msgid "pgr_connectedComponents" +msgstr "pgr_connectedComponents" + msgid "pgr_strongComponents" msgstr "pgr_strongComponents" @@ -19814,8 +19628,8 @@ msgstr "pgr_floydWarshall" msgid "pgr_johnson" msgstr "pgr_johnson" -msgid "pgr_astar" -msgstr "pgr_astar" +msgid "pgr_aStar" +msgstr "pgr_aStar" msgid "pgr_bdAstar" msgstr "pgr_bdAstar" @@ -19835,6 +19649,9 @@ msgstr "pgr_dijkstraCost" msgid "pgr_drivingDistance" msgstr "pgr_drivingDistance" +msgid "pgr_KSP" +msgstr "pgr_KSP" + msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" @@ -20065,25 +19882,16 @@ msgstr "Columnas path_id, cost y agg_cost añadidas al resultado" msgid "Parameter names changed" msgstr "Nombres de parámetros cambiados" -msgid "The many version results are the union of the one to one version" +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" +"Los muchos resultados de la versión son la unión de la versión Uno a Uno" msgid "New Signatures" msgstr "Nuevas Firmas" -msgid "pgr_bdAstar(one to one)" +msgid "pgr_bdAstar(One to One)" msgstr "pgr_bdAstar(Uno a Uno)" -msgid "New Proposed functions" -msgstr "Nuevas Funciones Propuestas" - -msgid "pgr_bdAstarCostMatrix" -msgstr "pgr_bdAstarCostMatrix" - -msgid "pgr_bdDijkstraCostMatrix" -msgstr "pgr_bdDijkstraCostMatrix" - msgid "pgr_lineGraph" msgstr "pgr_lineGraph" @@ -20175,32 +19983,8 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "pgr_bdDijkstra" -msgid "New Proposed Signatures" -msgstr "Nuevas Firmas Propuestas" - -msgid "pgr_astar(one to many)" -msgstr "pgr_astar(Uno a Muchos)" - -msgid "pgr_astar(many to one)" -msgstr "pgr_astar(muchos a uno)" - -msgid "pgr_astar(many to many)" -msgstr "pgr_astar(muchos a muchos)" - -msgid "pgr_astarCost(one to one)" -msgstr "pgr_astarCost(Uno a Uno)" - -msgid "pgr_astarCost(one to many)" -msgstr "pgr_astarCost(uno a muchos)" - -msgid "pgr_astarCost(many to one)" -msgstr "pgr_astarCost(muchos a uno)" - -msgid "pgr_astarCost(many to many)" -msgstr "pgr_astarCost(muchos a muchos)" - -msgid "pgr_astarCostMatrix" -msgstr "pgr_astarCostMatrix" +msgid "Deprecated signatures." +msgstr "Firmas obsoletas." msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" msgstr "pgr_bddijkstra - utilizar pgr_bdDijkstra en su lugar" @@ -20285,53 +20069,44 @@ msgstr "" msgid "pgr_TSP" msgstr "pgr_TSP" -msgid "pgr_aStar" -msgstr "pgr_aStar" - -msgid "New Functions" -msgstr "Nuevas Funciones" - msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" - -msgid "pgr_maxFlowPushRelabel(one to one)" +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "pgr_maxFlowPushRelabel(Uno a Uno)" -msgid "pgr_maxFlowPushRelabel(one to many)" -msgstr "pgr_maxFlowPushRelabel(uno a muchos)" +msgid "pgr_maxFlowPushRelabel(One to Many)" +msgstr "pgr_maxFlowPushRelabel(Uno a Muchos)" -msgid "pgr_maxFlowPushRelabel(many to one)" -msgstr "pgr_maxFlowPushRelabel(muchos a uno)" +msgid "pgr_maxFlowPushRelabel(Many to One)" +msgstr "pgr_maxFlowPushRelabel(Muchos a Uno)" -msgid "pgr_maxFlowPushRelabel(many to many)" -msgstr "pgr_maxFlowPushRelabel(muchos a muchos)" +msgid "pgr_maxFlowPushRelabel(Many to Many)" +msgstr "pgr_maxFlowPushRelabel(Muchos a Muchos)" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "pgr_maxFlowEdmondsKarp(Uno a Uno)" -msgid "pgr_maxFlowEdmondsKarp(one to many)" -msgstr "pgr_maxFlowEdmondsKarp(uno a muchos)" +msgid "pgr_maxFlowEdmondsKarp(One to Many)" +msgstr "pgr_maxFlowEdmondsKarp(Uno a Muchos)" -msgid "pgr_maxFlowEdmondsKarp(many to one)" -msgstr "pgr_maxFlowEdmondsKarp(muchos a uno)" +msgid "pgr_maxFlowEdmondsKarp(Many to One)" +msgstr "pgr_maxFlowEdmondsKarp(Muchos a Uno)" -msgid "pgr_maxFlowEdmondsKarp(many to many)" -msgstr "pgr_maxFlowEdmondsKarp(muchos a muchos)" +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" +msgstr "pgr_maxFlowEdmondsKarp(Muchos a Muchos)" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "pgr_maxFlowBoykovKolmogorov(Uno a Uno)" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" -msgstr "pgr_maxFlowBoykovKolmogorov (uno a muchos)" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" +msgstr "pgr_maxFlowBoykovKolmogorov (Uno a Muchos)" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" -msgstr "pgr_maxFlowBoykovKolmogorov (muchos a uno)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" +msgstr "pgr_maxFlowBoykovKolmogorov (Muchos a Uno)" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" -msgstr "pgr_maxFlowBoykovKolmogorov (muchos a muchos)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" +msgstr "pgr_maxFlowBoykovKolmogorov (Muchos a Muchos)" msgid "pgr_maximumCardinalityMatching" msgstr "pgr_maximumCardinalityMatching" @@ -20342,8 +20117,8 @@ msgstr "pgr_contractGraph" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "pgr_tsp - utilice pgr_TSP o pgr_eucledianTSP en su lugar" -msgid "pgr_astar - use pgr_aStar instead" -msgstr "pgr_astar - utilice pgr_aStar en su lugar" +msgid "pgr_aStar - use pgr_aStar instead" +msgstr "pgr_aStar - utilice pgr_aStar en su lugar" msgid "pgr_flip_edges" msgstr "pgr_flip_edges" @@ -20444,6 +20219,9 @@ msgstr "" msgid "Improvements" msgstr "Mejoras" +msgid "pgr_nodeNetwork" +msgstr "pgr_nodeNetwork" + msgid "Adding a row_where and outall optional parameters" msgstr "Adición de un row_where y todos los parámetros opcionales" @@ -20456,44 +20234,44 @@ msgstr "pgr_dijkstra -- para que coincida con lo documentado" msgid "pgr_Johnson" msgstr "pgr_Johnson" -msgid "pgr_dijkstraCost(one to one)" +msgid "pgr_dijkstraCost(One to One)" msgstr "pgr_dijkstraCost(Uno a Uno)" -msgid "pgr_dijkstraCost(one to many)" -msgstr "pgr_dijkstraCost(uno a muchos)" +msgid "pgr_dijkstraCost(One to Many)" +msgstr "pgr_dijkstraCost(Uno a Muchos)" -msgid "pgr_dijkstraCost(many to one)" -msgstr "pgr_dijkstraCost(muchos a uno)" +msgid "pgr_dijkstraCost(Many to One)" +msgstr "pgr_dijkstraCost(Muchos a Uno)" -msgid "pgr_dijkstraCost(many to many)" -msgstr "pgr_dijkstraCost(muchos a muchos)" +msgid "pgr_dijkstraCost(Many to Many)" +msgstr "pgr_dijkstraCost(Muchos a Muchos)" msgid "Proposed Functionality" msgstr "Funcionalidad Propuesta" -msgid "pgr_withPoints(one to one)" +msgid "pgr_withPoints(One to One)" msgstr "pgr_withPoints(Uno a Uno)" -msgid "pgr_withPoints(one to many)" -msgstr "pgr_withPoints(uno a muchos)" +msgid "pgr_withPoints(One to Many)" +msgstr "pgr_withPoints(Uno a Muchos)" -msgid "pgr_withPoints(many to one)" -msgstr "pgr_withPoints(muchos a uno)" +msgid "pgr_withPoints(Many to One)" +msgstr "pgr_withPoints(Muchos a Uno)" -msgid "pgr_withPoints(many to many)" -msgstr "pgr_withPoints(muchos a muchos)" +msgid "pgr_withPoints(Many to Many)" +msgstr "pgr_withPoints(Muchos a Muchos)" -msgid "pgr_withPointsCost(one to one)" +msgid "pgr_withPointsCost(One to One)" msgstr "pgr_withPointsCost(Uno a Uno)" -msgid "pgr_withPointsCost(one to many)" -msgstr "pgr_withPointsCost(uno a muchos)" +msgid "pgr_withPointsCost(One to Many)" +msgstr "pgr_withPointsCost(Uno a Muchos)" -msgid "pgr_withPointsCost(many to one)" -msgstr "pgr_withPointsCost(muchos a uno)" +msgid "pgr_withPointsCost(Many to One)" +msgstr "pgr_withPointsCost(Muchos a Uno)" -msgid "pgr_withPointsCost(many to many)" -msgstr "pgr_withPointsCost(muchos a muchos)" +msgid "pgr_withPointsCost(Many to Many)" +msgstr "pgr_withPointsCost(Muchos a Muchos)" msgid "pgr_withPointsDD(single vertex)" msgstr "pgr_withPointsDD(vértice único)" @@ -20501,9 +20279,6 @@ msgstr "pgr_withPointsDD(vértice único)" msgid "pgr_withPointsDD(multiple vertices)" msgstr "pgr_withPointsDD(múltiples vértices)" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - msgid "pgr_dijkstraVia" msgstr "pgr_dijkstraVia" @@ -20540,27 +20315,12 @@ msgstr "" "issues for 2.1.0 `_ en Github." -msgid "pgr_dijkstra(one to many)" -msgstr "pgr_dijkstra(uno a muchos)" - -msgid "pgr_dijkstra(many to one)" -msgstr "pgr_dijkstra(muchos a uno)" - -msgid "pgr_dijkstra(many to many)" -msgstr "pgr_dijkstra(muchos a muchos)" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance(múltiples vértices)" - msgid "Refactored" msgstr "Refactorizado" -msgid "pgr_dijkstra(one to one)" +msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra(Uno a Uno)" -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance(vértice único)" - msgid "" "pgr_alphaShape function now can generate better (multi)polygon with holes " "and alpha parameter." @@ -20949,8 +20709,8 @@ msgstr "Datos Muestra" msgid "" "The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the mayority of " -"the examples queries, follow the instructions bellow." +"sample network that resembles a city. To be able to execute the majority of " +"the examples queries, follow the instructions below." msgstr "" "La documentación proporciona consultas de ejemplo muy simples basadas en una " "red muestra pequeña que asemeja una ciudad. Para ser capaz de ejecutar la " @@ -20967,7 +20727,8 @@ 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." +"capacity values, category values and some locations that are not in the " +"graph." msgstr "" msgid "" @@ -20975,14 +20736,11 @@ msgid "" "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." +"opposite direction. Therefore some information has the ``reverse_`` prefix " +"which corresponds to the segment on the opposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -21013,7 +20771,7 @@ msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr "" msgid "" -"For convinience it is saved on the table but can be calculated as " +"For convenience it is saved on the table but can be calculated as " "``ST_X(ST_StartPoint(geom))``." msgstr "" @@ -21021,7 +20779,7 @@ msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr "" msgid "" -"For convinience it is saved on the table but can be calculated as " +"For convenience it is saved on the table but can be calculated as " "``ST_Y(ST_EndPoint(geom))``." msgstr "" @@ -21032,8 +20790,8 @@ msgid "Starting on PostgreSQL 12::" msgstr "A partir de PostgreSQL 12::" msgid "" -"Optionally indexes on different columns can be created. The recomendation is " -"to have" +"Optionally indexes on different columns can be created. The recommendation " +"is to have" msgstr "" msgid "``id`` indexed." @@ -21044,7 +20802,7 @@ msgid "" msgstr "" msgid "" -"``geom`` indexed to speed up gemetry processes that might be needed in the " +"``geom`` indexed to speed up geometry processes that might be needed in the " "front end." msgstr "" @@ -21113,9 +20871,11 @@ msgid "" msgstr "" msgid "" -"For convinence of this documentations, some combinations will be stored on a " +"For convenience of this documentation, some combinations will be stored on a " "table:" msgstr "" +"Por conveniencia de esta documentación, algunas combinaciones se almacenan " +"en una tabla:" msgid "Inserting the data:" msgstr "Insertar los datos:" @@ -21126,6 +20886,9 @@ msgstr "" msgid "Some functions accept soft restrictions about the segments." msgstr "" +msgid "Images" +msgstr "Imágenes" + msgid "Red arrows correspond when ``cost`` > 0 in the edge table." msgstr "" "Las flechas rojas corresponden cuando ``cost`` > 0 en la tabla de aristas." @@ -21377,8 +21140,8 @@ msgid "" msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "" msgid "Additional functions to create a graph:" @@ -21400,7 +21163,7 @@ msgstr "" msgid "Traversal - Family of functions" msgstr "Traversal - Familia de funciones" -msgid "Aditionaly there are 2 categories under this family" +msgid "Additionally there are 2 categories under this family" msgstr "Adicionalmente, hay dos categorías en esta familia" msgid "Via - Category" @@ -21417,7 +21180,7 @@ msgstr "" "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 " +"In other words, find a continuous route that visits all the vertices in the " "order given." msgstr "" "En otras palabras, encuentre la ruta continua que visite todos los vértices " @@ -21829,3 +21592,4 @@ msgstr "pgr_withPointsDD es pgr_drivingDistance **con puntos**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" + diff --git a/locale/zh_Hans/LC_MESSAGES/index.po b/locale/zh_Hans/LC_MESSAGES/index.po index dcb38e1c1a7..ca9be12e54b 100644 --- a/locale/zh_Hans/LC_MESSAGES/index.po +++ b/locale/zh_Hans/LC_MESSAGES/index.po @@ -18,436 +18,3 @@ msgstr "" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=1; plural=0;\n" "X-Generator: Weblate 5.4.3\n" - -#: ../../build/doc/index.rst:12 -msgid "**Supported versions:** `Latest `__ (`3.4 `__) `3.3 `__ `3.2 `__ `3.1 `__ `3.0 `__" -msgstr "" -"**支持的版本：最新版本：** `最新版本 `__ (`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 `__" -msgstr "" -"**不支持的版本：** `2.6 `__ `" -"2.5 `__ `2.4 `__ `2.3 `__ `2.2 `__ `2.1 " -"`__ `2.0 `__" - -#: ../../build/doc/index.rst:30 -msgid "Table of Contents" -msgstr "目录" - -#: ../../build/doc/index.rst:32 -msgid "pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and other network analysis functionality." -msgstr "" -"pgRouting 扩展了 `PostGIS `__/`PostgreSQL `__ 地理空间数据库，以提供地理空间路由和其他网络分析功能。" - -#: ../../build/doc/index.rst:36 -msgid "This is the manual for pgRouting |release|." -msgstr "这是pgRouting|release|的手册。" - -#: ../../build/doc/index.rst:None -msgid "Creative Commons Attribution-Share Alike 3.0 License" -msgstr "知识共享署名 - 相同方式共享 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 "" -"pgRouting 手册根据 `知识共享署名-相同方式共享3.0许可证 " -"`_。 您可以随意使用本材料，" -"但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://" -"pgrouting.org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 " -":ref:`license` page.。" - -#: ../../build/doc/index.rst:50 -msgid "General" -msgstr "常规" - -#: ../../build/doc/index.rst:60 -msgid ":doc:`sampledata` that is used in the examples of this manual." -msgstr "本手册示例中使用的 :doc:`sampledata`。" - -#: ../../build/doc/index.rst:68 -msgid "Pgrouting Concepts" -msgstr "Pgrouting概念" - -#: ../../build/doc/index.rst:77 -msgid ":doc:`routingFunctions`" -msgstr ":doc:`routingFunctions`" - -#: ../../build/doc/routingFunctions.rst:4 -msgid ":doc:`allpairs-family`" -msgstr ":doc:`allpairs-family`" - -#: ../../build/doc/allpairs-family.rst:3 -msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm." -msgstr ":doc:`pgr_floydWarshall` - Floyd-Warshall 算法。" - -#: ../../build/doc/allpairs-family.rst:4 -msgid ":doc:`pgr_johnson` - Johnson's algorithm" -msgstr ":doc:`pgr_johnson` - Johnson算法" - -#: ../../build/doc/routingFunctions.rst:10 -msgid ":doc:`aStar-family`" -msgstr ":doc:`aStar-family`" - -#: ../../build/doc/aStar-family.rst:3 -msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." -msgstr ":doc:`pgr_aStar` - A* 最短路径算法。" - -#: ../../build/doc/aStar-family.rst:4 -msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." -msgstr ":doc:`pgr_aStarCost` - 获取最短路径的总成本。" - -#: ../../build/doc/aStar-family.rst:5 -msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." -msgstr ":doc:`pgr_aStarCostMatrix` - 获取最短路径的成本矩阵。" - -#: ../../build/doc/routingFunctions.rst:17 -msgid ":doc:`bdAstar-family`" -msgstr ":doc:`bdAstar-family`" - -#: ../../build/doc/bdAstar-family.rst:3 -msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." -msgstr ":doc:`pgr_bdAstar` - 获取路径的双向A*算法。" - -#: ../../build/doc/bdAstar-family.rst:4 -msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." -msgstr ":doc:`pgr_bdAstarCost` - 双向 A* 算法计算路径成本。" - -#: ../../build/doc/bdAstar-family.rst:6 -msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." -msgstr ":doc:`pgr_bdAstarCostMatrix` - 用于计算路径成本矩阵的双向 A* 算法。" - -#: ../../build/doc/routingFunctions.rst:23 -msgid ":doc:`bdDijkstra-family`" -msgstr ":doc:`bdDijkstra-family`" - -#: ../../build/doc/bdDijkstra-family.rst:3 -msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." -msgstr ":doc:`pgr_bdDijkstra` - 最短路径的双向 Dijkstra 算法。" - -#: ../../build/doc/bdDijkstra-family.rst:5 -msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" -msgstr ":doc:`pgr_bdDijkstraCost` - 双向 Dijkstra 计算最短路径的成本" - -#: ../../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` - 双向 Dijkstra 算法创建最短路径成本矩阵。" - -#: ../../build/doc/routingFunctions.rst:29 -msgid ":doc:`components-family`" -msgstr ":doc:`components-family`" - -#: ../../build/doc/components-family.rst:3 -msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." -msgstr ":doc:`pgr_connectedComponents` - 无向图的连通分量。" - -#: ../../build/doc/components-family.rst:4 -msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." -msgstr ":doc:`pgr_strongComponents` - 有向图的强连通分量。" - -#: ../../build/doc/components-family.rst:6 -msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." -msgstr ":doc:`pgr_biconnectedComponents` - 无向图的双连通分量。" - -#: ../../build/doc/components-family.rst:8 -msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." -msgstr ":doc:`pgr_articulationPoints` - 无向图的铰接点。" - -#: ../../build/doc/components-family.rst:9 -msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." -msgstr ":doc:`pgr_bridges` - 无向图的桥。" - -#: ../../build/doc/routingFunctions.rst:35 -msgid ":doc:`contraction-family`" -msgstr ":doc:`contraction-family`" - -#: ../../build/doc/contraction-family.rst:3 -msgid ":doc:`pgr_contraction`" -msgstr ":doc:`pgr_contraction`" - -#: ../../build/doc/routingFunctions.rst:41 -msgid ":doc:`dijkstra-family`" -msgstr ":doc:`dijkstra-family`" - -#: ../../build/doc/dijkstra-family.rst:3 -msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr ":doc:`pgr_dijkstra` - Dijkstra 最短路径算法。" - -#: ../../build/doc/dijkstra-family.rst:4 -msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgstr ":doc:`pgr_dijkstraCost` - 获取最短路径的总成本。" - -#: ../../build/doc/dijkstra-family.rst:5 -msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr ":doc:`pgr_dijkstraCostMatrix` - 使用 pgr_dijkstra 创建成本矩阵。" - -#: ../../build/doc/dijkstra-family.rst:6 -msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." -msgstr ":doc:`pgr_drivingDistance` - 使用 pgr_dijkstra 计算流域信息。" - -#: ../../build/doc/dijkstra-family.rst:8 -msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." -msgstr ":doc:`pgr_KSP` - 使用 Yen 算法和 pgr_dijkstra 来获得 K 条最短路径。" - -#: ../../build/doc/routingFunctions.rst:47 -msgid ":doc:`flow-family`" -msgstr ":doc:`flow-family`" - -#: ../../build/doc/flow-family.rst:3 -msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." -msgstr ":doc:`pgr_maxFlow` - 仅使用 Push 和 Relabel 算法进行最大流量计算。" - -#: ../../build/doc/flow-family.rst:5 -msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." -msgstr ":doc:`pgr_boykovKolmogorov` - Boykov 和 Kolmogorov 的边流动细节。" - -#: ../../build/doc/flow-family.rst:7 -msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." -msgstr ":doc:`pgr_edmondsKarp` - 带有边流量详细信息的 Edmonds 和 Karp 算法。" - -#: ../../build/doc/flow-family.rst:9 -msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." -msgstr ":doc:`pgr_pushRelabel` - 推送和重新标记算法以及边流量的详细信息。" - -#: ../../build/doc/flow-family.rst:11 -msgid "Applications" -msgstr "应用" - -#: ../../build/doc/flow-family.rst:13 -msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." -msgstr ":doc:`pgr_edgeDisjointPaths` - 计算两组顶点之间的边不相交路径。" - -#: ../../build/doc/flow-family.rst:15 -msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." -msgstr ":doc:`pgr_maxCardinalityMatch` - 计算图中的最大基数匹配。" - -#: ../../build/doc/routingFunctions.rst:53 -#: ../../build/doc/spanningTree-family.rst:3 -msgid ":doc:`kruskal-family`" -msgstr ":doc:`kruskal-family`" - -#: ../../build/doc/kruskal-family.rst:3 -msgid ":doc:`pgr_kruskal`" -msgstr ":doc:`pgr_kruskal`" - -#: ../../build/doc/kruskal-family.rst:4 -#: ../../build/doc/BFS-category.rst:3 -msgid ":doc:`pgr_kruskalBFS`" -msgstr ":doc:`pgr_kruskalBFS`" - -#: ../../build/doc/kruskal-family.rst:5 -msgid ":doc:`pgr_kruskalDD`" -msgstr ":doc:`pgr_kruskalDD`" - -#: ../../build/doc/kruskal-family.rst:6 -#: ../../build/doc/DFS-category.rst:3 -msgid ":doc:`pgr_kruskalDFS`" -msgstr ":doc:`pgr_kruskalDFS`" - -#: ../../build/doc/routingFunctions.rst:59 -#: ../../build/doc/spanningTree-family.rst:4 -msgid ":doc:`prim-family`" -msgstr ":doc:`prim-family`" - -#: ../../build/doc/prim-family.rst:3 -msgid ":doc:`pgr_prim`" -msgstr ":doc:`pgr_prim`" - -#: ../../build/doc/prim-family.rst:4 -#: ../../build/doc/BFS-category.rst:4 -msgid ":doc:`pgr_primBFS`" -msgstr ":doc:`pgr_primBFS`" - -#: ../../build/doc/prim-family.rst:5 -msgid ":doc:`pgr_primDD`" -msgstr ":doc:`pgr_primDD`" - -#: ../../build/doc/prim-family.rst:6 -#: ../../build/doc/DFS-category.rst:4 -msgid ":doc:`pgr_primDFS`" -msgstr ":doc:`pgr_primDFS`" - -#: ../../build/doc/routingFunctions.rst:65 -msgid ":doc:`reference`" -msgstr ":doc:`reference`" - -#: ../../build/doc/reference.rst:3 -msgid ":doc:`pgr_version`" -msgstr ":doc:`pgr_version`" - -#: ../../build/doc/reference.rst:4 -msgid ":doc:`pgr_full_version`" -msgstr ":doc:`pgr_full_version`" - -#: ../../build/doc/routingFunctions.rst:71 -msgid ":doc:`topology-functions`" -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." -msgstr "以下函数直接修改数据库，因此用户必须具有管理员授予的特殊权限才能使用它们。" - -#: ../../build/doc/topology-functions.rst:6 -msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." -msgstr ":doc:`pgr_createTopology` - 根据几何形状创建拓扑。" - -#: ../../build/doc/topology-functions.rst:7 -msgid ":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the source and target information." -msgstr ":doc:`pgr_createVerticesTable` - 根据源和目标信息重建顶点表。" - -#: ../../build/doc/topology-functions.rst:9 -msgid ":doc:`pgr_analyzeGraph` - to analyze the edges and vertices of the edge table." -msgstr ":doc:`pgr_analyzeGraph` - 分析边表的边和顶点。" - -#: ../../build/doc/topology-functions.rst:11 -msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." -msgstr ":doc:`pgr_analyzeOneWay` - 分析边的方向性。" - -#: ../../build/doc/topology-functions.rst:12 -msgid ":doc:`pgr_nodeNetwork` -to create nodes to a not noded edge table." -msgstr ":doc:`pgr_nodeNetwork` -为无节点边表创建节点。" - -#: ../../build/doc/routingFunctions.rst:77 -msgid ":doc:`TSP-family`" -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`- 当输入作为矩阵单元信息给出时。" - -#: ../../build/doc/TSP-family.rst:4 -msgid ":doc:`pgr_TSPeuclidean` - When input are coordinates." -msgstr ":doc:`pgr_TSPeuclidean` - 当输入是坐标时。" - -#: ../../build/doc/routingFunctions.rst:83 -msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" -msgstr ":doc:`pgr_trsp` - 转弯限制最短路径 (TRSP)" - -#: ../../build/doc/routingFunctions.rst:87 -msgid "Functions by categories" -msgstr "按类别划分的函数" - -#: ../../build/doc/routingFunctions.rst:89 -msgid ":doc:`cost-category`" -msgstr ":doc:`cost-category`" - -#: ../../build/doc/cost-category.rst:3 -msgid ":doc:`pgr_aStarCost`" -msgstr ":doc:`pgr_aStarCost`" - -#: ../../build/doc/cost-category.rst:4 -msgid ":doc:`pgr_bdAstarCost`" -msgstr ":doc:`pgr_bdAstarCost`" - -#: ../../build/doc/cost-category.rst:5 -msgid ":doc:`pgr_dijkstraCost`" -msgstr ":doc:`pgr_dijkstraCost`" - -#: ../../build/doc/cost-category.rst:6 -msgid ":doc:`pgr_bdDijkstraCost`" -msgstr ":doc:`pgr_bdDijkstraCost`" - -#: ../../build/doc/cost-category.rst:7 -msgid ":doc:`pgr_dijkstraNearCost`" -msgstr ":doc:`pgr_dijkstraNearCost`" - -#: ../../build/doc/routingFunctions.rst:95 -msgid ":doc:`costMatrix-category`" -msgstr ":doc:`costMatrix-category`" - -#: ../../build/doc/costMatrix-category.rst:3 -msgid ":doc:`pgr_aStarCostMatrix`" -msgstr ":doc:`pgr_aStarCostMatrix`" - -#: ../../build/doc/costMatrix-category.rst:4 -msgid ":doc:`pgr_bdAstarCostMatrix`" -msgstr ":doc:`pgr_bdAstarCostMatrix`" - -#: ../../build/doc/costMatrix-category.rst:5 -#: ../../build/doc/costMatrix-category.rst:7 -msgid ":doc:`pgr_bdDijkstraCostMatrix`" -msgstr ":doc:`pgr_bdDijkstraCostMatrix`" - -#: ../../build/doc/costMatrix-category.rst:6 -msgid ":doc:`pgr_dijkstraCostMatrix`" -msgstr ":doc:`pgr_dijkstraCostMatrix`" - -#: ../../build/doc/routingFunctions.rst:102 -msgid ":doc:`drivingDistance-category`" -msgstr ":doc:`drivingDistance-category`" - -#: ../../build/doc/drivingDistance-category.rst:3 -msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" -msgstr ":doc:`pgr_drivingDistance` - 基于 Dijkstra 算法的行驶距离" - -#: ../../build/doc/drivingDistance-category.rst:4 -msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" -msgstr ":doc:`pgr_primDD` - 基于Prim算法的行驶距离" - -#: ../../build/doc/drivingDistance-category.rst:5 -msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" -msgstr ":doc:`pgr_kruskalDD` - 基于Kruskal算法的行驶距离" - -#: ../../build/doc/drivingDistance-category.rst:6 -msgid "Post pocessing" -msgstr "后期处理" - -#: ../../build/doc/drivingDistance-category.rst:8 -msgid ":doc:`pgr_alphaShape` - Alpha shape computation" -msgstr ":doc:`pgr_alphaShape` - Alpha 形状计算" - -#: ../../build/doc/routingFunctions.rst:108 -msgid ":doc:`KSP-category`" -msgstr ":doc:`KSP-category`" - -#: ../../build/doc/KSP-category.rst:3 -msgid ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra" -msgstr ":doc:`pgr_KSP` - 基于 pgr_dijkstra 的 Yen 算法" - -#: ../../build/doc/routingFunctions.rst:114 -msgid ":doc:`spanningTree-family`" -msgstr ":doc:`spanningTree-family`" - -#: ../../build/doc/routingFunctions.rst:120 -msgid ":doc:`BFS-category`" -msgstr ":doc:`BFS-category`" - -#: ../../build/doc/routingFunctions.rst:126 -msgid ":doc:`DFS-category`" -msgstr ":doc:`DFS-category`" - -#: ../../build/doc/index.rst:91 -msgid "Available Functions but not official pgRouting functions" -msgstr "可用函数，但不是官方 pgRouting 函数" - -#: ../../build/doc/index.rst:93 -msgid ":doc:`proposed`" -msgstr ":doc:`proposed`" - -#: ../../build/doc/index.rst:94 -msgid ":doc:`experimental`" -msgstr ":doc:`experimental`" - -#: ../../build/doc/index.rst:105 -msgid ":doc:`release_notes`" -msgstr ":doc:`release_notes`" - -#: ../../build/doc/index.rst:119 -msgid "Indices and tables" -msgstr "索引和表格" - -#: ../../build/doc/index.rst:120 -msgid ":ref:`genindex`" -msgstr ":ref:`genindex`" - -#: ../../build/doc/index.rst:121 -msgid ":ref:`search`" -msgstr ":ref:`search`" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 801fd089369..33b5a8ed527 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -2,18 +2,18 @@ # Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # Regina Obe , 2023. -# Wangdapeng , 2023. +# Wangdapeng , 2023, 2025. # Zuochenwei , 2023, 2024. -# Celia Virginia Vergara Castillo , 2023, 2024. +# Celia Virginia Vergara Castillo , 2023, 2024, 2025. # Wang Dapeng , 2023. -# DeepL , 2024. +# DeepL , 2024, 2025. msgid "" msgstr "" "Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-10-17 00:50+0000\n" -"PO-Revision-Date: 2024-10-10 19:47+0000\n" -"Last-Translator: DeepL \n" +"POT-Creation-Date: 2025-04-08 20:49+0000\n" +"PO-Revision-Date: 2025-04-09 00:16+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" "Language: zh_Hans\n" @@ -305,9 +305,6 @@ msgstr ":doc:`pgr_kruskalDFS`" msgid ":doc:`pgr_primDFS`" msgstr ":doc:`pgr_primDFS`" -msgid "Proposed" -msgstr "建议" - msgid "Proposed functions for next mayor release." msgstr "下一版本的拟议功能。" @@ -376,9 +373,6 @@ msgid "" msgstr "" "阅读 :doc:`migration` 了解如何从已弃用的 TRSP 功能迁移到新的签名或替换功能。" -msgid "Experimental" -msgstr "实验性的" - msgid "Possible server crash" msgstr "可能服务器崩溃" @@ -421,8 +415,8 @@ msgstr "文档（如果有）可能需要重写。" msgid "Documentation examples might need to be automatically generated." msgstr "可能需要自动生成文档示例。" -msgid "Might need a lot of feedback from the comunity." -msgstr "可能需要社区的大量反馈。" +msgid "Might need a lot of feedback from the community." +msgstr "需要从社区获取大量反馈意见。" msgid "Might depend on a proposed function of pgRouting" msgstr "可能取决于 pgRouting 的拟议功能" @@ -687,10 +681,10 @@ msgid "References" msgstr "参考" msgid "" -"`Boost's metric appro's metric approximation `__" +"`Boost: metric TSP approx `__" msgstr "" -"`Boost 的 metric appro 的 metric 近似 `__" msgid "`University of Waterloo TSP `__" @@ -705,8 +699,8 @@ msgstr "" "`维基百科：旅行商问题 `__" -msgid "Vehicle Routing Functions - Category (Experimental)" -msgstr "车辆路由功能 - 类别（实验）" +msgid "Vehicle Routing Functions - Category" +msgstr "车辆路径规划函数 - 分类" msgid "Pickup and delivery problem" msgstr "取货和送货问题" @@ -1674,8 +1668,8 @@ msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem" -msgid "The queries use the :doc:`sampledata` network." -msgstr "查询使用 :doc:`sampledata` 网络。" +msgid ":doc:`sampledata`" +msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - 函数族" @@ -1846,8 +1840,10 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" -msgstr "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search `__" +msgstr "" +"`Boost: A* search `__" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2662,15 +2658,12 @@ msgid "" "ending vertex:" msgstr "对于起始顶点和结束顶点之间存在路径的大型图:" -msgid "It is expected to terminate faster than pgr_astar" -msgstr "预计终止速度比 pgr_astar 更快" +msgid "It is expected to terminate faster than pgr_aStar" +msgstr "预计其执行速度将快于 pgr_aStar 函数" msgid ":doc:`aStar-family`" msgstr ":doc:`aStar-family`" -msgid "Previous versions of this page" -msgstr "此页面的先前版本" - msgid "Bidirectional Dijkstra - Family of functions" msgstr "双向 Dijkstra - 函数族" @@ -2815,34 +2808,9 @@ msgid "Identifier of the color of the edge." msgstr "边颜色的标识符。" msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" -"`Boost：顺序顶点着色算法文档 `__" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "`维基百科：图着色 `__" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: is_bipartite `__" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "`维基百科：二分图 `__" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" +"`Boost: `__" msgstr "" -"`Boost：边缘着色算法文档 `__" +"`Boost: `__" msgid "Components - Family of functions" msgstr "分量 - 函数族" @@ -2877,6 +2845,9 @@ msgstr "收缩 - 函数族" msgid ":doc:`pgr_contraction`" msgstr ":doc:`pgr_contraction`" +msgid ":doc:`pgr_contractionDeadEnd`" +msgstr ":doc:`pgr_contractionDeadEnd`" + msgid "" "In large graphs, like the road graphs, or electric networks, graph " "contraction can be used to speed up some graph algorithms. Contraction " @@ -2910,1360 +2881,867 @@ msgid "" "times they are to be executed." msgstr "决定收缩算法的顺序并设置它们要执行的最大次数。" -msgid "Contraction of the leaf nodes of the graph." -msgstr "图的叶节点的收缩。" - -msgid "Dead end" -msgstr "死端" - -msgid "A node is considered a **dead end** node when" -msgstr "当一个节点被认为是 **死端** 节点时" - -msgid "On undirected graphs:" -msgstr "在无向图上：" - -msgid "The number of adjacent vertices is 1." -msgstr "相邻顶点的个数为1。" - -msgid "On directed graphs:" -msgstr "在有向图上：" - -msgid "There are no outgoing edges and has at least one incoming edge." -msgstr "没有传出边缘，但至少有一个传入边缘。" +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 "There are no incoming edges and has at least one outgoing edge." -msgstr "没有传入边缘，但至少有一个传出边缘。" +msgid "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" +msgstr "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" -msgid "" -"When the conditions are true then the `Operation: Dead End Contraction`_ can " -"be done." -msgstr "当条件成立时，可以进行当条件成立时，可以进行 `操作: 死端收缩`_ 。" +msgid "Cost - Category" +msgstr "成本 - 类别" -msgid "Dead end vertex on undirected graph" -msgstr "无向图上的死端顶点" +msgid ":doc:`pgr_aStarCost`" +msgstr ":doc:`pgr_aStarCost`" -msgid "The green nodes are `dead end`_ nodes" -msgstr "绿色节点是 `死端`_ 节点" +msgid ":doc:`pgr_bdAstarCost`" +msgstr ":doc:`pgr_bdAstarCost`" -msgid "The blue nodes have an unlimited number of edges." -msgstr "蓝色节点具有无限数量的边。" +msgid ":doc:`pgr_dijkstraCost`" +msgstr ":doc:`pgr_dijkstraCost`" -msgid "Node" -msgstr "节点" +msgid ":doc:`pgr_bdDijkstraCost`" +msgstr ":doc:`pgr_bdDijkstraCost`" -msgid "Adjecent nodes" -msgstr "相邻节点" +msgid ":doc:`pgr_dijkstraNearCost`" +msgstr ":doc:`pgr_dijkstraNearCost`" -msgid "Number of adjacent nodes" -msgstr "相邻节点数" +msgid ":doc:`pgr_withPointsCost`" +msgstr ":doc:`pgr_withPointsCost`" -msgid ":math:`a`" -msgstr ":math:`a`" +msgid "Each function works as part of the family it belongs to." +msgstr "每个函数都是其所属家族的一部分。" -msgid ":math:`\\{u\\}`" -msgstr ":math:`\\{u\\}`" +msgid "" +"Returns the sum of the costs of the shortest path of each pair combination " +"of nodes requested." +msgstr "返回所请求的每对节点组合的最短路径的成本总和。" -msgid ":math:`b`" -msgstr ":math:`b`" +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 "" +"假设返回的值存储在表中，因此唯一索引将是一对： ``(start_vid, end_vid)``。" -msgid ":math:`\\{v\\}`" -msgstr ":math:`\\{v\\}`" +msgid "" +"Depending on the function and its parameters, the results can be symmetric." +msgstr "根据函数及其参数，结果可能是对称的。" -msgid "Dead end vertex on directed graph" -msgstr "有向图上的死端顶点" +msgid "" +"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgstr ":math:`(u, v)` 的 **总成本** 与 :math:`(v, u)` 的相同。" msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." -msgstr "蓝色节点具有无限数量的传入和/或传出边缘。" +"Any duplicated value in the start or end vertex identifiers are ignored." +msgstr "起始或结束顶点标识符中的任何重复值都将被忽略。" -msgid "Number of incoming edges" -msgstr "传入边数" +msgid "The returned values are ordered:" +msgstr "返回值是有序的：" -msgid "Number of outgoing edges" -msgstr "传出边数" +msgid "``start_vid`` ascending" +msgstr "``start_vid`` 升序" -msgid ":math:`c`" -msgstr ":math:`c`" +msgid "``end_vid`` ascending" +msgstr "``end_vid`` 升序" -msgid ":math:`\\{v, w\\}`" -msgstr ":math:`\\{v, w\\}`" +msgid "Cost Matrix - Category" +msgstr "成本矩阵 - 类别" -msgid "2" -msgstr "2" +msgid ":doc:`pgr_aStarCostMatrix`" +msgstr ":doc:`pgr_aStarCostMatrix`" -msgid ":math:`d`" -msgstr ":math:`d`" +msgid ":doc:`pgr_dijkstraCostMatrix`" +msgstr ":doc:`pgr_dijkstraCostMatrix`" -msgid ":math:`\\{x\\}`" -msgstr ":math:`\\{x\\}`" +msgid ":doc:`pgr_bdAstarCostMatrix`" +msgstr ":doc:`pgr_bdAstarCostMatrix`" -msgid ":math:`e`" -msgstr ":math:`e`" +msgid ":doc:`pgr_bdDijkstraCostMatrix`" +msgstr ":doc:`pgr_bdDijkstraCostMatrix`" -msgid ":math:`\\{x, y\\}`" -msgstr ":math:`\\{x, y\\}`" +msgid ":doc:`pgr_withPointsCostMatrix`" +msgstr ":doc:`pgr_withPointsCostMatrix`" 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." +":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " +"v)` must value :math:`\\infty`." msgstr "" -"从上面来看，节点 :math:`\\{a, b, d\\}` 是死端，因为相邻顶点的数量为 1。不需要" -"对这些节点进行进一步检查。" +":doc:`TSP-family` 需要一个对称成本矩阵作为输入，并且没有边 `(u, v)` 必须值" +"为 :math:`\\infty`。" msgid "" -"On the following table, nodes :math:`\\{c, e\\}` because the even that the " -"number of adjacent vertices is not 1 for" -msgstr "下表中，节点 :math:`\\{c, e\\}` 因为相邻顶点数不为1的偶数为" +"This collection of functions will return a cost matrix in form of a table." +msgstr "该函数集合将以表格形式返回成本矩阵。" -msgid "Operation: Dead End Contraction" -msgstr "操作：死端收缩" +msgid "Can be used as input to :doc:`pgr_TSP`." +msgstr "可用作 :doc:`pgr_TSP` 的输入。" 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:" -msgstr "" -"死端收缩将停止，直到不再有死端节点。 例如，从下图中，其中 :math:`w` 是 `死端" -"`_ 节点：" +"Use directly when the resulting matrix is symmetric and there is no :math:" +"`\\infty` value." +msgstr "当得到的矩阵是对称且没有 :math:`\\infty` 值时直接使用。" -msgid "" -"After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and is " -"contracted:" -msgstr "收缩 :math:`w` 后，节点 :math:`v` 现在是一个 `死端`_ 节点并且已收缩：" +msgid "It will be the users responsibility to make the matrix symmetric." +msgstr "用户有责任使矩阵对称。" + +msgid "By using geometric or harmonic average of the non symmetric values." +msgstr "通过使用非对称值的几何平均或调和平均。" + +msgid "By using max or min the non symmetric values." +msgstr "通过使用 max 或 min 非对称值。" msgid "" -"After contracting :math:`v`, stop. Node :math:`u` has the information of " -"nodes that were contrcted." -msgstr "在收缩 :math:`v` 之后，停止。节点 :math:`u` 有已收缩节点的信息。" +"By setting the upper triangle to be the mirror image of the lower triangle." +msgstr "通过将上三角形设置为下三角形的镜像。" -msgid "Node :math:`u` has the information of nodes that were contracted." -msgstr "节点 :math:`u` 有已收缩节点的信息。" +msgid "" +"By setting the lower triangle to be the mirror image of the upper triangle." +msgstr "通过将下三角形设置为上三角形的镜像。" -msgid "In the algorithm, linear contraction is represented by 2." -msgstr "算法中，线性收缩用2表示。" +msgid "It is also the users responsibility to fix an :math:`\\infty` value." +msgstr "确定 :math:`\\infty` 值也是用户的责任。" -msgid "Linear" -msgstr "线性" +msgid "" +"Returns the sum of the costs of the shortest path for pair combination of " +"nodes in the graph." +msgstr "返回图中节点对组合的最短路径的成本总和。" msgid "" -"In case of an undirected graph, a node is considered a `linear` node when" -msgstr "在无向图的情况下，当满足以下条件时，节点被视为`线性`节点" +"When the starting vertex and ending vertex are the same, there is no path." +msgstr "当起始顶点和结束顶点相同时，就没有路径。" -msgid "The number of adjacent vertices is 2." -msgstr "相邻顶点的数量为2。" +msgid "The aggregate cost in the non included values `(v, v)` is `0`." +msgstr "未包含值 `(v, v)` 中的总成本为 `0`。" -msgid "In case of a directed graph, a node is considered a `linear` node when" -msgstr "在有向图的情况下，当满足以下条件时，节点被视为`线性`节点" +msgid "" +"When the starting vertex and ending vertex are the different and there is no " +"path." +msgstr "当起始顶点和结束顶点不同且不存在路径时。" -msgid "Linearity is symmetrical" -msgstr "线性是对称的" +msgid "" +"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgstr "未包含值 `(u, v)` 中的总成本为 :math:`\\infty` 。" -msgid "Linear vertex on undirected graph" -msgstr "无向图上的线性顶点" +msgid "Let be the case the values returned are stored in a table:" +msgstr "假设返回的值存储在表中：" -msgid "The green nodes are `linear`_ nodes" -msgstr "绿色节点是 `线性`_ 节点" +msgid "The unique index would be the pair: ``(start_vid, end_vid)``." +msgstr "唯一索引将是一对： ``(start_vid, end_vid)``。" -msgid "The blue nodes have an unlimited number of incoming and outgoing edges." -msgstr "蓝色节点具有无限数量的传入和传出边缘。" +msgid "The aggregate cost of `(u, v)` is the same as for `(v, u)`." +msgstr "`(u, v)` 的总成本与 `(v, u)` 相同。" -msgid "Undirected" -msgstr "无向" +msgid "Any duplicated value in the **start vids** are ignored." +msgstr "**start vids** 中的任何重复值都会被忽略。" -msgid ":math:`v`" -msgstr ":math:`v`" +msgid "Used in:" +msgstr "用于：" -msgid ":math:`\\{u, w\\}`" -msgstr ":math:`\\{u, w\\}`" +msgid "`Edges SQL`_ as described below" +msgstr "`Edges SQL`_ 如下所述" -msgid "Linear vertex on directed graph" -msgstr "有向图上的线性顶点" +msgid "**start vids**" +msgstr "**start vids**" -msgid "The white node is not linear because the linearity is not symetrical." -msgstr "白色节点不是线性的，因为线性不对称。" +msgid "``ARRAY[BIGINT]``" +msgstr "``ARRAY[BIGINT]``" -msgid "It is possible to go :math:`y \\rightarrow c \\rightarrow z`" -msgstr "它是可能去走 :math:`y \\rightarrow c \\rightarrow z`" +msgid "Array of identifiers of starting vertices." +msgstr "起始顶点的标识符数组。" -msgid "It's not possible to go :math:`z \\rightarrow c \\rightarrow y`" -msgstr "不可能走 :math:`z \\rightarrow c \\rightarrow y`" +msgid "`Points SQL`_" +msgstr "`Points SQL`_" -msgid "Is symmetrical?" -msgstr "是对称的吗？" +msgid "`Points SQL`_ as described below" +msgstr "`Points SQL`_ 如下所述" -msgid ":math:`\\{u, v\\}`" -msgstr ":math:`\\{u, v\\}`" +msgid "Points SQL" +msgstr "Points SQL" -msgid "yes" -msgstr "是" +msgid "``pid``" +msgstr "``pid``" -msgid ":math:`\\{w, x\\}`" -msgstr ":math:`\\{w, x\\}`" +msgid "**value**" +msgstr "**value**" -msgid ":math:`\\{y, z\\}`" -msgstr ":math:`\\{y, z\\}`" +msgid "Identifier of the point." +msgstr "点的标识符。" -msgid "no" -msgstr "否" +msgid "" +"Use with positive value, as internally will be converted to negative value" +msgstr "使用正值，因为内部将转换为负值" -msgid "Operation: Linear Contraction" -msgstr "操作：线性收缩" +msgid "If column is present, it can not be NULL." +msgstr "如果列存在，则它不能为 NULL。" 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:" -msgstr "" -"当不再有线性节点时，线性收缩将停止。 例如，在下图中，其中 :math:`v` 和 :math:" -"`w` 是 `线性`_ 节点：" - -msgid "Contracting :math:`w`," -msgstr "收缩 :math:`w`，" +"If column is not present, a sequential negative **value** will be given " +"automatically." +msgstr "如果列不存在，将自动给出连续的负 **值** 。" -msgid "The vertex :math:`w` is removed from the graph" -msgstr "顶点 :math:`w` 已从图中移除" +msgid "Identifier of the \"closest\" edge to the point." +msgstr "距离该点“最近”的边的标识符。" -msgid "" -"The edges :math:`v \\rightarrow w` and :math:`w \\rightarrow z` are removed " -"from the graph." -msgstr "从图中删除边 :math:`v \\rightarrow w` 和 :math:`w \\rightarrow z`。" +msgid "``fraction``" +msgstr "``fraction``" msgid "" -"A new edge :math:`v \\rightarrow z` is inserted represented with red color." -msgstr "插入一条新边 :math:`v \\rightarrow z`，以红色表示。" +"Value in <0,1> that indicates the relative postition from the first end " +"point of the edge." +msgstr "<0,1> 中的值指示距边缘第一个端点的相对位置。" -msgid "Contracting :math:`v`:" -msgstr "收缩 :math:`v`：" +msgid "``side``" +msgstr "``side``" -msgid "The vertex :math:`v` is removed from the graph" -msgstr "顶点 :math:`v` 已从图中移除" +msgid "``CHAR``" +msgstr "``CHAR``" -msgid "" -"The edges :math:`u \\rightarrow v` and :math:`v \\rightarrow z` are removed " -"from the graph." -msgstr "从图中删除边 :math:`u \\rightarrow v` 和 :math:`v \\rightarrow z`。" +msgid "``b``" +msgstr "``b``" -msgid "" -"A new edge :math:`u \\rightarrow z` is inserted represented with red color." -msgstr "插入一条新边 :math:`u \\rightarrow z`，以红色表示。" +msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:" +msgstr "[``b``, ``r``, ``l``, ``NULL``] 中的值指示该点是否为：" -msgid "" -"Edge :math:`u \\rightarrow z` has the information of nodes that were " -"contracted." -msgstr "边 :math:`u \\rightarrow z` 有收缩点的信息。" +msgid "In the right ``r``," +msgstr "``r`` 在右边，" -msgid "The cycle" -msgstr "循环" +msgid "In the left ``l``," +msgstr "``l`` 在左边，" -msgid "" -"Contracting a graph, can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." -msgstr "" -"收缩一张图可以通过多个操作来完成。 操作的顺序会影响生成的收缩图，在应用一个操" -"作后，可以由另一操作收缩的顶点集会发生变化。" - -msgid "" -"This implementation, cycles ``max_cycles`` times through " -"``operations_order`` ." -msgstr "此实现通过 ``operations_order``循环 ``max_cycles`` 次。" +msgid "In both sides ``b``, ``NULL``" +msgstr "``b``, ``NULL`` 在两边" -msgid "Contracting sample data" -msgstr "收缩示例数据" +msgid ":doc:`TSP-family`" +msgstr ":doc:`TSP-family`" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." -msgstr "在本节中，将通过示例展示构建和使用收缩图。" +msgid "Dijkstra - Family of functions" +msgstr "Dijkstra - 函数族" -msgid "The :doc:`sampledata` for an undirected graph is used" -msgstr "使用无向图的 :doc:`sampledata`" +msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." +msgstr ":doc:`pgr_dijkstra` - Dijkstra 最短路径算法。" -msgid "a dead end operation first followed by a linear operation." -msgstr "首先是死端操作，然后是线性操作。" +msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." +msgstr ":doc:`pgr_dijkstraCost` - 获取最短路径的总成本。" -msgid "Construction of the graph in the database" -msgstr "数据库中图的构建" +msgid "" +":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgstr ":doc:`pgr_dijkstraCostMatrix` - 使用 pgr_dijkstra 创建成本矩阵。" -msgid "Original Data" -msgstr "原始数据" +msgid "" +":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " +"information." +msgstr ":doc:`pgr_drivingDistance` - 使用 pgr_dijkstra 计算流域信息。" msgid "" -"The following query shows the original data involved in the contraction " -"operation." -msgstr "以下查询显示了收缩操作所涉及的原始数据。" +":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " +"paths." +msgstr ":doc:`pgr_KSP` - 使用 Yen 算法和 pgr_dijkstra 来获得 K 条最短路径。" -msgid "The original graph:" -msgstr "原始图：" +msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." +msgstr ":doc:`pgr_dijkstraVia` - 获取经过一系列顶点的路径。" -msgid "Contraction results" -msgstr "收缩结果" +msgid ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex." +msgstr ":doc:`pgr_dijkstraNear` - 获取到最近顶点的路线。" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm." -msgstr "结果不代表收缩图。 它们表示应用收缩算法后对图所做的更改。" +msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." +msgstr ":doc:`pgr_dijkstraNearCost` - 获取最近顶点的成本。" msgid "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." +"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 "" -"例如，观察到顶点 :math:`6` 没有出现在结果中，因为它不受收缩算法的影响。" - -msgid "After doing the dead end contraction operation:" -msgstr "进行死端收缩操作后：" - -msgid "After doing the linear contraction operation to the graph above:" -msgstr "对上图进行线性收缩运算后：" - -msgid "The process to create the contraction graph on the database:" -msgstr "在数据库上创建收缩图的过程：" +"Dijkstra算法，由荷兰计算机科学家Edsger Dijkstra于1956年提出。它是一种图搜索算" +"法，解决具有非负边路径成本的图的最短路径问题，产生从起始顶点到结束顶点的最短" +"路径。 该实现可以与有向图和无向图一起使用。" -msgid "Add additional columns" -msgstr "添加附加列" +msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" +msgstr "运行时间： :math:`O(| start\\ vids | * (V \\log V + E))`" -msgid "" -"Adding extra columns to the ``edge_table`` and ``edge_table_vertices_pgr`` " -"tables, where:" -msgstr "向 ``edge_table`` 和``edge_table_vertices_pgr`` 表添加额外的列，其中：" +msgid "The Dijkstra family functions are based on the Dijkstra algorithm." +msgstr "Dijkstra 系列函数基于 Dijkstra 算法。" -msgid "``contracted_vertices``" -msgstr "``contracted_vertices``" +msgid "`Combinations SQL`_" +msgstr "`Combinations SQL`_" -msgid "The vertices set belonging to the vertex/edge" -msgstr "属于顶点/边的顶点集" +msgid "`Combinations SQL`_ as described below" +msgstr "`Combinations SQL`_ 如下所述" -msgid "``is_contracted``" -msgstr "``is_contracted``" +msgid "**start vid**" +msgstr "**start vid**" -msgid "On the vertex table" -msgstr "在顶点表上" +msgid "Identifier of the starting vertex of the path." +msgstr "路径起始顶点的标识符。" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." -msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" +msgid "**end vid**" +msgstr "**end vid**" -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." -msgstr "当 ``false`` 时，顶点不收缩，它是收缩图的一部分。" +msgid "Identifier of the ending vertex of the path." +msgstr "路径结束顶点的标识符。" -msgid "``is_new``" -msgstr "``is_new``" +msgid "**end vids**" +msgstr "**end vids**" -msgid "On the edge table" -msgstr "在边表上" +msgid "Array of identifiers of ending vertices." +msgstr "结束顶点的标识符数组。" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." -msgstr "当 ``true`` 时，边缘由收缩算法生成。 它是收缩图的一部分。" +msgid "Combinations SQL" +msgstr "分量 SQL" -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." -msgstr "当 ``false`` 时，边是原始边，可能是也可能不是收缩图的一部分。" +msgid "Identifier of the departure vertex." +msgstr "出发顶点的标识符。" -msgid "Store contraction information" -msgstr "存储收缩信息" +msgid "Identifier of the arrival vertex." +msgstr "到达顶点的标识符。" -msgid "Store the `contraction results`_ in a table" -msgstr "将 `收缩结果`_ 存储在表中" +msgid "The problem definition (Advanced documentation)" +msgstr "问题定义（高级文档）" -msgid "The vertex table update" -msgstr "顶点表更新" +msgid "Given the following query:" +msgstr "给出以下查询：" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "使用 ``is_contracted`` 列来指示收缩的顶点。" +msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgid "" -"Fill ``contracted_vertices`` with the information from the results tha " -"belong to the vertices." -msgstr "使用属于顶点的结果中的信息填充 ``contracted_vertices``。" - -msgid "The modified vertices table:" -msgstr "修改后的顶点表：" +"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" +"`" +msgstr "" +"其中 :math:`sql =\\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" -msgid "The edge table update" -msgstr "边缘表更新" +msgid "and" +msgstr "和" -msgid "Insert the new edges generated by pgr_contraction." -msgstr "插入由 pgr_contraction 生成的新边。" +msgid ":math:`source = \\bigcup source_i`," +msgstr ":math:`source = \\bigcup source_i`," -msgid "The modified ``edge_table``." -msgstr "修改后的 ``edge_table``。" +msgid ":math:`target = \\bigcup target_i`," +msgstr ":math:`target = \\bigcup target_i`," -msgid "The contracted graph" -msgstr "收缩图" +msgid "The graphs are defined as follows:" +msgstr "图定义如下：" -msgid "Vertices that belong to the contracted graph." -msgstr "属于收缩图的顶点。" +msgid "Directed graph" +msgstr "有向图" -msgid "Edges that belong to the contracted graph." -msgstr "属于收缩图的边。" +msgid "The weighted directed graph, :math:`G_d(V,E)`, is defined by:" +msgstr "加权有向图， :math:`G_d(V,E)`， 定义如下：" -msgid "Contracted graph" -msgstr "收缩图" +msgid "the set of vertices :math:`V`" +msgstr "顶点集 :math:`V`" -msgid "Using the contracted graph" -msgstr "使用收缩图" +msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" +msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" -msgid "Using the contracted graph with ``pgr_dijkstra``" -msgstr "将收缩图与 ``pgr_dijkstra`` 一起使用" +msgid "the set of edges :math:`E`" +msgstr "边集 :math:`E`" msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" -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}`" +msgstr "" +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " +"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " +"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " +"\\neq \\varnothing \\\\ \\end{cases}`" -msgid "Case 1: Both source and target belong to the contracted graph." -msgstr "情况1：源和目标都属于收缩图。" +msgid "Undirected graph" +msgstr "无向图" -msgid "Case 2: Source and/or target belong to an edge subgraph." -msgstr "情况 2：源和/或目标属于边缘子图。" +msgid "The weighted undirected graph, :math:`G_u(V,E)`, is defined by:" +msgstr "加权无向图 :math:`G_u(V,E)` 的定义如下：" -msgid "Case 3: Source and/or target belong to a vertex." -msgstr "情况 3：源和/或目标属于一个顶点。" +msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" +msgstr "" +":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgid "" -"Using the `Edges that belong to the contracted graph.`_ on lines 11 to 20." -msgstr "使用 `属于收缩图的边。`_ 第 11 至 20 行。" +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " +"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " +"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " +"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " +"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " +"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " +"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" +msgstr "" +":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " +"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " +"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " +"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " +"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " +"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " +"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " +"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " +"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" -msgid "Case 1" -msgstr "情况1" +msgid "The problem" +msgstr "问题" -msgid "" -"When both source and target belong to the contracted graph, a path is found." -msgstr "当源和目标都属于收缩图时，就找到了一条路径。" +msgid "Given:" +msgstr "给定：" -msgid "Case 2" -msgstr "情况2" +msgid ":math:`start_{vid} \\in V` a starting vertex" +msgstr ":math:`start_{vid} \\in V` a starting vertex" -msgid "" -"When source and/or target belong to an edge subgraph then a path is not " -"found." -msgstr "当源和/或目标属于边缘子图时，则找不到路径。" +msgid ":math:`end_{vid} \\in V` an ending vertex" +msgstr ":math:`end_{vid} \\in V` an ending vertex" msgid "" -"In this case, the contracted graph do not have an edge connecting with node :" -"math:`4`." -msgstr "在这种情况下，收缩图没有与节点 :math:`4` 相连的边。" - -msgid "Case 3" -msgstr "情况3" +":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = " +"true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" +msgstr "" +":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = " +"true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" -msgid "When source and/or target belong to a vertex then a path is not found." -msgstr "当源和/或目标属于顶点时，则找不到路径。" +msgid "Then:" +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." +":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " +"agg\\_cost_i)\\}`" msgstr "" -"在这种情况下，收缩图没有与第二种情况的节点 :math:`7` 和节点 :math:`4` 连接的" -"边。" - -msgid "Refining the above function to include nodes that belong to an edge." -msgstr "改进上述函数以包含属于边的节点。" +":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " +"agg\\_cost_i)\\}`" -msgid "The vertices that need to be expanded are calculated on lines 11 to 17." -msgstr "需要扩展的顶点在第 11 至 17 行计算。" +msgid "where:" +msgstr "其中：" -msgid "" -"Adding to the contracted graph that additional section on lines 26 to 28." -msgstr "将第 26 至 28 行的附加部分添加到收缩图中。" +msgid ":math:`path\\_seq_i = i`" +msgstr ":math:`path\\_seq_i = i`" -msgid "" -"When source and/or target belong to an edge subgraph, now, a path is found." -msgstr "当源和目标都属于收缩图时，就找到了一条路径。" +msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`" +msgstr ":math:`path\\_seq_{| \\pi |} = | \\pi |`" -msgid "The routing graph now has an edge connecting with node :math:`4`." -msgstr "路由图现在有一条与节点 :math:`4` 连接的边。" +msgid ":math:`node_i \\in V`" +msgstr ":math:`node_i \\in V`" -msgid "" -"In this case, the contracted graph do not have an edge connecting with node :" -"math:`7`." -msgstr "在这种情况下，收缩图没有与节点 :math:`7` 相连的边。" +msgid ":math:`node_1 = start_{vid}`" +msgstr ":math:`node_1 = start_{vid}`" -msgid "The vertices that need to be expanded are calculated on lines 19 to 24." -msgstr "需要扩展的顶点在第19到24行计算。" +msgid ":math:`node_{| \\pi |} = end_{vid}`" +msgstr ":math:`node_{| \\pi |} = end_{vid}`" msgid "" -"Adding to the contracted graph that additional section on lines 38 to 40." -msgstr "将第 38 至 40 行的附加部分添加到收缩图中。" +":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" +msgstr "" +":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" msgid "" -"The code change do not affect this case so when source and/or target belong " -"to an edge subgraph, a path is still found." +":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " +"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" +"\\ \\end{cases}`" msgstr "" -"代码更改不会影响这种情况，因此当源和/或目标属于边缘子图时，仍然会找到路径。" +":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " +"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" +"\\ \\end{cases}`" -msgid "When source and/or target belong to a vertex, now, a path is found." -msgstr "当源和/或目标属于一个顶点时，现在就找到了一条路径。" +msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" +msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`" -msgid "Now, the routing graph has an edge connecting with node :math:`7`." -msgstr "现在，路由图有一条与节点 :math:`7` 连接的边。" +msgid "" +":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" +"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " +"\\text{when } i \\neq 1 \\\\ \\end{cases}`" +msgstr "" +":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" +"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " +"\\text{when } i \\neq 1 \\\\ \\end{cases}`" -msgid ":doc:`sampledata`" -msgstr ":doc:`sampledata`" +msgid "" +"In other words: The algorithm returns a the shortest path between :math:" +"`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of " +"nodes and of edges," +msgstr "" +"换句话说：如果 :math:`start_{vid}` 和 :math:`end_{vid}` 之间存在最短路径，算" +"法会根据节点和边的序列返回该路径、" msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +":math:`path\\_seq` indicates the relative position in the path of the :math:" +"`node` or :math:`edge`." msgstr "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +":math:`path\\_seq` 表示 :math:`node` 或 :math:`edge` 的路径中的相对位置。" -msgid "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" -msgstr "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" +msgid ":math:`cost` is the cost of the edge to be used to go to the next node." +msgstr ":math:`cost` 是用于转到下一个节点的边的成本。" -msgid "Cost - Category" -msgstr "成本 - 类别" +msgid "" +":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgstr ":math:`agg\\_cost` 是从 :math:`start_{vid}` 到节点的成本。" -msgid ":doc:`pgr_aStarCost`" -msgstr ":doc:`pgr_aStarCost`" +msgid "If there is no path, the resulting set is empty." +msgstr "如果没有路径，则结果集为空。" -msgid ":doc:`pgr_bdAstarCost`" -msgstr ":doc:`pgr_bdAstarCost`" +msgid "Driving Distance - Category" +msgstr "驾驶距离 - 类别" -msgid ":doc:`pgr_dijkstraCost`" -msgstr ":doc:`pgr_dijkstraCost`" +msgid "" +":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgstr ":doc:`pgr_drivingDistance` - 基于 Dijkstra 算法的行驶距离" -msgid ":doc:`pgr_bdDijkstraCost`" -msgstr ":doc:`pgr_bdDijkstraCost`" +msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" +msgstr ":doc:`pgr_primDD` - 基于Prim算法的行驶距离" -msgid ":doc:`pgr_dijkstraNearCost`" -msgstr ":doc:`pgr_dijkstraNearCost`" +msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" +msgstr ":doc:`pgr_kruskalDD` - 基于Kruskal算法的行驶距离" -msgid ":doc:`pgr_withPointsCost`" -msgstr ":doc:`pgr_withPointsCost`" +#, fuzzy +msgid "Post processing" +msgstr "后期处理" -msgid "Each function works as part of the family it belongs to." -msgstr "每个函数都是其所属家族的一部分。" +msgid ":doc:`pgr_alphaShape` - Alpha shape computation" +msgstr ":doc:`pgr_alphaShape` - Alpha 形状计算" -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." -msgstr "返回所请求的每对节点组合的最短路径的成本总和。" +msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" +msgstr ":doc:`pgr_withPointsDD` - 基于 pgr_withPoints 的行驶距离" -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 "" -"假设返回的值存储在表中，因此唯一索引将是一对： ``(start_vid, end_vid)``。" +msgid "Calculate nodes that are within a distance." +msgstr "计算一定距离内的节点。" msgid "" -"Depending on the function and its parameters, the results can be symmetric." -msgstr "根据函数及其参数，结果可能是对称的。" +"Extracts all the nodes that have costs less than or equal to the value " +"distance." +msgstr "提取成本小于或等于距离值的所有节点。" -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." -msgstr ":math:`(u, v)` 的 **总成本** 与 :math:`(v, u)` 的相同。" +msgid "The edges extracted will conform to the corresponding spanning tree." +msgstr "提取的边将符合相应的生成树。" + +msgid "Edge :math:`(u, v)` will not be included when:" +msgstr "在以下情况下，边 :math:`(u, v)` 将不包括在内：" + +msgid "The distance from the **root** to :math:`u` > limit distance." +msgstr "从 **root** 到 :math:`u` 的距离>限制距离。" + +msgid "The distance from the **root** to :math:`v` > limit distance." +msgstr "从 **root** 到 :math:`v` 的距离>限制距离。" msgid "" -"Any duplicated value in the start or end vertex identifiers are ignored." -msgstr "起始或结束顶点标识符中的任何重复值都将被忽略。" +"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 "The returned values are ordered:" -msgstr "返回值是有序的：" +msgid "Edges SQL as described below." +msgstr "Edges SQL如下所述。" -msgid "``start_vid`` ascending" -msgstr "``start_vid`` 升序" +msgid "**Root vid**" +msgstr "**Root vid**" -msgid "``end_vid`` ascending" -msgstr "``end_vid`` 升序" +msgid "**Root vids**" +msgstr "**Root vids**" -msgid "Cost Matrix - Category" -msgstr "成本矩阵 - 类别" +msgid "``ARRAY[ANY-INTEGER]``" +msgstr "``ARRAY[ANY-INTEGER]``" -msgid ":doc:`pgr_aStarCostMatrix`" -msgstr ":doc:`pgr_aStarCostMatrix`" +msgid "**distance**" +msgstr "**distance**" -msgid ":doc:`pgr_dijkstraCostMatrix`" -msgstr ":doc:`pgr_dijkstraCostMatrix`" +msgid "Upper limit for the inclusion of a node in the result." +msgstr "结果中包含节点的上限。" -msgid ":doc:`pgr_bdAstarCostMatrix`" -msgstr ":doc:`pgr_bdAstarCostMatrix`" +msgid "Returns set of |result-spantree|" +msgstr "Returns set of |result-spantree|" -msgid ":doc:`pgr_bdDijkstraCostMatrix`" -msgstr ":doc:`pgr_bdDijkstraCostMatrix`" +msgid ":math:`depth-1` is the depth of ``pred``" +msgstr ":math:`depth-1` is the depth of ``pred``" -msgid "proposed" -msgstr "建议的" +msgid "``pred``" +msgstr "``pred``" -msgid ":doc:`pgr_withPointsCostMatrix`" -msgstr ":doc:`pgr_withPointsCostMatrix`" +msgid "Predecessor of ``node``." +msgstr "``node`` 的前驱。" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." -msgstr "" -":doc:`TSP-family` 需要一个对称成本矩阵作为输入，并且没有边 `(u, v)` 必须值" -"为 :math:`\\infty`。" +msgid "When ``node`` = ``start_vid`` then has the value ``node``." +msgstr "当 `node` 等于 `start_vid` 时，它的值就是 `node`。" -msgid "" -"This collection of functions will return a cost matrix in form of a table." -msgstr "该函数集合将以表格形式返回成本矩阵。" +msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." +msgstr "从 ``pred`` 到达``node``所使用的 ``edge`` 的标识符。" -msgid "Can be used as input to :doc:`pgr_TSP`." -msgstr "可用作 :doc:`pgr_TSP` 的输入。" +msgid "Experimental Functions" +msgstr "实验函数" -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." -msgstr "当得到的矩阵是对称且没有 :math:`\\infty` 值时直接使用。" +msgid "Families" +msgstr "族" -msgid "It will be the users responsibility to make the matrix symmetric." -msgstr "用户有责任使矩阵对称。" +msgid ":doc:`flow-family`" +msgstr ":doc:`flow-family`" -msgid "By using geometric or harmonic average of the non symmetric values." -msgstr "通过使用非对称值的几何平均或调和平均。" +msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." +msgstr ":doc:`pgr_maxFlowMinCost` - 边缘上的流量和成本详细信息。" -msgid "By using max or min the non symmetric values." -msgstr "通过使用 max 或 min 非对称值。" +msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." +msgstr ":doc:`pgr_maxFlowMinCost_Cost` -仅最小成本计算。" -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." -msgstr "通过将上三角形设置为下三角形的镜像。" +msgid ":doc:`chinesePostmanProblem-family`" +msgstr ":doc:`chinesePostmanProblem-family`" + +msgid ":doc:`coloring-family`" +msgstr ":doc:`coloring-family`" + +msgid ":doc:`transformation-family`" +msgstr ":doc:`transformation-family`" msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." -msgstr "通过将下三角形设置为上三角形的镜像。" +":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " +"Graph out of each vertex in the input graph." +msgstr "" +":doc:`pgr_lineGraphFull` - 用于从输入图中的每个顶点生成线图的变换算法。" -msgid "It is also the users responsibility to fix an :math:`\\infty` value." -msgstr "确定 :math:`\\infty` 值也是用户的责任。" +msgid ":doc:`traversal-family`" +msgstr ":doc:`traversal-family`" msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." -msgstr "返回图中节点对组合的最短路径的成本总和。" +":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_breadthFirstSearch` - 图的广度优先搜索遍历。" msgid "" -"When the starting vertex and ending vertex are the same, there is no path." -msgstr "当起始顶点和结束顶点相同时，就没有路径。" +":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " +"graph." +msgstr ":doc:`pgr_binaryBreadthFirstSearch` -图的广度优先搜索遍历。" -msgid "The aggregate cost in the non included values `(v, v)` is `0`." -msgstr "未包含值 `(v, v)` 中的总成本为 `0`。" +msgid ":doc:`components-family`" +msgstr ":doc:`components-family`" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." -msgstr "当起始顶点和结束顶点不同且不存在路径时。" +msgid ":doc:`ordering-family`" +msgstr ":doc:`ordering-family`" msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." -msgstr "未包含值 `(u, v)` 中的总成本为 :math:`\\infty` 。" +":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " +"an undirected graph." +msgstr ":doc:`pgr_cuthillMckeeOrdering` -返回无向图的反向 Cuthill-McKee 排序。" -msgid "Let be the case the values returned are stored in a table:" -msgstr "假设返回的值存储在表中：" +msgid "" +":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " +"acyclic graph." +msgstr ":doc:`pgr_topologicalSort` — 有向无环图 (DAG) 的顶点的线性排序。" -msgid "The unique index would be the pair: ``(start_vid, end_vid)``." -msgstr "唯一索引将是一对： ``(start_vid, end_vid)``。" +msgid ":doc:`metrics-family`" +msgstr ":doc:`metrics-family`" -msgid "The aggregate cost of `(u, v)` is the same as for `(v, u)`." -msgstr "`(u, v)` 的总成本与 `(v, u)` 相同。" +msgid "" +":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " +"centrality using Brandes Algorithm" +msgstr ":doc:`pgr_betweennessCentrality` - 使用布兰德斯算法计算相对介度中心性" -msgid "Any duplicated value in the **start vids** are ignored." -msgstr "**start vids** 中的任何重复值都会被忽略。" +msgid ":doc:`TRSP-family`" +msgstr ":doc:`TRSP-family`" -msgid "Used in:" -msgstr "用于：" +msgid "categories" +msgstr "类别" -msgid "`Edges SQL`_ as described below" -msgstr "`Edges SQL`_ 如下所述" +msgid ":doc:`VRP-category`" +msgstr ":doc:`VRP-category`" -msgid "**start vids**" -msgstr "**start vids**" +msgid "Shortest Path Category" +msgstr "最短路径算法分类" -msgid "``ARRAY[BIGINT]``" -msgstr "``ARRAY[BIGINT]``" +msgid ":doc:`pgr_bellmanFord`" +msgstr ":doc:`pgr_bellmanFord`" -msgid "Array of identifiers of starting vertices." -msgstr "起始顶点的标识符数组。" +msgid ":doc:`pgr_dagShortestPath`" +msgstr ":doc:`pgr_dagShortestPath`" -msgid "`Points SQL`_" -msgstr "`Points SQL`_" +msgid ":doc:`pgr_edwardMoore`" +msgstr ":doc:`pgr_edwardMoore`" -msgid "`Points SQL`_ as described below" -msgstr "`Points SQL`_ 如下所述" +msgid "Planar Family" +msgstr "平面图算法族" -msgid "Points SQL" -msgstr "Points SQL" +msgid ":doc:`pgr_isPlanar`" +msgstr ":doc:`pgr_isPlanar`" -msgid "``pid``" -msgstr "``pid``" +msgid "Miscellaneous Algorithms" +msgstr "其他算法" -msgid "**value**" -msgstr "**value**" +msgid ":doc:`pgr_lengauerTarjanDominatorTree`" +msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" -msgid "Identifier of the point." -msgstr "点的标识符。" +msgid ":doc:`pgr_stoerWagner`" +msgstr ":doc:`pgr_stoerWagner`" -msgid "" -"Use with positive value, as internally will be converted to negative value" -msgstr "使用正值，因为内部将转换为负值" +msgid ":doc:`pgr_transitiveClosure`" +msgstr ":doc:`pgr_transitiveClosure`" -msgid "If column is present, it can not be NULL." -msgstr "如果列存在，则它不能为 NULL。" +msgid ":doc:`pgr_hawickCircuits`" +msgstr ":doc:`pgr_hawickCircuits`" + +msgid "Flow - Family of functions" +msgstr "Flow - 函数族" msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." -msgstr "如果列不存在，将自动给出连续的负 **值** 。" +":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " +"algorithm." +msgstr ":doc:`pgr_maxFlow` - 仅使用 Push 和 Relabel 算法进行最大流量计算。" -msgid "Identifier of the \"closest\" edge to the point." -msgstr "距离该点“最近”的边的标识符。" +msgid "" +":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " +"edges." +msgstr ":doc:`pgr_boykovKolmogorov` - Boykov 和 Kolmogorov 的边流动细节。" -msgid "``fraction``" -msgstr "``fraction``" +msgid "" +":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " +"edges." +msgstr ":doc:`pgr_edmondsKarp` - 带有边流量详细信息的 Edmonds 和 Karp 算法。" msgid "" -"Value in <0,1> that indicates the relative postition from the first end " -"point of the edge." -msgstr "<0,1> 中的值指示距边缘第一个端点的相对位置。" +":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " +"edges." +msgstr ":doc:`pgr_pushRelabel` - 推送和重新标记算法以及边流量的详细信息。" -msgid "``side``" -msgstr "``side``" +msgid "Applications" +msgstr "应用" -msgid "``CHAR``" -msgstr "``CHAR``" +msgid "" +":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " +"groups of vertices." +msgstr ":doc:`pgr_edgeDisjointPaths` - 计算两组顶点之间的边不相交路径。" -msgid "``b``" -msgstr "``b``" +msgid "" +":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " +"in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - 计算图中的最大基数匹配。" -msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:" -msgstr "[``b``, ``r``, ``l``, ``NULL``] 中的值指示该点是否为：" +msgid "Flow Functions General Information" +msgstr "流函数一般信息" -msgid "In the right ``r``," -msgstr "``r`` 在右边，" +msgid "The graph is **directed**." +msgstr "该图是 **有向** 的。" -msgid "In the left ``l``," -msgstr "``l`` 在左边，" +msgid "Process is done only on edges with positive capacities." +msgstr "仅在具有正容量的边缘上进行处理。" -msgid "In both sides ``b``, ``NULL``" -msgstr "``b``, ``NULL`` 在两边" +msgid "" +"When the maximum flow is 0 then there is no flow and **EMPTY SET** is " +"returned." +msgstr "当最大流量为0时则没有流量并返回 **EMPTY SET** 。" -msgid ":doc:`TSP-family`" -msgstr ":doc:`TSP-family`" +msgid "There is no flow when source has the same value as target." +msgstr "源点与目标点相同时无流通过。" -msgid "Dijkstra - Family of functions" -msgstr "Dijkstra - 函数族" +msgid "Any duplicated values in source or target are ignored." +msgstr "source或target 中的任何重复值都将被忽略。" -msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr ":doc:`pgr_dijkstra` - Dijkstra 最短路径算法。" +msgid "Calculates the flow/residual capacity for each edge. In the output" +msgstr "计算每条边的流量/剩余容量。 在输出中" -msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgstr ":doc:`pgr_dijkstraCost` - 获取最短路径的总成本。" +msgid "Edges with zero flow are omitted." +msgstr "流量为零的边被忽略。" -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr ":doc:`pgr_dijkstraCostMatrix` - 使用 pgr_dijkstra 创建成本矩阵。" +msgid "Creates" +msgstr "创建" -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." -msgstr ":doc:`pgr_drivingDistance` - 使用 pgr_dijkstra 计算流域信息。" +msgid "a **super source** and edges from it to all the sources," +msgstr "一个**超级源**和从它到所有源的边，" -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." -msgstr ":doc:`pgr_KSP` - 使用 Yen 算法和 pgr_dijkstra 来获得 K 条最短路径。" +msgid "a **super target** and edges from it to all the targetss." +msgstr "一个**超级目标**和从它到所有目标的边。" -msgid ":doc:`pgr_dijkstraVia` - Get a route of a seuence of vertices." -msgstr ":doc:`pgr_dijkstraVia` - 获取一系列顶点的路径。" +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:" +msgstr "" +"当使用相同参数执行时，通过图表的最大流量保证是 :doc:`pgr_maxFlow " +"` 返回的值，并且可以计算：" -msgid ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex." -msgstr ":doc:`pgr_dijkstraNear` - 获取到最近顶点的路线。" +msgid "By aggregation of the outgoing flow from the sources" +msgstr "通过聚合来自源的传出流量" -msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." -msgstr ":doc:`pgr_dijkstraNearCost` - 获取最近顶点的成本。" +msgid "By aggregation of the incoming flow to the targets" +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." +":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 "" -"Dijkstra算法，由荷兰计算机科学家Edsger Dijkstra于1956年提出。它是一种图搜索算" -"法，解决具有非负边路径成本的图的最短路径问题，产生从起始顶点到结束顶点的最短" -"路径。 该实现可以与有向图和无向图一起使用。" +":doc:`pgr_maxFlow` 是最大流量，并且该最大值保证在函数 :doc:" +"`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, 上相" +"同，但通过每条边的实际流量可能会有所不同。" -msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" -msgstr "运行时间： :math:`O(| start\\ vids | * (V \\log V + E))`" +msgid "Capacity edges" +msgstr "容量边缘" -msgid "The Dijkstra family functions are based on the Dijkstra algorithm." -msgstr "Dijkstra 系列函数基于 Dijkstra 算法。" +msgid ":doc:`pgr_pushRelabel`" +msgstr ":doc:`pgr_pushRelabel`" -msgid "`Combinations SQL`_" -msgstr "`Combinations SQL`_" +msgid ":doc:`pgr_edmondsKarp`" +msgstr ":doc:`pgr_edmondsKarp`" -msgid "`Combinations SQL`_ as described below" -msgstr "`Combinations SQL`_ 如下所述" +msgid ":doc:`pgr_boykovKolmogorov`" +msgstr ":doc:`pgr_boykovKolmogorov`" -msgid "**start vid**" -msgstr "**start vid**" +msgid "``reverse_capacity``" +msgstr "``reverse_capacity``" -msgid "Identifier of the starting vertex of the path." -msgstr "路径起始顶点的标识符。" +msgid "Capacity-Cost edges" +msgstr "容量-成本边" -msgid "**end vid**" -msgstr "**end vid**" +msgid ":doc:`pgr_maxFlowMinCost`" +msgstr ":doc:`pgr_maxFlowMinCost`" -msgid "Identifier of the ending vertex of the path." -msgstr "路径结束顶点的标识符。" +msgid ":doc:`pgr_maxFlowMinCost_Cost`" +msgstr ":doc:`pgr_maxFlowMinCost_Cost`" -msgid "**end vids**" -msgstr "**end vids**" +msgid "Capacity of the edge (``source``, ``target``)" +msgstr "边 (``source``, ``target``)的容量" -msgid "Array of identifiers of ending vertices." -msgstr "结束顶点的标识符数组。" +msgid "Capacity of the edge (``target``, ``source``)" +msgstr "边 (``target``, ``source``)的容量" -msgid "Combinations SQL" -msgstr "分量 SQL" +msgid "Weight of the edge (``source``, ``target``) if it exist" +msgstr "边 (``source``, ``target``)的权重（如果存在）" -msgid "Identifier of the departure vertex." -msgstr "出发顶点的标识符。" +msgid "Weight of the edge (``target``, ``source``) if it exist" +msgstr "边(``target``, ``source``)的权重（如果存在）" -msgid "Identifier of the arrival vertex." -msgstr "到达顶点的标识符。" +msgid "Cost edges" +msgstr "成本边" -msgid "The problem definition (Advanced documentation)" -msgstr "问题定义（高级文档）" +msgid ":doc:`pgr_edgeDisjointPaths`" +msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "Given the following query:" -msgstr "给出以下查询：" +msgid "Used in" +msgstr "用于" -msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" +msgid "**seq**" +msgstr "**seq**" -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" -msgstr "" -"其中 :math:`sql =\\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" +msgid "``INT``" +msgstr "``INT``" -msgid "and" -msgstr "和" +msgid "**edge**" +msgstr "**edge**" -msgid ":math:`source = \\bigcup source_i`," -msgstr ":math:`source = \\bigcup source_i`," +msgid "Identifier of the edge in the original query (edges_sql)." +msgstr "原始查询中边的标识符 (edges_sql)。" -msgid ":math:`target = \\bigcup target_i`," -msgstr ":math:`target = \\bigcup target_i`," +msgid "**start_vid**" +msgstr "**start_vid**" -msgid "The graphs are defined as follows:" -msgstr "图定义如下：" +msgid "**end_vid**" +msgstr "**end_vid**" -msgid "Directed graph" -msgstr "有向图" +msgid "**flow**" +msgstr "**flow**" -msgid "The weighted directed graph, :math:`G_d(V,E)`, is definied by:" -msgstr "加权有向图， :math:`G_d(V,E)` 的定义如下：" - -msgid "the set of vertices :math:`V`" -msgstr "顶点集 :math:`V`" - -msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" -msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" - -msgid "the set of edges :math:`E`" -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 " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " -"\\neq \\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " -"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " -"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " -"\\neq \\varnothing \\\\ \\end{cases}`" - -msgid "Undirected graph" -msgstr "无向图" - -msgid "The weighted undirected graph, :math:`G_u(V,E)`, is definied by:" -msgstr "加权无向图， :math:`G_u(V,E)` 的定义如下：" - -msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" -msgstr "" -":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" - -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " -"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " -"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " -"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " -"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " -"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " -"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " -"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " -"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" - -msgid "The problem" -msgstr "问题" - -msgid "Given:" -msgstr "给定：" - -msgid ":math:`start_{vid} \\in V` a starting vertex" -msgstr ":math:`start_{vid} \\in V` a starting vertex" - -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}`" -msgstr "" -":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = " -"true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" - -msgid "Then:" -msgstr "然后：" - -msgid "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" -msgstr "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" - -msgid "where:" -msgstr "其中：" - -msgid ":math:`path\\_seq_i = i`" -msgstr ":math:`path\\_seq_i = i`" - -msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`" -msgstr ":math:`path\\_seq_{| \\pi |} = | \\pi |`" - -msgid ":math:`node_i \\in V`" -msgstr ":math:`node_i \\in V`" - -msgid ":math:`node_1 = start_{vid}`" -msgstr ":math:`node_1 = start_{vid}`" - -msgid ":math:`node_{| \\pi |} = end_{vid}`" -msgstr ":math:`node_{| \\pi |} = end_{vid}`" - -msgid "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" -msgstr "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" - -msgid "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " -"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" -"\\ \\end{cases}`" -msgstr "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " -"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" -"\\ \\end{cases}`" - -msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" -msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`" - -msgid "" -":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" -"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " -"\\text{when } i \\neq 1 \\\\ \\end{cases}`" -msgstr "" -":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" -"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " -"\\text{when } i \\neq 1 \\\\ \\end{cases}`" - -msgid "" -"In other words: The algorithm returns a the shortest path between :math:" -"`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of " -"nodes and of edges," -msgstr "" -"换句话说：如果 :math:`start_{vid}` 和 :math:`end_{vid}` 之间存在最短路径，算" -"法会根据节点和边的序列返回该路径、" - -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` 的路径中的相对位置。" - -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}` 到节点的成本。" - -msgid "If there is no path, the resulting set is empty." -msgstr "如果没有路径，则结果集为空。" - -msgid "Driving Distance - Category" -msgstr "驾驶距离 - 类别" - -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" -msgstr ":doc:`pgr_drivingDistance` - 基于 Dijkstra 算法的行驶距离" - -msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" -msgstr ":doc:`pgr_primDD` - 基于Prim算法的行驶距离" - -msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" -msgstr ":doc:`pgr_kruskalDD` - 基于Kruskal算法的行驶距离" - -msgid "Post pocessing" -msgstr "后期处理" - -msgid ":doc:`pgr_alphaShape` - Alpha shape computation" -msgstr ":doc:`pgr_alphaShape` - Alpha 形状计算" - -msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" -msgstr ":doc:`pgr_withPointsDD` - 基于 pgr_withPoints 的行驶距离" - -msgid "Calculate nodes that are within a distance." -msgstr "计算一定距离内的节点。" - -msgid "" -"Extracts all the nodes that have costs less than or equal to the value " -"distance." -msgstr "提取成本小于或等于距离值的所有节点。" - -msgid "The edges extracted will conform to the corresponding spanning tree." -msgstr "提取的边将符合相应的生成树。" - -msgid "Edge :math:`(u, v)` will not be included when:" -msgstr "在以下情况下，边 :math:`(u, v)` 将不包括在内：" - -msgid "The distance from the **root** to :math:`u` > limit distance." -msgstr "从 **root** 到 :math:`u` 的距离>限制距离。" - -msgid "The distance from the **root** to :math:`v` > limit distance." -msgstr "从 **root** 到 :math:`v` 的距离>限制距离。" - -msgid "" -"No new nodes are created on the graph, so when is within the limit and is " -"not within the limit, the edge is not included." -msgstr "图上不会创建新的节点，因此当 位于限制内和不在限制内时，不包含边。" - -msgid "Edges SQL as described below." -msgstr "Edges SQL如下所述。" - -msgid "**Root vid**" -msgstr "**Root vid**" - -msgid "**Root vids**" -msgstr "**Root vids**" - -msgid "``ARRAY[ANY-INTEGER]``" -msgstr "``ARRAY[ANY-INTEGER]``" - -msgid "**distance**" -msgstr "**distance**" - -msgid "Upper limit for the inclusion of a node in the result." -msgstr "结果中包含节点的上限。" - -msgid "Returns set of |result-spantree|" -msgstr "Returns set of |result-spantree|" - -msgid ":math:`depth-1` is the depth of ``pred``" -msgstr ":math:`depth-1` is the depth of ``pred``" - -msgid "``pred``" -msgstr "``pred``" - -msgid "Predecessor of ``node``." -msgstr "``node`` 的前驱。" - -msgid "When ``node`` = ``start_vid`` then has the value ``node``." -msgstr "当 `node` 等于 `start_vid` 时，它的值就是 `node`。" - -msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." -msgstr "从 ``pred`` 到达``node``所使用的 ``edge`` 的标识符。" - -msgid "Experimental Functions" -msgstr "实验函数" - -msgid "Families" -msgstr "族" - -msgid ":doc:`flow-family`" -msgstr ":doc:`flow-family`" - -msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." -msgstr ":doc:`pgr_maxFlowMinCost` - 边缘上的流量和成本详细信息。" - -msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." -msgstr ":doc:`pgr_maxFlowMinCost_Cost` -仅最小成本计算。" - -msgid ":doc:`chinesePostmanProblem-family`" -msgstr ":doc:`chinesePostmanProblem-family`" - -msgid ":doc:`coloring-family`" -msgstr ":doc:`coloring-family`" - -msgid ":doc:`transformation-family`" -msgstr ":doc:`transformation-family`" - -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." -msgstr "" -":doc:`pgr_lineGraphFull` - 用于从输入图中的每个顶点生成线图的变换算法。" - -msgid ":doc:`traversal-family`" -msgstr ":doc:`traversal-family`" - -msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." -msgstr ":doc:`pgr_breadthFirstSearch` - 图的广度优先搜索遍历。" - -msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." -msgstr ":doc:`pgr_binaryBreadthFirstSearch` -图的广度优先搜索遍历。" - -msgid ":doc:`components-family`" -msgstr ":doc:`components-family`" - -msgid ":doc:`ordering-family`" -msgstr ":doc:`ordering-family`" - -msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " -"an undirected graph." -msgstr ":doc:`pgr_cuthillMckeeOrdering` -返回无向图的反向 Cuthill-McKee 排序。" - -msgid ":doc:`metrics-family`" -msgstr ":doc:`metrics-family`" - -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" -msgstr "" - -msgid ":doc:`TRSP-family`" -msgstr ":doc:`TRSP-family`" - -msgid "categories" -msgstr "类别" - -msgid ":doc:`VRP-category`" -msgstr ":doc:`VRP-category`" - -msgid "Unclassified" -msgstr "未分类" - -msgid ":doc:`pgr_bellmanFord`" -msgstr ":doc:`pgr_bellmanFord`" - -msgid ":doc:`pgr_dagShortestPath`" -msgstr ":doc:`pgr_dagShortestPath`" - -msgid ":doc:`pgr_edwardMoore`" -msgstr ":doc:`pgr_edwardMoore`" - -msgid ":doc:`pgr_isPlanar`" -msgstr ":doc:`pgr_isPlanar`" - -msgid ":doc:`pgr_stoerWagner`" -msgstr ":doc:`pgr_stoerWagner`" - -msgid ":doc:`pgr_topologicalSort`" -msgstr ":doc:`pgr_topologicalSort`" - -msgid ":doc:`pgr_transitiveClosure`" -msgstr ":doc:`pgr_transitiveClosure`" - -msgid ":doc:`pgr_lengauerTarjanDominatorTree`" -msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" - -msgid ":doc:`pgr_hawickCircuits`" -msgstr ":doc:`pgr_hawickCircuits`" - -msgid "Flow - Family of functions" -msgstr "Flow - 函数族" - -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." -msgstr ":doc:`pgr_maxFlow` - 仅使用 Push 和 Relabel 算法进行最大流量计算。" - -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." -msgstr ":doc:`pgr_boykovKolmogorov` - Boykov 和 Kolmogorov 的边流动细节。" - -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." -msgstr ":doc:`pgr_edmondsKarp` - 带有边流量详细信息的 Edmonds 和 Karp 算法。" - -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." -msgstr ":doc:`pgr_pushRelabel` - 推送和重新标记算法以及边流量的详细信息。" - -msgid "Applications" -msgstr "应用" - -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." -msgstr ":doc:`pgr_edgeDisjointPaths` - 计算两组顶点之间的边不相交路径。" - -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." -msgstr ":doc:`pgr_maxCardinalityMatch` - 计算图中的最大基数匹配。" - -msgid "Flow Functions General Information" -msgstr "流函数一般信息" - -msgid "The graph is **directed**." -msgstr "该图是 **有向** 的。" - -msgid "Process is done only on edges with positive capacities." -msgstr "仅在具有正容量的边缘上进行处理。" - -msgid "" -"When the maximum flow is 0 then there is no flow and **EMPTY SET** is " -"returned." -msgstr "当最大流量为0时则没有流量并返回 **EMPTY SET** 。" - -#, fuzzy -msgid "There is no flow when source has the same vaule as target." -msgstr "当 source与 target相同时，就没有流量。" - -#, fuzzy -msgid "Any duplicated values in source or target are ignored." -msgstr "source或target 中的任何重复值都将被忽略。" - -msgid "Calculates the flow/residual capacity for each edge. In the output" -msgstr "计算每条边的流量/剩余容量。 在输出中" - -msgid "Edges with zero flow are omitted." -msgstr "流量为零的边被忽略。" - -msgid "Creates" -msgstr "" - -msgid "a **super source** and edges from it to all the sources," -msgstr "" - -msgid "a **super target** and edges from it to all the targetss." -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:" -msgstr "" -"当使用相同参数执行时，通过图表的最大流量保证是 :doc:`pgr_maxFlow " -"` 返回的值，并且可以计算：" - -msgid "By aggregation of the outgoing flow from the sources" -msgstr "通过聚合来自源的传出流量" - -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." -msgstr "" -":doc:`pgr_maxFlow` 是最大流量，并且该最大值保证在函数 :doc:" -"`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, 上相" -"同，但通过每条边的实际流量可能会有所不同。" - -msgid "Capacity edges" -msgstr "容量边缘" - -msgid ":doc:`pgr_pushRelabel`" -msgstr ":doc:`pgr_pushRelabel`" - -msgid ":doc:`pgr_edmondsKarp`" -msgstr ":doc:`pgr_edmondsKarp`" - -msgid ":doc:`pgr_boykovKolmogorov`" -msgstr ":doc:`pgr_boykovKolmogorov`" - -msgid "``reverse_capacity``" -msgstr "``reverse_capacity``" - -msgid "Capacity-Cost edges" -msgstr "容量-成本边" - -msgid ":doc:`pgr_maxFlowMinCost`" -msgstr ":doc:`pgr_maxFlowMinCost`" - -msgid ":doc:`pgr_maxFlowMinCost_Cost`" -msgstr ":doc:`pgr_maxFlowMinCost_Cost`" - -msgid "Capacity of the edge (``source``, ``target``)" -msgstr "边 (``source``, ``target``)的容量" - -msgid "Capacity of the edge (``target``, ``source``)" -msgstr "边 (``target``, ``source``)的容量" - -msgid "Weight of the edge (``source``, ``target``) if it exist" -msgstr "边 (``source``, ``target``)的权重（如果存在）" - -msgid "Weight of the edge (``target``, ``source``) if it exist" -msgstr "边(``target``, ``source``)的权重（如果存在）" - -msgid "Cost edges" -msgstr "成本边" - -msgid ":doc:`pgr_edgeDisjointPaths`" -msgstr ":doc:`pgr_edgeDisjointPaths`" - -msgid "Used in" -msgstr "用于" - -msgid "**seq**" -msgstr "**seq**" - -msgid "``INT``" -msgstr "``INT``" - -msgid "**edge**" -msgstr "**edge**" - -msgid "Identifier of the edge in the original query (edges_sql)." -msgstr "原始查询中边的标识符 (edges_sql)。" - -msgid "**start_vid**" -msgstr "**start_vid**" - -msgid "**end_vid**" -msgstr "**end_vid**" - -msgid "**flow**" -msgstr "**flow**" - -msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)." -msgstr "沿 (``start_vid``, ``end_vid``)方向流经边缘。" +msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)." +msgstr "沿 (``start_vid``, ``end_vid``)方向流经边缘。" msgid "**residual_capacity**" msgstr "**residual_capacity**" @@ -4472,256 +3950,608 @@ msgstr ":doc:`pgr_kruskal`" msgid ":doc:`pgr_kruskalDD`" msgstr ":doc:`pgr_kruskalDD`" -msgid ":doc:`prim-family`" -msgstr ":doc:`prim-family`" +msgid "" +":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " +"incident edges to the vertex." +msgstr ":doc:`pgr_degree` - 返回顶点集及其关联边数统计。" + +msgid ":doc:`prim-family`" +msgstr ":doc:`prim-family`" + +msgid ":doc:`pgr_prim`" +msgstr ":doc:`pgr_prim`" + +msgid ":doc:`pgr_primDD`" +msgstr ":doc:`pgr_primDD`" + +msgid ":doc:`reference`" +msgstr ":doc:`reference`" + +msgid ":doc:`pgr_version`" +msgstr ":doc:`pgr_version`" + +msgid ":doc:`pgr_full_version`" +msgstr ":doc:`pgr_full_version`" + +msgid ":doc:`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." +msgstr "" +"以下函数直接修改数据库，因此用户必须具有管理员授予的特殊权限才能使用它们。" + +msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." +msgstr ":doc:`pgr_createTopology` - 根据几何形状创建拓扑。" + +msgid "" +":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " +"source and target information." +msgstr ":doc:`pgr_createVerticesTable` - 根据源和目标信息重建顶点表。" + +msgid "" +":doc:`pgr_analyzeGraph` - to analyze the edges and vertices of the edge " +"table." +msgstr ":doc:`pgr_analyzeGraph` - 分析边表的边和顶点。" + +msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." +msgstr ":doc:`pgr_analyzeOneWay` - 分析边的方向性。" + +msgid ":doc:`pgr_nodeNetwork` - to create nodes to a not noded edge table." +msgstr ":doc:`pgr_nodeNetwork` - 为无节点边表创建节点。" + +msgid "" +":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " +"table information." +msgstr ":doc:`pgr_extractVertices` - 根据边表信息提取顶点信息。" + +msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" +msgstr ":doc:`pgr_trsp` - 转弯限制最短路径 (TRSP)" + +msgid "Utilities family" +msgstr "实用工具函数集" + +msgid ":doc:`pgr_findCloseEdges`" +msgstr ":doc:`pgr_findCloseEdges`" + +msgid "Functions by categories" +msgstr "按类别划分的函数" + +msgid ":doc:`cost-category`" +msgstr ":doc:`cost-category`" + +msgid ":doc:`costMatrix-category`" +msgstr ":doc:`costMatrix-category`" + +msgid ":doc:`drivingDistance-category`" +msgstr ":doc:`drivingDistance-category`" + +msgid ":doc:`KSP-category`" +msgstr ":doc:`KSP-category`" + +msgid ":doc:`spanningTree-category`" +msgstr ":doc:`spanningTree-category`" + +msgid ":doc:`BFS-category`" +msgstr ":doc:`BFS-category`" + +msgid ":doc:`DFS-category`" +msgstr ":doc:`DFS-category`" + +msgid "Available Functions but not official pgRouting functions" +msgstr "可用函数，但不是官方 pgRouting 函数" + +msgid ":doc:`proposed`" +msgstr ":doc:`proposed`" + +msgid ":doc:`experimental`" +msgstr ":doc:`experimental`" + +msgid ":doc:`release_notes`" +msgstr ":doc:`release_notes`" + +msgid "pgRouting 4.0.0 Release Notes" +msgstr "pgRouting 4.0.0 发布说明" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.0.0 `__" +msgstr "" +"查看本版本已关闭的所有议题和拉取请求,请访问：`GitHub 4.0.0版本里程碑关闭列表 " +"`__" + +msgid "Functions promoted to official" +msgstr "正式版功能函数" + +msgid "pgr_trsp" +msgstr "pgr_trsp" + +msgid "pgr_trspVia" +msgstr "pgr_trspVia" + +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" + +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" + +msgid "pgr_withPoints" +msgstr "pgr_withPoints" + +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" + +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "Signatures promoted to official" +msgstr "正式版函数签名" + +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(组合)" + +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(组合)" + +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(组合)" + +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(组合)" + +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(组合)" + +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(组合)" + +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(组合)" + +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(组合)" + +msgid "pgr_KSP(All signatures)" +msgstr "pgr_KSP（所有函数签名版本）" + +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov (组合)" + +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(组合)" + +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(组合)" + +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(组合)" + +msgid "code enhancements:" +msgstr "代码改进：" + +msgid "Removal of unused C/C++ code" +msgstr "移除未使用的C/C++代码" + +msgid "Removal of SQL deprecated functions" +msgstr "移除已弃用的SQL函数" + +#, fuzzy +msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" + +msgid "" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" + +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" + +msgid "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" + +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" + +msgid "Removal of SQL deprecated internal functions" +msgstr "移除已弃用的SQL内部函数" + +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" + +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" + +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" + +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" + +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "_pgr_dijkstra(text,text,boolean,boolean,boolean)" + +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" + +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_kruskal(text,anyarray,text,bigint,double precision)" + +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_prim(text,anyarray,text,bigint,double precision)" + +msgid "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" + +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" + +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" + +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "_pgr_trsp(text,text,bigint,bigint,boolean)" + +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" + +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" + +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_v4trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_v4trsp(text,text,text,boolean)" +msgstr "_v4trsp(text,text,text,boolean)" + +msgid "Deprecation of internal C/C++ functions" +msgstr "弃用内部C/C++函数" + +#, fuzzy +msgid "Internal C/C++ functions in legacy" +msgstr "已废弃的函数" + +msgid "All releases" +msgstr "所有版本" + +msgid "Kruskal - Family of functions" +msgstr "Kruskal - 函数族" -msgid ":doc:`pgr_prim`" -msgstr ":doc:`pgr_prim`" +msgid "" +"Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each " +"cycle finds and adds the edge of the least possible weight that connects any " +"two trees in the forest." +msgstr "" +"克鲁斯卡尔算法是一种贪婪的最小生成树算法，它在每个循环中查找并添加连接森林中" +"任意两棵树的最小可能权重的边。" -msgid ":doc:`pgr_primDD`" -msgstr ":doc:`pgr_primDD`" +msgid "**The main Characteristics are:**" +msgstr "**主要特点是：**" -msgid ":doc:`reference`" -msgstr ":doc:`reference`" +msgid "The total weight of all the edges in the tree or forest is minimized." +msgstr "树或森林中所有边的总权重最小化。" -msgid ":doc:`pgr_version`" -msgstr ":doc:`pgr_version`" +msgid "Kruskal's running time: :math:`O(E * log E)`" +msgstr "克鲁斯卡尔的运行时间： :math:`O(E * log E)`" -msgid ":doc:`pgr_full_version`" -msgstr ":doc:`pgr_full_version`" +msgid "Metrics - Family of functions" +msgstr "度量 - 功能系列" -msgid ":doc:`topology-functions`" -msgstr ":doc:`topology-functions`" +msgid "Migration guide" +msgstr "迁移指南" msgid "" -"The following functions modify the database directly therefore the user must " -"have special permissions given by the administrators to use them." -msgstr "" -"以下函数直接修改数据库，因此用户必须具有管理员授予的特殊权限才能使用它们。" +"Several functions are having changes on the signatures, and/or have been " +"replaced by new functions." +msgstr "多个函数的签名发生了变化，和/或已被新函数取代。" -msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." -msgstr ":doc:`pgr_createTopology` - 根据几何形状创建拓扑。" +msgid "Results can be different because of the changes." +msgstr "结果可能会因变化而不同。" -msgid "" -":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " -"source and target information." -msgstr ":doc:`pgr_createVerticesTable` - 根据源和目标信息重建顶点表。" +#, fuzzy +msgid "All deprecated functions will be removed on next major version 4.0.0" +msgstr "所有已弃用的函数将在下一个主要版本 4.0.0 中被移除" -msgid "" -":doc:`pgr_analyzeGraph` - to analyze the edges and vertices of the edge " -"table." -msgstr ":doc:`pgr_analyzeGraph` - 分析边表的边和顶点。" +#, fuzzy +msgid "Migration of ``pgr_alphaShape``" +msgstr "``pgr_aStar`` 迁移" -msgid ":doc:`pgr_analyzeOneWay` - to analyze directionality of the edges." -msgstr ":doc:`pgr_analyzeOneWay` - 分析边的方向性。" +#, fuzzy +msgid "" +"Starting from `v3.8.0 `__" +msgstr "开始从 `v3.6.0 `__" -msgid ":doc:`pgr_nodeNetwork` - to create nodes to a not noded edge table." -msgstr ":doc:`pgr_nodeNetwork` - 为无节点边表创建节点。" +msgid "**Before Deprecation:** The following was calculated:" +msgstr "" -msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)" -msgstr ":doc:`pgr_trsp` - 转弯限制最短路径 (TRSP)" +msgid "An alphaShape was calculated" +msgstr "" -msgid "Functions by categories" -msgstr "按类别划分的函数" +#, fuzzy +msgid "**After Deprecation:**" +msgstr "迁移后" -msgid ":doc:`cost-category`" -msgstr ":doc:`cost-category`" +msgid "PostGIS has two ways of generating alphaShape." +msgstr "" -msgid ":doc:`costMatrix-category`" -msgstr ":doc:`costMatrix-category`" +msgid "If you have SFCGAL, which you can install using" +msgstr "" -msgid ":doc:`drivingDistance-category`" -msgstr ":doc:`drivingDistance-category`" +msgid "" +"Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgstr "" -msgid ":doc:`KSP-category`" -msgstr ":doc:`KSP-category`" +msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" +msgstr "" -msgid ":doc:`spanningTree-family`" -msgstr ":doc:`spanningTree-family`" +msgid "" +"Other PostGIS options are * `ST_ConvexHull `__ * `ST_ConcaveHull `__" +msgstr "" -msgid ":doc:`BFS-category`" -msgstr ":doc:`BFS-category`" +#, fuzzy +msgid "Migration of ``pgr_createTopology``" +msgstr "迁移 ``pgr_trspViaVertices``" -msgid ":doc:`DFS-category`" -msgstr ":doc:`DFS-category`" +msgid "A table with `_vertices_pgr` was created." +msgstr "" -msgid "Available Functions but not official pgRouting functions" -msgstr "可用函数，但不是官方 pgRouting 函数" +msgid "" +"**After Deprecation:** The user is responsible to create the complete " +"topology." +msgstr "" -msgid ":doc:`proposed`" -msgstr ":doc:`proposed`" +msgid "Build a routing topology" +msgstr "构建路由拓扑" -msgid ":doc:`experimental`" -msgstr ":doc:`experimental`" +msgid "" +"The basic information to use the majority of the pgRouting functions ``id, " +"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " +"routing topology." +msgstr "" +"使用大多数 pgRouting 函数的基本信息``id, source, target, cost, " +"[reverse_cost]`` 在 pgRouting 中被称为路由拓扑。" -msgid ":doc:`release_notes`" -msgstr ":doc:`release_notes`" +msgid "" +"``reverse_cost`` is optional but strongly recommended to have in order to " +"reduce the size of the database due to the size of the geometry columns. " +"Having said that, in this documentation ``reverse_cost`` is used in this " +"documentation." +msgstr "" +"``reverse_cost`` 是可选的，但强烈建议使用，以便由于几何列的大小而减小数据库的" +"大小。 话虽如此，在本文档中使用了 ``reverse_cost``。" -msgid "pgRouting 3.7.0 Release Notes" -msgstr "pgRouting 3.7.0 发布说明" +msgid "" +"When the data comes with geometries and there is no routing topology, then " +"this step is needed." +msgstr "当数据带有几何图形并且没有路由拓扑时，则需要此步骤。" msgid "" -"To see all issues & pull requests closed by this release see the `Git closed " -"milestone for 3.7.0 `__" +"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 "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.7.0 `__ 的 Git 关闭里程碑" +"几何图的所有开始和结束顶点都需要一个标识符，该标识符将存储在数据表的" +"``source``列和``target``列中。 同样，``cost`` 和 ``reverse_cost`` 需要具有在" +"两个方向上遍历边的值。" -msgid "Support" -msgstr "支持" +msgid "" +"If the columns do not exist they need to be added to the table in question. " +"(see `ALTER TABLE `__)" +msgstr "" +"如果这些列不存在，则需要将它们添加到相关表中。 （参见`ALTER TABLE `__ ）" -#, fuzzy msgid "" -"`#2656 `__ Stop support of " -"PostgreSQL12 on pgrouting v3.7" +"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 "" -"`#2607 `__ 在 C++ 上读取 " -"postgresql 数据" +"函数 :doc:`pgr_extractVertices` 用于根据边标识符和图边的几何形状创建顶点表。" -#, fuzzy -msgid "Stopping support of PostgreSQL 12" -msgstr "从 PostgreSQL 12 开始：：" +msgid "" +"Finally using the data stored on the vertices tables the ``source`` and " +"``target`` are filled up." +msgstr "最后使用存储在顶点表上的数据填充 ``source`` 和``target``。" #, fuzzy -msgid "CI does not test for PostgreSQL 12" -msgstr "适用于 postgreSQL 10" +msgid "Migration of ``pgr_createVerticesTable``" +msgstr "迁移 ``pgr_trspViaVertices``" -msgid "New experimental functions" -msgstr "新的实验函数" +msgid "" +"**After Deprecation:** The user is responsible to create the vertices table, " +"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "" #, fuzzy -msgid "Metrics" -msgstr "限制" +msgid "Migration of ``pgr_analyzeOneWay``" +msgstr "``pgr_aStar`` 迁移" -msgid "pgr_betweennessCentrality" +msgid "Number of potential problems in directionality" msgstr "" -msgid "Official functions changes" -msgstr "官方功能变更" +msgid "WHERE" +msgstr "" -msgid "" -"`#2605 `__ Standarize " -"spanning tree functions output" +msgid "Directionality problems were calculated based on codes." msgstr "" -msgid "Functions:" -msgstr "新函数:" +#, fuzzy +msgid "Dead ends." +msgstr "死端" -msgid "``pgr_kruskalDD``" -msgstr "``pgr_kruskalDD``" +msgid "" +"A routing problem can arise when from a vertex there is only a way on or a " +"way out but not both:" +msgstr "" -msgid "``pgr_kruskalDFS``" -msgstr "``pgr_kruskalDFS``" +msgid "" +"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " +"information and determine if the adjacent edge is one way or not." +msgstr "" -msgid "``pgr_kruskalBFS``" -msgstr "``pgr_kruskalBFS``" +msgid "In this example :doc:`pgr_extractVertices` has already been applied." +msgstr "" -msgid "``pgr_primDD``" -msgstr "``pgr_primDD``" +#, fuzzy +msgid "Bridges." +msgstr "pgr_bridges" -msgid "``pgr_primDFS``" -msgstr "``pgr_primDFS``" +#, fuzzy +msgid "" +"Another routing problem can arise when there is an edge of an undirected " +"graph whose deletion increases its number of connected components, and the " +"bridge is only one way." +msgstr "" +"桥是指一个无向图中的边，如果删除它会增加该图的连通分量数量。此实现仅适用于无" +"向图。" -msgid "``pgr_primBFS``" -msgstr "``pgr_primBFS``" +msgid "To determine if the bridges are or not one way." +msgstr "" -msgid "Standarizing output columns to |result-spantree|" -msgstr "将输出列标准化为 |result-spantree|" +#, fuzzy +msgid "Migration of ``pgr_analyzeGraph``" +msgstr "``pgr_aStar`` 迁移" #, fuzzy -msgid "Added ``pred`` result columns." -msgstr "添加了 ``depth`` 和``pred`` 结果列。" +msgid "Number of isolated segments." +msgstr "无孤立段" -msgid "Experimental promoted to proposed." -msgstr "实验提升为拟议。" +#, fuzzy +msgid "Number of dead ends." +msgstr "所需路径的数量。" -msgid "" -"`#2635 `__ pgr_LineGraph " -"ignores directed flag and use negative values for identifiers." +msgid "Number of potential gaps found near dead ends." msgstr "" -msgid "``pgr_lineGraph``" -msgstr "``pgr_lineGraph``" +#, fuzzy +msgid "Number of intersections. (between 2 edges)" +msgstr "订单中的单位数量" -msgid "Promoted to **proposed** signature." -msgstr "晋升为 **拟议** 签名。" +#, fuzzy +msgid "Graph component" +msgstr "检查组件" -msgid "Works for directed and undirected graphs." -msgstr "适用于有向和无向图。" +#, fuzzy +msgid "A connected subgraph that is not part of any larger connected subgraph." +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" -msgid "Code enhancement" -msgstr "代码改进" +#, fuzzy +msgid "Isolated segment" +msgstr "孤立的片段" -msgid "" -"`#2599 `__ Driving " -"distance cleanup" +msgid "A graph component with only one segment." msgstr "" -"`#2599 `__ 行车距离清理" -msgid "" -"`#2607 `__ Read postgresql " -"data on C++" +msgid "Dead ends" +msgstr "死端" + +msgid "A vertex that participates in only one edge." msgstr "" -"`#2607 `__ 在 C++ 上读取 " -"postgresql 数据" -msgid "" -"`#2614 `__ Clang tidy does " -"not work" +msgid "gaps" msgstr "" -"`#2614 `__ Clang tidy 不工" -"作" -msgid "All releases" -msgstr "所有版本" +#, fuzzy +msgid "Space between two geometries." +msgstr "几何图形之间的最大距离" + +#, fuzzy +msgid "Intersection" +msgstr "交叉口" + +msgid "Is a topological relationship between two geometries." +msgstr "" -msgid "Kruskal - Family of functions" -msgstr "Kruskal - 函数族" +#, fuzzy +msgid "Migration." +msgstr "迁移" -msgid "Boost Graph Inside" -msgstr "Boost 图内部" +#, fuzzy +msgid "Components." +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." +"Instead of counting only isolated segments, determine all the components of " +"the graph." msgstr "" -"克鲁斯卡尔算法是一种贪婪的最小生成树算法，它在每个循环中查找并添加连接森林中" -"任意两棵树的最小可能权重的边。" -msgid "**The main Characteristics are:**" -msgstr "**主要特点是：**" +msgid "Depending of the final application requirements use:" +msgstr "" -msgid "The total weight of all the edges in the tree or forest is minimized." -msgstr "树或森林中所有边的总权重最小化。" +#, fuzzy +msgid ":doc:`pgr_connectedComponents`" +msgstr "使用 :doc:`pgr_connectedComponents`" -msgid "Kruskal's running time: :math:`O(E * log E)`" -msgstr "克鲁斯卡尔的运行时间： :math:`O(E * log E)`" +#, fuzzy +msgid ":doc:`pgr_strongComponents`" +msgstr "``pgr_strongComponents``" -msgid "Metrics - Family of functions" -msgstr "" +#, fuzzy +msgid ":doc:`pgr_biconnectedComponents`" +msgstr "``pgr_biconnectedComponents``" -msgid "Migration guide" -msgstr "迁移指南" +#, fuzzy +msgid "For example:" +msgstr "示例" msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." -msgstr "多个函数的签名发生了变化，和/或已被新函数取代。" +"Instead of counting the dead ends, determine all the dead ends of the graph " +"using :doc:`pgr_degree`." +msgstr "" -msgid "Results can be different because of the changes." -msgstr "结果可能会因变化而不同。" +msgid "Potential gaps near dead ends." +msgstr "" -msgid "All deprecated functions will be removed on next mayor version 4.0.0" -msgstr "所有已弃用的函数将在下一个主要版本 4.0.0 中被移除" +msgid "" +"Instead of counting potential gaps between geometries, determine the " +"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgstr "" + +#, fuzzy +msgid "Topological relationships." +msgstr "对图进行拓扑排序" -msgid "Migration of functions" -msgstr "函数迁移" +msgid "" +"Instead of counting intersections, determine topological relationships " +"between geometries." +msgstr "" -msgid "Migrating functions" -msgstr "迁移函数" +msgid "" +"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "" msgid "Migration of ``pgr_aStar``" msgstr "``pgr_aStar`` 迁移" @@ -4766,9 +4596,8 @@ msgstr "``pgr_aStar`` (`多对一`)没有 ``end_vid``。" msgid "Migration" msgstr "迁移" -#, fuzzy msgid "Be aware of the existence of the additional columns." -msgstr "请注意附加列的存在。" +msgstr "注意附加栏的存在。" msgid "In ``pgr_aStar`` (`One to One`)" msgstr "在 ``pgr_aStar`` (`一对一`)中" @@ -4885,7 +4714,8 @@ msgstr "在 ``pgr_dijkstra`` (`多对一`)中" msgid "If needed add the new columns, for example:" msgstr "如果需要，过滤掉添加的列，例如：" -msgid "Migration of ``pgr_drivingdistance``" +#, fuzzy +msgid "Migration of ``pgr_drivingDistance``" msgstr "迁移 ``pgr_drivingdistance``" msgid "" @@ -4907,11 +4737,13 @@ msgstr "到" msgid "|result-spantree|" msgstr "|result-spantree|" -msgid "``pgr_drivingdistance`` (Single vertex)" -msgstr "``pgr_drivingdistance`` (单个顶点)" +#, fuzzy +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance （单顶点）" -msgid "``pgr_drivingdistance`` (Multiple vertices)" -msgstr "``pgr_drivingdistance`` (多个顶点)" +#, fuzzy +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance （多顶点）" msgid "Output columns were |result-dij-dd|" msgstr "输出列是 |result-dij-dd|" @@ -4925,9 +4757,8 @@ msgstr "有 ``from_v`` 而不是 ``start_vid`` 结果列。" msgid "does not have ``depth`` result column." msgstr "没有 ``depth`` 结果列。" -#, fuzzy msgid "Be aware of the existence and name change of the result columns." -msgstr "请注意结果列的存在和名称更改。" +msgstr "注意结果列的存在和名称变化。" msgid "" "Using `this `__ :" "doc:`pgr_kruskalDD`, :doc:`pgr_kruskalBFS` and :doc:`pgr_kruskalDFS` result " "columns are being standardized." msgstr "" +"Starting from `v3.7.0 `__ :" +"doc:`pgr_kruskalDD`, :doc:`pgr_kruskalBFS` and :doc:`pgr_kruskalDFS` result " +"columns are being standardized." msgid "|result-bfs|" msgstr "|result-bfs|" +msgid "``pgr_kruskalDD``" +msgstr "``pgr_kruskalDD``" + msgid "Single vertex" msgstr "单顶点" msgid "Multiple vertices" msgstr "多个顶点" +msgid "``pgr_kruskalDFS``" +msgstr "``pgr_kruskalDFS``" + +msgid "``pgr_kruskalBFS``" +msgstr "``pgr_kruskalBFS``" + msgid "Output columns were |result-bfs|" -msgstr "" +msgstr "输出列为 |result-bfs|" -#, fuzzy msgid "Single vertex and Multiple vertices" -msgstr "多个顶点" +msgstr "单顶点和多顶点" msgid "Do not have ``pred`` result column." -msgstr "" +msgstr "没有 ``pred`` 结果列。" -#, fuzzy msgid "Be aware of the existence of `pred` result columns." -msgstr "注意附加结果列的存在。" +msgstr "注意`pred`结果列的存在。" -#, fuzzy msgid "If needed filter out the added columns" -msgstr "如果需要，过滤掉添加的列，例如" +msgstr "如果需要，可过滤掉添加的列" -#, fuzzy msgid "Kruskal single vertex" -msgstr "单顶点" +msgstr "Kruskal 单顶点" msgid "" "Using ``pgr_KruskalDD`` as example. Migration is similar to al the affected " "functions." -msgstr "" +msgstr "以 ``pgr_KruskalDD`` 为例。迁移与所有受影响的函数类似。" -#, fuzzy msgid "" "Comparing with `this `__ example." msgstr "" -"使用`这个 `__ 示例。" +"与 `this `__ 示例比较。" -#, fuzzy msgid "" "Now column ``pred`` exists and contains the predecessor of the ``node``." -msgstr "``pred`` 包含``node`` 的前驱。" +msgstr "现在列 ``pred`` 已经存在，并包含了 ``node`` 的前置节点。" -#, fuzzy msgid "Kruskal multiple vertices" -msgstr "多个顶点" +msgstr "Kruskal 多顶点" -#, fuzzy msgid "" "Comparing with `this `__ example." msgstr "" -"使用`这个 `__ 示例。" +"与 `this `__ 示例比较。" msgid "Migration of ``pgr_KSP``" msgstr "迁移 ``pgr_KSP``" -#, fuzzy msgid "" "Starting from `v3.6.0 `__ :" "doc:`pgr_KSP` result columns are being standardized." msgstr "" -"从 `v3.6.0 `__ 开始， :doc:" -"`pgr_KSP`结果列正在标准化。" +"从 `v3.6.0 `__ :doc:" +"`pgr_KSP` 开始，结果列被标准化。" msgid "|ksp-result|" msgstr "|ksp-result|" @@ -5063,12 +4896,11 @@ msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" msgid "``pgr_KSP`` (One to One) does not have ``start_vid`` and ``end_vid``." msgstr "``pgr_KSP`` (一对一) 没有 ``start_vid`` 和``end_vid``。" -#, fuzzy msgid "" "Using `this `__ " "example." msgstr "" -"使用`这个 `__ 示" +"使用 `this `__ 示" "例。" msgid "" @@ -5146,7 +4978,7 @@ msgid "In the query returns only ``edge`` column." msgstr "查询中仅返回 ``边`` 列。" msgid "Migration of ``pgr_primDD`` / ``pgr_primBFS`` / ``pgr_primDFS``" -msgstr "" +msgstr "`pgr_primDD`` / `pgr_primBFS`` / `pgr_primDFS`` 的迁移" #, fuzzy msgid "" @@ -5157,45 +4989,49 @@ msgstr "" "从 `v3.6.0 `__ 开始， :doc:" "`pgr_drivingDistance`结果列正在标准化。" -#, fuzzy +msgid "``pgr_primDD``" +msgstr "``pgr_primDD``" + +msgid "``pgr_primDFS``" +msgstr "``pgr_primDFS``" + +msgid "``pgr_primBFS``" +msgstr "``pgr_primBFS``" + msgid "Prim single vertex" -msgstr "单顶点" +msgstr "Prim 单一节点" msgid "" "Using ``pgr_primDD`` as example. Migration is similar to al the affected " "functions." -msgstr "" +msgstr "以 ``pgr_primDD`` 为例。迁移与所有受影响的函数类似。" -#, fuzzy msgid "" "Comparing with `this `__ example." msgstr "" -"使用`这个 `__ 示例。" +"与 `this `__ 例子比较。" -#, fuzzy msgid "Prim multiple vertices" -msgstr "多个顶点" +msgstr "Prim 多个顶点" -#, fuzzy msgid "" "Comparing with `this `__ example." msgstr "" -"使用`这个 `__ 示例。" +"与 `this `__ 例子比较。" msgid "Migration of ``pgr_withPointsDD``" msgstr "迁移 ``pgr_withPointsDD``" -#, fuzzy msgid "" "Starting from `v3.6.0 `__ :" "doc:`pgr_withPointsDD` result columns are being standardized." msgstr "" -"从`v3.6.0 `__ 开始 :doc:" -"`pgr_withPointsDD`结果列正在标准化。" +"从 `v3.6.0 `__ :doc:" +"`pgr_withPointsDD` 结果列开始标准化。" msgid "|result-generic-no-seq|" msgstr "|result-generic-no-seq|" @@ -5220,10 +5056,9 @@ msgstr "输出列为 |result-1-1-no-seq|" msgid "Does not have ``start_vid``, ``pred`` and ``depth`` result columns." msgstr "没有 ``start_vid``，``pred`` 和``depth`` 结果列。" -#, fuzzy msgid "" "``driving_side`` parameter was named optional now it is compulsory unnamed." -msgstr "``driving_side`` 参数被命名为可选，现在强制未命名。" +msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" msgid "``pgr_withPointsDD`` (`Multiple vertices`)" msgstr "``pgr_withPointsDD`` (`多个顶点`)" @@ -5273,7 +5108,6 @@ msgstr "此外， ``l`` 也可用作 **驾驶侧**" msgid "After Migration" msgstr "迁移后" -#, fuzzy msgid "Be aware of the existence of the additional result Columns." msgstr "注意附加结果列的存在。" @@ -5342,13 +5176,12 @@ msgstr "过滤掉额外的列" msgid "Migration of ``pgr_withPointsKSP``" msgstr "迁移 ``pgr_withPointsKSP``" -#, fuzzy msgid "" "Starting from `v3.6.0 `__ :" "doc:`pgr_withPointsKSP` result columns are being standardized." msgstr "" -"从`v3.6.0 `__ 开始 ， :doc:" -"`pgr_withPointsKSP`结果列正在标准化。" +"从 `v3.6.0 `__ :doc:" +"`pgr_withPointsKSP` 开始对结果列进行标准化。" msgid "" "And ``driving side`` parameter changed from named optional to unnamed " @@ -5379,8 +5212,137 @@ msgid "" "original columns:" msgstr "如果需要，过滤掉附加列，例如，返回原始列：" -msgid "Migration of turn restrictions" -msgstr "转弯限制的迁移" +msgid "Migration of ``pgr_trsp`` (Vertices)" +msgstr "迁移 ``pgr_trsp`` （顶点）" + +msgid "Signature:" +msgstr "标识：" + +#, fuzzy +msgid "Deprecated" +msgstr "已废弃的功能" + +msgid "`v3.4.0 `__" +msgstr "`v3.4.0 `__" + +msgid "Removed" +msgstr "已删除的功能" + +msgid "`v4.0.0 `__" +msgstr "`v4.0.0 `__" + +msgid ":doc:`pgr_dijkstra`" +msgstr ":doc:`pgr_dijkstra`" + +msgid ":doc:`pgr_trsp`" +msgstr ":doc:`pgr_trsp`" + +#, fuzzy +msgid "`Migration of restrictions`_" +msgstr "限制迁移" + +#, fuzzy +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr ":doc:`pgr_dijkstra` 当没有限制时，" + +msgid "Use :doc:`pgr_dijkstra` instead." +msgstr "请改用 :doc:`pgr_dijkstra`。" + +#, fuzzy +msgid "To get the original column names:" +msgstr "要获取图的连通性：" + +msgid "``id1`` is the node" +msgstr "``id1`` 是节点" + +msgid "``id2`` is the edge" +msgstr "``id2`` 是边" + +#, fuzzy +msgid "Use ``pgr_trsp`` when there are restrictions." +msgstr ":doc:`pgr_trspVia` 当有限制时。" + +msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgstr "请改用 :doc:`pgr_trsp` (一对一）。" + +msgid "Migration of ``pgr_trsp`` (Edges)" +msgstr "迁移 ``pgr_trsp`` （边）" + +msgid ":doc:`pgr_withPoints`" +msgstr ":doc:`pgr_withPoints`" + +msgid ":doc:`pgr_trsp_withPoints`" +msgstr ":doc:`pgr_trsp_withPoints`" + +#, fuzzy +msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgstr ":doc:`pgr_withPoints` 当没有任何限制的时候，" + +#, fuzzy +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "请改用 :doc:`pgr_trsp` (一对一）。" + +#, fuzzy +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgstr ":doc:`pgr_trspVia_withPoints` 当有限制时。" + +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "请使用 :doc:`pgr_trsp_withPoints`。" + +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "迁移 ``pgr_trspViaVertices``" + +msgid ":doc:`pgr_dijkstraVia`" +msgstr ":doc:`pgr_dijkstraVia`" + +msgid ":doc:`pgr_trspVia`" +msgstr ":doc:`pgr_trspVia`" + +#, fuzzy +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr ":doc:`pgr_dijkstraVia` 当无限制时，" + +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "请使用 :doc:`pgr_dijkstraVia`。" + +msgid "``id1`` is the path identifier" +msgstr "``id1`` 是路径标识符" + +msgid "``id2`` is the node" +msgstr "``id2`` 是节点" + +msgid "``id3`` is the edge" +msgstr "``id3`` 是边" + +#, fuzzy +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr ":doc:`pgr_trspVia` 当有限制时。" + +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "使用 :doc:`pgr_trspVia`。" + +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "迁移 ``pgr_trspViaEdges``" + +msgid ":doc:`pgr_withPointsVia`" +msgstr ":doc:`pgr_withPointsVia`" + +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr ":doc:`pgr_trspVia_withPoints`" + +#, fuzzy +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr ":doc:`pgr_withPointsVia` 当没有限制时，" + +msgid "Use :doc:`pgr_withPointsVia` instead." +msgstr "请使用 :doc:`pgr_withPointsVia`。" + +#, fuzzy +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr ":doc:`pgr_trspVia_withPoints` 当有限制时。" + +msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgstr "使用 :doc:`pgr_trspVia_withPoints` 代替。" msgid "Migration of restrictions" msgstr "限制迁移" @@ -5512,5018 +5474,5276 @@ msgid "" "an array ``_pgr_array_reverse`` needed for the migration." msgstr "" "为了进行这次迁移，pgRouting 提供了一个用于反转数组的辅助函数 ``_ " -"pgr_array_reverse`` ，这在迁移过程中是必需的。" - -msgid "``_pgr_array_reverse``:" -msgstr "``_pgr_array_reverse``:" - -msgid "Was created temporally for this migration" -msgstr "是为此迁移临时创建的" - -msgid "Is not documented." -msgstr "没有记录。" - -msgid "Will be removed on the next mayor version 4.0.0" -msgstr "将在下一个正式版本 4.0.0 中删除" - -msgid "The migrated table contents:" -msgstr "迁移后的表内容：" - -msgid "Migration of ``pgr_trsp`` (Vertices)" -msgstr "迁移 ``pgr_trsp`` （顶点）" - -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 " -"restrictions." -msgstr "" -":doc:`pgr_trsp` 的签名已更改，并且新签名中已修复许多问题。 本节将展示如何从旧" -"签名迁移到新的替换函数。 这也会影响限制。" - -msgid "The integral type of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "``Edges SQL`` 的整数类型只能是 ``INTEGER``。" - -msgid "The floating point type of the ``Edges SQL`` can only be ``FLOAT``." -msgstr "``Edges SQL`` 的浮点类型只能是 ``FLOAT``。" - -msgid "``directed`` flag is compulsory." -msgstr "``directed`` 标志是强制性的。" - -msgid "Does not autodetect if ``reverse_cost`` column exist." -msgstr "不自动检测 ``reverse_cost`` 列是否存在。" - -msgid "" -"User must be careful to match the existence of the column with the value of " -"``has_rcost`` parameter." -msgstr "用户必须小心地将列的存在与 ``has_rcost`` 参数的值相匹配。" +"pgr_array_reverse`` ，这在迁移过程中是必需的。" -msgid "The restrictions inner query is optional." -msgstr "内部查询的限制是可选的。" +msgid "``_pgr_array_reverse``:" +msgstr "``_pgr_array_reverse``:" -msgid "The output column names are meaningless" -msgstr "输出列名没有意义" +msgid "Was created temporally for this migration" +msgstr "是为此迁移临时创建的" -msgid "Migrate by using:" -msgstr "使用以下方式迁移：" +msgid "Is not documented." +msgstr "没有记录。" -msgid ":doc:`pgr_dijkstra` when there are no restrictions," -msgstr ":doc:`pgr_dijkstra` 当没有限制时，" +msgid "Will be removed on the next mayor version 4.0.0" +msgstr "将在下一个正式版本 4.0.0 中删除" -msgid ":doc:`pgr_trsp` (One to One) when there are restrictions." -msgstr ":doc:`pgr_trsp` (一对一)当有限制时。" +msgid "The migrated table contents:" +msgstr "迁移后的表内容：" -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_dijkstra``" -msgstr "使用 ``pgr_dijkstra`` 迁移 ``pgr_trsp`` （顶点）" +msgid ":doc:`withPoints-category`" +msgstr ":doc:`withPoints-category`" -msgid "The following query does not have restrictions." -msgstr "以下查询没有限制。" +msgid "Ordering - Family of functions" +msgstr "排序 - 函数族" -msgid "A message about deprecation is shown" -msgstr "显示有关弃用的消息" +msgid "pgRouting Concepts" +msgstr "pgRouting 基本概念" -msgid "Deprecated functions will be removed on the next mayor version 4.0.0" -msgstr "已弃用的功能将在下一个正式版本 4.0.0 中删除" +msgid "" +"This is a simple guide that go through some of the steps for getting started " +"with pgRouting. This guide covers:" +msgstr "这是一个简单的指南，介绍了 pgRouting 入门的一些步骤。 本指南涵盖：" -msgid "Use :doc:`pgr_dijkstra` instead." -msgstr "请改用 :doc:`pgr_dijkstra`。" +msgid "Graphs" +msgstr "图" -msgid "The types casting has been removed." -msgstr "类型强制转换已被删除。" +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" +msgstr "图是一个有序对 :math:`G = (V ,E)` ，其中：" -msgid ":doc:`pgr_dijkstra`:" -msgstr ":doc:`pgr_dijkstra`:" +msgid ":math:`V` is a set of vertices, also called nodes." +msgstr ":math:`V` 是一组顶点，也称为节点。" -msgid "Autodetects if ``reverse_cost`` column is in the edges SQL." -msgstr "自动检测 ``reverse_cost`` 列是否在边SQL中。" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgid "Accepts ``ANY-INTEGER`` on integral types" -msgstr "接受整数类型 ``ANY-INTEGER``" +msgid "There are different kinds of graphs:" +msgstr "有不同类型的图：" -msgid "Accepts ``ANY-NUMERICAL`` on floating point types" -msgstr "接受浮点类型 ``ANY-NUMERICAL``" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgid "``directed`` flag has a default value of ``true``." -msgstr "``directed`` 标志的默认值为``true``。" +msgid "Undirected simple graph" +msgstr "无向简单图" -msgid "Use the same value that on the original query." -msgstr "使用与原始查询相同的值。" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -msgid "In this example it is ``true`` which is the default value." -msgstr "在此示例中，默认值为 ``true``。" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgid "The flag has been omitted and the default is been used." -msgstr "该标志已被省略，并使用默认值。" +msgid "Directed simple graph" +msgstr "有向简单图" msgid "" -"When the need of using strictly the same (meaningless) names and types of " -"the function been migrated then:" -msgstr "当需要使用严格相同（无意义）的函数名称和类型进行迁移时：" - -msgid "``id1`` is the node" -msgstr "``id1`` 是节点" - -msgid "``id2`` is the edge" -msgstr "``id2`` 是边" +":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr "" +":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_trsp``" -msgstr "使用 ``pgr_trsp``迁移 ``pgr_trsp`` （顶点）" +msgid "Graphs:" +msgstr "图：" -msgid "The following query has restrictions." -msgstr "以下查询有限制。" +msgid "Do not have geometries." +msgstr "没有几何图形。" -msgid "The restrictions are the last parameter of the function" -msgstr "限制是函数的最后一个参数" +msgid "" +"Some graph theory problems require graphs to have weights, called **cost** " +"in pgRouting." +msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为 **成本** 。" -msgid "Using the old structure of restrictions" -msgstr "使用旧的限制结构" +msgid "" +"In pgRouting there are several ways to represent a graph on the database:" +msgstr "在 pgRouting 中，有多种方法来表示数据库上的图：" -msgid "Use :doc:`pgr_trsp` (One to One) instead." -msgstr "请改用 :doc:`pgr_trsp` (一对一）。" +msgid "With ``cost``" +msgstr "使用 ``cost``" -msgid "The new structure of restrictions is been used." -msgstr "使用了新的限制结构。" +msgid "(``id``, ``source``, ``target``, ``cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``)" -msgid "It is the second parameter." -msgstr "这是第二个参数。" +msgid "With ``cost`` and ``reverse_cost``" +msgstr "使用 ``cost`` 和 ``reverse_cost``" -msgid ":doc:`pgr_trsp`:" -msgstr ":doc:`pgr_trsp`:" +msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgid "Migration of ``pgr_trsp`` (Edges)" -msgstr "迁移 ``pgr_trsp`` （边）" +msgid "" +"Identifier of the edge. Requirement to use the database in a consistent. " +"manner." +msgstr "边的标识符。要求在数据库中以一致的方式使用。" -msgid "The integral types of the ``sql`` can only be ``INTEGER``." -msgstr "``sql`` 的整型类型只能是 ``INTEGER``。" +msgid "Identifier of a vertex." +msgstr "顶点的标识符。" -msgid "The floating point type of the ``sql`` can only be ``FLOAT``." -msgstr "``sql`` 的浮点类型只能是 ``FLOAT``。" +msgid "Weight of the edge (``source``, ``target``):" +msgstr "边 (``source``, ``target``)的权重：" -msgid "For these migration guide the following points will be used:" -msgstr "对于这些迁移指南，将使用以下几点：" +msgid "" +"When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "当为负时，图上不存在边(``source``, ``target``)。" -msgid ":doc:`pgr_withPoints` when there are no restrictions," -msgstr ":doc:`pgr_withPoints` 当没有任何限制的时候，" +msgid "``cost`` must exist in the query." +msgstr "查询中必须存在 ``cost``。" -msgid ":doc:`pgr_trsp_withPoints` (One to One) when there are restrictions." -msgstr ":doc:`pgr_trsp_withPoints` (一对一) 当有限制时。" +msgid "" +"When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "当为负时，图上不存在边(``target``, ``source``)。" -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_withPoints``" -msgstr "使用 ``pgr_withPoints``迁移 ``pgr_trsp`` （边）" +msgid "" +"The decision of the graph to be **directed** or **undirected** is done when " +"executing a pgRouting algorithm." +msgstr "" +"图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" -msgid "Use :doc:`pgr_withPoints` instead." -msgstr "请使用 :doc:`pgr_withPoints`。" +msgid "Graph with ``cost``" +msgstr "``成本`` 图" -msgid "Do not show details, as the deprecated function does not show details." -msgstr "不显示详细信息，因为已弃用的函数不显示详细信息。" +msgid "The weighted directed graph, :math:`G_d(V,E)`:" +msgstr "加权有向图， :math:`G_d(V,E)`:" -msgid ":doc:`pgr_withPoints`:" -msgstr ":doc:`pgr_withPoints`:" +msgid "Graph data is obtained with a query" +msgstr "通过查询获取图数据" -msgid "On the points query do not include the ``side`` column." -msgstr "在点查询中不包括 ``side`` 列。" +msgid "``SELECT id, source, target, cost FROM edges``" +msgstr "``SELECT id, source, target, cost FROM edges``" msgid "" -"When the need of using strictly the same (meaningless) names and types, and " -"node values of the function been migrated then:" -msgstr "当需要使用严格相同（无意义）的名称和类型，并且函数的节点值被迁移时：" +":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " +"\\ge 0 \\}`" +msgstr "" +":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " +"\\ge 0 \\}`" + +msgid "Edges where ``cost`` is non negative are part of the graph." +msgstr "成本非负的边是图的一部分。" -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints``" -msgstr "使用 ``pgr_trsp_withPoints`` 迁移 ``pgr_trsp`` （边）" +msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "请使用 :doc:`pgr_trsp_withPoints`。" +msgid "All vertices in ``source`` and ``target`` are part of the graph." +msgstr "``source`` 和``target`` 中的所有顶点都是图的一部分。" -msgid ":doc:`pgr_trsp_withPoints`:" -msgstr ":doc:`pgr_trsp_withPoints`:" +msgid "" +"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " +"has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "" +"在有向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性：:" +"math:`source_{id} \\rightarrow target_{id}`" -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "迁移 ``pgr_trspViaVertices``" +msgid "For the following data:" +msgstr "对于以下数据：" -msgid "The integral types of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "``Edges SQL`` 的整数类型只能是 ``INTEGER``。" +msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." +msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" -msgid ":doc:`pgr_dijkstraVia` when there are no restrictions," -msgstr ":doc:`pgr_dijkstraVia` 当无限制时，" +msgid "The data is representing the following graph:" +msgstr "数据代表下图：" -msgid ":doc:`pgr_trspVia` when there are restrictions." -msgstr ":doc:`pgr_trspVia` 当有限制时。" +msgid "" +"In an undirected graph the edge :math:`(source_{id}, target_{id}, " +"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" +"\\;\\;}{} target_{id}`" +msgstr "" +"在无向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 没有方向性：:" +"math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_dijkstraVia``" -msgstr "使用 ``pgr_dijkstraVia``迁移 ``pgr_trspViaVertices``" +msgid "" +"In terms of a directed graph is like having two edges: :math:`source_{id} " +"\\leftrightarrow target_{id}`" +msgstr "" +"在有向图的术语中，这相当于有两条边： :math:`source_{id} \\leftrightarrow " +"target_{id}`" -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "请使用 :doc:`pgr_dijkstraVia`。" +msgid "" +"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " +"graph." +msgstr "边 :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) 不是图的一部分。" -msgid ":doc:`pgr_dijkstraVia`:" -msgstr ":doc:`pgr_dijkstraVia`:" +msgid "Graph with ``cost`` and ``reverse_cost``" +msgstr "带有 ``cost`` 和``reverse_cost`` 的图" -msgid "``id1`` is the path identifier" -msgstr "``id1`` 是路径标识符" +msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" -msgid "``id2`` is the node" -msgstr "``id2`` 是节点" +msgid "The set of edges :math:`E`:" +msgstr "边的集合 :math:`E`：" -msgid "``id3`` is the edge" -msgstr "``id3`` 是边" +msgid "" +":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " +"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " +"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " +"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr "" +":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " +"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " +"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " +"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_trspVia``" -msgstr "使用 ``pgr_trspVia``迁移 ``pgr_trspViaVertices``" +msgid "" +"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " +"are part of the graph." +msgstr "" +"边 :math:`(source \\rightarrow target)` 中的 ``cost`` 是非负数的都属于图的一" +"部分。" -msgid "Use :doc:`pgr_trspVia` instead." -msgstr "使用 :doc:`pgr_trspVia`。" +msgid "" +"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " +"negative are part of the graph." +msgstr "" +"边 :math:`(target \\rightarrow source)` 中的 ``reverse_cost`` 是非负数的都属" +"于图的一部分。" -msgid ":doc:`pgr_trspVia`:" -msgstr ":doc:`pgr_trspVia`:" +msgid "The set of vertices :math:`V`:" +msgstr "顶点集 :math:`V`：" -msgid "Migration of ``pgr_trspViaEdges``" -msgstr "迁移 ``pgr_trspViaEdges``" +msgid "In a directed graph both edges have directionality" +msgstr "在有向图中，两条边都有方向性" msgid "" -"And will travel thru the following Via points :math:" -"`4\\rightarrow3\\rightarrow6`" -msgstr "并将途经以下途经点： :math:`4\\rightarrow3\\rightarrow6`" +"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" +"`source_{id} \\rightarrow target_{id}`" +msgstr "" +"边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性： :math:" +"`source_{id} \\rightarrow target_{id}`" -msgid ":doc:`pgr_withPointsVia` when there are no restrictions," -msgstr ":doc:`pgr_withPointsVia` 当没有限制时，" +msgid "" +"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " +"directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgstr "" +"边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` 具有方向性： :" +"math:`target_{id} \\rightarrow source_{id}`" -msgid ":doc:`pgr_trspVia_withPoints` when there are restrictions." -msgstr ":doc:`pgr_trspVia_withPoints` 当有限制时。" +msgid "Edges not part of the graph:" +msgstr "边不是图的一部分：" -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_withPointsVia``" -msgstr "使用 ``pgr_withPointsVia`` 迁移 ``pgr_trspViaEdges``" +msgid ":math:`2` (:math:`1 \\rightarrow 3`)" +msgstr ":math:`2` (:math:`1\\rightarrow 3`)" -msgid "Use :doc:`pgr_withPointsVia` instead." -msgstr "请使用 :doc:`pgr_withPointsVia`。" +msgid ":math:`3` (:math:`3 \\rightarrow 2`)" +msgstr ":math:`3` (:math:`3\\rightarrow 2`)" -msgid ":doc:`pgr_withPointsVia`:" -msgstr ":doc:`pgr_withPointsVia`:" +msgid "In a directed graph both edges do not have directionality" +msgstr "在有向图中，两条边都没有方向性" -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_trspVia_withPoints``" -msgstr "使用 ``pgr_trspVia_withPoints``迁移``pgr_trspViaEdges``" +msgid "" +"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " +"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "" +"边 :math:`(source_{id}, target_{id}, cost_{id})` 是 :math:`source_{id} " +"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." -msgstr "使用 :doc:`pgr_trspVia_withPoints` 代替。" +msgid "" +"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" +"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgstr "" +"边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})`是 :math:" +"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgid ":doc:`pgr_trspVia_withPoints`:" -msgstr ":doc:`pgr_trspVia_withPoints`:" +msgid "In terms of a directed graph is like having four edges:" +msgstr "就有向图而言，就像有四个边：" -msgid ":doc:`withPoints-category`" -msgstr ":doc:`withPoints-category`" +msgid ":math:`source_i \\leftrightarrow target_i`" +msgstr ":math:`source_i \\leftrightarrow target_i`" -msgid "Ordering - Family of functions" -msgstr "排序 - 函数族" +msgid ":math:`target_i \\leftrightarrow source_i`" +msgstr ":math:`target_i \\leftrightarrow source_i`" -msgid "pgRouting Concepts" -msgstr "pgRouting 基本概念" +msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" -msgstr "这是一个简单的指南，介绍了 pgRouting 入门的一些步骤。 本指南涵盖：" +msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -msgid "Graphs" -msgstr "图" +msgid "Graphs without geometries" +msgstr "没有几何信息的图" -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" -msgstr "图是一个有序对 :math:`G = (V ,E)` ，其中：" +msgid "" +"Personal relationships, genealogy, file dependency problems can be solved " +"using pgRouting. Those problems, normally, do not come with geometries " +"associated with the graph." +msgstr "" +"使用 pgRouting 可以解决个人关系、家谱和文件依赖性问题。这些问题通常不会与图形" +"相关的几何图形一起出现。" -msgid ":math:`V` is a set of vertices, also called nodes." -msgstr ":math:`V` 是一组顶点，也称为节点。" +msgid "Wiki example" +msgstr "维基示例" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" +msgid "" +"Solve the example problem taken from `wikipedia `__):" +msgstr "" +"解决来自 `维基百科 `__ ）的示例问题 ：" -msgid "There are different kinds of graphs:" -msgstr "有不同类型的图：" +msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." +msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" +msgid "Is an undirected graph." +msgstr "是一个无向图。" -msgid "Undirected simple graph" -msgstr "无向简单图" +msgid "" +"Although visually looks like to have geometries, the drawing is not to scale." +msgstr "虽然视觉上看起来有几何形状，但该图并不是按比例绘制的。" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" +msgid "No geometries associated to the vertices or edges" +msgstr "没有与顶点或边关联的几何图形" -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" -msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" +msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" +msgstr "有6个顶点 :math:`\\{1,2,3,4,5,6\\}`" -msgid "Directed simple graph" -msgstr "有向简单图" +msgid "Has 9 edges:" +msgstr "有九个边：" msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" +"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " +"(5,6,9) \\} \\end{align} \\end{split}`" msgstr "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" +"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " +"(5,6,9) \\} \\end{align} \\end{split}`" -msgid "Graphs:" -msgstr "图：" +msgid "The graph can be represented in many ways for example:" +msgstr "该图可以用多种方式表示，例如：" -msgid "Do not have geometries." -msgstr "没有几何图形。" +msgid "Prepare the database" +msgstr "准备数据库" msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." -msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为 **成本** 。" +"Create a database for the example, access the database and install " +"pgRouting: ::" +msgstr "为示例创建一个数据库，访问数据库并安装 pgRouting：::" + +msgid "Create a table" +msgstr "创建表" msgid "" -"In pgRouting there are several ways to represent a graph on the database:" -msgstr "在 pgRouting 中，有多种方法来表示数据库上的图：" +"The basic elements needed to perform basic routing on an undirected graph " +"are:" +msgstr "在无向图上执行基本路由所需的基本元素是：" -msgid "With ``cost``" -msgstr "使用 ``cost``" +msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgid "(``id``, ``source``, ``target``, ``cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``)" +msgid "Using this table design for this example:" +msgstr "本示例使用此表设计：" -msgid "With ``cost`` and ``reverse_cost``" -msgstr "使用 ``cost`` 和 ``reverse_cost``" +msgid "Insert the data" +msgstr "插入数据" -msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" +msgid "Find the shortest path" +msgstr "寻找最短路径" + +msgid "To solve this example :doc:`pgr_dijkstra` is used:" +msgstr "为了解决这个例子，使用了 :doc:`pgr_dijkstra`：" msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." -msgstr "边的标识符。要求在数据库中以一致的方式使用。" +"To go from :math:`1` to :math:`5` the path goes thru the following " +"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "" +"从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 " +"\\rightarrow 6 \\rightarrow 5`" -msgid "Identifier of a vertex." -msgstr "顶点的标识符。" +msgid "Vertex information" +msgstr "顶点信息" -msgid "Weight of the edge (``source``, ``target``):" -msgstr "边 (``source``, ``target``)的权重：" +msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" +msgstr "要获取顶点信息，请使用 :doc:`pgr_extractVertices`" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." -msgstr "当为负时，图上不存在边(``source``, ``target``)。" +msgid "Graphs with geometries" +msgstr "具有几何图形的图" -msgid "``cost`` must exist in the query." -msgstr "查询中必须存在 ``cost``。" +msgid "Create a routing Database" +msgstr "创建路由数据库" msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." -msgstr "当为负时，图上不存在边(``target``, ``source``)。" +"The first step is to create a database and load pgRouting in the database." +msgstr "第一步是创建数据库并在数据库中加载 pgRouting。" + +msgid "Typically create a database for each project." +msgstr "通常为每个项目创建一个数据库。" msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." -msgstr "" -"图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" +"Once having the database to work in, load your data and build the routing " +"application in that database." +msgstr "一旦数据库可以工作，加载数据并在该数据库中构建路由应用程序。" -msgid "Graph with ``cost``" -msgstr "``成本`` 图" +msgid "Load Data" +msgstr "加载数据" -msgid "The weighted directed graph, :math:`G_d(V,E)`:" -msgstr "加权有向图， :math:`G_d(V,E)`:" +msgid "There are several ways to load your data into pgRouting." +msgstr "有多种方法可以将数据加载到 pgRouting 中。" -msgid "Graph data is obtained with a query" -msgstr "通过查询获取图数据" +msgid "Manually creating a database." +msgstr "手动创建数据库。" -msgid "``SELECT id, source, target, cost FROM edges``" -msgstr "``SELECT id, source, target, cost FROM edges``" +msgid "`Graphs without geometries`_" +msgstr "`没有几何形状的图`_" + +msgid ":doc:`sampledata`: a small graph used in the documentation examples" +msgstr ":doc:`sampledata`: 文档示例中使用的小图形" msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +"Using `osm2pgrouting `__" msgstr "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +"使用 `osm2pgrouting `__" -msgid "Edges where ``cost`` is non negative are part of the graph." -msgstr "成本非负的边是图的一部分。" +msgid "There are various open source tools that can help, like:" +msgstr "有多种开源工具可以提供帮助，例如：" -msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`" -msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" +msgid "shp2pgsql" +msgstr "shp2pgsql" -msgid "All vertices in ``source`` and ``target`` are part of the graph." -msgstr "``source`` 和``target`` 中的所有顶点都是图的一部分。" +msgid "postgresql shapefile loader" +msgstr "postgresql shapefile 加载器" -msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " -"has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "" -"在有向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性：:" -"math:`source_{id} \\rightarrow target_{id}`" +msgid "ogr2ogr" +msgstr "ogr2ogr" -msgid "For the following data:" -msgstr "对于以下数据：" +msgid "vector data conversion utility" +msgstr "矢量数据转换实用程序" -msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph." -msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" +msgid "osm2pgsql" +msgstr "osm2pgsql" -msgid "The data is representing the following graph:" -msgstr "数据代表下图：" +msgid "load OSM data into postgresql" +msgstr "将OSM数据加载到postgresql中" msgid "" -"In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" -"\\;\\;}{} target_{id}`" +"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 "" -"在无向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 没有方向性：:" -"math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +"请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况" +"时，需要调整拓扑。" + +msgid "Breakup a segments on each segment-segment intersection" +msgstr "在每个线段-线段交叉点上分解线段" msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id} " -"\\leftrightarrow target_{id}`" +"When missing, add columns and assign values to ``source``, ``target``, " +"``cost``, ``reverse_cost``." msgstr "" -"在有向图的术语中，这相当于有两条边： :math:`source_{id} \\leftrightarrow " -"target_{id}`" +"如果缺少，请添加列并为 ``source``, ``target``, ``cost``, ``reverse_cost`` 分" +"配值。" -msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." -msgstr "边 :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) 不是图的一部分。" +msgid "Connect a disconnected graph." +msgstr "连接断开的图。" -msgid "Graph with ``cost`` and ``reverse_cost``" -msgstr "带有 ``cost`` 和``reverse_cost`` 的图" +msgid "Create the complete graph topology" +msgstr "创建完整的图拓扑" -msgid "The weighted directed graph, :math:`G_d(V,E)`, is defined by:" -msgstr "加权有向图， :math:`G_d(V,E)`， 定义如下：" +msgid "Create one or more graphs based on the application to be developed." +msgstr "根据要开发的应用程序创建一个或多个图。" -msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``" -msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" +msgid "Create a contracted graph for the high speed roads" +msgstr "为高速道路创建收缩图" -msgid "The set of edges :math:`E`:" -msgstr "边的集合 :math:`E`：" +msgid "Create graphs per state/country" +msgstr "创建每个州/国家的图" + +msgid "In few words:" +msgstr "简而言之：" + +msgid "Prepare the graph" +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}`" +"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 "" -":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}`" +"准备什么以及如何准备图将取决于应用程序和/或数据质量和/或信息与 pgRouting 可用" +"的拓扑的接近程度和/或未提及的一些其他因素。" msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the 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 "" -"边 :math:`(source \\rightarrow target)` 中的 ``cost`` 是非负数的都属于图的一" -"部分。" +"准备图的步骤涉及使用`PostGIS `__ 进行几何操作，其他一些" +"步骤涉及诸如 :doc:`pgr_contraction` 之类的图操作来收缩图。" msgid "" -"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " -"negative are part of the graph." +"The `workshop `__ has a step by step " +"on how to prepare a graph using Open Street Map data, for a small " +"application." msgstr "" -"边 :math:`(target \\rightarrow source)` 中的 ``reverse_cost`` 是非负数的都属" -"于图的一部分。" +"该 `workshop `__ 逐步介绍了如何使用开" +"放街道地图数据为小型应用程序准备图。" -msgid "The set of vertices :math:`V`:" -msgstr "顶点集 :math:`V`：" +msgid "The use of indexes on the database design in general:" +msgstr "数据库设计上索引的使用一般：" -msgid "In a directed graph both edges have directionality" -msgstr "在有向图中，两条边都有方向性" +msgid "Have the geometries indexed." +msgstr "对几何图形进行索引。" + +msgid "Have the identifiers columns indexed." +msgstr "对标识符列建立索引。" msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" +"Please consult the `PostgreSQL `__ " +"documentation and the `PostGIS `__ documentation." msgstr "" -"边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性： :math:" -"`source_{id} \\rightarrow target_{id}`" +"请查阅`PostgreSQL `__ 文档和 `PostGIS " +"`__ 文档。" msgid "" -"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " -"directionality: :math:`target_{id} \\rightarrow source_{id}`" +"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 "" -"边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` 具有方向性： :" -"math:`target_{id} \\rightarrow source_{id}`" - -msgid "Edges not part of the graph:" -msgstr "边不是图的一部分：" +"来自 OSM 并使用 `osm2pgrouting `__ 作为导入工具的数据附带路由拓扑。 请参阅 `workshop `__ 上使用 " +"``osm2pgrouting`` 的示例。" -msgid ":math:`2` (:math:`1 \\rightarrow 3`)" -msgstr ":math:`2` (:math:`1\\rightarrow 3`)" +msgid "Adjust costs" +msgstr "调整成本" -msgid ":math:`3` (:math:`3 \\rightarrow 2`)" -msgstr ":math:`3` (:math:`3\\rightarrow 2`)" +msgid "" +"For this example the ``cost`` and ``reverse_cost`` values are going to be " +"the double of the length of the geometry." +msgstr "对于本示例， ``cost`` 和 ``reverse_cost`` 值将是几何体长度的两倍。" -msgid "In a directed graph both edges do not have directionality" -msgstr "在有向图中，两条边都没有方向性" +msgid "Update costs to length of geometry" +msgstr "将成本更新为几何形状的长度" msgid "" -"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "" -"边 :math:`(source_{id}, target_{id}, cost_{id})` 是 :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " +"represent:" +msgstr "假设样本数据中的 ``cost`` 和 ``reverse_cost`` 列表示：" + +msgid ":math:`1` when the edge exists in the graph" +msgstr "当边存在于图中时为 :math:`1`" + +msgid ":math:`-1` when the edge does not exist in the graph" +msgstr "当图中不存在边时为 :math:`-1`" + +msgid "Using that information updating to the length of the geometries:" +msgstr "使用该信息更新几何形状的长度：" + +msgid "Which gives the following results:" +msgstr "给出以下结果：" msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgstr "" -"边 :math:`(target_{id}, source_{id}, reverse\\_cost_{id})`是 :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +"Note that to be able to follow the documentation examples, everything is " +"based on the original graph." +msgstr "请注意，为了能够遵循文档示例，一切都基于原始图。" -msgid "In terms of a directed graph is like having four edges:" -msgstr "就有向图而言，就像有四个边：" +msgid "Returning to the original data:" +msgstr "回到原始数据：" -msgid ":math:`source_i \\leftrightarrow target_i`" -msgstr ":math:`source_i \\leftrightarrow target_i`" +msgid "Update costs based on codes" +msgstr "根据代码更新成本" -msgid ":math:`target_i \\leftrightarrow source_i`" -msgstr ":math:`target_i \\leftrightarrow source_i`" +msgid "Other datasets, can have a column with values like" +msgstr "其他数据集可以有一列包含如下值" -msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" -msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" +msgid "``FT`` vehicle flow on the direction of the geometry" +msgstr "``FT`` 几何方向上的车流" -msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" -msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" +msgid "``TF`` vehicle flow opposite of the direction of the geometry" +msgstr "``TF`` 车流与几何方向相反" -msgid "Graphs without geometries" -msgstr "没有几何信息的图" +msgid "``B`` vehicle flow on both directions" +msgstr "``B`` 双向车流" -msgid "" -"Personal relationships, genealogy, file dependency problems can be solved " -"using pgRouting. Those problems, normally, do not come with geometries " -"associated with the graph." -msgstr "" -"使用 pgRouting 可以解决个人关系、家谱和文件依赖性问题。这些问题通常不会与图形" -"相关的几何图形一起出现。" +msgid "Preparing a code column for the example:" +msgstr "为示例准备代码列：" -msgid "Wiki example" -msgstr "维基示例" +msgid "Adjusting the costs based on the codes:" +msgstr "根据代码调整成本：" -msgid "" -"Solve the example problem taken from `wikipedia `__):" -msgstr "" -"解决来自 `维基百科 `__ ）的示例问题 ：" +msgid "Check the Routing Topology" +msgstr "检查路由拓扑" -msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." -msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。" +msgid "There are lots of possible problems in a graph." +msgstr "图中可能存在很多问题。" -msgid "Is an undirected graph." -msgstr "是一个无向图。" +msgid "The data used may not have been designed with routing in mind." +msgstr "使用的数据在设计时可能没有考虑路由。" -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." -msgstr "虽然视觉上看起来有几何形状，但该图并不是按比例绘制的。" +msgid "A graph has some very specific requirements." +msgstr "图有一些非常具体的要求。" -msgid "No geometries associated to the vertices or edges" -msgstr "没有与顶点或边关联的几何图形" +msgid "The graph is disconnected." +msgstr "该图已断开连接。" -msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" -msgstr "有6个顶点 :math:`\\{1,2,3,4,5,6\\}`" +msgid "There are unwanted intersections." +msgstr "存在不需要的交叉点。" -msgid "Has 9 edges:" -msgstr "有九个边：" +msgid "The graph is too large and needs to be contracted." +msgstr "图太大，需要收缩。" + +msgid "A sub graph is needed for the application." +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}`" -msgstr "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +"and many other problems that the pgRouting user, that is the application " +"developer might encounter." +msgstr "以及 pgRouting 用户（即应用程序开发人员）可能遇到的许多其他问题。" -msgid "The graph can be represented in many ways for example:" -msgstr "该图可以用多种方式表示，例如：" +msgid "Crossing edges" +msgstr "交叉边" -msgid "Prepare the database" -msgstr "准备数据库" +msgid "To get the crossing edges:" +msgstr "要获取交叉边：" msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" -msgstr "为示例创建一个数据库，访问数据库并安装 pgRouting：::" +"That information is correct, for example, when in terms of vehicles, is it a " +"tunnel or bridge crossing over another road." +msgstr "这些信息是正确的，例如，就车辆而言，是隧道还是横跨另一条道路的桥梁。" -msgid "Create a table" -msgstr "创建表" +msgid "It might be incorrect, for example:" +msgstr "它可能是不正确的，例如：" msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" -msgstr "在无向图上执行基本路由所需的基本元素是：" - -msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" -msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" +"When it is actually an intersection of roads, where vehicles can make turns." +msgstr "当它实际上是道路交叉口时，车辆可以转弯。" -msgid "Using this table design for this example:" -msgstr "本示例使用此表设计：" +msgid "" +"When in terms of electrical lines, the electrical line is able to switch " +"roads even on a tunnel or bridge." +msgstr "在电力线路方面，电力线能够在隧道或桥梁上甚至切换道路。" -msgid "Insert the data" -msgstr "插入数据" +msgid "When it is incorrect, it needs fixing:" +msgstr "当不正确时，需要修复：" -msgid "Find the shortest path" -msgstr "寻找最短路径" +msgid "For vehicles and pedestrians" +msgstr "对于车辆和行人" -msgid "To solve this example :doc:`pgr_dijkstra` is used:" -msgstr "为了解决这个例子，使用了 :doc:`pgr_dijkstra`：" +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." +msgstr "" +"如果数据来自 OSM 并使用 ``osm2pgrouting`` 导入到数据库，则需要在 `OSM portal " +"`__ 中完成修复并再次导入数据。" msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +"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 "" -"从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 " -"\\rightarrow 6 \\rightarrow 5`" +"一般来说，当数据来自为车辆路线准备数据的供应商时，并且出现问题时，需要从供应" +"商处修复数据" -msgid "Vertex information" -msgstr "顶点信息" +msgid "For very specific applications" +msgstr "对于非常具体的应用" -msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" -msgstr "要获取顶点信息，请使用 :doc:`pgr_extractVertices`" +msgid "" +"The data is correct when from the point of view of routing vehicles or " +"pedestrians." +msgstr "从路线车辆或行人的角度来看，数据是正确的。" + +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 `__." +msgstr "" +"对交叉点进行一一分析后，对于需要局部修复的交叉点，需要 `分割 `__ 边。" -msgid "Graphs with geometries" -msgstr "具有几何图形的图" +msgid "" +"The new edges need to be added to the edges table, the rest of the " +"attributes need to be updated in the new edges, the old edges need to be " +"removed and the routing topology needs to be updated." +msgstr "" +"需要将新边添加到边表中，需要更新新边中的其余属性，需要删除旧边并需要更新路由" +"拓扑。" -msgid "Create a routing Database" -msgstr "创建路由数据库" +msgid "Adding split edges" +msgstr "添加分割边" msgid "" -"The first step is to create a database and load pgRouting in the database." -msgstr "第一步是创建数据库并在数据库中加载 pgRouting。" +"For each pair of crossing edges a process similar to this one must be " +"performed." +msgstr "对于每一对交叉边，必须执行与此类似的过程。" -msgid "Typically create a database for each project." -msgstr "通常为每个项目创建一个数据库。" +msgid "" +"The columns inserted and the way are calculated are based on the " +"application. For example, if the edges have a trait **name**, then that " +"column is to be copied." +msgstr "" +"插入的列和计算方式取决于应用程序。 例如，如果边具有特征 **名称** ，则将复制该" +"列。" + +msgid "For pgRouting calculations" +msgstr "用于 pgRouting 计算" msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." -msgstr "一旦数据库可以工作，加载数据并在该数据库中构建路由应用程序。" +"**factor** based on the position of the intersection of the edges can be " +"used to adjust the ``cost`` and ``reverse_cost`` columns." +msgstr "基于边相交位置的 **因子** 可用于调整 ``cost`` 和 ``reverse_cost`` 列。" -msgid "Load Data" -msgstr "加载数据" +msgid "" +"Capacity information, used in the :doc:`flow-family` functions does not need " +"to change when splitting edges." +msgstr "分割边时，在 :doc:`flow-family` 函数中使用的容量信息不需要改变。" -msgid "There are several ways to load your data into pgRouting." -msgstr "有多种方法可以将数据加载到 pgRouting 中。" +msgid "Adding new vertices" +msgstr "添加新的顶点" -msgid "Manually creating a database." -msgstr "手动创建数据库。" +msgid "" +"After adding all the split edges required by the application, the newly " +"created vertices need to be added to the vertices table." +msgstr "添加应用程序所需的所有分割边后，需要将新创建的顶点添加到顶点表中。" -msgid "`Graphs without geometries`_" -msgstr "`没有几何形状的图`_" +msgid "Updating edges topology" +msgstr "更新边拓扑" -msgid ":doc:`sampledata`: a small graph used in the documentation examples" -msgstr ":doc:`sampledata`: 文档示例中使用的小图形" +msgid "Removing the surplus edges" +msgstr "去除多余的边" msgid "" -"Using `osm2pgrouting `__" -msgstr "" -"使用 `osm2pgrouting `__" +"Once all significant information needed by the application has been " +"transported to the new edges, then the crossing edges can be deleted." +msgstr "一旦应用程序所需的所有重要信息都已传输到新边，则可以删除交叉边。" -msgid "There are various open source tools that can help, like:" -msgstr "有多种开源工具可以提供帮助，例如：" +msgid "" +"There are other options to do this task, like creating a view, or a " +"materialized view." +msgstr "还有其他选项可以完成此任务，例如创建视图或物化视图。" -msgid "shp2pgsql" -msgstr "shp2pgsql" +msgid "Updating vertices topology" +msgstr "更新顶点拓扑" -msgid "postgresql shapefile loader" -msgstr "postgresql shapefile 加载器" +msgid "To keep the graph consistent, the vertices topology needs to be updated" +msgstr "为了保持图的一致性，需要更新顶点拓扑" -msgid "ogr2ogr" -msgstr "ogr2ogr" +msgid "Checking for crossing edges" +msgstr "检查交叉边" -msgid "vector data conversion utility" -msgstr "矢量数据转换实用程序" +msgid "There are no crossing edges on the graph." +msgstr "图上没有交叉边。" -msgid "osm2pgsql" -msgstr "osm2pgsql" +msgid "Disconnected graphs" +msgstr "断开连接的图" -msgid "load OSM data into postgresql" -msgstr "将OSM数据加载到postgresql中" +msgid "To get the graph connectivity:" +msgstr "要获取图的连通性：" 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." +"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 "" -"请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况" -"时，需要调整拓扑。" +"在此示例中，组件 :math:`2`由顶点 :math:`\\{2, 4\\}` 组成，并且两个顶点也是死" +"端结果集的一部分。" -msgid "Breakup a segments on each segment-segment intersection" -msgstr "在每个线段-线段交叉点上分解线段" +msgid "This graph needs to be connected." +msgstr "这个图需要连接起来。" msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." -msgstr "" -"如果缺少，请添加列并为 ``source``, ``target``, ``cost``, ``reverse_cost`` 分" -"配值。" - -msgid "Connect a disconnected graph." -msgstr "连接断开的图。" - -msgid "Create the complete graph topology" -msgstr "创建完整的图拓扑" - -msgid "Create one or more graphs based on the application to be developed." -msgstr "根据要开发的应用程序创建一个或多个图。" +"With the original graph of this documentation, there would be 3 components " +"as the crossing edge in this graph is a different component." +msgstr "对于本文档的原始图，将有 3 个组件，因为该图中的交叉边是不同的组件。" -msgid "Create a contracted graph for the high speed roads" -msgstr "为高速道路创建收缩图" +msgid "Prepare storage for connection information" +msgstr "为连接信息准备存储" -msgid "Create graphs per state/country" -msgstr "创建每个州/国家的图" +msgid "Save the vertices connection information" +msgstr "保存顶点连接信息" -msgid "In few words:" -msgstr "简而言之：" +msgid "Save the edges connection information" +msgstr "保存边连接信息" -msgid "Prepare the graph" -msgstr "准备图" +msgid "Get the closest vertex" +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." +"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 "" -"准备什么以及如何准备图将取决于应用程序和/或数据质量和/或信息与 pgRouting 可用" -"的拓扑的接近程度和/或未提及的一些其他因素。" +"使用 :doc:`pgr_findCloseEdges` 距离组件 :math:`1` 最近的顶点是顶点 :math:" +"`4`。 距离顶点 :math:`4` 最近的边是 边 :math:`14`。" 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 ``edge`` can be used to connect the components, using the ``fraction`` " +"information about the edge :math:`14` to split the connecting edge." msgstr "" -"准备图的步骤涉及使用`PostGIS `__ 进行几何操作，其他一些" -"步骤涉及诸如 :doc:`pgr_contraction` 之类的图操作来收缩图。" +"``edge``可用于连接组件，利用边 :math:`14` 的``fraction`` 信息来分割连接边。" -msgid "" -"The `workshop `__ has a step by step " -"on how to prepare a graph using Open Street Map data, for a small " -"application." -msgstr "" -"该 `workshop `__ 逐步介绍了如何使用开" -"放街道地图数据为小型应用程序准备图。" +msgid "Connecting components" +msgstr "连接组件" -msgid "The use of indexes on the database design in general:" -msgstr "数据库设计上索引的使用一般：" +msgid "There are three basic ways to connect the components" +msgstr "连接组件有三种基本方法" -msgid "Have the geometries indexed." -msgstr "对几何图形进行索引。" +msgid "From the vertex to the starting point of the edge" +msgstr "从顶点到边的起点" -msgid "Have the identifiers columns indexed." -msgstr "对标识符列建立索引。" +msgid "From the vertex to the ending point of the edge" +msgstr "从顶点到边的终点" -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." -msgstr "" -"请查阅`PostgreSQL `__ 文档和 `PostGIS " -"`__ 文档。" +msgid "From the vertex to the closest vertex on the edge" +msgstr "从边上的顶点到最近的顶点" -msgid "Build a routing topology" -msgstr "构建路由拓扑" +msgid "This solution requires the edge to be split." +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." -msgstr "" -"使用大多数 pgRouting 函数的基本信息``id, source, target, cost, " -"[reverse_cost]`` 在 pgRouting 中被称为路由拓扑。" +msgid "The following query shows the three ways to connect the components:" +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." -msgstr "" -"``reverse_cost`` 是可选的，但强烈建议使用，以便由于几何列的大小而减小数据库的" -"大小。 话虽如此，在本文档中使用了 ``reverse_cost``。" +msgid "Checking components" +msgstr "检查组件" msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." -msgstr "当数据带有几何图形并且没有路由拓扑时，则需要此步骤。" +"Ignoring the edge that requires further work. The graph is now fully " +"connected as there is only one component." +msgstr "忽略需要进一步工作的边缘。 该图现在已完全连接，因为只有一个组件。" + +msgid "Contraction of a graph" +msgstr "图的收缩" + +msgid "The graph can be reduced in size using :doc:`contraction-family`" +msgstr "可以使用 :doc:`contraction-family` 来减小图形的大小" 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." +"When to contract will depend on the size of the graph, processing times, " +"correctness of the data, on the final application, or any other factor not " +"mentioned." msgstr "" -"几何图的所有开始和结束顶点都需要一个标识符，该标识符将存储在数据表的" -"``source``列和``target``列中。 同样，``cost`` 和 ``reverse_cost`` 需要具有在" -"两个方向上遍历边的值。" +"何时收缩将取决于图的大小、处理时间、数据的正确性、最终应用程序或任何其他未提" +"及的因素。" msgid "" -"If the columns do not exist they need to be added to the table in question. " -"(see `ALTER TABLE `__)" -msgstr "" -"如果这些列不存在，则需要将它们添加到相关表中。 （参见`ALTER TABLE `__ ）" +"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 "" -"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." +"A complete method on how to contract and how to use the contracted graph is " +"described on :doc:`contraction-family`" msgstr "" -"函数 :doc:`pgr_extractVertices` 用于根据边标识符和图边的几何形状创建顶点表。" +"有关如何收缩以及如何使用收缩图的完整方法在 :doc:`contraction-family` 中进行了" +"描述" + +msgid "To get the dead ends:" +msgstr "获取死端：" + +msgid "A dead end happens when" +msgstr "死端（Dead End）的形成条件" msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." -msgstr "最后使用存储在顶点表上的数据填充 ``source`` 和``target``。" +"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgstr "死端顶点（Dead End Vertex）的拓扑定义。" + +#, fuzzy +msgid "The vertex is on the limit of the imported graph." +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" -msgid "See :doc:`sampledata` for an example for building a topology." -msgstr "有关构建拓扑的示例，请参阅 :doc:`sampledata`。" +msgid "If a larger graph is imported then the vertex might not be a dead end" +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 `__." -msgstr "" -"来自 OSM 并使用 `osm2pgrouting `__ 作为导入工具的数据附带路由拓扑。 请参阅 `workshop `__ 上使用 " -"``osm2pgrouting`` 的示例。" +"Node :math:`4`, is a dead end on the query, even that it visually looks like " +"an end point of 3 edges." +msgstr "节点 :math:`4` 在查询中是一个死端，即使从视觉上看它是三条边的终点。" -msgid "Adjust costs" -msgstr "调整成本" +msgid "Is node :math:`4` a dead end or not?" +msgstr "节点 :math:`4` 是死端还是非死端？" + +msgid "The answer to that question will depend on the application." +msgstr "这个问题的答案将取决于应用情况。" + +msgid "Is there such a small curb:" +msgstr "有这么小的路边吗：" + +msgid "That does not allow a vehicle to use that visual intersection?" +msgstr "这不允许车辆使用该视觉交叉路口？" msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." -msgstr "对于本示例， ``cost`` 和 ``reverse_cost`` 值将是几何体长度的两倍。" +"Is the application for pedestrians and therefore the pedestrian can easily " +"walk on the small curb?" +msgstr "是否适用于行人，因此行人可以轻松地在小路边行走？" -msgid "Update costs to length of geometry" -msgstr "将成本更新为几何形状的长度" +msgid "" +"Is the application for the electricity and the electrical lines than can " +"easily be extended on top of the small curb?" +msgstr "电力和电线的应用是否可以轻松地延伸到小路边顶部？" msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" -msgstr "假设样本数据中的 ``cost`` 和 ``reverse_cost`` 列表示：" +"Is there a big cliff and from eagles view look like the dead end is close to " +"the segment?" +msgstr "是否有一个大悬崖，从鹰的角度看，死胡同靠近该路段？" -msgid ":math:`1` when the edge exists in the graph" -msgstr "当边存在于图中时为 :math:`1`" +#, fuzzy +msgid "Depending on the answer, modification of the data might be needed." +msgstr "根据函数需要一个或多个内部查询。" -msgid ":math:`-1` when the edge does not exist in the graph" -msgstr "当图中不存在边时为 :math:`-1`" +#, fuzzy +msgid "" +"When there are many dead ends, to speed up processing, the :doc:`contraction-" +"family` functions can be used to contract the graph." +msgstr "" +"当有很多死端时，为了加快速度，可以使用 :doc:`contraction-family` 函数来划分问" +"题。" -msgid "Using that information updating to the length of the geometries:" -msgstr "使用该信息更新几何形状的长度：" +msgid "Linear edges" +msgstr "线性边" -msgid "Which gives the following results:" -msgstr "给出以下结果：" +msgid "To get the linear edges:" +msgstr "要获得线性边：" msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." -msgstr "请注意，为了能够遵循文档示例，一切都基于原始图。" +"These linear vertices are correct, for example, when those the vertices are " +"speed bumps, stop signals and the application is taking them into account." +msgstr "" +"当这些顶点表示减速带、停止信号，并且应用程序将其纳入考虑时，这些线性顶点是正" +"确的。" -msgid "Returning to the original data:" -msgstr "回到原始数据：" +#, fuzzy +msgid "" +"When there are many linear vertices, that need not to be taken into account, " +"to speed up the processing, the :doc:`contraction-family` functions can be " +"used to contract the problem." +msgstr "" +"当线性边较多时，为了加快速度，可以使用 :doc:`contraction-family` 函数来划分问" +"题。" -msgid "Update costs based on codes" -msgstr "根据代码更新成本" +msgid "Function's structure" +msgstr "函数的结构" -msgid "Other datasets, can have a column with values like" -msgstr "其他数据集可以有一列包含如下值" +msgid "" +"Once the graph preparation work has been done above, it is time to use a" +msgstr "完成上述图准备工作后，就可以使用" -msgid "``FT`` vehicle flow on the direction of the geometry" -msgstr "``FT`` 几何方向上的车流" +msgid "The general form of a pgRouting function call is:" +msgstr "pgRouting 函数调用的一般形式是：" -msgid "``TF`` vehicle flow opposite of the direction of the geometry" -msgstr "``TF`` 车流与几何方向相反" +msgid "\\ \\" +msgstr "\\ \\" -msgid "``B`` vehicle flow on both directions" -msgstr "``B`` 双向车流" +msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgstr "" +"pgr_(`Inner queries`_ , **parameters**, [``Optional parameters``)" -msgid "Preparing a code column for the example:" -msgstr "为示例准备代码列：" +msgid "" +"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " +"containing SQL queries." +msgstr "`Inner queries`_ ：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" -msgid "Adjusting the costs based on the codes:" -msgstr "根据代码调整成本：" +msgid "" +"**parameters**: Additional compulsory parameters needed by the function." +msgstr "**parameters**：函数需要的附加强制参数。" -msgid "Check the Routing Topology" -msgstr "检查路由拓扑" +msgid "" +"``Optional parameters``: Are non compulsory **named** parameters that have a " +"default value when omitted." +msgstr "``Optional parameters`` ：是非强制命名参数，省略时具有默认值。" -msgid "There are lots of possible problems in a graph." -msgstr "图中可能存在很多问题。" +msgid "" +"The compulsory parameters are positional parameters, the optional parameters " +"are named parameters." +msgstr "强制参数是位置参数，可选参数是命名参数。" -msgid "The data used may not have been designed with routing in mind." -msgstr "使用的数据在设计时可能没有考虑路由。" +msgid "For example, for this :doc:`pgr_dijkstra` signature:" +msgstr "例如，对于这个 :doc:`pgr_dijkstra` 签名：" -msgid "A graph has some very specific requirements." -msgstr "图有一些非常具体的要求。" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "The graph is disconnected." -msgstr "该图已断开连接。" +msgid "`Edges SQL`_:" +msgstr "`Edges SQL`_:" -msgid "There are unwanted intersections." -msgstr "存在不需要的交叉点。" +msgid "Is the first parameter." +msgstr "是第一个参数。" -msgid "The graph is too large and needs to be contracted." -msgstr "图太大，需要收缩。" +msgid "It is compulsory." +msgstr "这是强制性的。" -msgid "A sub graph is needed for the application." -msgstr "该应用程序需要一个子图。" +msgid "It is an inner query." +msgstr "这是一个内部查询。" msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." -msgstr "以及 pgRouting 用户（即应用程序开发人员）可能遇到的许多其他问题。" +"It has no name, so **Edges SQL** gives an idea of what kind of inner query " +"needs to be used" +msgstr "它没有名称，因此 **Edges SQL** 给出了需要使用哪种内部查询的想法" -msgid "Crossing edges" -msgstr "交叉边" +msgid "**start vid**:" +msgstr "**start vid**:" -msgid "To get the crossing edges:" -msgstr "要获取交叉边：" +msgid "Is the second parameter." +msgstr "是第二个参数。" msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." -msgstr "这些信息是正确的，例如，就车辆而言，是隧道还是横跨另一条道路的桥梁。" +"It has no name, so **start vid** gives an idea of what the second " +"parameter's value should contain." +msgstr "它没有名称，因此 **start vid** 给出了第二个参数的值应包含的内容。" -msgid "It might be incorrect, for example:" -msgstr "它可能是不正确的，例如：" +msgid "Is the third parameter." +msgstr "是第三个参数。" msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." -msgstr "当它实际上是道路交叉口时，车辆可以转弯。" +"It has no name, so **end vid** gives an idea of what the third parameter's " +"value should contain" +msgstr "它没有名称，因此 **end vid** 给出了第三个参数的值应包含的内容" -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." -msgstr "在电力线路方面，电力线能够在隧道或桥梁上甚至切换道路。" +msgid "Is the fourth parameter." +msgstr "是第四个参数。" -msgid "When it is incorrect, it needs fixing:" -msgstr "当不正确时，需要修复：" +msgid "It is optional." +msgstr "是可选的。" -msgid "For vehicles and pedestrians" -msgstr "对于车辆和行人" +msgid "It has a name." +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." -msgstr "" -"如果数据来自 OSM 并使用 ``osm2pgrouting`` 导入到数据库，则需要在 `OSM portal " -"`__ 中完成修复并再次导入数据。" +"The full description of the parameters are found on the `Parameters`_ " +"section of each function." +msgstr "参数的完整描述可以在每个函数的 `Parameters`_ 部分找到。" -msgid "" -"In general when the data comes from a supplier that has the data prepared " -"for routing vehicles, and there is a problem, the data is to be fixed from " -"the supplier" -msgstr "" -"一般来说，当数据来自为车辆路线准备数据的供应商时，并且出现问题时，需要从供应" -"商处修复数据" +msgid "Function's overloads" +msgstr "函数的重载" -msgid "For very specific applications" -msgstr "对于非常具体的应用" +msgid "A function might have different overloads. The most common are called:" +msgstr "一个函数可能有不同的重载。 最常见的是：" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." -msgstr "从路线车辆或行人的角度来看，数据是正确的。" +msgid "`One to One`_" +msgstr "`一对一`_" -msgid "The data needs a local fix for the specific application." -msgstr "数据需要针对特定应用程序进行本地修复。" +msgid "`One to Many`_" +msgstr "`一对多`_" -msgid "" -"Once analyzed one by one the crossings, for the ones that need a local fix, " -"the edges need to be `split `__." -msgstr "" -"对交叉点进行一一分析后，对于需要局部修复的交叉点，需要 `分割 `__ 边。" +msgid "`Many to One`_" +msgstr "`多对一`_" -msgid "" -"The new edges need to be added to the edges table, the rest of the " -"attributes need to be updated in the new edges, the old edges need to be " -"removed and the routing topology needs to be updated." -msgstr "" -"需要将新边添加到边表中，需要更新新边中的其余属性，需要删除旧边并需要更新路由" -"拓扑。" +msgid "`Many to Many`_" +msgstr "`多对多`_" -msgid "Adding split edges" -msgstr "添加分割边" +msgid "`Combinations`_" +msgstr "`组合`_" -msgid "" -"For each pair of crossing edges a process similar to this one must be " -"performed." -msgstr "对于每一对交叉边，必须执行与此类似的过程。" +msgid "Depending on the overload the parameters types change." +msgstr "根据过载，参数类型会发生变化。" -msgid "" -"The columns inserted and the way are calculated are based on the " -"application. For example, if the edges have a trait **name**, then that " -"column is to be copied." -msgstr "" -"插入的列和计算方式取决于应用程序。 例如，如果边具有特征 **名称** ，则将复制该" -"列。" +msgid "**One**: **ANY-INTEGER**" +msgstr "**一**: **ANY-INTEGER**" -msgid "For pgRouting calculations" -msgstr "用于 pgRouting 计算" +msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" +msgstr "**多**: ``ARRAY`` [**ANY-INTEGER**]" msgid "" -"**factor** based on the position of the intersection of the edges can be " -"used to adjust the ``cost`` and ``reverse_cost`` columns." -msgstr "基于边相交位置的 **因子** 可用于调整 ``cost`` 和 ``reverse_cost`` 列。" +"Depending of the function the overloads may vary. But the concept of " +"parameter type change remains the same." +msgstr "根据函数的不同，重载可能会有所不同。 但参数类型改变的概念保持不变。" -msgid "" -"Capacity information, used in the :doc:`flow-family` functions does not need " -"to change when splitting edges." -msgstr "分割边时，在 :doc:`flow-family` 函数中使用的容量信息不需要改变。" +msgid "One to One" +msgstr "一对一" -msgid "Adding new vertices" -msgstr "添加新的顶点" +msgid "When routing from:" +msgstr "当路由来自：" -msgid "" -"After adding all the split edges required by the application, the newly " -"created vertices need to be added to the vertices table." -msgstr "添加应用程序所需的所有分割边后，需要将新创建的顶点添加到顶点表中。" +msgid "From **one** starting vertex" +msgstr "从 **一** 起始顶点" -msgid "Updating edges topology" -msgstr "更新边拓扑" +msgid "to **one** ending vertex" +msgstr "到 **一** 结束顶点" -msgid "Removing the surplus edges" -msgstr "去除多余的边" +msgid "One to Many" +msgstr "一对多" -msgid "" -"Once all significant information needed by the application has been " -"transported to the new edges, then the crossing edges can be deleted." -msgstr "一旦应用程序所需的所有重要信息都已传输到新边，则可以删除交叉边。" +msgid "to **many** ending vertices" +msgstr "到 **多** 结束顶点" -msgid "" -"There are other options to do this task, like creating a view, or a " -"materialized view." -msgstr "还有其他选项可以完成此任务，例如创建视图或物化视图。" +msgid "Many to One" +msgstr "多对一" -msgid "Updating vertices topology" -msgstr "更新顶点拓扑" +msgid "From **many** starting vertices" +msgstr "从 **多** 起始顶点" -msgid "To keep the graph consistent, the vertices topology needs to be updated" -msgstr "为了保持图的一致性，需要更新顶点拓扑" +msgid "Many to Many" +msgstr "多对多" -msgid "Checking for crossing edges" -msgstr "检查交叉边" +msgid "Combinations" +msgstr "组合" -msgid "There are no crossing edges on the graph." -msgstr "图上没有交叉边。" +msgid "From **many** different starting vertices" +msgstr "从 **多个** 不同的起始顶点" -msgid "Disconnected graphs" -msgstr "断开连接的图" +msgid "to **many** different ending vertices" +msgstr "到 **多个** 不同的结束顶点" -msgid "To get the graph connectivity:" -msgstr "要获取图的连通性：" +msgid "Every tuple specifies a pair of a start vertex and an end vertex" +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." -msgstr "" -"在此示例中，组件 :math:`2`由顶点 :math:`\\{2, 4\\}` 组成，并且两个顶点也是死" -"端结果集的一部分。" +msgid "Users can define the combinations as desired." +msgstr "用户可以根据需要定义组合。" -msgid "This graph needs to be connected." -msgstr "这个图需要连接起来。" +msgid "Needs a `Combinations SQL`_" +msgstr "需要 `Combinations SQL`_" msgid "" -"With the original graph of this documentation, there would be 3 components " -"as the crossing edge in this graph is a different component." -msgstr "对于本文档的原始图，将有 3 个组件，因为该图中的交叉边是不同的组件。" +"There are several kinds of valid inner queries and also the columns returned " +"are depending of the function. Which kind of inner query will depend on the " +"function's requirements. To simplify the variety of types, **ANY-INTEGER** " +"and **ANY-NUMERICAL** is used." +msgstr "" +"有几种有效的内部查询类型，返回的列也取决于函数。哪种类型的内部查询将取决于函" +"数的要求。为了简化类型的种类，使用了 **ANY-INTEGER**和**ANY-NUMERICAL**。" -msgid "Prepare storage for connection information" -msgstr "为连接信息准备存储" +msgid "Edges SQL for" +msgstr "边 SQL" -msgid "Save the vertices connection information" -msgstr "保存顶点连接信息" +msgid ":doc:`withPoints-family`" +msgstr ":doc:`withPoints-family`" -msgid "Save the edges connection information" -msgstr "保存边连接信息" +msgid "Some uncategorised functions" +msgstr "一些未分类的函数" -msgid "Get the closest vertex" -msgstr "获取最近的顶点" +msgid "General without ``id``" +msgstr "一般没有 ``id``" -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`." -msgstr "" -"使用 :doc:`pgr_findCloseEdges` 距离组件 :math:`1` 最近的顶点是顶点 :math:" -"`4`。 距离顶点 :math:`4` 最近的边是 边 :math:`14`。" +msgid "General with (X,Y)" +msgstr "通常带有（X,Y)" msgid "" -"The ``edge`` can be used to connect the components, using the ``fraction`` " -"information about the edge :math:`14` to split the connecting edge." -msgstr "" -"``edge``可用于连接组件，利用边 :math:`14` 的``fraction`` 信息来分割连接边。" +"When negative: edge (``source``, ``target``) does not exist, therefore it's " +"not part of the graph." +msgstr "当为负时：边（``source``, ``target``）不存在，因此它不是图的一部分。" -msgid "Connecting components" -msgstr "连接组件" +msgid "Weight of the edge (``target``, ``source``)," +msgstr "边 (``target``, ``source``)的权重，" -msgid "There are three basic ways to connect the components" -msgstr "连接组件有三种基本方法" +msgid "``x1``" +msgstr "``x1``" -msgid "From the vertex to the starting point of the edge" -msgstr "从顶点到边的起点" +msgid "X coordinate of ``source`` vertex." +msgstr "``source`` 顶点的X坐标。" -msgid "From the vertex to the ending point of the edge" -msgstr "从顶点到边的终点" +msgid "``y1``" +msgstr "``y1``" -msgid "From the vertex to the closest vertex on the edge" -msgstr "从边上的顶点到最近的顶点" +msgid "Y coordinate of ``source`` vertex." +msgstr "``source`` 顶点的Y坐标。" -msgid "This solution requires the edge to be split." -msgstr "该解决方案需要将边缘分割。" +msgid "``x2``" +msgstr "``x2``" -msgid "The following query shows the three ways to connect the components:" -msgstr "以下查询显示了连接组件的三种方式：" +msgid "X coordinate of ``target`` vertex." +msgstr "``target`` 顶点的X坐标。" -msgid "Checking components" -msgstr "检查组件" +msgid "``y2``" +msgstr "``y2``" -msgid "" -"Ignoring the edge that requires further work. The graph is now fully " -"connected as there is only one component." -msgstr "忽略需要进一步工作的边缘。 该图现在已完全连接，因为只有一个组件。" +msgid "Y coordinate of ``target`` vertex." +msgstr "``target`` 顶点的Y坐标。" -msgid "Contraction of a graph" -msgstr "图的收缩" +msgid "Flow" +msgstr "流" -msgid "The graph can be reduced in size using :doc:`contraction-family`" -msgstr "可以使用 :doc:`contraction-family` 来减小图形的大小" +msgid "Edges SQL for :doc:`flow-family`" +msgstr "用于流数据系列 ( :doc:`flow-family`) 的Edges SQL" + +msgid "Edges SQL for the following functions of :doc:`flow-family`" +msgstr "Edges SQL 适用于 :doc:`flow-family` 的以下函数" + +msgid "Used in combination signatures" +msgstr "结合签名使用" + +msgid "Points SQL for" +msgstr "用于Points SQL" msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." -msgstr "" -"何时收缩将取决于图的大小、处理时间、数据的正确性、最终应用程序或任何其他未提" -"及的因素。" +"The main parameter of the majority of the pgRouting functions is a query " +"that selects the edges of the graph." +msgstr "大多数 pgRouting 函数的主要参数是选择图的边的查询。" msgid "" -"A fairly good method of finding out if contraction can be useful is because " -"of the number of dead ends and/or the number of linear edges." -msgstr "确定收缩是否有用的一个相当好的方法是根据死端的数量和/或线性边的数量。" +"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 "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" +"The compulsory parameters are nameless and must be given in the required " +"order. The optional parameters are named parameters and will have a default " +"value." msgstr "" -"有关如何收缩以及如何使用收缩图的完整方法在 :doc:`contraction-family` 中进行了" -"描述" +"强制参数是无名的，并且必须按要求的顺序给出。 可选参数是命名参数，并且具有默认" +"值。" -msgid "Dead ends" -msgstr "死端" +msgid "Parameters for the Via functions" +msgstr "Via 函数的参数" -msgid "To get the dead ends:" -msgstr "获取死端：" +msgid "SQL query as described." +msgstr "如所述的 SQL 查询。" -msgid "" -"That information is correct, for example, when the dead end is on the limit " -"of the imported graph." -msgstr "例如，当死端位于导入图的极限时，该信息是正确的。" +msgid "When ``true`` Graph is considered `Directed`" +msgstr "当为 ``true`` 时，图被视为`有向`图" -msgid "" -"Visually node :math:`4` looks to be as start/ending of 3 edges, but it is " -"not." -msgstr "" -"从视觉上看，节点 :math:`4` 看起来是 3 条边的开始/结束，但事实并非如此。" +msgid "When ``false`` the graph is considered as Undirected." +msgstr "当为 ``false`` 时，图被视为无向图。" -msgid "Is that correct?" -msgstr "那是对的吗？" +msgid "``strict``" +msgstr "``strict``" -msgid "Is there such a small curb:" -msgstr "有这么小的路边吗：" +msgid "``false``" +msgstr "``false``" -msgid "That does not allow a vehicle to use that visual intersection?" -msgstr "这不允许车辆使用该视觉交叉路口？" +msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" +msgstr "当为 ``true`` 时，如果路径丢失，则停止并返回 **EMPTY SET**" + +msgid "When ``false`` ignores missing paths returning all paths found" +msgstr "当 ``false`` 忽略丢失的路径时，返回找到的所有路径" + +msgid "``U_turn_on_edge``" +msgstr "``U_turn_on_edge``" msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" -msgstr "是否适用于行人，因此行人可以轻松地在小路边行走？" +"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 "" +"当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话" +"说，允许使用具有相同标识符的边来进行掉头。" msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" -msgstr "电力和电线的应用是否可以轻松地延伸到小路边顶部？" +"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 "" +"当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，" +"只有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" + +msgid "For the TRSP functions" +msgstr "对于 TRSP 函数" + +msgid "Array of identifiers of destination vertices." +msgstr "目标顶点的标识符数组。" msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" -msgstr "是否有一个大悬崖，从鹰的角度看，死胡同靠近该路段？" +"There are several kinds of columns returned are depending of the function." +msgstr "根据函数的不同，返回的列有多种。" + +msgid "Result columns for a path" +msgstr "路径的结果列" + +msgid "Used in functions that return one path solution" +msgstr "在返回一个路径解的函数中使用" msgid "" -"When there are many dead ends, to speed up, the :doc:`contraction-family` " -"functions can be used to divide the problem." +"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " +"agg_cost)``" msgstr "" -"当有很多死端时，为了加快速度，可以使用 :doc:`contraction-family` 函数来划分问" -"题。" +"返回 ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " +"agg_cost)`` 的集合" -msgid "Linear edges" -msgstr "线性边" +msgid "``path_seq``" +msgstr "``path_seq``" -msgid "To get the linear edges:" -msgstr "要获得线性边：" +msgid "" +"Relative position in the path. Has value **1** for the beginning of a path." +msgstr "路径中的相对位置。 路径开头的值为 **1**。" msgid "" -"This information is correct, for example, when the application is taking " -"into account speed bumps, stop signals." -msgstr "例如，当应用程序考虑减速带、停止信号时，此信息是正确的。" +"Identifier of the starting vertex. Returned when multiple starting vetrices " +"are in the query." +msgstr "起始顶点的标识符。 当查询中有多个起始向量时返回。" msgid "" -"When there are many linear edges, to speed up, the :doc:`contraction-family` " -"functions can be used to divide the problem." -msgstr "" -"当线性边较多时，为了加快速度，可以使用 :doc:`contraction-family` 函数来划分问" -"题。" +"Identifier of the ending vertex. Returned when multiple ending vertices are " +"in the query." +msgstr "结束顶点的标识符。 当查询中有多个结束顶点时返回。" -msgid "Function's structure" -msgstr "函数的结构" +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." +msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符。" msgid "" -"Once the graph preparation work has been done above, it is time to use a" -msgstr "完成上述图准备工作后，就可以使用" +"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 "" +"用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后" +"一个节点。" -msgid "The general form of a pgRouting function call is:" -msgstr "pgRouting 函数调用的一般形式是：" +msgid "" +"Cost to traverse from ``node`` using ``edge`` to the next node in the path " +"sequence." +msgstr "从使用 ``edge`` 的 ``node`` 遍历到路径序列中的下一个节点的成本。" -msgid "\\ \\" -msgstr "\\ \\" +msgid "Used in functions the following:" +msgstr "用于以下函数：" -msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgid "" +"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " +"agg_cost)``" msgstr "" -"pgr_(`Inner queries`_ , **parameters**, [``Optional parameters``)" +"返回 ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " +"agg_cost)`` 的集合" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." -msgstr "`Inner queries`_ ：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" +msgid "Relative position in the path." +msgstr "路径中的相对位置。" -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." -msgstr "**parameters**：函数需要的附加强制参数。" +msgid "**1** For the first row of the path." +msgstr "**1** 对于路径的第一行。" -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." -msgstr "``Optional parameters`` ：是非强制命名参数，省略时具有默认值。" +msgid "``start_pid``" +msgstr "``start_pid``" -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." -msgstr "强制参数是位置参数，可选参数是命名参数。" +msgid "Identifier of a starting vertex/point of the path." +msgstr "路径起始顶点/点的标识符。" -msgid "For example, for this :doc:`pgr_dijkstra` signature:" -msgstr "例如，对于这个 :doc:`pgr_dijkstra` 签名：" +msgid "When positive is the identifier of the starting vertex." +msgstr "当正数时是起始顶点的标识符。" -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "When negative is the identifier of the starting point." +msgstr "当负数时是起点的标识符。" -msgid "`Edges SQL`_:" -msgstr "`Edges SQL`_:" +msgid "Returned on `Many to One`_ and `Many to Many`_" +msgstr "`多对一`_ 和 `多对多`_ 的返回值" -msgid "Is the first parameter." -msgstr "是第一个参数。" +msgid "``end_pid``" +msgstr "``end_pid``" -msgid "It is compulsory." -msgstr "这是强制性的。" +msgid "Identifier of an ending vertex/point of the path." +msgstr "路径结束顶点/点的标识符。" -msgid "It is an inner query." -msgstr "这是一个内部查询。" +msgid "When positive is the identifier of the ending vertex." +msgstr "当正数时是结束顶点的标识符。" -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" -msgstr "它没有名称，因此 **Edges SQL** 给出了需要使用哪种内部查询的想法" +msgid "When negative is the identifier of the ending point." +msgstr "当负数时是终点的标识符。" -msgid "**start vid**:" -msgstr "**start vid**:" +msgid "Returned on `One to Many`_ and `Many to Many`_" +msgstr "返回 `一对多`_ 和 `多对多`_" -msgid "Is the second parameter." -msgstr "是第二个参数。" +msgid "Identifier of the node in the path from ``start_pid`` to ``end_pid``." +msgstr "从 ``start_pid`` 到 ``end_pid`` 路径中节点的标识符。" -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." -msgstr "它没有名称，因此 **start vid** 给出了第二个参数的值应包含的内容。" +msgid "When positive is the identifier of the a vertex." +msgstr "当正数时是顶点的标识符。" -msgid "Is the third parameter." -msgstr "是第三个参数。" +msgid "When negative is the identifier of the a point." +msgstr "当负数时是a点的标识符。" msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" -msgstr "它没有名称，因此 **end vid** 给出了第三个参数的值应包含的内容" +"Identifier of the edge used to go from ``node`` to the next node in the path " +"sequence." +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。" -msgid "Is the fourth parameter." -msgstr "是第四个参数。" +msgid "**-1** for the last row of the path." +msgstr "**-1** 表示路径的最后一行。" -msgid "It is optional." -msgstr "是可选的。" +msgid "**0** For the first row of the path." +msgstr "**0** 表示路径的第一行。" -msgid "It has a name." -msgstr "它有一个名字。" +msgid ":doc:`pgr_dijkstraNear`" +msgstr ":doc:`pgr_dijkstraNear`" msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." -msgstr "参数的完整描述可以在每个函数的 `Parameters`_ 部分找到。" - -msgid "Function's overloads" -msgstr "函数的重载" - -msgid "A function might have different overloads. The most common are called:" -msgstr "一个函数可能有不同的重载。 最常见的是：" +"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" +msgstr "" +"返回 ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" -msgid "`One to One`_" -msgstr "`一对一`_" +msgid "Identifier of the starting vertex of the current path." +msgstr "当前路径起始顶点的标识符。" -msgid "`One to Many`_" -msgstr "`一对多`_" +msgid "Identifier of the ending vertex of the current path." +msgstr "当前路径结束顶点的标识符。" -msgid "`Many to One`_" -msgstr "`多对一`_" +msgid "Multiple paths" +msgstr "多条路径" -msgid "`Many to Many`_" -msgstr "`多对多`_" +msgid "Selective for multiple paths." +msgstr "多路径选择性。" -msgid "`Combinations`_" -msgstr "`组合`_" +msgid "The columns depend on the function call." +msgstr "这些列取决于函数调用。" -msgid "Depending on the overload the parameters types change." -msgstr "根据过载，参数类型会发生变化。" +msgid "" +"Set of ``(seq, path_id, path_seq [, start_vid] [, end_vid], node, edge, " +"cost, agg_cost)``" +msgstr "" +"``(seq, path_id, path_seq [, start_vid] [, end_vid], node, edge, cost, " +"agg_cost)`` 集合" -msgid "**One**: **ANY-INTEGER**" -msgstr "**一**: **ANY-INTEGER**" +msgid "``path_id``" +msgstr "``path_id``" -msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" -msgstr "**多**: ``ARRAY`` [**ANY-INTEGER**]" +msgid "Path identifier." +msgstr "路径标识符。" msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." -msgstr "根据函数的不同，重载可能会有所不同。 但参数类型改变的概念保持不变。" - -msgid "One to One" -msgstr "一对一" +"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1** 。" -msgid "When routing from:" -msgstr "当路由来自：" +msgid "Non selective for multiple paths" +msgstr "多路径非选择性" -msgid "From **one** starting vertex" -msgstr "从 **一** 起始顶点" +msgid "Regardless of the call, al the columns are returned." +msgstr "无论调用如何，都会返回所有列。" -msgid "to **one** ending vertex" -msgstr "到 **一** 结束顶点" +msgid "" +"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, " +"cost, agg_cost)``" +msgstr "" +"返回集合``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, " +"agg_cost)``" -msgid "One to Many" -msgstr "一对多" +msgid "Result columns for cost functions" +msgstr "成本函数结果列" -msgid "to **many** ending vertices" -msgstr "到 **多** 结束顶点" +msgid "Used in the following" +msgstr "用于以下函数" -msgid "Many to One" -msgstr "多对一" +msgid "" +"When start_vid or end_vid columns have negative values, the identifier is " +"for a Point." +msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" -msgid "From **many** starting vertices" -msgstr "从 **多** 起始顶点" +msgid "Result columns for flow functions" +msgstr "流量函数的结果列" -msgid "Many to Many" -msgstr "多对多" +msgid "Edges SQL for the following" +msgstr "Edges SQL 适用于以下内容" -msgid "Combinations" -msgstr "组合" +msgid "Result columns for spanning tree functions" +msgstr "生成树函数的结果列" -msgid "From **many** different starting vertices" -msgstr "从 **多个** 不同的起始顶点" +msgid "Returns set of ``(edge, cost)``" +msgstr "返回集合 ``(edge, cost)``" -msgid "to **many** different ending vertices" -msgstr "到 **多个** 不同的结束顶点" +msgid "Cost to traverse the edge." +msgstr "穿越边的成本。" -msgid "Every tuple specifies a pair of a start vertex and an end vertex" -msgstr "每个元组指定一对起始顶点和结束顶点" +msgid "Performance Tips" +msgstr "性能技巧" -msgid "Users can define the combinations as desired." -msgstr "用户可以根据需要定义组合。" +msgid "For the Routing functions" +msgstr "对于路由功能" -msgid "Needs a `Combinations SQL`_" -msgstr "需要 `Combinations SQL`_" +msgid "" +"To get faster results bound the queries to an area of interest of routing." +msgstr "为了获得更快的结果，将查询绑定到路由感兴趣的区域。" -#, 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 the variety of types, **ANY-INTEGER** " -"and **ANY-NUMERICAL** is used." +"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 "" -"有多种有效的内部查询，返回的列也取决于函数。 哪种内部查询取决于函数的要求。 " -"为了简化各种类型，使用 **ANY-INTEGER** 和 **ANY-NUMERICAL** 。" - -msgid "Edges SQL for" -msgstr "边 SQL" +"在此示例中，使用内部查询 SQL，该 SQL 不包括路由函数中的某些边并且位于结果区域" +"内。" -msgid ":doc:`withPoints-family`" -msgstr ":doc:`withPoints-family`" +#, fuzzy +msgid "Given this area:" +msgstr "给定车辆：" -msgid "Some uncategorised functions" -msgstr "一些未分类的函数" +#, fuzzy +msgid "Calculate a route:" +msgstr "计算所有列" -msgid "General without ``id``" -msgstr "一般没有 ``id``" +msgid "How to contribute" +msgstr "如何贡献" -msgid "General with (X,Y)" -msgstr "通常带有（X,Y)" +msgid "Wiki" +msgstr "维基" msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." -msgstr "当为负时：边（``source``, ``target``）不存在，因此它不是图的一部分。" - -msgid "Weight of the edge (``target``, ``source``)," -msgstr "边 (``target``, ``source``)的权重，" +"Edit an existing `pgRouting Wiki `__ page." +msgstr "" +"编辑现有的 `pgRouting 维基 `__ " +"页面。" -msgid "``x1``" -msgstr "``x1``" +msgid "Or create a new Wiki page" +msgstr "或者创建一个新的维基 页面" -msgid "X coordinate of ``source`` vertex." -msgstr "``source`` 顶点的X坐标。" +msgid "" +"Create a page on the `pgRouting Wiki `__" +msgstr "" +"在 `pgRouting 维基 `__ 上创建页" +"面" -msgid "``y1``" -msgstr "``y1``" +msgid "Give the title an appropriate name" +msgstr "给标题起一个合适的名称" -msgid "Y coordinate of ``source`` vertex." -msgstr "``source`` 顶点的Y坐标。" +msgid "" +"`Example `__" +msgstr "" +"`示例 `__" -msgid "``x2``" -msgstr "``x2``" +#, fuzzy +msgid "Adding Functionality to pgRouting" +msgstr "向 pgRouting 添加功能" -msgid "X coordinate of ``target`` vertex." -msgstr "``target`` 顶点的X坐标。" +msgid "" +"Consult the `developer's documentation `__" +msgstr "查阅`开发者文档 `__" -msgid "``y2``" -msgstr "``y2``" +msgid "Installation" +msgstr "安装" -msgid "Y coordinate of ``target`` vertex." -msgstr "``target`` 顶点的Y坐标。" +msgid ":ref:`install-short`" +msgstr ":ref:`install-short`" -msgid "Flow" -msgstr "流" +msgid ":ref:`install_get_sources`" +msgstr ":ref:`install_get_sources`" -msgid "Edges SQL for :doc:`flow-family`" -msgstr "用于流数据系列 ( :doc:`flow-family`) 的Edges SQL" +msgid ":ref:`install_enable_db`" +msgstr ":ref:`install_enable_db`" -msgid "Edges SQL for the following functions of :doc:`flow-family`" -msgstr "Edges SQL 适用于 :doc:`flow-family` 的以下函数" +msgid ":ref:`install_dependencies`" +msgstr ":ref:`install_dependencies`" -msgid "Used in combination signatures" -msgstr "结合签名使用" +msgid ":ref:`install_configuring`" +msgstr ":ref:`install_configuring`" -msgid "Points SQL for" -msgstr "用于Points SQL" +msgid ":ref:`install_build`" +msgstr ":ref:`install_build`" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." -msgstr "大多数 pgRouting 函数的主要参数是选择图的边的查询。" +msgid ":ref:`install_testing`" +msgstr ":ref:`install_testing`" msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." +"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 "" -"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." +"To use pgRouting PostGIS needs to be installed, please read the information " +"about installation in this `Install Guide `__" msgstr "" -"强制参数是无名的，并且必须按要求的顺序给出。 可选参数是命名参数，并且具有默认" -"值。" - -msgid "Parameters for the Via functions" -msgstr "Via 函数的参数" - -msgid ":doc:`pgr_dijkstraVia`" -msgstr ":doc:`pgr_dijkstraVia`" - -msgid "SQL query as described." -msgstr "如所述的 SQL 查询。" +"使用pgRouting需要安装PostGIS，请阅读本 `安装指南 `__ 中有关安装的信息" -msgid "When ``true`` Graph is considered `Directed`" -msgstr "当为 ``true`` 时，图被视为`有向`图" +msgid "Short Version" +msgstr "简洁版本" -msgid "When ``false`` the graph is considered as Undirected." -msgstr "当为 ``false`` 时，图被视为无向图。" +msgid "Extracting the tar ball" +msgstr "解压 tar 压缩文件" -msgid "``strict``" -msgstr "``strict``" +msgid "To compile assuming you have all the dependencies in your search path:" +msgstr "假设您的搜索路径中有所有依赖项，则进行编译：" -msgid "``false``" -msgstr "``false``" +msgid "" +"Once pgRouting is installed, it needs to be enabled in each individual " +"database you want to use it in." +msgstr "安装 pgRouting 后，需要在您想要使用它的每个数据库中启用它。" -msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" -msgstr "当为 ``true`` 时，如果路径丢失，则停止并返回 **EMPTY SET**" +msgid "Get the sources" +msgstr "获取来源" -msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "当 ``false`` 忽略丢失的路径时，返回找到的所有路径" +msgid "" +"The pgRouting latest release can be found in https://github.com/pgRouting/" +"pgrouting/releases/latest" +msgstr "" +"pgRouting 最新版本可以在 https://github.com/pgRouting/pgrouting/releases/" +"latest 中找到" -msgid "``U_turn_on_edge``" -msgstr "``U_turn_on_edge``" +msgid "To download this release:" +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." +"Go to :ref:`install-short` for more instructions on extracting tar ball and " +"compiling pgRouting." msgstr "" -"当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话" -"说，允许使用具有相同标识符的边来进行掉头。" +"转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。" + +msgid "git" +msgstr "git" + +msgid "To download the repository" +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." +"Go to :ref:`install-short` for more instructions on compiling pgRouting " +"(there is no tar ball involved while downloading pgRouting repository from " +"GitHub)." msgstr "" -"当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，" -"只有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" +"请参阅 :ref:`install-short` 获取有关编译 pgRouting 的更多说明（从 GitHub 下" +"载 pgRouting 存储库时不涉及 tar 文件）。" -msgid "For the TRSP functions" -msgstr "对于 TRSP 函数" +msgid "Enabling and upgrading in the database" +msgstr "在数据库中启用和升级" -msgid ":doc:`pgr_trsp`" -msgstr ":doc:`pgr_trsp`" +msgid "Enabling the database" +msgstr "启用数据库" -msgid "Array of identifiers of destination vertices." -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." +msgstr "" +"pgRouting 是 PostgreSQL 扩展，依赖 PostGIS 向最终用户提供功能。 下面给出的代" +"码演示了在数据库中启用 PostGIS 和 pgRouting。" msgid "" -"There are several kinds of columns returned are depending of the function." -msgstr "根据函数的不同，返回的列有多种。" +"Checking PostGIS and pgRouting version after enabling them in the database." +msgstr "在数据库中启用 PostGIS 和 pgRouting 后检查它们的版本。" -msgid "Result columns for a path" -msgstr "路径的结果列" +msgid "Upgrading the database" +msgstr "升级数据库" -msgid "Used in functions that return one path solution" -msgstr "在返回一个路径解的函数中使用" +msgid "" +"To upgrade pgRouting in the database to version 4.0.0 use the following " +"command:" +msgstr "要将数据库中的 pgRouting 升级到 4.0.0 版本，请使用以下命令：" msgid "" -"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " -"agg_cost)``" +"More information can be found in https://www.postgresql.org/docs/current/sql-" +"createextension.html" msgstr "" -"返回 ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " -"agg_cost)`` 的集合" - -msgid "``path_seq``" -msgstr "``path_seq``" +"更多信息可以在 https://www.postgresql.org/docs/current/sql-createextension." +"html 中找到" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." -msgstr "路径中的相对位置。 路径开头的值为 **1**。" +msgid "Dependencies" +msgstr "依赖" -msgid "" -"Identifier of the starting vertex. Returned when multiple starting vetrices " -"are in the query." -msgstr "起始顶点的标识符。 当查询中有多个起始向量时返回。" +msgid "Compilation Dependencies" +msgstr "编译依赖" msgid "" -"Identifier of the ending vertex. Returned when multiple ending vertices are " -"in the query." -msgstr "结束顶点的标识符。 当查询中有多个结束顶点时返回。" +"To be able to compile pgRouting, make sure that the following dependencies " +"are met:" +msgstr "为了能够编译 pgRouting，请确保满足以下依赖项：" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." -msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符。" +msgid "C and C++0x compilers" +msgstr "C 和 C++0x编译器" 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." +"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " +"or C++11 standard support" msgstr "" -"用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后" -"一个节点。" +"使用 Boost 1.56 到 Boost 1.74 进行编译需要具有 C++03 或 C++ 11 标准支持的 C +" +"+编译器" msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." -msgstr "从使用 ``edge`` 的 ``node`` 遍历到路径序列中的下一个节点的成本。" - -msgid "Used in functions the following:" -msgstr "用于以下函数：" - -msgid ":doc:`pgr_withPoints`" -msgstr ":doc:`pgr_withPoints`" +"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" -msgid "" -"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " -"agg_cost)``" -msgstr "" -"返回 ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " -"agg_cost)`` 的集合" +msgid "Postgresql version = Supported versions by PostgreSQL" +msgstr "Postgresql 版本 = PostgreSQL 支持的版本" -msgid "Relative position in the path." -msgstr "路径中的相对位置。" +msgid "The Boost Graph Library (BGL). Version >= 1.56" +msgstr "Boost 图库 (BGL)。 版本 >= 1.56" -msgid "**1** For the first row of the path." -msgstr "**1** 对于路径的第一行。" +msgid "CMake >= 3.2" +msgstr "CMake >= 3.2" -msgid "``start_pid``" -msgstr "``start_pid``" +msgid "optional dependencies" +msgstr "可选的依赖项" -msgid "Identifier of a starting vertex/point of the path." -msgstr "路径起始顶点/点的标识符。" +msgid "For user's documentation" +msgstr "用于用户文档" -msgid "When positive is the identifier of the starting vertex." -msgstr "当正数时是起始顶点的标识符。" +msgid "Sphinx >= 1.1" +msgstr "Sphinx >= 1.1" -msgid "When negative is the identifier of the starting point." -msgstr "当负数时是起点的标识符。" +msgid "Latex" +msgstr "Latex" -msgid "Returned on `Many to One`_ and `Many to Many`_" -msgstr "`多对一`_ 和 `多对多`_ 的返回值" +msgid "For developer's documentation" +msgstr "对于开发者文档" -msgid "``end_pid``" -msgstr "``end_pid``" +msgid "Doxygen >= 1.7" +msgstr "Doxygen >= 1.7" -msgid "Identifier of an ending vertex/point of the path." -msgstr "路径结束顶点/点的标识符。" +msgid "For testing" +msgstr "供测试用" -msgid "When positive is the identifier of the ending vertex." -msgstr "当正数时是结束顶点的标识符。" +msgid "pgtap" +msgstr "pgtap" -msgid "When negative is the identifier of the ending point." -msgstr "当负数时是终点的标识符。" +msgid "pg_prove" +msgstr "pg_prove" -msgid "Returned on `One to Many`_ and `Many to Many`_" -msgstr "返回 `一对多`_ 和 `多对多`_" +msgid "For using:" +msgstr "用于使用：" -msgid "Identifier of the node in the path from ``start_pid`` to ``end_pid``." -msgstr "从 ``start_pid`` 到 ``end_pid`` 路径中节点的标识符。" +msgid "PostGIS version >= 2.2" +msgstr "PostGIS版本 >= 2.2" -msgid "When positive is the identifier of the a vertex." -msgstr "当正数时是顶点的标识符。" +msgid "Example: Installing dependencies on linux" +msgstr "示例：在 Linux 上安装依赖项" -msgid "When negative is the identifier of the a point." -msgstr "当负数时是a点的标识符。" +msgid "Installing the compilation dependencies" +msgstr "安装编译依赖项" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." -msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。" +msgid "Database dependencies" +msgstr "数据库依赖" -msgid "**-1** for the last row of the path." -msgstr "**-1** 表示路径的最后一行。" +msgid "Configuring PostgreSQL" +msgstr "配置 PostgreSQL" -msgid "**0** For the first row of the path." -msgstr "**0** 表示路径的第一行。" +msgid "Entering psql console" +msgstr "进入psql控制台" -msgid ":doc:`pgr_dijkstraNear`" -msgstr ":doc:`pgr_dijkstraNear`" +msgid "To exit psql console" +msgstr "退出 psql 控制台" msgid "" -"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" -msgstr "" -"返回 ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" +"Entering psql console directly without switching roles can be done by the " +"following commands" +msgstr "直接进入psql控制台，无需切换角色，可以通过以下命令完成" -msgid "Identifier of the starting vertex of the current path." -msgstr "当前路径起始顶点的标识符。" +msgid "Then use the above given method to exit out of the psql console" +msgstr "然后使用上面给出的方法退出psql控制台" -msgid "Identifier of the ending vertex of the current path." -msgstr "当前路径结束顶点的标识符。" +msgid "Checking PostgreSQL version" +msgstr "检查 PostgreSQL 版本" -msgid "Multiple paths" -msgstr "多条路径" +msgid "or" +msgstr "或者" -msgid "Selective for multiple paths." -msgstr "多路径选择性。" +msgid "Enter the psql console using above given method and then enter" +msgstr "使用上面给定的方法进入psql控制台，然后输入" -msgid "The columns depend on the function call." -msgstr "这些列取决于函数调用。" +msgid "Creating PostgreSQL role" +msgstr "创建 PostgreSQL 角色" msgid "" -"Set of ``(seq, path_id, path_seq [, start_vid] [, end_vid], node, edge, " -"cost, agg_cost)``" +"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 "" -"``(seq, path_id, path_seq [, start_vid] [, end_vid], node, edge, cost, " -"agg_cost)`` 集合" - -msgid "``path_id``" -msgstr "``path_id``" - -msgid "Path identifier." -msgstr "路径标识符。" +"PostgreSQL 提供的默认角色是 postgres。 要创建新角色，您可以使用上面提供的命" +"令。 提示将要求用户输入角色名称，然后提供确认。 继续执行这些步骤，您将成功创" +"建 PostgreSQL 角色。" msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." -msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1** 。" - -msgid "Non selective for multiple paths" -msgstr "多路径非选择性" - -msgid "Regardless of the call, al the columns are returned." -msgstr "无论调用如何，都会返回所有列。" +"To add password to the role or change previously created password of the " +"role use the following commands" +msgstr "要向角色添加密码或更改之前创建的角色密码，请使用以下命令" msgid "" -"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, " -"cost, agg_cost)``" +"To get additional details on the flags associated with ``createuser`` below " +"given command can be used" msgstr "" -"返回集合``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, " -"agg_cost)``" - -msgid "Result columns for cost functions" -msgstr "成本函数结果列" +"要获取与下面的 ``createuser`` 相关的标志的更多详细信息，可以使用给定的命令" -msgid "Used in the following" -msgstr "用于以下函数" +msgid "Creating Database in PostgreSQL" +msgstr "在 PostgreSQL 中创建数据库" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." -msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" +msgid "Connecting to a PostgreSQL Database" +msgstr "连接到 PostgreSQL 数据库" -msgid "Result columns for flow functions" -msgstr "流量函数的结果列" +msgid "Enter the psql console and type the following commands" +msgstr "进入psql控制台，输入以下命令" -msgid "Edges SQL for the following" -msgstr "Edges SQL 适用于以下内容" +msgid "Build dependencies" +msgstr "构建依赖关系" -msgid "Result columns for spanning tree functions" -msgstr "生成树函数的结果列" +msgid "Optional dependencies" +msgstr "可选依赖项" -msgid "Returns set of ``(edge, cost)``" -msgstr "返回集合 ``(edge, cost)``" +msgid "For documentation and testing" +msgstr "用于文档和测试" -msgid "Cost to traverse the edge." -msgstr "穿越边的成本。" +msgid "Configuring" +msgstr "配置" -msgid "Performance Tips" -msgstr "性能技巧" +msgid "pgRouting uses the `cmake` system to do the configuration." +msgstr "pgRouting 使用 `cmake` 系统进行配置。" -msgid "For the Routing functions" -msgstr "对于路由功能" +msgid "The build directory is different from the source directory" +msgstr "构建目录与源目录不同" -msgid "" -"To get faster results bound the queries to an area of interest of routing." -msgstr "为了获得更快的结果，将查询绑定到路由感兴趣的区域。" +msgid "Create the build directory" +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." -msgstr "" -"在此示例中，使用内部查询 SQL，该 SQL 不包括路由函数中的某些边并且位于结果区域" -"内。" +msgid "Configurable variables" +msgstr "可配置变量" -msgid "How to contribute" -msgstr "如何贡献" +msgid "To see the variables that can be configured" +msgstr "查看可以配置的变量" -msgid "Wiki" -msgstr "维基" +msgid "Configuring The Documentation" +msgstr "配置文档" msgid "" -"Edit an existing `pgRouting Wiki `__ page." -msgstr "" -"编辑现有的 `pgRouting 维基 `__ " -"页面。" - -msgid "Or create a new Wiki page" -msgstr "或者创建一个新的维基 页面" +"Most of the effort of the documentation has been on the HTML files. Some " +"variables for building documentation:" +msgstr "文档的大部分工作都集中在 HTML 文件上。 构建文档的一些变量：" -msgid "" -"Create a page on the `pgRouting Wiki `__" -msgstr "" -"在 `pgRouting 维基 `__ 上创建页" -"面" +msgid "Variable" +msgstr "变量" -msgid "Give the title an appropriate name" -msgstr "给标题起一个合适的名称" +msgid "Comment" +msgstr "解释" -msgid "" -"`Example `__" -msgstr "" -"`示例 `__" +msgid "WITH_DOC" +msgstr "WITH_DOC" -msgid "Adding Functionaity to pgRouting" -msgstr "向 pgRouting 添加功能" +msgid "BOOL=OFF" +msgstr "BOOL=OFF" -msgid "" -"Consult the `developer's documentation `__" -msgstr "查阅`开发者文档 `__" +msgid "Turn on/off building the documentation" +msgstr "打开/关闭构建文档" -msgid "Installation" -msgstr "安装" +msgid "BUILD_HTML" +msgstr "BUILD_HTML" -msgid ":ref:`install-short`" -msgstr ":ref:`install-short`" +msgid "BOOL=ON" +msgstr "BOOL=ON" -msgid ":ref:`install_get_sources`" -msgstr ":ref:`install_get_sources`" +msgid "If ON, turn on/off building HTML for user's documentation" +msgstr "如果打开，则打开/关闭为用户文档构建 HTML" -msgid ":ref:`install_enable_db`" -msgstr ":ref:`install_enable_db`" +msgid "BUILD_DOXY" +msgstr "BUILD_DOXY" -msgid ":ref:`install_dependencies`" -msgstr ":ref:`install_dependencies`" +msgid "If ON, turn on/off building HTML for developer's documentation" +msgstr "如果打开，则打开/关闭为开发人员文档构建 HTML" -msgid ":ref:`install_configuring`" -msgstr ":ref:`install_configuring`" +msgid "BUILD_LATEX" +msgstr "BUILD_LATEX" -msgid ":ref:`install_build`" -msgstr ":ref:`install_build`" +msgid "If ON, turn on/off building PDF" +msgstr "如果打开，则打开/关闭构建 PDF" -msgid ":ref:`install_testing`" -msgstr ":ref:`install_testing`" +msgid "BUILD_MAN" +msgstr "BUILD_MAN" -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 `__" -msgstr "" -"有关下载和安装适用于不同操作系统的二进制文件的说明、本文档中未包含的其他注释" -"和更正，可以在 `安装维基 `__ 中找到" +msgid "If ON, turn on/off building MAN pages" +msgstr "如果为 ON，则打开/关闭构建 MAN 页面" -msgid "" -"To use pgRouting PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" -msgstr "" -"使用pgRouting需要安装PostGIS，请阅读本 `安装指南 `__ 中有关安装的信息" +msgid "DOC_USE_BOOTSTRAP" +msgstr "DOC_USE_BOOTSTRAP" -msgid "Short Version" -msgstr "简洁版本" +msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" +msgstr "如果打开，则对用户文档的 HTML 页面使用 sphinx-bootstrap" -msgid "Extracting the tar ball" -msgstr "解压 tar 压缩文件" +msgid "Configuring cmake to create documentation before building pgRouting" +msgstr "在构建 pgRouting 之前配置 cmake 创建文档" -msgid "To compile assuming you have all the dependencies in your search path:" -msgstr "假设您的搜索路径中有所有依赖项，则进行编译：" +msgid "Most of the effort of the documentation has been on the html files." +msgstr "文档的大部分工作都集中在 html 文件上。" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." -msgstr "安装 pgRouting 后，需要在您想要使用它的每个数据库中启用它。" +msgid "Building" +msgstr "构建" -msgid "Get the sources" -msgstr "获取来源" +msgid "Using ``make`` to build the code and the documentation" +msgstr "使用 ``make`` 构建代码和文档" + +msgid "The following instructions start from *path/to/pgrouting/build*" +msgstr "以下说明从 *path/to/pgrouting/build* 开始" msgid "" -"The pgRouting latest release can be found in https://github.com/pgRouting/" -"pgrouting/releases/latest" -msgstr "" -"pgRouting 最新版本可以在 https://github.com/pgRouting/pgrouting/releases/" -"latest 中找到" +"We have tested on several platforms, For installing or reinstalling all the " +"steps are needed." +msgstr "我们已经在多个平台上进行了测试，安装或重新安装需要所有步骤。" -msgid "To download this release:" -msgstr "要下载此版本：" +msgid "The sql signatures are configured and build in the ``cmake`` command." +msgstr "SQL签名是在 ``cmake`` 命令中配置和构建的。" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." -msgstr "" -"转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。" +msgid "MinGW on Windows" +msgstr "Windows 上的 MinGW" -msgid "git" -msgstr "git" +msgid "Linux" +msgstr "Linux" -msgid "To download the repository" -msgstr "下载存储库" +msgid "The following instructions start from *path/to/pgrouting*" +msgstr "以下说明从 *path/to/pgrouting* 开始" msgid "" -"Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository from " -"GitHub)." -msgstr "" -"请参阅 :ref:`install-short` 获取有关编译 pgRouting 的更多说明（从 GitHub 下" -"载 pgRouting 存储库时不涉及 tar 文件）。" - -msgid "Enabling and upgrading in the database" -msgstr "在数据库中启用和升级" +"To remove the build when the configuration changes, use the following code:" +msgstr "要在配置更改时删除构建，请使用以下代码：" -msgid "Enabling the database" -msgstr "启用数据库" +msgid "and start the build process as mentioned previously." +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." -msgstr "" -"pgRouting 是 PostgreSQL 扩展，依赖 PostGIS 向最终用户提供功能。 下面给出的代" -"码演示了在数据库中启用 PostGIS 和 pgRouting。" +msgid "Testing" +msgstr "测试" -msgid "" -"Checking PostGIS and pgRouting version after enabling them in the database." -msgstr "在数据库中启用 PostGIS 和 pgRouting 后检查它们的版本。" +msgid "Currently there is no :code:`make test` and testing is done as follows" +msgstr "目前没有 :code:`make test`，测试如下" -msgid "Upgrading the database" -msgstr "升级数据库" +msgid "The following instructions start from *path/to/pgrouting/*" +msgstr "以下指令从 *path/to/pgrouting/* 开始" msgid "" -"To upgrade pgRouting in the database to version 3.7.0 use the following " -"command:" -msgstr "要将数据库中的 pgRouting 升级到版本3.7.0，请使用以下命令：" +"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 是 `PostGIS `__ 和 `PostgreSQL `__ 地理空间数据库的扩展，并添加了路由和其他网络分析功能。 " +"pgRouting的前身——pgDijkstra，由`Camptocamp `__ 的" +"Sylvain Pasche编写，后来被Orkney扩展并更名为pgRouting。 该项目现在得到了 " +"`Georepublic `__ 、`Paragon Corporation `__ 和广大用户社区的支持和维护。" msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" +"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" -"更多信息可以在 https://www.postgresql.org/docs/current/sql-createextension." -"html 中找到" +"pgRouting 是 `OSGeo Community Projects `__的一部分，隶属于`OSGeo Foundation `__，并被包含在`OSGeoLive `__。" -msgid "Dependencies" -msgstr "依赖" +msgid "Licensing" +msgstr "许可" -msgid "Compilation Dependencies" -msgstr "编译依赖" +msgid "The following licenses can be found in pgRouting:" +msgstr "可以在 pgRouting 中找到以下许可证：" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" -msgstr "为了能够编译 pgRouting，请确保满足以下依赖项：" +msgid "**License**" +msgstr "**许可**" -msgid "C and C++0x compilers" -msgstr "C 和 C++0x编译器" +msgid "GNU General Public License v2.0 or later" +msgstr "GNU 通用公共许可证 v2.0 或更高版本" msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" +"Most features of pgRouting are available under `GNU General Public License " +"v2.0 or later `_." msgstr "" -"使用 Boost 1.56 到 Boost 1.74 进行编译需要具有 C++03 或 C++ 11 标准支持的 C +" -"+编译器" - -msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" +"pgRouting 的大多数功能都可以在` GNU 通用公共许可证 v2.0 或更高版本 `_ 下使用。" -msgid "Postgresql version = Supported versions by PostgreSQL" -msgstr "Postgresql 版本 = PostgreSQL 支持的版本" +msgid "Boost Software License - Version 1.0" +msgstr "Boost 软件许可证 - 版本 1.0" -msgid "The Boost Graph Library (BGL). Version >= 1.56" -msgstr "Boost 图库 (BGL)。 版本 >= 1.56" +msgid "" +"Some Boost extensions are available under `Boost Software License - Version " +"1.0 `_." +msgstr "" +"一些 Boost 扩展可根据` Boost 软件许可证 - 版本 1.0 获得 `_。" -msgid "CMake >= 3.2" -msgstr "CMake >= 3.2" +msgid "MIT-X License" +msgstr "MIT-X License" -msgid "optional dependencies" -msgstr "可选的依赖项" +msgid "" +"Some code contributed by iMaptools.com is available under MIT-X license." +msgstr "iMaptools.com 贡献的一些代码可在 MIT-X 许可证下使用。" -msgid "For user's documentation" -msgstr "用于用户文档" +msgid "" +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_." +msgstr "" +"pgRouting 手册根据`知识共享署名-相同方式共享 3.0 许可证获得许可 `_。" -msgid "Sphinx >= 1.1" -msgstr "Sphinx >= 1.1" +msgid "" +"In general license information should be included in the header of each " +"source file." +msgstr "一般来说，许可证信息应包含在每个源文件的标头中。" -msgid "Latex" -msgstr "Latex" +msgid "Contributors" +msgstr "贡献者" -msgid "For developer's documentation" -msgstr "对于开发者文档" +msgid "This Release Contributors" +msgstr "此版本贡献者" -msgid "Doxygen >= 1.7" -msgstr "Doxygen >= 1.7" +msgid "Individuals in this release v3.7.x (in alphabetical order)" +msgstr "在此版本 v3.7.x 中的个人贡献者（按字母顺序排列）" -msgid "For testing" -msgstr "供测试用" +msgid "(Alphabetical order)" +msgstr "(按字母顺序排列）" -msgid "pgtap" -msgstr "pgtap" +msgid "Regina Obe, Vicky Vergara" +msgstr "Regina Obe, Vicky Vergara" -msgid "pg_prove" -msgstr "pg_prove" +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 "" +"还有所有为我们的产品（osm2pgrouting、pgRouting、pgRoutingLayer、workshop）提" +"供意见、发现问题、提出拉取请求等的人们。" -msgid "For using:" -msgstr "用于使用：" +msgid "Corporate Sponsors in this release (in alphabetical order)" +msgstr "本次发布中的企业赞助商（按字母顺序排列）" -msgid "PostGIS version >= 2.2" -msgstr "PostGIS版本 >= 2.2" +msgid "" +"These are corporate entities that have contributed developer time, hosting, " +"or direct monetary funding to the pgRouting project:" +msgstr "" +"这些是为 pgRouting 项目贡献了开发人员时间、托管或直接货币资金的公司实体：" -msgid "Example: Installing dependencies on linux" -msgstr "示例：在 Linux 上安装依赖项" +msgid "`OSGeo `__" +msgstr "`OSGeo `__" -msgid "Installing the compilation dependencies" -msgstr "安装编译依赖项" +msgid "`OSGeo UK `__" +msgstr "`OSGeo UK `__" -msgid "Database dependencies" -msgstr "数据库依赖" +msgid "`Google Summer of Code `__" +msgstr "`Google Summer of Code `__" -msgid "Configuring PostgreSQL" -msgstr "配置 PostgreSQL" +msgid "`Paragon Corporation `__" +msgstr "`Paragon Corporation `__" -msgid "Entering psql console" -msgstr "进入psql控制台" +msgid "Contributors Past & Present:" +msgstr "过去与现在的贡献者：" -msgid "To exit psql console" -msgstr "退出 psql 控制台" +msgid "Individuals (in alphabetical order)" +msgstr "个人贡献者（按字母排序）" msgid "" -"Entering psql console directly without switching roles can be done by the " -"following commands" -msgstr "直接进入psql控制台，无需切换角色，可以通过以下命令完成" +"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " +"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " +"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " +"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " +"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " +"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " +"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " +"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " +"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " +"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " +"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " +"Virginia Vergara, Yige Huang" +msgstr "" +"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " +"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " +"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " +"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " +"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " +"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " +"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " +"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " +"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " +"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " +"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " +"Virginia Vergara, Yige Huang" -msgid "Then use the above given method to exit out of the psql console" -msgstr "然后使用上面给出的方法退出psql控制台" +msgid "Corporate Sponsors (in alphabetical order)" +msgstr "企业赞助商（按字母顺序排列）" -msgid "Checking PostgreSQL version" -msgstr "检查 PostgreSQL 版本" +msgid "Camptocamp" +msgstr "Camptocamp" -msgid "or" -msgstr "或者" +msgid "CSIS (University of Tokyo)" +msgstr "CSIS (University of Tokyo)" -msgid "Enter the psql console using above given method and then enter" -msgstr "使用上面给定的方法进入psql控制台，然后输入" +msgid "Georepublic" +msgstr "Georepublic" -msgid "Creating PostgreSQL role" -msgstr "创建 PostgreSQL 角色" +msgid "Google Summer of Code" +msgstr "Google Summer of Code" -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." -msgstr "" -"PostgreSQL 提供的默认角色是 postgres。 要创建新角色，您可以使用上面提供的命" -"令。 提示将要求用户输入角色名称，然后提供确认。 继续执行这些步骤，您将成功创" -"建 PostgreSQL 角色。" +msgid "iMaptools" +msgstr "iMaptools" -msgid "" -"To add password to the role or change previously created password of the " -"role use the following commands" -msgstr "要向角色添加密码或更改之前创建的角色密码，请使用以下命令" +msgid "Leopark" +msgstr "Leopark" -msgid "" -"To get additional details on the flags associated with ``createuser`` below " -"given command can be used" -msgstr "" -"要获取与下面的 ``createuser`` 相关的标志的更多详细信息，可以使用给定的命令" +msgid "Orkney" +msgstr "Orkney" -msgid "Creating Database in PostgreSQL" -msgstr "在 PostgreSQL 中创建数据库" +msgid "OSGeo" +msgstr "OSGeo" -msgid "Connecting to a PostgreSQL Database" -msgstr "连接到 PostgreSQL 数据库" +msgid "OSGeo UK" +msgstr "OSGeo UK" -msgid "Enter the psql console and type the following commands" -msgstr "进入psql控制台，输入以下命令" +msgid "Paragon Corporation" +msgstr "Paragon Corporation" -msgid "Build dependencies" -msgstr "构建依赖关系" +msgid "Versaterm Inc." +msgstr "Versaterm Inc." -msgid "Optional dependencies" -msgstr "可选依赖项" +msgid "More Information" +msgstr "更多信息" -msgid "For documentation and testing" -msgstr "用于文档和测试" +msgid "" +"The latest software, documentation and news items are available at the " +"pgRouting web site https://pgrouting.org." +msgstr "" +"最新的软件、文档和新闻可在 pgRouting 网站 https://pgrouting.org 上获取。" -msgid "Configuring" -msgstr "配置" +msgid "" +"PostgreSQL database server at the PostgreSQL main site https://www." +"postgresql.org." +msgstr "" +"PostgreSQL 数据库服务器位于 PostgreSQL 主站点 https://www.postgresql.org。" -msgid "pgRouting uses the `cmake` system to do the configuration." -msgstr "pgRouting 使用 `cmake` 系统进行配置。" +msgid "PostGIS extension at the PostGIS project web site https://postgis.net." +msgstr "PostGIS 项目网站 https://postgis.net 上的 PostGIS 扩展。" -msgid "The build directory is different from the source directory" -msgstr "构建目录与源目录不同" +msgid "Boost C++ source libraries at https://www.boost.org." +msgstr "Boost C++ 源库位于 https://www.boost.org。" -msgid "Create the build directory" -msgstr "创建构建目录" +msgid ":doc:`migration`" +msgstr ":doc:`migration`" -msgid "Configurable variables" -msgstr "可配置变量" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" -msgid "To see the variables that can be configured" -msgstr "查看可以配置的变量" +msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_KSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" -msgid "Configuring The Documentation" -msgstr "配置文档" +msgid "Availability" +msgstr "可用性" -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" -msgstr "文档的大部分工作都集中在 HTML 文件上。 构建文档的一些变量：" +#, fuzzy +msgid "Version 4.0.0" +msgstr "版本2.0.0" -msgid "Variable" -msgstr "变量" +msgid "All signatures promoted to official." +msgstr "所有签名均已升级为正式版本。" -msgid "Comment" -msgstr "解释" +msgid "Version 3.6.0" +msgstr "版本3.6.0" -msgid "WITH_DOC" -msgstr "WITH_DOC" +msgid "Result columns standarized to: |nksp-result|" +msgstr "结果列标准化为 |nksp-result|" -msgid "BOOL=OFF" -msgstr "BOOL=OFF" +msgid "pgr_ksp(One to One)" +msgstr "pgr_ksp(一对一)" -msgid "Turn on/off building the documentation" -msgstr "打开/关闭构建文档" +msgid "Added ``start_vid`` and ``end_vid`` result columns." +msgstr "增加 ``start_vid`` 和 ``end_vid`` 结果列。" -msgid "BUILD_HTML" -msgstr "BUILD_HTML" +msgid "New proposed signatures:" +msgstr "新拟议的签名：" -msgid "BOOL=ON" -msgstr "BOOL=ON" +msgid "pgr_ksp(One to Many)" +msgstr "pgr_ksp(一对多)" -msgid "If ON, turn on/off building HTML for user's documentation" -msgstr "如果打开，则打开/关闭为用户文档构建 HTML" +msgid "pgr_ksp(Many to One)" +msgstr "pgr_ksp(多对一)" -msgid "BUILD_DOXY" -msgstr "BUILD_DOXY" +msgid "pgr_ksp(Many to Many)" +msgstr "pgr_ksp(多对多)" -msgid "If ON, turn on/off building HTML for developer's documentation" -msgstr "如果打开，则打开/关闭为开发人员文档构建 HTML" +msgid "pgr_ksp(Combinations)" +msgstr "pgr_ksp(组合)" -msgid "BUILD_LATEX" -msgstr "BUILD_LATEX" +msgid "Version 2.1.0" +msgstr "版本2.1.0" -msgid "If ON, turn on/off building PDF" -msgstr "如果打开，则打开/关闭构建 PDF" +msgid "Signature change" +msgstr "签名变更" -msgid "BUILD_MAN" -msgstr "BUILD_MAN" +msgid "Old signature no longer supported" +msgstr "不再支持旧签名" -msgid "If ON, turn on/off building MAN pages" -msgstr "如果为 ON，则打开/关闭构建 MAN 页面" +msgid "Version 2.0.0" +msgstr "版本2.0.0" -msgid "DOC_USE_BOOTSTRAP" -msgstr "DOC_USE_BOOTSTRAP" +msgid "Official function." +msgstr "官方 函数" -msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" -msgstr "如果打开，则对用户文档的 HTML 页面使用 sphinx-bootstrap" +msgid "" +"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " +"number of shortest paths desired." +msgstr "基于Yen算法的K最短路径路由算法。 “K”是所需的最短路径的数量。" -msgid "Configuring cmake to create documentation before building pgRouting" -msgstr "在构建 pgRouting 之前配置 cmake 创建文档" +msgid "|Boost| Boost Graph Inside" +msgstr "|Boost| Boost 图内部" -msgid "Most of the effort of the documentation has been on the html files." -msgstr "文档的大部分工作都集中在 html 文件上。" +msgid "Boost Graph Inside" +msgstr "Boost 图内部" -msgid "Building" -msgstr "构建" +msgid "Signatures" +msgstr "签名" -msgid "Using ``make`` to build the code and the documentation" -msgstr "使用 ``make`` 构建代码和文档" +msgid "Summary" +msgstr "总结" -msgid "The following instructions start from *path/to/pgrouting/build*" -msgstr "以下说明从 *path/to/pgrouting/build* 开始" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." -msgstr "我们已经在多个平台上进行了测试，安装或重新安装需要所有步骤。" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgid "The sql signatures are configured and build in the ``cmake`` command." -msgstr "SQL签名是在 ``cmake`` 命令中配置和构建的。" +msgid "" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgid "MinGW on Windows" -msgstr "Windows 上的 MinGW" +msgid "" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgid "Linux" -msgstr "Linux" +msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgid "The following instructions start from *path/to/pgrouting*" -msgstr "以下说明从 *path/to/pgrouting* 开始" +msgid "**options:** ``[directed, heap_paths]``" +msgstr "**options:** ``[directed, heap_paths]``" -msgid "" -"To remove the build when the configuration changes, use the following code:" -msgstr "要在配置更改时删除构建，请使用以下代码：" +msgid "Returns set of |nksp-result|" +msgstr "返回集合 |nksp-result|" -msgid "and start the build process as mentioned previously." -msgstr "并开始前面提到的构建过程。" +msgid "OR EMPTY SET" +msgstr "OR EMPTY SET" -msgid "Testing" -msgstr "测试" +msgid "Example" +msgstr "示例" -msgid "Currently there is no :code:`make test` and testing is done as follows" -msgstr "目前没有 :code:`make test`，测试如下" +msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." +msgstr "在有向图上获取从 :math:`6` 到 :math:`17` 的 2 条路径。" -msgid "The following instructions start from *path/to/pgrouting/*" -msgstr "以下指令从 *path/to/pgrouting/* 开始" +msgid "" +"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " +"directed graph." +msgstr "获取有向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}` 的 2 条路径。" 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 是 `PostGIS `__ 和 `PostgreSQL `__ 地理空间数据库的扩展，并添加了路由和其他网络分析功能。 " -"pgRouting的前身——pgDijkstra，由`Camptocamp `__ 的" -"Sylvain Pasche编写，后来被Orkney扩展并更名为pgRouting。 该项目现在得到了 " -"`Georepublic `__ 、`Paragon Corporation `__ 和广大用户社区的支持和维护。" +"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " +"directed graph." +msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路经。" -#, fuzzy msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " +"a directed graph." msgstr "" -"pgRouting 是 `OSGeo 基金会 `__ `OSGeo 社区项目 " -"`__ 的一部分，并包含在 " -"`OSGeoLive `__ 中。" +"在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}` 的2条路" +"经。" -msgid "Licensing" -msgstr "许可" +msgid "Using a combinations table on an directed graph" +msgstr "在有向图上使用组合表" -msgid "The following licenses can be found in pgRouting:" -msgstr "可以在 pgRouting 中找到以下许可证：" +msgid "The combinations table:" +msgstr "组合表：" -msgid "**License**" -msgstr "**许可**" +msgid "The query:" +msgstr "查询：" -msgid "GNU General Public License v2.0 or later" -msgstr "GNU 通用公共许可证 v2.0 或更高版本" +msgid "Identifier of the destination vertex." +msgstr "目标顶点的标识符。" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." -msgstr "" -"pgRouting 的大多数功能都可以在` GNU 通用公共许可证 v2.0 或更高版本 `_ 下使用。" +msgid "**K**" +msgstr "**K**" -msgid "Boost Software License - Version 1.0" -msgstr "Boost 软件许可证 - 版本 1.0" +msgid "Number of required paths." +msgstr "所需路径的数量。" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." -msgstr "" -"一些 Boost 扩展可根据` Boost 软件许可证 - 版本 1.0 获得 `_。" +msgid "KSP Optional parameters" +msgstr "KSP 可选参数" -msgid "MIT-X License" -msgstr "MIT-X License" +msgid "``heap_paths``" +msgstr "``heap_paths``" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "iMaptools.com 贡献的一些代码可在 MIT-X 许可证下使用。" +msgid "When ``false`` Returns at most K paths." +msgstr "当 ``false`` 时返回最多 K 条路径。" + +msgid "When ``true`` all the calculated paths while processing are returned." +msgstr "当 ``true`` 时，返回处理时的所有计算路径。" msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." +"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 "" -"pgRouting 手册根据`知识共享署名-相同方式共享 3.0 许可证获得许可 `_。" +"粗略地说，当最短路径有 ``N`` 个边时，对于``K``值较小且``K > 5`` ，堆将包含大" +"约 ``N * K`` 条路径。" msgid "" -"In general license information should be included in the header of each " -"source file." -msgstr "一般来说，许可证信息应包含在每个源文件的标头中。" +"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``" +msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1**" -msgid "Contributors" -msgstr "贡献者" +msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``" +msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符" -msgid "This Release Contributors" -msgstr "此版本贡献者" +msgid ":math:`0` for the last ``node`` of the path." +msgstr ":math:`0` 为路径的最后一个 ``node``。" -msgid "Individuals in this release v3.7.x (in alphabetical order)" -msgstr "在此版本 v3.7.x 中的个人贡献者（按字母顺序排列）" +msgid "Aggregate cost from **start vid** to ``node``." +msgstr "从 **start vid** 到 ``node`` 的总成本。" -msgid "(Alphabetical order)" -msgstr "(按字母顺序排列）" +msgid "Additional Examples" +msgstr "其他示例" -msgid "Regina Obe, Vicky Vergara" -msgstr "Regina Obe, Vicky Vergara" +msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" +msgstr "在无向图中获取从 :math:`6` 到 :math:`17` 的2条路径" -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 "" -"还有所有为我们的产品（osm2pgrouting、pgRouting、pgRoutingLayer、workshop）提" -"供意见、发现问题、提出拉取请求等的人们。" +msgid "Also get the paths in the heap." +msgstr "还获取堆中的路径。" -msgid "Corporate Sponsors in this release (in alphabetical order)" -msgstr "本次发布中的企业赞助商（按字母顺序排列）" +msgid "Get 2 paths using combinations table on an undirected graph" +msgstr "使用无向图上的组合表获取 2 条路径" msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" -msgstr "" -"这些是为 pgRouting 项目贡献了开发人员时间、托管或直接货币资金的公司实体：" +"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " +"undirected graph." +msgstr "在无向图中获取从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路径。" -msgid "`OSGeo `__" -msgstr "`OSGeo `__" +msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgid "`OSGeo UK `__" -msgstr "`OSGeo UK `__" +msgid "``pgr_TSP``" +msgstr "``pgr_TSP``" -msgid "`Google Summer of Code `__" -msgstr "`Google Summer of Code `__" +#, fuzzy +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSP`` -使用*metric*算法的近似方法。" -msgid "`Paragon Corporation `__" -msgstr "`Paragon Corporation `__" +msgid "Availability:" +msgstr "可用性：" -msgid "Contributors Past & Present:" -msgstr "过去与现在的贡献者：" +msgid "Version 3.2.1" +msgstr "版本3.2.1" -msgid "Individuals (in alphabetical order)" -msgstr "个人贡献者（按字母排序）" +msgid "" +"Metric Algorithm from `Boost library `__" +msgstr "" +"`Boost库 `__ 中" +"的度量算法" + +msgid "Simulated Annealing Algorithm no longer supported" +msgstr "Simulated Annealing算法不再受支持" msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " -"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " -"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " -"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " -"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " -"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " -"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " -"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " -"Virginia Vergara, Yige Huang" +"The Simulated Annealing Algorithm related parameters are ignored: " +"max_processing_time, tries_per_temperature, max_changes_per_temperature, " +"max_consecutive_non_changes, initial_temperature, final_temperature, " +"cooling_factor, randomize" msgstr "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " -"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " -"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " -"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " -"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " -"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " -"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " -"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " -"Virginia Vergara, Yige Huang" +"Simulated Annealing算法相关参数被忽略：max_processing_time、" +"tries_per_temper、max_changes_per_tempere、max_consecutive_non_changes、" +"initial_temper、final_temper、cooling_factor、randomize" + +msgid "Version 2.3.0" +msgstr "版本2.3.0" + +msgid "" +"Can be Used with :doc:`costMatrix-category` functions preferably with " +"`directed => false`." +msgstr "" +"可以与 :doc:`costMatrix-category` 函数一起使用，最好使用 `directed => " +"false`。" -msgid "Corporate Sponsors (in alphabetical order)" -msgstr "企业赞助商（按字母顺序排列）" +msgid "With ``directed => false``" +msgstr "使用 ``directed => false``" -msgid "Camptocamp" -msgstr "Camptocamp" +msgid "Will generate a graph that:" +msgstr "将生成一个图：" -msgid "CSIS (University of Tokyo)" -msgstr "CSIS (University of Tokyo)" +msgid "is undirected" +msgstr "是无向的" -msgid "Georepublic" -msgstr "Georepublic" +msgid "is fully connected (As long as the graph has one component)" +msgstr "是完全连接的（只要图有一个分量）" -msgid "Google Summer of Code" -msgstr "Google Summer of Code" +msgid "all traveling costs on edges obey the triangle inequality." +msgstr "所有边上的旅行成本都遵循三角不等式。" -msgid "iMaptools" -msgstr "iMaptools" +msgid "When ``start_vid = 0 OR end_vid = 0``" +msgstr "当 ``start_vid = 0 OR end_vid = 0``" -msgid "Leopark" -msgstr "Leopark" +msgid "" +"The solutions generated is garanteed to be *twice as long as the optimal " +"tour in the worst case*" +msgstr "生成的解决方案保证是*最坏情况下最优路径时间的两倍*" -msgid "Orkney" -msgstr "Orkney" +msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgstr "当 ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgid "OSGeo" -msgstr "OSGeo" +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." +msgstr "" +"在最坏情况下， **不能保证** 解决方案将是最优路径的两倍长，因为 `end_vid` 被强" +"制设置在固定位置。" -msgid "OSGeo UK" -msgstr "OSGeo UK" +msgid "With ``directed => true``" +msgstr "当 ``directed => true``" -msgid "Paragon Corporation" -msgstr "Paragon Corporation" +msgid "" +"It is **not garanteed** that the solution will be, in the worse case, twice " +"as long as the optimal tour" +msgstr "**不能保证** 在最坏情况下解决方案将是最优路径的两倍长" -msgid "Versaterm Inc." -msgstr "Versaterm Inc." +msgid "is directed" +msgstr "有向" -msgid "More Information" -msgstr "更多信息" +msgid "" +"some (or all) traveling costs on edges might not obey the triangle " +"inequality." +msgstr "某些（或全部）边上的旅行成本可能不满足三角不等式。" msgid "" -"The latest software, documentation and news items are available at the " -"pgRouting web site https://pgrouting.org." -msgstr "" -"最新的软件、文档和新闻可在 pgRouting 网站 https://pgrouting.org 上获取。" +"As an undirected graph is required, the directed graph is transformed as " +"follows:" +msgstr "由于需要无向图，有向图变换如下：" msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." +"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " +"v)`" +msgstr "边 `(u, v)` 和 `(v, u)`被认为是相同的边（表示为 `(u, v)`" + +msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" +msgstr "如果 ``agg_cost`` 在边`(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 "" -"PostgreSQL 数据库服务器位于 PostgreSQL 主站点 https://www.postgresql.org。" +"边 `(u, v)` 的所有实例的 ``agg_cost`` 最小值将被视为边 `(u, v)` 的 " +"``agg_cost``" -msgid "PostGIS extension at the PostGIS project web site https://postgis.net." -msgstr "PostGIS 项目网站 https://postgis.net 上的 PostGIS 扩展。" +msgid "" +"Some (or all) traveling costs on edges will still might not obey the " +"triangle inequality." +msgstr "边上的一些（或全部）旅行成本仍然可能不遵守三角不等式。" -msgid "Boost C++ source libraries at https://www.boost.org." -msgstr "Boost C++ 源库位于 https://www.boost.org。" +msgid "When the data is incomplete, but it is a connected graph:" +msgstr "当数据不完整，但是是连通图时：" -msgid ":doc:`migration`" -msgstr ":doc:`migration`" +msgid "the missing values will be calculated with dijkstra algorithm." +msgstr "缺失值将使用 dijkstra 算法计算。" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "``pgr_KSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" +msgid "Returns set of |tsp-result|" +msgstr "返回 |tsp-result| 的集合" -msgid "Availability" -msgstr "可用性" +msgid "OR EMTPY SET" +msgstr "OR EMTPY SET" -msgid "Version 3.6.0" -msgstr "版本3.6.0" +msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" +msgstr "使用 :doc:`pgr_dijkstraCostMatrix` 生成矩阵信息" -msgid "Result columns standarized to: |nksp-result|" -msgstr "结果列标准化为 |nksp-result|" +msgid "" +"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " +"are not connected." +msgstr "" +"**Line 4** 顶点 :math:`\\{2, 4, 13, 14\\}` 不包括在内，因为它们未连接。" -msgid "``pgr_ksp`` (One to One)" -msgstr "``pgr_ksp`` (一对一)" +msgid "`Matrix SQL`_ as described below" +msgstr "`Matrix SQL`_ 如下所述" -msgid "Added ``start_vid`` and ``end_vid`` result columns." -msgstr "增加 ``start_vid`` 和 ``end_vid`` 结果列。" +msgid "``ANY-INTEGER``" +msgstr "``ANY-INTEGER``" -msgid "New overload functions:" -msgstr "新的重载函数：" +msgid "``ANY-NUMERICAL``" +msgstr "``ANY-NUMERICAL``" -msgid "``pgr_ksp`` (One to Many)" -msgstr "``pgr_ksp`` (一对多)" +msgid "Cost for going from start_vid to end_vid" +msgstr "从 start_vid 到 end_vid 的成本" -msgid "``pgr_ksp`` (Many to One)" -msgstr "``pgr_ksp`` (多对一)" +msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" +msgstr "返回集合 ``(seq, node, cost, agg_cost)``" -msgid "``pgr_ksp`` (Many to Many)" -msgstr "``pgr_ksp`` (多对多)" +msgid "Row sequence." +msgstr "行顺序。" -msgid "``pgr_ksp`` (Combinations)" -msgstr "``pgr_ksp`` (组合)" +msgid "**node**" +msgstr "**node**" -msgid "Version 2.1.0" -msgstr "版本2.1.0" +msgid "Identifier of the node/coordinate/point." +msgstr "节点/坐标/点的标识符。" -msgid "Signature change" -msgstr "签名变更" +msgid "" +"Cost to traverse from the current ``node`` to the next ``node`` in the path " +"sequence." +msgstr "从路径序列中的当前 ``node``遍历到下一个``node`` 的成本。" -msgid "Old signature no longer supported" -msgstr "不再支持旧签名" +msgid "``0`` for the last row in the tour sequence." +msgstr "``0`` 表示游览序列中的最后一行。" -msgid "Version 2.0.0" -msgstr "版本2.0.0" +msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." +msgstr "从 ``seq = 1`` 的 ``node`` 到当前节点的总成本。" -msgid "**Official** function" -msgstr "**官方** 函数" +msgid "``0`` for the first row in the tour sequence." +msgstr "``0`` 表示游览序列中的第一行。" -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." -msgstr "基于Yen算法的K最短路径路由算法。 “K”是所需的最短路径的数量。" +msgid "Start from vertex :math:`1`" +msgstr "从顶点 :math:`1` 开始" -msgid "Signatures" -msgstr "签名" +msgid "**Line 6** ``start_vid => 1``" +msgstr "**Line 6** ``start_vid => 1``" -msgid "Summary" -msgstr "总结" +msgid "Using points of interest to generate an asymetric matrix." +msgstr "使用兴趣点生成不对称矩阵。" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgid "To generate an asymmetric matrix:" +msgstr "生成非对称矩阵：" msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " +"not including it in the query" msgstr "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +"**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的``side`` 信息而被忽略" + +msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" +msgstr "**Line 6** 使用 ``directed => true`` 生成一个非对称矩阵" msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +":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))` 将被视为 ``agg_cost``" msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +"The solution that can be larger than *twice as long as the optimal tour* " +"because:" +msgstr "该解决方案的长度可能是*最佳行程的两倍以上*，因为：" + +msgid "Triangle inequality might not be satisfied." +msgstr "三角不等式可能不满足。" + +msgid "``start_id != 0 AND end_id != 0``" +msgstr "``start_id != 0 AND end_id != 0``" + +msgid "Connected incomplete data" +msgstr "连接不完整数据" + +msgid "" +"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " +"complete." +msgstr "使用选定的边 :math:`\\{2, 4, 5, 8, 9, 15\\}`，矩阵不完整。" + +msgid "" +"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " +"the value used is taken from :math:`10 \\rightarrow 17`." msgstr "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +"对于 :math:`17 \\rightarrow 10` 的成本值在矩阵中不存在，但使用的值是从 :math:" +"`10 \\rightarrow 17` 中获取的。" -msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgstr "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" +msgid "``pgr_TSPeuclidean``" +msgstr "``pgr_TSPeuclidean``" -msgid "**options:** ``[directed, heap_paths]``" -msgstr "**options:** ``[directed, heap_paths]``" +#, fuzzy +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgstr "``pgr_TSPeuclidean`` -使用*metric*算法进行近似。" -msgid "Returns set of |nksp-result|" -msgstr "返回集合 |nksp-result|" +#, fuzzy +msgid "" +"Using `Boost: metric TSP approx `__" +msgstr "" +"`Boost 的 metric appro 的 metric 近似 `__" -msgid "OR EMPTY SET" -msgstr "OR EMPTY SET" +msgid "" +"The Simulated Annealing Algorithm related parameters are ignored: " +"`max_processing_time`, `tries_per_temperature`, " +"`max_changes_per_temperature`, `max_consecutive_non_changes`, " +"`initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgstr "" +"Simulated Annealing 算法相关参数被忽略： `max_processing_time`, " +"`tries_per_temperature`, `max_changes_per_temperature`, " +"`max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, " +"`cooling_factor`, `randomize`" -msgid "Example" -msgstr "示例" +msgid "Version 3.0.0" +msgstr "版本3.0.0" -msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." -msgstr "在有向图上获取从 :math:`6` 到 :math:`17` 的 2 条路径。" +msgid "Name change from pgr_eucledianTSP" +msgstr "pgr_eucledianTSP 的名称更改" + +#, fuzzy +msgid "New official function." +msgstr "新函数 official。" msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." -msgstr "获取有向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}` 的 2 条路径。" +"Any duplicated identifier will be ignored. The coordinates that will be kept" +msgstr "任何重复的标识符都将被忽略。 将保留的坐标" + +msgid "is arbitrarly." +msgstr "是任意的。" msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." -msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路经。" +"The coordinates are quite similar for the same identifier, for example ::" +msgstr "对于相同的标识符，坐标非常相似，例如 ::" msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " -"a directed graph." -msgstr "" -"在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}` 的2条路" -"经。" +"The coordinates are quite different for the same identifier, for example ::" +msgstr "对于相同的标识符，坐标有很大不同，例如::" -msgid "Using a combinations table on an directed graph" -msgstr "在有向图上使用组合表" +msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" +msgstr "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" -msgid "The combinations table:" -msgstr "组合表：" +msgid "With default values" +msgstr "有默认值" -msgid "The query:" -msgstr "查询：" +msgid "`Coordinates SQL`_" +msgstr "`Coordinates SQL`_" -msgid "Identifier of the destination vertex." -msgstr "目标顶点的标识符。" +msgid "`Coordinates SQL`_ as described below" +msgstr "`Coordinates SQL`_ 如下所述" -msgid "**K**" -msgstr "**K**" +msgid "Coordinates SQL" +msgstr "坐标SQL" -msgid "Number of required paths." -msgstr "所需路径的数量。" +msgid "``x``" +msgstr "``x``" -msgid "KSP Optional parameters" -msgstr "KSP 可选参数" +msgid "X value of the coordinate." +msgstr "坐标的X值。" -msgid "``heap_paths``" -msgstr "``heap_paths``" +msgid "``y``" +msgstr "``y``" -msgid "When ``false`` Returns at most K paths." -msgstr "当 ``false`` 时返回最多 K 条路径。" +msgid "Y value of the coordinate." +msgstr "坐标的Y值。" -msgid "When ``true`` all the calculated paths while processing are returned." -msgstr "当 ``true`` 时，返回处理时的所有计算路径。" +msgid "Test 29 cities of Western Sahara" +msgstr "测试西撒哈拉29个城市" 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``." +"This example shows how to make performance tests using University of " +"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" msgstr "" -"粗略地说，当最短路径有 ``N`` 个边时，对于``K``值较小且``K > 5`` ，堆将包含大" -"约 ``N * K`` 条路径。" +"此示例展示了如何使用Waterloo大学的 `示例数据 `__ （使用西撒哈拉 29 个城市的数据集 `__）进行性能测试" + +msgid "Creating a table for the data and storing the data" +msgstr "创建数据表并存储数据" + +msgid "Adding a geometry (for visual purposes)" +msgstr "添加几何图形（用于视觉目的）" + +msgid "Total tour cost" +msgstr "旅游总费用" msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``" -msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1**" +"Getting a total cost of the tour, compare the value with the length of an " +"optimal tour is 27603, given on the dataset" +msgstr "获取旅行的总成本，将该值与数据集上给出的最佳旅行长度 27603 进行比较" -msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``" -msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符" +msgid "Getting a geometry of the tour" +msgstr "获取游览的几何形状" -msgid ":math:`0` for the last ``node`` of the path." -msgstr ":math:`0` 为路径的最后一个 ``node``。" +msgid "Visual results" +msgstr "视觉效果" -msgid "Aggregate cost from **start vid** to ``node``." -msgstr "从 **start vid** 到 ``node`` 的总成本。" +msgid "" +"Visualy, The first image is the `optimal solution `__ and the second image is the solution " +"obtained with ``pgr_TSPeuclidean``." +msgstr "" +"从视觉上看，第一幅图像是 `最优解 `__ ，第二幅图像是使用 ``pgr_TSPeuclidean`` 获得的解。" -msgid "Additional Examples" -msgstr "其他示例" +msgid "``pgr_aStar``" +msgstr "``pgr_aStar``" -msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" -msgstr "在无向图中获取从 :math:`6` 到 :math:`17` 的2条路径" +msgid "``pgr_aStar`` — Shortest path using the A* algorithm." +msgstr "``pgr_aStar`` —使用 A* 算法的最短路径。" -msgid "Also get the paths in the heap." -msgstr "还获取堆中的路径。" +msgid "Combinations signature promoted to official." +msgstr "组合签名已升级为正式版本。" -msgid "Get 2 paths using combinations table on an undirected graph" -msgstr "使用无向图上的组合表获取 2 条路径" +msgid "Standarizing output columns to |short-generic-result|" +msgstr "标准输出列|short-generic-result|" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." -msgstr "在无向图中获取从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路径。" +#, fuzzy +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "``pgr_aStar`` （`一对一`）增加了 ``start_vid`` 和 ``end_vid`` 列。" -msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" -msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(一对多）添加了 ``end_vid`` 列。" -msgid "``pgr_TSP``" -msgstr "``pgr_TSP``" +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(多对一）添加了 ``start_vid`` 列。" -msgid "``pgr_TSP`` - Aproximation using *metric* algorithm." -msgstr "``pgr_TSP`` -使用*metric*算法的近似方法。" +msgid "Version 3.2.0" +msgstr "版本3.2.0" -msgid "Availability:" -msgstr "可用性：" +#, fuzzy +msgid "New proposed signature:" +msgstr "新拟议的签名：" -msgid "Version 3.2.1" -msgstr "版本3.2.1" +msgid "Function promoted to official." +msgstr "函数正式发布。" -msgid "" -"Metric Algorithm from `Boost library `__" -msgstr "" -"`Boost库 `__ 中" -"的度量算法" +msgid "Version 2.4.0" +msgstr "版本2.4.0" -msgid "Simulated Annealing Algorithm no longer supported" -msgstr "Simulated Annealing算法不再受支持" +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(一对多）" -msgid "" -"The Simulated Annealing Algorithm related parameters are ignored: " -"max_processing_time, tries_per_temperature, max_changes_per_temperature, " -"max_consecutive_non_changes, initial_temperature, final_temperature, " -"cooling_factor, randomize" -msgstr "" -"Simulated Annealing算法相关参数被忽略：max_processing_time、" -"tries_per_temper、max_changes_per_tempere、max_consecutive_non_changes、" -"initial_temper、final_temper、cooling_factor、randomize" +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(多对一）" -msgid "Version 2.3.0" -msgstr "版本2.3.0" +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(多对多）" + +#, fuzzy +msgid "Signature change on pgr_aStar(One to One)" +msgstr "签名更改 pgr_aStar(一对一)" msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." -msgstr "" -"可以与 :doc:`costMatrix-category` 函数一起使用，最好使用 `directed => " -"false`。" +"The results are equivalent to the union of the results of the `pgr_aStar(` " +"`One to One`_ `)` on the:" +msgstr "结果相当于 `pgr_aStar(` `一对一`_ `)` 结果的并集：" -msgid "With ``directed => false``" -msgstr "使用 ``directed => false``" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "Will generate a graph that:" -msgstr "将生成一个图：" +msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "is undirected" -msgstr "是无向的" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "is fully connected (As long as the graph has one component)" -msgstr "是完全连接的（只要图有一个分量）" +msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "all traveling costs on edges obey the triangle inequality." -msgstr "所有边上的旅行成本都遵循三角不等式。" +msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "When ``start_vid = 0 OR end_vid = 0``" -msgstr "当 ``start_vid = 0 OR end_vid = 0``" +msgid "**options:** ``[directed, heuristic, factor, epsilon]``" +msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" -msgid "" -"The solutions generated is garanteed to be *twice as long as the optimal " -"tour in the worst case*" -msgstr "生成的解决方案保证是*最坏情况下最优路径时间的两倍*" +msgid "Returns set of |short-generic-result|" +msgstr "Returns set of |short-generic-result|" -msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgstr "当 ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +msgid "Optional parameters are `named parameters` and have a default value." +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." +"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " +"heuristic :math:`2`" msgstr "" -"在最坏情况下， **不能保证** 解决方案将是最优路径的两倍长，因为 `end_vid` 被强" -"制设置在固定位置。" +"在具有heuristic :math:`2` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:" +"`12`" -msgid "With ``directed => true``" -msgstr "当 ``directed => true``" +msgid "" +"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " +"graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "" +"在具有heuristic :math:`3` 和factor :math:`3.5` 的 **有向** 图上，从顶点 :" +"math:`6` 到顶点 :math:`\\{10, 12\\}`" msgid "" -"It is **not garanteed** that the solution will be, in the worse case, twice " -"as long as the optimal tour" -msgstr "**不能保证** 在最坏情况下解决方案将是最优路径的两倍长" +"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " +"graph with heuristic :math:`4`" +msgstr "" +"在具有heuristic :math:`4` 的 **无向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶" +"点 :math:`10`" -msgid "is directed" -msgstr "有向" +msgid "" +"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " +"**directed** graph with factor :math:`0.5`" +msgstr "" +"在具有factor :math:`0.5` 的 **有向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :" +"math:`\\{10, 12\\}`" msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." -msgstr "某些（或全部）边上的旅行成本可能不满足三角不等式。" +"Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "在 **有向** 图上使用组合表，且使用factor :math:`0.5`。" + +msgid "Example 1" +msgstr "示例1" + +msgid "Demonstration of repeated values are ignored, and result is sorted." +msgstr "演示中重复的值被忽略，且结果被排序。" + +msgid "Example 2" +msgstr "示例2" + +msgid "Making **start vids** the same as **end vids**." +msgstr "使 **start vids** 与 **end vids** 相同。" + +msgid "Example 3" +msgstr "示例3" + +msgid "Manually assigned vertex combinations." +msgstr "手动指定的顶点组合。" -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" -msgstr "由于需要无向图，有向图变换如下：" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" -msgstr "边 `(u, v)` 和 `(v, u)`被认为是相同的边（表示为 `(u, v)`" +"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` - 使用 A* 算法计算最短路径的总成本。" -msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" -msgstr "如果 ``agg_cost`` 在边`(u, v)` 的一个或多个实例之间不同" +msgid "New proposed function." +msgstr "新提议的函数。" 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 "" -"边 `(u, v)` 的所有实例的 ``agg_cost`` 最小值将被视为边 `(u, v)` 的 " -"``agg_cost``" +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " +"using the A* algorithm." +msgstr "``pgr_aStarCost`` 函数总结了使用 A* 算法计算最短路径的成本。" msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." -msgstr "边上的一些（或全部）旅行成本仍然可能不遵守三角不等式。" +"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 "假设返回的值存储在表中，因此唯一索引将是一对：`(start_vid, end_vid)`" -msgid "When the data is incomplete, but it is a connected graph:" -msgstr "当数据不完整，但是是连通图时：" +msgid "For undirected graphs, the results are symmetric." +msgstr "对于无向图，结果是对称的。" -msgid "the missing values will be calculated with dijkstra algorithm." -msgstr "缺失值将使用 dijkstra 算法计算。" +msgid "The returned values are ordered in ascending order:" +msgstr "返回值按升序排列：" -msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" +msgid "`start_vid` ascending" +msgstr "`start_vid` 升序" -msgid "Returns set of |tsp-result|" -msgstr "返回 |tsp-result| 的集合" +msgid "`end_vid` ascending" +msgstr "`end_vid` 升序" -msgid "OR EMTPY SET" -msgstr "OR EMTPY SET" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" -msgstr "使用 :doc:`pgr_dijkstraCostMatrix` 生成矩阵信息" +msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "" +"pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " -"are not connected." +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -"**Line 4** 顶点 :math:`\\{2, 4, 13, 14\\}` 不包括在内，因为它们未连接。" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "`Matrix SQL`_ as described below" -msgstr "`Matrix SQL`_ 如下所述" +msgid "" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "``ANY-INTEGER``" -msgstr "``ANY-INTEGER``" +msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "``ANY-NUMERICAL``" -msgstr "``ANY-NUMERICAL``" +msgid "Returns set of |matrix-result|" +msgstr "返回 |matrix-result| 的集合" -msgid "Cost for going from start_vid to end_vid" -msgstr "从 start_vid 到 end_vid 的成本" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgid "Returns SET OF ``(seq, node, cost, agg_cost)``" -msgstr "返回集合 ``(seq, node, cost, agg_cost)``" +msgid "``pgr_aStarCostMatrix``" +msgstr "``pgr_aStarCostMatrix``" -msgid "Row sequence." -msgstr "行顺序。" +msgid "" +"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." +msgstr "``pgr_aStarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" -msgid "**node**" -msgstr "**node**" +msgid "Using internaly the :doc:`pgr_aStar` algorithm" +msgstr "内部使用 :doc:`pgr_aStar` 算法" -msgid "Identifier of the node/coordinate/point." -msgstr "节点/坐标/点的标识符。" +msgid "Returns a cost matrix." +msgstr "返回成本矩阵。" -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." -msgstr "从路径序列中的当前 ``node``遍历到下一个``node`` 的成本。" +msgid "No ordering is performed" +msgstr "不进行排序" -msgid "``0`` for the last row in the tour sequence." -msgstr "``0`` 表示游览序列中的最后一行。" +msgid "let `v` and `u` are nodes on the graph:" +msgstr "设`v` 和 `u` 是图上的节点：" -msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "从 ``seq = 1`` 的 ``node`` 到当前节点的总成本。" +msgid "when there is no path from `v` to `u`:" +msgstr "当没有从 `v` 到 `u` 的路径时：" -msgid "``0`` for the first row in the tour sequence." -msgstr "``0`` 表示游览序列中的第一行。" +msgid "cost from `v` to `u` is :math:`\\inf`" +msgstr "从 `v` 到 `u` 的成本是 :math:`\\inf`" -msgid "Start from vertex :math:`1`" -msgstr "从顶点 :math:`1` 开始" +msgid "when :math:`v = u` then" +msgstr "当 :math:`v = u` 时" -msgid "**Line 6** ``start_vid => 1``" -msgstr "**Line 6** ``start_vid => 1``" +msgid "cost from `v` to `u` is :math:`0`" +msgstr "从 `v` 到 `u` 的成本是 :math:`0`" -msgid "Using points of interest to generate an asymetric matrix." -msgstr "使用兴趣点生成不对称矩阵。" +msgid "When the graph is **undirected** the cost matrix is symmetric" +msgstr "当图 **无向** 时，成本矩阵是对称的" -msgid "To generate an asymmetric matrix:" -msgstr "生成非对称矩阵：" +msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" +"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " +"**undirected** graph using heuristic :math:`2`" msgstr "" -"**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的``side`` 信息而被忽略" +"在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` " +"创建对称的成本矩阵" -msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" -msgstr "**Line 6** 使用 ``directed => true`` 生成一个非对称矩阵" +msgid "Use with :doc:`pgr_TSP`" +msgstr "使用 :doc:`pgr_TSP`" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" -msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` 将被视为 ``agg_cost``" +msgid "``pgr_alphaShape``" +msgstr "``pgr_alphaShape``" -msgid "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" -msgstr "该解决方案的长度可能是*最佳行程的两倍以上*，因为：" +msgid "``pgr_alphaShape`` — Polygon part of an alpha shape." +msgstr "``pgr_alphaShape`` — Alpha 形状的多边形部分。" -msgid "Triangle inequality might not be satisfied." -msgstr "三角不等式可能不满足。" +#, fuzzy +msgid "Version 3.8.0" +msgstr "版本3.6.0" -msgid "``start_id != 0 AND end_id != 0``" -msgstr "``start_id != 0 AND end_id != 0``" +#, fuzzy +msgid "Deprecated function." +msgstr "已废弃的功能" -msgid "Connected incomplete data" -msgstr "连接不完整数据" +msgid "Breaking change on signature" +msgstr "签名的重大更改" -msgid "" -"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " -"complete." -msgstr "使用选定的边 :math:`\\{2, 4, 5, 8, 9, 15\\}`，矩阵不完整。" +msgid "**Boost 1.54** & **Boost 1.55** are supported" +msgstr "**Boost 1.54** & **Boost 1.55** 被支持" -msgid "" -"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " -"the value used is taken from :math:`10 \\rightarrow 17`." -msgstr "" -"对于 :math:`17 \\rightarrow 10` 的成本值在矩阵中不存在，但使用的值是从 :math:" -"`10 \\rightarrow 17` 中获取的。" +msgid "**Boost 1.56+** is preferable" +msgstr "**Boost 1.56+** 更好" -msgid "``pgr_TSPeuclidean``" -msgstr "``pgr_TSPeuclidean``" +msgid "Boost Geometry is stable on Boost 1.56" +msgstr "Boost Geometry 在 Boost 1.56 上保持稳定" -msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." -msgstr "``pgr_TSPeuclidean`` -使用*metric*算法进行近似。" +msgid "Added alpha argument with default 0 (use optimal value)" +msgstr "添加了默认值为 0 的 alpha 参数（使用最佳值）" -msgid "" -"The Simulated Annealing Algorithm related parameters are ignored: " -"`max_processing_time`, `tries_per_temperature`, " -"`max_changes_per_temperature`, `max_consecutive_non_changes`, " -"`initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgstr "" -"Simulated Annealing 算法相关参数被忽略： `max_processing_time`, " -"`tries_per_temperature`, `max_changes_per_temperature`, " -"`max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, " -"`cooling_factor`, `randomize`" +msgid "Support to return multiple outer/inner ring" +msgstr "支持返回多个外/内圈" -msgid "Version 3.0.0" -msgstr "版本3.0.0" +msgid "Renamed from version 1.x" +msgstr "从版本1.X重命名" -msgid "Name change from pgr_eucledianTSP" -msgstr "pgr_eucledianTSP 的名称更改" +msgid "Returns the polygon part of an alpha shape." +msgstr "返回 alpha 形状的多边形部分。" -msgid "New **Official** function" -msgstr "**官方** 新函数" +msgid "Input is a *geometry* and returns a *geometry*" +msgstr "输入是*几何图形*并返回*几何图形*" + +msgid "Uses PostGis ST_DelaunyTriangles" +msgstr "使用 PostGis ST_DelaunyTriangles" msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept" -msgstr "任何重复的标识符都将被忽略。 将保留的坐标" +"Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" +msgstr "它没有使用 CGAL 的`alpha`定义，而是使用 ``spoon_radius``" -msgid "is arbitrarly." -msgstr "是任意的。" +msgid ":math:`spoon\\_radius = \\sqrt alpha`" +msgstr ":math:`spoon\\_radius = \\sqrt alpha`" msgid "" -"The coordinates are quite similar for the same identifier, for example ::" -msgstr "对于相同的标识符，坐标非常相似，例如 ::" +"A Triangle area is considered part of the alpha shape when :math:" +"`circumcenter\\ radius < spoon\\_radius`" +msgstr "" +"三角形的面积被认为是 alpha shape 的一部分，当且仅当 :math:`circumcenter\\ " +"radius < spoon\\_radius`" + +msgid "The ``alpha`` parameter is the **spoon radius**" +msgstr "``alpha`` 参数是 **spoon radius**" msgid "" -"The coordinates are quite different for the same identifier, for example ::" -msgstr "对于相同的标识符，坐标有很大不同，例如::" +"When the total number of points is less than 3, returns an EMPTY geometry" +msgstr "当总点数小于 3 时，返回 EMPTY 几何图形" -#, fuzzy -msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" -msgstr "pgr_TSPeuclidean(`Coordinates SQL`_ , ``[start_id, end_id]``)" +msgid "pgr_alphaShape(**geometry**, [alpha])" +msgstr "pgr_alphaShape(**geometry**, [alpha])" -msgid "With default values" -msgstr "有默认值" +msgid "RETURNS ``geometry``" +msgstr "RETURNS ``geometry``" -msgid "`Coordinates SQL`_" -msgstr "`Coordinates SQL`_" +msgid "" +"passing a geometry collection with spoon radius :math:`1.5` using the return " +"variable ``geom``" +msgstr "传递一个带有 spoon 半径 :math:`1.5` 的几何集合，使用返回变量 \"geom\"" + +msgid "**geometry**" +msgstr "**geometry**" + +msgid "``geometry``" +msgstr "``geometry``" + +msgid "Geometry with at least :math:`3` points" +msgstr "至少包含 :math:`3` 个点的几何形状" + +msgid "``alpha``" +msgstr "``alpha``" + +msgid "The radius of the spoon." +msgstr "spoon的半径。" -msgid "`Coordinates SQL`_ as described below" -msgstr "`Coordinates SQL`_ 如下所述" +msgid "Return Value" +msgstr "返回值" -msgid "Coordinates SQL" -msgstr "坐标SQL" +msgid "Kind of geometry" +msgstr "几何类型" -msgid "``x``" -msgstr "``x``" +msgid "GEOMETRY COLLECTION" +msgstr "GEOMETRY COLLECTION" -msgid "X value of the coordinate." -msgstr "坐标的X值。" +msgid "A Geometry collection of Polygons" +msgstr "多边形的几何集合" -msgid "``y``" -msgstr "``y``" +msgid ":doc:`pgr_drivingDistance`" +msgstr ":doc:`pgr_drivingDistance`" -msgid "Y value of the coordinate." -msgstr "坐标的Y值。" +msgid "`ST_ConcaveHull `__" +msgstr "`ST_ConcaveHull `__" -msgid "Test 29 cities of Western Sahara" -msgstr "测试西撒哈拉29个城市" +#, fuzzy +msgid "``pgr_analyzeGraph`` -- Deprecated since 3.8.0" +msgstr "``pgr_analyzeGraph``" -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 "" -"此示例展示了如何使用Waterloo大学的 `示例数据 `__ （使用西撒哈拉 29 个城市的数据集 `__）进行性能测试" +msgid "``pgr_analyzeGraph`` — Analyzes the network topology." +msgstr "``pgr_analyzeGraph`` —分析网络拓扑。" -msgid "Creating a table for the data and storing the data" -msgstr "创建数据表并存储数据" +msgid "The function returns:" +msgstr "函数返回：" -msgid "Adding a geometry (for visual purposes)" -msgstr "添加几何图形（用于视觉目的）" +msgid "``OK`` after the analysis has finished." +msgstr "``OK`` 分析完成后。" -msgid "Total tour cost" -msgstr "旅游总费用" +msgid "``FAIL`` when the analysis was not completed due to an error." +msgstr "``FAIL`` 当分析因错误而未完成时。" -msgid "" -"Getting a total cost of the tour, compare the value with the length of an " -"optimal tour is 27603, given on the dataset" -msgstr "获取旅行的总成本，将该值与数据集上给出的最佳旅行长度 27603 进行比较" +msgid "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" +msgstr "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" -msgid "Getting a geometry of the tour" -msgstr "获取游览的几何形状" +msgid "**options:** ``[the_geom, id, source, target, rows_where]``" +msgstr "**options:** ``[the_geom, id, source, target, rows_where]``" -msgid "Visual results" -msgstr "视觉效果" +msgid "RETURNS ``VARCHAR``" +msgstr "RETURNS ``VARCHAR``" + +msgid "Prerequisites" +msgstr "先决条件" msgid "" -"Visualy, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." +"The edge table to be analyzed must contain a source column and a target " +"column filled with id's of the vertices of the segments and the " +"corresponding vertices table _vertices_pgr that stores the " +"vertices information." msgstr "" -"从视觉上看，第一幅图像是 `最优解 `__ ，第二幅图像是使用 ``pgr_TSPeuclidean`` 获得的解。" +"待分析的边表必须包含源列和目标列，其中填充了线段顶点的id以及对应的存储顶点信" +"息的顶点表_vertices_pgr。" -msgid ":doc:`sampledata` network." -msgstr ":doc:`sampledata` 网络。" +msgid "The analyze graph function accepts the following parameters:" +msgstr "分析图函数接受以下参数：" -msgid "``pgr_aStar``" -msgstr "``pgr_aStar``" +msgid "edge_table" +msgstr "edge_table" -msgid "``pgr_aStar`` — Shortest path using the A* algorithm." -msgstr "``pgr_aStar`` —使用 A* 算法的最短路径。" +msgid "``text`` Network table name. (may contain the schema name as well)" +msgstr "``text`` 网络表的名称（可能包含模式名称）" -msgid "Standarizing output columns to |short-generic-result|" -msgstr "标准输出列|short-generic-result|" +msgid "tolerance" +msgstr "tolerance" msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_aStar`` (`一对一`_) 增加 ``start_vid`` 和 ``end_vid`` 列." +"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" +msgstr "``float8`` 断开边的捕捉容差。 （以投影单位表示）" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_aStar`` (`一对多`_) 增加 ``end_vid`` 列." +msgid "the_geom" +msgstr "the_geom" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`多对一`_) 增加 ``start_vid`` 列." +msgid "" +"``text`` Geometry column name of the network table. Default value is " +"``the_geom``." +msgstr "``text``网络表的几何列名称。 默认值为``the_geom``。" -msgid "Version 3.2.0" -msgstr "版本3.2.0" +msgid "id" +msgstr "id" -msgid "New **proposed** signature:" -msgstr "新 **拟议** 的签名：" +msgid "" +"``text`` Primary key column name of the network table. Default value is " +"``id``." +msgstr "``text`` 网络表的主键列名称。 默认值为``id``。" -msgid "``pgr_aStar`` (`Combinations`_)" -msgstr "``pgr_aStar`` (`组合`_)" +msgid "source" +msgstr "source" -msgid "Version 2.4.0" -msgstr "版本2.4.0" +msgid "" +"``text`` Source column name of the network table. Default value is " +"``source``." +msgstr "``text``网络表的Source列名称。 默认值为``source``。" -msgid "New **Proposed** signatures:" -msgstr "新 **拟议** 签名：" +msgid "target" +msgstr "target" -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "``pgr_aStar`` (`一对多`_)" +msgid "" +"``text`` Target column name of the network table. Default value is " +"``target``." +msgstr "``text``网络表的Target列名称。 默认值为 ``target``。" -msgid "``pgr_aStar`` (`Many to One`_)" -msgstr "``pgr_aStar`` (`多对一`_)" +msgid "rows_where" +msgstr "rows_where" -msgid "``pgr_aStar`` (`Many to Many`_)" -msgstr "``pgr_aStar`` (`多对多`_)" +msgid "" +"``text`` Condition to select a subset or rows. Default value is ``true`` to " +"indicate all rows." +msgstr "``text`` 用于选择子集或行的条件。默认值为``true`` ，表示选择所有行。" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" -msgstr "签名更改 ``pgr_astar`` (`一对一`_)" +msgid "Uses the vertices table: _vertices_pgr." +msgstr "使用这个顶点表：_vertices_pgr。" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" -msgstr "**官方** ``pgr_aStar`` (`一对一`_)" +msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." +msgstr "完全填充顶点表的 ``cnt`` 和``chk`` 列。" msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" -msgstr "结果相当于 `pgr_aStar(` `一对一`_ `)` 结果的并集：" +"Returns the analysis of the section of the network defined by ``rows_where``" +msgstr "返回由 ``rows_where`` 定义的网络部分的分析结果" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "The vertices table is not found." +msgstr "未找到顶点表。" -msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "" +"A required column of the Network table is not found or is not of the " +"appropriate type." +msgstr "未找到网络表所需的列或该列的类型不正确。" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "The condition is not well formed." +msgstr "条件尚未形成。" -msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "The names of source , target or id are the same." +msgstr "source 、 target 或 id 的名称相同。" -msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgid "The SRID of the geometry could not be determined." +msgstr "无法确定几何图形的 SRID。" -msgid "**options:** ``[directed, heuristic, factor, epsilon]``" -msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" +msgid "The Vertices Table" +msgstr "顶点表" -msgid "Returns set of |short-generic-result|" -msgstr "Returns set of |short-generic-result|" +msgid "The structure of the vertices table is:" +msgstr "顶点表的结构为：" -msgid "Optional parameters are `named parameters` and have a default value." -msgstr "可选参数是`命名参数` 并具有默认值。" +msgid "``bigint`` Identifier of the vertex." +msgstr "``bigint`` 顶点的标识符。" -msgid "" -"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " -"heuristic :math:`2`" -msgstr "" -"在具有heuristic :math:`2` 的 **有向** 图上，从顶点 :math:`6` 到顶点 :math:" -"`12`" +msgid "cnt" +msgstr "cnt" msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " -"graph with heuristic :math:`3` and factor :math:`3.5`" -msgstr "" -"在具有heuristic :math:`3` 和factor :math:`3.5` 的 **有向** 图上，从顶点 :" -"math:`6` 到顶点 :math:`\\{10, 12\\}`" +"``integer`` Number of vertices in the edge_table that reference this vertex." +msgstr "``integer`` edge_table 中引用该顶点的顶点数。" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " -"graph with heuristic :math:`4`" -msgstr "" -"在具有heuristic :math:`4` 的 **无向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶" -"点 :math:`10`" +msgid "chk" +msgstr "chk" + +msgid "``integer`` Indicator that the vertex might have a problem." +msgstr "``integer`` 指示顶点可能有问题。" + +msgid "ein" +msgstr "ein" msgid "" -"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " -"**directed** graph with factor :math:`0.5`" -msgstr "" -"在具有factor :math:`0.5` 的 **有向** 图上，从顶点 :math:`\\{6, 8\\}` 到顶点 :" -"math:`\\{10, 12\\}`" +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming." +msgstr "``integer`` edge_table 中引用该顶点作为传入的顶点数。" + +msgid "eout" +msgstr "eout" msgid "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." -msgstr "在 **有向** 图上使用组合表，且使用factor :math:`0.5`。" +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing." +msgstr "``integer`` Edge_table 中引用该顶点作为传出的顶点数。" -msgid "Example 1" -msgstr "示例1" +msgid "``geometry`` Point geometry of the vertex." +msgstr "``geometry`` 顶点的点几何。" -msgid "Demonstration of repeated values are ignored, and result is sorted." -msgstr "演示中重复的值被忽略，且结果被排序。" +msgid "Usage when the edge table's columns MATCH the default values:" +msgstr "当边表的列与默认值匹配时的用法：" -msgid "Example 2" -msgstr "示例2" +msgid "The simplest way to use pgr_analyzeGraph is:" +msgstr "使用 pgr_analyzeGraph 最简单的方法是：" -msgid "Making **start vids** the same as **end vids**." -msgstr "使 **start vids** 与 **end vids** 相同。" +msgid "Arguments are given in the order described in the parameters:" +msgstr "参数按照参数中描述的顺序给出：" -msgid "Example 3" -msgstr "示例3" +msgid "We get the same result as the simplest way to use the function." +msgstr "我们得到与使用该函数的最简单方法相同的结果。" -msgid "Manually assigned vertex combinations." -msgstr "手动指定的顶点组合。" +msgid "An error would occur when" +msgstr "错误将会发生，当" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid "the arguments are not given in the appropriate order:" +msgstr "参数未按适当的顺序给出：" -#, fuzzy msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr "``pgr_aStarCost`` -使用 A* 算法的最短路径的总成本。" +"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 "" +"在此示例中，表 ``mytable`` 的列 ``id`` 作为几何列传递给函数，几何列 " +"``the_geom`` 作为 id 列传递给函数。" + +msgid "When using the named notation" +msgstr "当使用命名符号时" + +msgid "The order of the parameters do not matter:" +msgstr "参数的顺序并不重要：" -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "``pgr_aStarCost`` (`组合`_)" +msgid "" +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default:" +msgstr "定义有默认值的参数可以省略，只要该值与默认值匹配即可：" -msgid "New **proposed** function" -msgstr "新 **拟议** 函数" +msgid "Selecting rows using rows_where parameter" +msgstr "使用 rows_where 参数选择行" -#, fuzzy msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " -"using the A* algorithm." -msgstr "``pgr_aStarCost`` 函数使用 A* 算法汇总最短路径的成本。" +"Selecting rows based on the id. Displays the analysis a the section of the " +"network." +msgstr "根据 id 选择行。 显示网络部分的分析。" 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 "假设返回的值存储在表中，因此唯一索引将是一对：`(start_vid, end_vid)`" - -msgid "For undirected graphs, the results are symmetric." -msgstr "对于无向图，结果是对称的。" - -msgid "The returned values are ordered in ascending order:" -msgstr "返回值按升序排列：" +"Selecting the rows where the geometry is near the geometry of row with " +"``id`` = 5" +msgstr "选择几何形状接近 ``id`` = 5 的几何形状的行" -msgid "`start_vid` ascending" -msgstr "`start_vid` 升序" +msgid "" +"Selecting the rows where the geometry is near the geometry of the row with " +"``gid`` =100 of the table ``othertable``." +msgstr "选择几何形状接近表 ``othertable`` 的``gid`` = 100 的行的几何形状的行。" -msgid "`end_vid` ascending" -msgstr "`end_vid` 升序" +msgid "Usage when the edge table's columns DO NOT MATCH the default values:" +msgstr "当边表的列与默认值不匹配时的用法：" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "For the following table" +msgstr "对于下表" -msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "Using positional notation:" +msgstr "使用位置符号：" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "" +"The arguments need to be given in the order described in the parameters:" +msgstr "参数需要按照参数中描述的顺序给出：" msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +"An error would occur when the arguments are not given in the appropriate " +"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 "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" - -msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" - -msgid "Returns set of |matrix-result|" -msgstr "返回 |matrix-result| 的集合" +"如果未按适当的顺序给出参数，则会发生错误：在此示例中，表 ``mytable`` 的列 " +"``gid``作为几何列传递给函数，几何列 ``mygeom`` 作为 id 列传递给函数 。" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" +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 "在这种情况下，省略参数会产生错误，因为列名的默认值与表的列名不匹配。" -msgid "``pgr_aStarCostMatrix``" -msgstr "``pgr_aStarCostMatrix``" +msgid "Selecting rows based on the id." +msgstr "根据 id 选择行。" msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." -msgstr "``pgr_aStarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" - -msgid "Using internaly the :doc:`pgr_aStar` algorithm" -msgstr "内部使用 :doc:`pgr_aStar` 算法" +"Selecting the rows WHERE the geometry is near the geometry of row with " +"``id`` =5 ." +msgstr "选择那些几何与具有 ``id`` = 5的行的几何接近的行。" -msgid "Returns a cost matrix." -msgstr "返回成本矩阵。" +msgid "" +"Selecting the rows WHERE the geometry is near the place='myhouse' of the " +"table ``othertable``. (note the use of quote_literal)" +msgstr "" +"选择几何图形靠近表 ``othertable`` 的 place='myhouse' 的行。 （注意 " +"quote_literal 的使用）" -msgid "No ordering is performed" -msgstr "不进行排序" +msgid ":doc:`pgr_analyzeOneWay`" +msgstr ":doc:`pgr_analyzeOneWay`" -msgid "let `v` and `u` are nodes on the graph:" -msgstr "设`v` 和 `u` 是图上的节点：" +msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." +msgstr ":doc:`pgr_nodeNetwork` 创建节点到非节点边表。" -msgid "when there is no path from `v` to `u`:" -msgstr "当没有从 `v` 到 `u` 的路径时：" +#, fuzzy +msgid "``pgr_analyzeOneWay`` - Deprecated since 3.8.0" +msgstr "``pgr_analyzeGraph``" -msgid "cost from `v` to `u` is :math:`\\inf`" -msgstr "从 `v` 到 `u` 的成本是 :math:`\\inf`" +msgid "" +"``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " +"segments." +msgstr "``pgr_analyzeOneWay`` — 分析单向街道并识别翻转路段。" -msgid "when :math:`v = u` then" -msgstr "当 :math:`v = u` 时" +msgid "" +"This function analyzes oneway streets in a graph and identifies any flipped " +"segments." +msgstr "该函数分析图中的单向街道并识别任何翻转的路段。" -msgid "cost from `v` to `u` is :math:`0`" -msgstr "从 `v` 到 `u` 的成本是 :math:`0`" +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 "" +"单向路段的分析非常简单，但可以成为一种强大的工具，可以识别由于错误地设置路段" +"方向而产生的一些潜在问题。 如果一个节点有从该节点出口的边并且没有边进入该节" +"点，则该节点是`source` 。 相反，如果所有边都进入该节点但没有一条边退出该节" +"点，则该节点是`sink`。 对于`source` 类型节点来说，逻辑上不可能存在，因为如果" +"没有车辆进入该节点，则任何车辆都无法离开该节点。 同样，如果您有一个`sink`节" +"点，那么您将在该节点上堆积无限数量的车辆，因为您可以进入它但不能离开它。" -msgid "When the graph is **undirected** the cost matrix is symmetric" -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." +msgstr "" +"那么我们为什么要关心这些是否不可行呢？ 如果边的方向被错误地反转，我们就可以准" +"确地生成这些条件。 想象一下一条分开的高速公路，在北行车道上，有一个路段输入错" +"误，或者可能是一系列多个路段输入错误，或者这可能发生在环岛上。 结果可能是 " +"`source` 节点和/或`sink`节点。" -msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +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." +msgstr "" +"因此，通过计算进入和退出每个节点的边数，我们可以识别 `source` 节点和 `sink` " +"节点，以便您可以查看网络的这些区域以进行修复和/或将问题报告给数据供应商。" msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" +"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " +"**t_in_rules**, **t_out_rules**, [**options**])" msgstr "" -"在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` " -"创建对称的成本矩阵" +"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " +"**t_in_rules**, **t_out_rules**, [**options**])" -msgid "Use with :doc:`pgr_TSP`" -msgstr "使用 :doc:`pgr_TSP`" +msgid "**options:** ``[oneway, source, target, two_way_if_null]``" +msgstr "**options:** ``[oneway, source, target, two_way_if_null]``" -msgid "``pgr_alphaShape``" -msgstr "``pgr_alphaShape``" +msgid "RETURNS ``TEXT``" +msgstr "RETURNS ``TEXT``" -msgid "``pgr_alphaShape`` — Polygon part of an alpha shape." -msgstr "``pgr_alphaShape`` — Alpha 形状的多边形部分。" +msgid "s_in_rules" +msgstr "s_in_rules" -msgid "Breaking change on signature" -msgstr "签名的重大更改" +msgid "``text[]`` source node **in** rules" +msgstr "``text[]`` source节点 **输入** 规则" -msgid "**Boost 1.54** & **Boost 1.55** are supported" -msgstr "**Boost 1.54** & **Boost 1.55** 被支持" +msgid "s_out_rules" +msgstr "s_out_rules" -msgid "**Boost 1.56+** is preferable" -msgstr "**Boost 1.56+** 更好" +msgid "``text[]`` source node **out** rules" +msgstr "``text[]`` source节点 **输出** 规则" -msgid "Boost Geometry is stable on Boost 1.56" -msgstr "Boost Geometry 在 Boost 1.56 上保持稳定" +msgid "t_in_rules" +msgstr "t_in_rules" -msgid "Added alpha argument with default 0 (use optimal value)" -msgstr "添加了默认值为 0 的 alpha 参数（使用最佳值）" +msgid "``text[]`` target node **in** rules" +msgstr "``text[]`` target节点 **输入** 规则" -msgid "Support to return multiple outer/inner ring" -msgstr "支持返回多个外/内圈" +msgid "t_out_rules" +msgstr "t_out_rules" -msgid "Renamed from version 1.x" -msgstr "从版本1.X重命名" +msgid "``text[]`` target node **out** rules" +msgstr "``text[]`` target节点 **输出** 规则" -msgid "Returns the polygon part of an alpha shape." -msgstr "返回 alpha 形状的多边形部分。" +msgid "oneway" +msgstr "oneway" -msgid "Input is a *geometry* and returns a *geometry*" -msgstr "输入是*几何图形*并返回*几何图形*" +msgid "" +"``text`` oneway column name name of the network table. Default value is " +"``oneway``." +msgstr "``text``oneway 列名，网络表的名称。 默认值为``oneway``。" -msgid "Uses PostGis ST_DelaunyTriangles" -msgstr "使用 PostGis ST_DelaunyTriangles" +msgid "two_way_if_null" +msgstr "two_way_if_null" msgid "" -"Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" -msgstr "它没有使用 CGAL 的`alpha`定义，而是使用 ``spoon_radius``" - -msgid ":math:`spoon\\_radius = \\sqrt alpha`" -msgstr ":math:`spoon\\_radius = \\sqrt alpha`" +"``boolean`` flag to treat oneway NULL values as bi-directional. Default " +"value is ``true``." +msgstr "``boolean`` 将单向 NULL 值视为双向的标志。 默认值为 ``true``。" msgid "" -"A Triangle area is considered part of the alpha shape when :math:" -"`circumcenter\\ radius < spoon\\_radius`" -msgstr "" -"三角形的面积被认为是 alpha shape 的一部分，当且仅当 :math:`circumcenter\\ " -"radius < spoon\\_radius`" +"Fills completely the ``ein`` and ``eout`` columns of the vertices table." +msgstr "完全填充顶点表的 ``ein`` 和 ``eout`` 列。" -msgid "The ``alpha`` parameter is the **spoon radius**" -msgstr "``alpha`` 参数是 **spoon radius**" +msgid "The names of source , target or oneway are the same." +msgstr "source 、 target 或 oneway 的名称相同。" msgid "" -"When the total number of points is less than 3, returns an EMPTY geometry" -msgstr "当总点数小于 3 时，返回 EMPTY 几何图形" - -msgid "pgr_alphaShape(**geometry**, [alpha])" -msgstr "pgr_alphaShape(**geometry**, [alpha])" +"The rules are defined as an array of text strings that if match the " +"``oneway`` value would be counted as ``true`` for the source or target " +"**in** or **out** condition." +msgstr "" +"这些规则被定义为文本字符串数组，如果与 ``oneway`` 值匹配，则 source或 target " +"**输入** 或 **输出** 条件将被视为 ``true``。" -msgid "RETURNS ``geometry``" -msgstr "RETURNS ``geometry``" +msgid "``pgr_articulationPoints``" +msgstr "``pgr_articulationPoints``" msgid "" -"passing a geometry collection with spoon radius :math:`1.5` using the return " -"variable ``geom``" -msgstr "传递一个带有 spoon 半径 :math:`1.5` 的几何集合，使用返回变量 \"geom\"" +"``pgr_articulationPoints`` - Return the articulation points of an undirected " +"graph." +msgstr "``pgr_articulationPoints`` - 返回无向图的连接点。" -msgid "**geometry**" -msgstr "**geometry**" +msgid "Result columns change: ``seq`` is removed" +msgstr "结果列更改：删除了 ``seq``" -msgid "``geometry``" -msgstr "``geometry``" +msgid "Version 2.5.0" +msgstr "版本2.5.0" -msgid "Geometry with at least :math:`3` points" -msgstr "至少包含 :math:`3` 个点的几何形状" +msgid "New experimental function." +msgstr "新实验功能。" -msgid "``alpha``" -msgstr "``alpha``" +msgid "" +"Those vertices that belong to more than one biconnected component are called " +"articulation points or, equivalently, cut vertices. Articulation points are " +"vertices whose removal would increase the number of connected components in " +"the graph. This implementation can only be used with an undirected graph." +msgstr "" +"那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指" +"那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" -msgid "The radius of the spoon." -msgstr "spoon的半径。" +msgid "Works for **undirected** graphs." +msgstr "适用于 **无向** 图。" -msgid "Return Value" -msgstr "返回值" +msgid "``node`` ascending" +msgstr "``node`` 升序" -msgid "Kind of geometry" -msgstr "几何类型" +msgid "Running time: :math:`O(V + E)`" +msgstr "运行时间： :math:`O(V + E)`" -msgid "GEOMETRY COLLECTION" -msgstr "GEOMETRY COLLECTION" +msgid "pgr_articulationPoints(`Edges SQL`_)" +msgstr "pgr_articulationPoints(`Edges SQL`_)" -msgid "A Geometry collection of Polygons" -msgstr "多边形的几何集合" +msgid "Returns set of |result-node|" +msgstr "Returns set of |result-node|" -msgid ":doc:`pgr_drivingDistance`" -msgstr ":doc:`pgr_drivingDistance`" +msgid "The articulation points of the graph" +msgstr "图表的连接点" -msgid "`ST_ConcaveHull `__" -msgstr "`ST_ConcaveHull `__" +msgid "Nodes in red are the articulation points." +msgstr "红色节点是关节点。" -msgid "pgr_analyzeGraph" -msgstr "pgr_analyzeGraph" +#, fuzzy +msgid "" +"`Boost: Biconnected components & articulation points `__" +msgstr "" +"Boost: `双连通分量和关节点 `__" -msgid "``pgr_analyzeGraph`` — Analyzes the network topology." -msgstr "``pgr_analyzeGraph`` —分析网络拓扑。" +msgid "" +"wikipedia: `Biconnected component `__" +msgstr "" +"维基百科: `双连通分量 `__" -msgid "The function returns:" -msgstr "函数返回：" +msgid "``pgr_bdAstar``" +msgstr "``pgr_bdAstar``" -msgid "``OK`` after the analysis has finished." -msgstr "``OK`` 分析完成后。" +msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstar`` — 使用双向 A* 算法的最短路径。" -msgid "``FAIL`` when the analysis was not completed due to an error." -msgstr "``FAIL`` 当分析因错误而未完成时。" +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_bdAstar(一对一）增加了 ``start_vid`` 和``end_vid`` 列。" -msgid "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" -msgstr "pgr_analyzeGraph(**edge_table**, **tolerance**, [**options**])" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." +msgstr "pgr_bdAstar(一对多）添加了``end_vid`` 列。" -msgid "**options:** ``[the_geom, id, source, target, rows_where]``" -msgstr "**options:** ``[the_geom, id, source, target, rows_where]``" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." +msgstr "pgr_bdAstar(多对一）添加了``start_vid`` 列。" -msgid "RETURNS ``VARCHAR``" -msgstr "RETURNS ``VARCHAR``" +msgid "pgr_bdAstar(One to Many)" +msgstr "pgr_bdAstar（一对多）" -msgid "Prerequisites" -msgstr "先决条件" +msgid "pgr_bdAstar(Many to One)" +msgstr "pgr_bdAstar（多对一）" -msgid "" -"The edge table to be analyzed must contain a source column and a target " -"column filled with id's of the vertices of the segments and the " -"corresponding vertices table _vertices_pgr that stores the " -"vertices information." -msgstr "" -"待分析的边表必须包含源列和目标列，其中填充了线段顶点的id以及对应的存储顶点信" -"息的顶点表_vertices_pgr。" +msgid "pgr_bdAstar(Many to Many)" +msgstr "pgr_bdAstar（多对多）" -msgid "Use :doc:`pgr_createVerticesTable` to create the vertices table." -msgstr "使用 :doc:`pgr_createVerticesTable` 建立顶点表。" +#, fuzzy +msgid "Signature change on pgr_bdAstar(One to One)" +msgstr "在 ``pgr_bdAstar`` (`一对一`_)上的签名更改" +#, fuzzy msgid "" -"Use :doc:`pgr_createTopology` to create the topology and the vertices table." -msgstr "使用 :doc:`pgr_createTopology` 建立拓扑和顶点表。" +"The results are equivalent to the union of the results of the " +"pgr_bdAStar(One to One) on the:" +msgstr "结果相当于pgr_bdAStar(一对一) 结果的并集：" -msgid "The analyze graph function accepts the following parameters:" -msgstr "分析图函数接受以下参数：" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "edge_table" -msgstr "edge_table" +msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "``text`` Network table name. (may contain the schema name as well)" -msgstr "``text`` 网络表的名称（可能包含模式名称）" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "tolerance" -msgstr "tolerance" +msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "" -"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" -msgstr "``float8`` 断开边的捕捉容差。 （以投影单位表示）" +msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "the_geom" -msgstr "the_geom" +msgid "``pgr_bdAstarCost``" +msgstr "``pgr_bdAstarCost``" msgid "" -"``text`` Geometry column name of the network table. Default value is " -"``the_geom``." -msgstr "``text``网络表的几何列名称。 默认值为``the_geom``。" - -msgid "id" -msgstr "id" +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " +"bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` - 使用双向 A* 算法计算的最短路径的总成本。" msgid "" -"``text`` Primary key column name of the network table. Default value is " -"``id``." -msgstr "``text`` 网络表的主键列名称。 默认值为``id``。" - -msgid "source" -msgstr "source" +"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` 函数总结了使用双向 A* 算法计算最短路径的成本。" msgid "" -"``text`` Source column name of the network table. Default value is " -"``source``." -msgstr "``text``网络表的Source列名称。 默认值为``source``。" - -msgid "target" -msgstr "target" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgid "" -"``text`` Target column name of the network table. Default value is " -"``target``." -msgstr "``text``网络表的Target列名称。 默认值为 ``target``。" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "rows_where" -msgstr "rows_where" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgid "" -"``text`` Condition to select a subset or rows. Default value is ``true`` to " -"indicate all rows." -msgstr "``text`` 用于选择子集或行的条件。默认值为``true`` ，表示选择所有行。" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgid "Uses the vertices table: _vertices_pgr." -msgstr "使用这个顶点表：_vertices_pgr。" +msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." -msgstr "完全填充顶点表的 ``cnt`` 和``chk`` 列。" +msgid "``pgr_bdAstarCostMatrix``" +msgstr "``pgr_bdAstarCostMatrix``" msgid "" -"Returns the analysis of the section of the network defined by ``rows_where``" -msgstr "返回由 ``rows_where`` 定义的网络部分的分析结果" +"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." +msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" -msgid "The vertices table is not found." -msgstr "未找到顶点表。" +msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" +msgstr "内部使用 :doc:`pgr_bdAstar` 算法" + +msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" + +msgid "``pgr_bdDijkstra``" +msgstr "``pgr_bdDijkstra``" msgid "" -"A required column of the Network table is not found or is not of the " -"appropriate type." -msgstr "未找到网络表所需的列或该列的类型不正确。" +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." +msgstr "``pgr_bdDijkstra`` — 返回使用双向 Dijkstra 算法计算的最短路径。" -msgid "The condition is not well formed." -msgstr "条件尚未形成。" +#, fuzzy +msgid "pgr_bdDijkstra(One to Many)" +msgstr "pgr_bdDijkstra（一对多）" -msgid "The names of source , target or id are the same." -msgstr "source 、 target 或 id 的名称相同。" +msgid "pgr_bdDijkstra(Many to One)" +msgstr "pgr_bdDijkstra（多对一）" -msgid "The SRID of the geometry could not be determined." -msgstr "无法确定几何图形的 SRID。" +msgid "pgr_bdDijkstra(Many to Many)" +msgstr "pgr_bdDijkstra（多对多）" -msgid "The Vertices Table" -msgstr "顶点表" +#, fuzzy +msgid "Signature change on pgr_bdDijsktra(One to One)" +msgstr "``pgr_bdDijsktra`` (`一对一`_)上的签名更改" msgid "" -"The vertices table can be created with :doc:`pgr_createVerticesTable " -"` or :doc:`pgr_createTopology `" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -"顶点表可以使用 :doc:`pgr_createVerticesTable ` 或 :" -"doc:`pgr_createTopology ` 创建" - -msgid "The structure of the vertices table is:" -msgstr "顶点表的结构为：" - -msgid "``bigint`` Identifier of the vertex." -msgstr "``bigint`` 顶点的标识符。" - -msgid "cnt" -msgstr "cnt" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex." -msgstr "``integer`` edge_table 中引用该顶点的顶点数。" - -msgid "chk" -msgstr "chk" - -msgid "``integer`` Indicator that the vertex might have a problem." -msgstr "``integer`` 指示顶点可能有问题。" - -msgid "ein" -msgstr "ein" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as incoming. See :doc:`pgr_analyzeOneWay `." +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -"``integer`` edge_table 中引用该顶点作为传入的顶点数。 请参阅 :doc:" -"`pgr_analyzeOneWay `。" - -msgid "eout" -msgstr "eout" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as outgoing. See :doc:`pgr_analyzeOneWay `." +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -"``integer`` Edge_table 中引用该顶点作为传出的顶点数。 请参阅 :doc:" -"`pgr_analyzeOneWay `。" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "``geometry`` Point geometry of the vertex." -msgstr "``geometry`` 顶点的点几何。" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "Usage when the edge table's columns MATCH the default values:" -msgstr "当边表的列与默认值匹配时的用法：" +msgid "Returns set of |old-generic-result|" +msgstr "返回 |old-generic-result| 的集合" -msgid "The simplest way to use pgr_analyzeGraph is:" -msgstr "使用 pgr_analyzeGraph 最简单的方法是：" +msgid "Returns set of |result-1-1|" +msgstr "返回 |result-1-1| 的集合" -msgid "Arguments are given in the order described in the parameters:" -msgstr "参数按照参数中描述的顺序给出：" +msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" +msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`10`" + +msgid "Returns set of |result-1-m|" +msgstr "返回 |result-1-m| 的集合" -msgid "We get the same result as the simplest way to use the function." -msgstr "我们得到与使用该函数的最简单方法相同的结果。" +msgid "" +"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " +"graph" +msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "An error would occur when" -msgstr "错误将会发生，当" +msgid "Returns set of |result-m-1|" +msgstr "返回 |result-m-1| 的集合" -msgid "the arguments are not given in the appropriate order:" -msgstr "参数未按适当的顺序给出：" +msgid "" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" 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." -msgstr "" -"在此示例中，表 ``mytable`` 的列 ``id`` 作为几何列传递给函数，几何列 " -"``the_geom`` 作为 id 列传递给函数。" +"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " +"**undirected** graph" +msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" -msgid "When using the named notation" -msgstr "当使用命名符号时" +msgid "Using a combinations table on an **undirected** graph" +msgstr "在 **无向** 图上使用组合表" -msgid "The order of the parameters do not matter:" -msgstr "参数的顺序并不重要：" +msgid "https://en.wikipedia.org/wiki/Bidirectional_search" +msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" + +msgid "``pgr_bdDijkstraCost``" +msgstr "``pgr_bdDijkstraCost``" msgid "" -"Parameters defined with a default value can be omitted, as long as the value " -"matches the default:" -msgstr "定义有默认值的参数可以省略，只要该值与默认值匹配即可：" +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " +"Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` —返回使用双向 Dijkstra 算法计算最短路径的成本。" -msgid "Selecting rows using rows_where parameter" -msgstr "使用 rows_where 参数选择行" +msgid "" +"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " +"path using the bidirectional Dijkstra Algorithm." +msgstr "``pgr_bdDijkstraCost`` 函数使用双向 Dijkstra 算法汇总最短路径的成本。" msgid "" -"Selecting rows based on the id. Displays the analysis a the section of the " -"network." -msgstr "根据 id 选择行。 显示网络部分的分析。" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgid "" -"Selecting the rows where the geometry is near the geometry of row with " -"``id`` = 5" -msgstr "选择几何形状接近 ``id`` = 5 的几何形状的行" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "" -"Selecting the rows where the geometry is near the geometry of the row with " -"``gid`` =100 of the table ``othertable``." -msgstr "选择几何形状接近表 ``othertable`` 的``gid`` = 100 的行的几何形状的行。" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " +"[``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " +"[``directed``])" -msgid "Usage when the edge table's columns DO NOT MATCH the default values:" -msgstr "当边表的列与默认值不匹配时的用法：" +msgid "" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " +"[``directed``])" +msgstr "" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " +"[``directed``])" -msgid "For the following table" -msgstr "对于下表" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgid "Using positional notation:" -msgstr "使用位置符号：" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"The arguments need to be given in the order described in the parameters:" -msgstr "参数需要按照参数中描述的顺序给出：" +msgid "``pgr_bdDijkstraCostMatrix``" +msgstr "``pgr_bdDijkstraCostMatrix``" msgid "" -"An error would occur when the arguments are not given in the appropriate " -"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." +"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_bdDijkstra`." msgstr "" -"如果未按适当的顺序给出参数，则会发生错误：在此示例中，表 ``mytable`` 的列 " -"``gid``作为几何列传递给函数，几何列 ``mygeom`` 作为 id 列传递给函数 。" +"``pgr_bdDijkstraCostMatrix`` - 使用 :doc:`pgr_bdDijkstra` 计算成本矩阵。" 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 "在这种情况下，省略参数会产生错误，因为列名的默认值与表的列名不匹配。" - -msgid "Selecting rows based on the id." -msgstr "根据 id 选择行。" +"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgstr "使用双向Dijkstra算法，计算并返回成本矩阵。" -msgid "" -"Selecting the rows WHERE the geometry is near the geometry of row with " -"``id`` =5 ." -msgstr "选择那些几何与具有 ``id`` = 5的行的几何接近的行。" +msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgid "" -"Selecting the rows WHERE the geometry is near the place='myhouse' of the " -"table ``othertable``. (note the use of quote_literal)" +"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " +"**undirected** graph" msgstr "" -"选择几何图形靠近表 ``othertable`` 的 place='myhouse' 的行。 （注意 " -"quote_literal 的使用）" +"在一个 **无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵" -msgid "The examples use the :doc:`sampledata` network." -msgstr "这些示例使用 :doc:`sampledata` 网络。" +msgid "Use with :doc:`pgr_TSP`." +msgstr "与 :doc:`pgr_TSP` 一起使用。" -msgid ":doc:`pgr_analyzeOneWay`" -msgstr ":doc:`pgr_analyzeOneWay`" +msgid "``pgr_bellmanFord - Experimental``" +msgstr "``pgr_bellmanFord - 实验``" -msgid ":doc:`pgr_createVerticesTable`" -msgstr ":doc:`pgr_createVerticesTable`" +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgstr "``pgr_bellmanFord`` — 使用 Bellman-Ford 算法计算的最短路径。" -msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." -msgstr ":doc:`pgr_nodeNetwork` 创建节点到非节点边表。" +msgid "New experimental signature:" +msgstr "新 实验性*签名：" -msgid "pgr_analyzeOneWay" -msgstr "pgr_analyzeOneWay" +msgid "pgr_bellmanFord(Combinations)" +msgstr "pgr_bellmanFord(组合)" msgid "" -"``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " -"segments." -msgstr "``pgr_analyzeOneWay`` — 分析单向街道并识别翻转路段。" +"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 "" +"Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和" +"1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点" +"（``start_vid``）到终点顶点（``end_vid``）的最短路径，其中一些边的权重可以为" +"负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" msgid "" -"This function analyzes oneway streets in a graph and identifies any flipped " -"segments." -msgstr "该函数分析图中的单向街道并识别任何翻转的路段。" +"Process is valid for edges with both positive and negative edge weights." +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." +"When the start vertex and the end vertex are the same, there is no path. The " +"agg_cost would be :math:`0`." msgstr "" -"单向路段的分析非常简单，但可以成为一种强大的工具，可以识别由于错误地设置路段" -"方向而产生的一些潜在问题。 如果一个节点有从该节点出口的边并且没有边进入该节" -"点，则该节点是`source` 。 相反，如果所有边都进入该节点但没有一条边退出该节" -"点，则该节点是`sink`。 对于`source` 类型节点来说，逻辑上不可能存在，因为如果" -"没有车辆进入该节点，则任何车辆都无法离开该节点。 同样，如果您有一个`sink`节" -"点，那么您将在该节点上堆积无限数量的车辆，因为您可以进入它但不能离开它。" +"当起始顶点和结束顶点相同时，不存在路径。聚合成本（agg_cost）将为 :math:`0`。" 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." +"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 "" -"那么我们为什么要关心这些是否不可行呢？ 如果边的方向被错误地反转，我们就可以准" -"确地生成这些条件。 想象一下一条分开的高速公路，在北行车道上，有一个路段输入错" -"误，或者可能是一系列多个路段输入错误，或者这可能发生在环岛上。 结果可能是 " -"`source` 节点和/或`sink`节点。" +"当起始顶点和结束顶点不同，并且它们之间存在路径且不存在*负循环*时。 agg_cost " +"将是某个有限值，表示它们之间的最短距离。" 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." +"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 "" -"因此，通过计算进入和退出每个节点的边数，我们可以识别 `source` 节点和 `sink` " -"节点，以便您可以查看网络的这些区域以进行修复和/或将问题报告给数据供应商。" +"当起始顶点和结束顶点不同，并且它们之间存在路径，但包含*负循环*时。 在这种情况" +"下，这些顶点的 agg_cost 继续减少，因此无法为它们定义 agg_cost 。" msgid "" -"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " -"**t_in_rules**, **t_out_rules**, [**options**])" +"When the start vertex and the end vertex are different, and there is no " +"path. The agg_cost is :math:`\\infty`." msgstr "" -"pgr_analyzeOneWay(**geom_table**, **s_in_rules**, **s_out_rules**, " -"**t_in_rules**, **t_out_rules**, [**options**])" - -msgid "**options:** ``[oneway, source, target, two_way_if_null]``" -msgstr "**options:** ``[oneway, source, target, two_way_if_null]``" - -msgid "RETURNS ``TEXT``" -msgstr "RETURNS ``TEXT``" - -msgid "s_in_rules" -msgstr "s_in_rules" - -msgid "``text[]`` source node **in** rules" -msgstr "``text[]`` source节点 **输入** 规则" - -msgid "s_out_rules" -msgstr "s_out_rules" - -msgid "``text[]`` source node **out** rules" -msgstr "``text[]`` source节点 **输出** 规则" +"当起始顶点和结束顶点不同且不存在路径时，聚合成本（agg_cost）为 :math:" +"`\\infty`。" -msgid "t_in_rules" -msgstr "t_in_rules" +msgid "" +"For optimization purposes, any duplicated value in the `start_vids` or " +"`end_vids` are ignored." +msgstr "出于优化目的，`start_vids`或 `end_vids` 中的任何重复值都将被忽略。" -msgid "``text[]`` target node **in** rules" -msgstr "``text[]`` target节点 **输入** 规则" +msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" +msgstr "运行时间： :math:`O(| start\\_vids | * ( V * E))`" -msgid "t_out_rules" -msgstr "t_out_rules" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "``text[]`` target node **out** rules" -msgstr "``text[]`` target节点 **输出** 规则" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "oneway" -msgstr "oneway" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgid "" -"``text`` oneway column name name of the network table. Default value is " -"``oneway``." -msgstr "``text``oneway 列名，网络表的名称。 默认值为``oneway``。" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "two_way_if_null" -msgstr "two_way_if_null" +msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "" -"``boolean`` flag to treat oneway NULL values as bi-directional. Default " -"value is ``true``." -msgstr "``boolean`` 将单向 NULL 值视为双向的标志。 默认值为 ``true``。" +"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " +"graph" +msgstr "" +"从节点 :math:`6`到节点:math:`\\{ 10, 17\\}`的最短路径，基于一个**directed**图" + +msgid "Using a combinations table on an **undirected** graph." +msgstr "在 **无向** 图上使用组合表。" +#, fuzzy msgid "" -"It is strongly recommended to use the named notation. See :doc:" -"`pgr_createVerticesTable` or :doc:`pgr_createTopology` for examples." +"`Boost: Bellman Ford `__" msgstr "" -"强烈建议使用命名符号。 有关示例，请参阅 :doc:`pgr_createVerticesTable` 或 :" -"doc:`pgr_createTopology`。" +"`Boost: Belman Ford `__" -msgid "" -"Fills completely the ``ein`` and ``eout`` columns of the vertices table." -msgstr "完全填充顶点表的 ``ein`` 和 ``eout`` 列。" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgid "The names of source , target or oneway are the same." -msgstr "source 、 target 或 oneway 的名称相同。" +#, fuzzy +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "``pgr_betweennessCentrality``" +#, fuzzy msgid "" -"The rules are defined as an array of text strings that if match the " -"``oneway`` value would be counted as ``true`` for the source or target " -"**in** or **out** condition." -msgstr "" -"这些规则被定义为文本字符串数组，如果与 ``oneway`` 值匹配，则 source或 target " -"**输入** 或 **输出** 条件将被视为 ``true``。" +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " +"centrality using Brandes Algorithm" +msgstr "``pgr_betweennessCentrality`` - 使用 Brandes 算法计算相对介数中心度" + +msgid "Version 3.7.0" +msgstr "版本 3.7.0" msgid "" -"The vertices table can be created with :doc:`pgr_createVerticesTable` or :" -"doc:`pgr_createTopology`" -msgstr "" -"顶点表可以使用 :doc:`pgr_createVerticesTable` 或 :doc:`pgr_createTopology` 创" -"建" +"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " +"the betweenness centrality score of all vertices." +msgstr "Brandes 算法利用稀疏图来评估所有顶点的中心度得分。" msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex. " -"See :doc:`pgr_analyzeGgraph `." +"Betweenness centrality measures the extent to which a vertex lies on the " +"shortest paths between all other pairs of vertices. Vertices with a high " +"betweenness centrality score may have considerable influence in a network by " +"the virtue of their control over the shortest paths passing between them." msgstr "" -"``integer`` edge_table 中引用该顶点的顶点数。 请参阅 :doc:`pgr_analyzeGgraph " -"`。" +"Betweenness centrality（介数中心性）衡量的是一个顶点在所有其他顶点对之间的最" +"短路径中的重要性。具有较高介数中心性得分的顶点，通常能够对网络产生显著的影" +"响，因为它们控制了通过它们的最短路径。" msgid "" -"``integer`` Indicator that the vertex might have a problem. See :doc:" -"`pgr_analyzeGraph `." +"The removal of these vertices will affect the network by disrupting the it, " +"as most of the shortest paths between vertices pass through them." msgstr "" -"``integer`` 指示顶点可能有问题。 请参阅 :doc:`pgr_analyzeGraph " -"`。" +"这些顶点的移除会影响网络，因为大多数顶点之间的最短路径都经过它们，从而破坏了" +"网络的连接性。" -msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as incoming." -msgstr "``integer`` edge_table 中引用该顶点作为传入的顶点数。" +msgid "This implementation work for both directed and undirected graphs." +msgstr "该实现适用于directed 和undirected。" -msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as outgoing." -msgstr "``integer`` Edge_table 中引用该顶点作为传出的顶点数。" +msgid "Running time: :math:`\\Theta(VE)`" +msgstr "运行时间: :math:`Theta(VE)`" -msgid ":doc:`pgr_analyzeGraph`" -msgstr ":doc:`pgr_analyzeGraph`" +msgid "Running space: :math:`\\Theta(VE)`" +msgstr "运行空间: :math:`\\Theta(VE)`" -msgid "``pgr_articulationPoints``" -msgstr "``pgr_articulationPoints``" +msgid "Throws when there are no edges in the graph" +msgstr "当图形中没有边时抛出" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." -msgstr "``pgr_articulationPoints`` - 返回无向图的连接点。" +msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgstr "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgid "Result columns change: ``seq`` is removed" -msgstr "结果列更改：删除了 ``seq``" +msgid "Returns set of ``(vid, centrality)``" +msgstr "返回 ``(vid, centrality)`` 的集合" -msgid "Version 2.5.0" -msgstr "版本2.5.0" +msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." +msgstr "对于带边的directed graph:math:`\\{1, 2, 3, 4\\}`." -msgid "New **experimental** function" -msgstr "新 **实验** 函数" +msgid "Explanation" +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." -msgstr "" -"那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指" -"那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" +msgid "The betweenness centrality are between parenthesis." +msgstr "介数中心性值位于括号内。" -msgid "Works for **undirected** graphs." -msgstr "适用于 **无向** 图。" +msgid "The leaf vertices have betweenness centrality :math:`0`." +msgstr "叶子节点的介数中心性为 :math:`0`。" -msgid "``node`` ascending" -msgstr "``node`` 升序" +msgid "" +"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" +"`10`." +msgstr "顶点 :math:`6` 的间隔中心度高于顶点 :math:`10` 的间隔中心度。" -msgid "Running time: :math:`O(V + E)`" -msgstr "运行时间： :math:`O(V + E)`" +msgid "Removing vertex :math:`6` will create three graph components." +msgstr "移除顶点 :math:`6` 将创建三个图形组件。" -msgid "pgr_articulationPoints(`Edges SQL`_)" -msgstr "pgr_articulationPoints(`Edges SQL`_)" +msgid "Removing vertex :math:`10` will create two graph components." +msgstr "移除节点 :math:`10` 将会产生两个图形组件。" -msgid "Returns set of |result-node|" -msgstr "Returns set of |result-node|" +msgid "``vid``" +msgstr "``vid``" -msgid "The articulation points of the graph" -msgstr "图表的连接点" +msgid "``centrality``" +msgstr "``capacity``" -msgid "Nodes in red are the articulation points." -msgstr "红色节点是关节点。" +msgid "" +"Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgstr "该节点的相对介数中心性得分（范围为 [0,1]）" +#, fuzzy msgid "" -"Boost: `Biconnected components & articulation points `__" +"`Boost: betweenness centrality `_" msgstr "" -"Boost: `双连通分量和关节点 `__" +"`Boost: betweenness centrality `_" + +msgid "``pgr_biconnectedComponents``" +msgstr "``pgr_biconnectedComponents``" msgid "" -"wikipedia: `Biconnected component `__" -msgstr "" -"维基百科: `双连通分量 `__" +"``pgr_biconnectedComponents`` — Biconnected components of an undirected " +"graph." +msgstr "``pgr_biconnectedComponents`` — 无向图的双连通分量。" -msgid "``pgr_bdAstar``" -msgstr "``pgr_bdAstar``" +msgid "Result columns change:" +msgstr "结果列发生变化：" -msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." -msgstr "``pgr_bdAstar`` — 使用双向 A* 算法的最短路径。" +msgid "``n_seq`` is removed" +msgstr "``n_seq`` 被删除" + +msgid "``seq`` changed type to ``BIGINT``" +msgstr "``seq`` 将类型更改为``BIGINT``" msgid "" -"``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_bdAstar`` (`一对一`_) 增加 ``start_vid`` 和 ``end_vid`` 列。" +"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." +msgstr "组件由边描述。" + +msgid "``component`` ascending." +msgstr "``component`` 升序。" -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_bdAstar`` (`一对多`_) 增加 ``end_vid`` 列。" +msgid "``edge`` ascending." +msgstr "``edge`` 升序。" -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_bdAstar`` (`多对一`_) 增加 ``start_vid`` 列。" +msgid "pgr_biconnectedComponents(`Edges SQL`_)" +msgstr "pgr_biconnectedComponents(`Edges SQL`_)" -msgid "``pgr_bdAstar`` (`Combinations`_)" -msgstr "``pgr_bdAstar`` (`组合`_)" +msgid "Returns set of |result-component-E|" +msgstr "Returns set of |result-component-E|" -msgid "``pgr_bdAstar`` (`One to Many`_)" -msgstr "``pgr_bdAstar`` (`一对多`_)" +msgid "The biconnected components of the graph" +msgstr "图的双连通分量" -msgid "``pgr_bdAstar`` (`Many to One`_)" -msgstr "``pgr_bdAstar`` (`多对一`_)" +msgid "``component``" +msgstr "``component``" -msgid "``pgr_bdAstar`` (`Many to Many`_)" -msgstr "``pgr_bdAstar`` (`多对多`_)" +msgid "Component identifier." +msgstr "分量标识符。" -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" -msgstr "在 ``pgr_bdAstar`` (`一对一`_)上的签名更改" +msgid "Has the value of the minimum edge identifier in the component." +msgstr "具有组件中最小边标识符的值。" + +msgid "Identifier of the edge that belongs to the ``component``." +msgstr "属于该 ``分量`` 的边的标识符。" -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" -msgstr "**官方** ``pgr_bdAstar`` (`一对一`_)" +msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" +msgstr "``pgr_binaryBreadthFirstSearch`` - 实验" msgid "" -"The results are equivalent to the union of the results of the `pgr_bdAStar(` " -"`One to One`_ `)` on the:" -msgstr "结果相当于`pgr_bdAStar(` `一对一`_ `)` 结果的并集：" +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " +"graph." +msgstr "``pgr_binaryBreadthFirstSearch`` — 返回二进制图中的最短路径。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "" +"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" +"negative integer, is termed as a 'binary graph'." +msgstr "任何边权属于集合 {0,X} 的图（其中“X”是任何非负整数）都被称为“二元图”。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(组合)" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +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 "" +"众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:" +"`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点" +"到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权" +"重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，" +"比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。" -msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +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 "" +"然而，如果权重受到更多限制，我们可以使用一种更快的算法。这个算法被称为'二进制" +"广度优先搜索'，也称为'0-1 BFS'，它是标准广度优先搜索问题的一种变体，用于解决" +"单源最短路径（SSSP）问题，当每条边的权重属于集合{0，X}，其中'X'是任意非负实数" +"时，其时间复杂度为 :math:`O(|E|)`。" -msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" +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 "" +"过程仅在“二元图”上完成。 （“二元图”：边权重属于集合 {0,X} 的任何图，其中“X”是" +"任何非负实整数。）" -msgid "pgr_bdAstarCost" -msgstr "pgr_bdAstarCost" +msgid "Running time: :math:`O(| start\\_vids | * |E|)`" +msgstr "运行时间： :math:`O(| start\\_vids | * |E|)`" -#, fuzzy msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost`` -使用双向 A* 算法的最短路径的总成本。" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " +"[``directed``])" +msgstr "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " +"[``directed``])" -msgid "``pgr_bdAstarCost`` (`Combinations`_)" -msgstr "``pgr_bdAstarCost`` (`组合`_)" +msgid "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " +"[``directed``])" +msgstr "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " +"[``directed``])" -#, fuzzy msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " -"using the bidirectional A* algorithm." -msgstr "``pgr_bdAstarCost`` 函数使用双向 A* 算法汇总最短路径的成本。" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " +"[``directed``])" +msgstr "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " +"[``directed``])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " +"[``directed``])" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " +"[``directed``])" + +msgid "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " +"[``directed``])" +msgstr "" +"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " +"[``directed``])" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" +"math:`1``)" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +"**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同（即为 :math:`1`）" +#, fuzzy msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +"`Boost: Breadth First Search `__" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +"`Boost：广度优先搜索算法文档 `__" + +msgid "https://cp-algorithms.com/graph/01_bfs.html" +msgstr "https://cp-algorithms.com/graph/01_bfs.html" msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" - -msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid "``pgr_bdAstarCostMatrix``" -msgstr "``pgr_bdAstarCostMatrix``" +#, fuzzy +msgid "``pgr_bipartite`` - Experimental" +msgstr "pgr_bipartite -实验" msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." -msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" +"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " +"within the same set are adjacent." +msgstr "`pgr_bipartite` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。" -msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" -msgstr "内部使用 :doc:`pgr_bdAstar` 算法" +msgid "" +"A bipartite graph is a graph with two sets of vertices which are connected " +"to each other, but not within themselves. A bipartite graph is possible if " +"the graph coloring is possible using two colors such that vertices in a set " +"are colored with the same color." +msgstr "" +"二方图是指有两组顶点的图，这两组顶点相互连接，但内部没有连接。如果可以使用两" +"种颜色对图形着色，从而使一个集合中的顶点着色为相同的颜色，那么就可能是一个二" +"方图。" -msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" +msgid "The algorithm works in undirected graph only." +msgstr "该算法只适用于无向图。" -msgid "``pgr_bdDijkstra``" -msgstr "``pgr_bdDijkstra``" +msgid "The returned values are not ordered." +msgstr "返回值没有排序。" -#, fuzzy msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." -msgstr "``pgr_bdDijkstra`` — 使用双向 Dijkstra 算法返回最短路径。" - -msgid "pgr_bdDijkstra(`Combinations`_)" -msgstr "pgr_bdDijkstra(`组合`_)" +"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 "" +"该算法检查图是否是二分图。 如果它是二分的，那么它返回节点以及代表两个不同集合" +"的两种颜色 `0` 和`1`。" -msgid "New **Proposed** functions:" -msgstr "新 **拟议** 函数：" +msgid "If graph is not bipartite then algorithm returns empty set." +msgstr "如果图不是两部分的，那么算法会返回空集。" -msgid "``pgr_bdDijkstra`` (`One to Many`_)" -msgstr "``pgr_bdDijkstra`` (`一对多`_)" +msgid "pgr_bipartite(`Edges SQL`_)" +msgstr "pgr_bipartite(`Edges SQL`_)" -msgid "``pgr_bdDijkstra`` (`Many to One`_)" -msgstr "``pgr_bdDijkstra`` (`多对一`_)" +msgid "Returns set of |result-node-color|" +msgstr "Returns set of |result-node-color|" -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" -msgstr "``pgr_bdDijkstra`` (`多对多`_)" +msgid "When the graph is bipartite" +msgstr "当图形为两方时" -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" -msgstr "``pgr_bdDijsktra`` (`一对一`_)上的签名更改" +msgid "Additional Example" +msgstr "附加示例" -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" -msgstr "**官方** ``pgr_bdDijkstra`` (`一对一`_)" +msgid "The odd length cyclic graph can not be bipartite." +msgstr "奇长循环图不可能是两部分的。" msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +"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 "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +"边 :math:`5 \\rightarrow 1` 将使顶点为 :math:`\\{1, 3, 7, 6, 5\\}` 的子图成为" +"奇数长度的循环图，因为循环有 5 个顶点。" + +msgid "Edges in blue represent odd length cycle subgraph." +msgstr "蓝色边代表奇数长度循环子图。" msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +"`Boost: is_bipartite `__" msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +"`Boost: is_bipartite `__" msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +"`Wikipedia: bipartite graph `__" +msgstr "`维基百科：二分图 `__" + +msgid "``pgr_boykovKolmogorov``" +msgstr "``pgr_boykovKolmogorov``" msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +"``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " +"maximizes the flow from the sources to the targets using Boykov Kolmogorov " +"algorithm." msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +"`pgr_boykovKolmogorov`` - 使用 Boykov Kolmogorov 算法计算图边的流量，使从源到" +"目标的流量最大。" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgstr "从 ``pgr_maxFlowBoykovKolmogorov`` 更名而来" -msgid "Returns set of |old-generic-result|" -msgstr "返回 |old-generic-result| 的集合" +#, fuzzy +msgid "Function promoted to proposed." +msgstr "实验性的功能被提升为提议的。" -msgid "Returns set of |result-1-1|" -msgstr "返回 |result-1-1| 的集合" +msgid "Running time: Polynomial" +msgstr "运行时间：多项式时间" -msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" -msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`10`" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgid "Returns set of |result-1-m|" -msgstr "返回 |result-1-m| 的集合" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" -msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgid "Returns set of |result-m-1|" -msgstr "返回 |result-m-1| 的集合" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" +msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgstr "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" -msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" +msgid "Returns set of |result-flow|" +msgstr "Returns set of |result-flow|" -msgid "Using a combinations table on an **undirected** graph" -msgstr "在 **无向** 图上使用组合表" +msgid "From vertex :math:`11` to vertex :math:`12`" +msgstr "从顶点 :math:`11` 到顶点 :math:`12`" -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 "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "从顶点 :math:`11` 到顶点 :math:`\\{5, 10, 12\\}`" -msgid "https://en.wikipedia.org/wiki/Bidirectional_search" -msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" +msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`12`" -msgid "``pgr_bdDijkstraCost``" -msgstr "``pgr_bdDijkstraCost``" +msgid "" +"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`\\{5, 10, 12\\}`" + +msgid "" +"Using a combinations table, equivalent to calculating result from vertices :" +"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgstr "" +"使用组合表，相当于计算从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`{\\10, 15, " +"14\\}` 的结果。" #, fuzzy msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." -msgstr "``pgr_bdDijkstraCost`` — 使用双向 Dijkstra 算法返回最短路径的成本。" +"`Boost: Boykov Kolmogorov max flow `__" +msgstr "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" -msgstr "``pgr_bdDijkstraCost`` (`组合`_)" +msgid "``pgr_breadthFirstSearch`` - Experimental" +msgstr "``pgr_breadthFirstSearch`` - 实验" msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " -"path using the bidirectional Dijkstra Algorithm." -msgstr "``pgr_bdDijkstraCost`` 函数使用双向 Dijkstra 算法汇总最短路径的成本。" +"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " +"First Search algorithm." +msgstr "``pgr_breadthFirstSearch`` —使用广度优先搜索算法返回遍历顺序。" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +"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 "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +"Provides the Breadth First Search traversal order from a source node to a " +"target depth level." +msgstr "提供从源节点到目标深度级别的广度优先搜索遍历顺序。" + +msgid "Running time: :math:`O(E + V)`" +msgstr "运行时间： :math:`O(E + V)`" + +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" + +msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" + +msgid "**options:** ``[max_depth, directed]``" +msgstr "**options:** ``[max_depth, directed]``" + +msgid "Returns set of |result-bfs|" +msgstr "返回 |result-bfs| 的集合" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +"From root vertex :math:`6` on a **directed** graph with edges in ascending " +"order of ``id``" msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +"从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " +"**depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"从根顶点开始 :math:`{12, 6\\}` 在一个 **无向** 图上，**depth** :math:`<=2`，" +"边按 ``id`` 升序排列" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" +msgid "DFS optional parameters" +msgstr "DFS 可选参数" -msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." +msgstr "与 `单个顶点`_ 相同，边按 ``id`` 升序排列。" -msgid "``pgr_bdDijkstraCostMatrix``" -msgstr "``pgr_bdDijkstraCostMatrix``" +msgid "Same as `Single vertex`_ with edges in descending order of ``id``." +msgstr "与 `单个顶点`_ 相同，边按 ``id`` 降序排列。" + +msgid "The resulting traversal is different." +msgstr "由此产生的遍历是不同的。" msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." +"The left image shows the result with ascending order of ids and the right " +"image shows with descending order of the edge identifiers." msgstr "" -"``pgr_bdDijkstraCostMatrix`` - 使用 :doc:`pgr_bdDijkstra` 计算成本矩阵。" +"左图显示的是按 ID 升序排列的结果，右图显示的是按边缘标识符降序排列的结果。" -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." -msgstr "使用双向Dijkstra算法，计算并返回成本矩阵。" +msgid "|ascending| |descending|" +msgstr "|ascending| |descending|" -msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" +msgid "ascending" +msgstr "升序" + +msgid "descending" +msgstr "降序" msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" +"`Wikipedia: Breadth First Search algorithm `__" msgstr "" -"在一个 **无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵" +"`维基百科：广度优先搜索算法 `__" -msgid "Use with :doc:`pgr_TSP`." -msgstr "与 :doc:`pgr_TSP` 一起使用。" +msgid "``pgr_bridges``" +msgstr "``pgr_bridges``" -msgid "``pgr_bellmanFord - Experimental``" -msgstr "``pgr_bellmanFord - 实验``" +msgid "``pgr_bridges`` - Return the bridges of an undirected graph." +msgstr "``pgr_bridges`` - 返回无向图的桥。" -#, fuzzy -msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." -msgstr "``pgr_bellmanFord`` — 使用 Bellman-Ford 算法的最短路径。" +msgid "" +"A bridge is an edge of an undirected graph whose deletion increases its " +"number of connected components. This implementation can only be used with an " +"undirected graph." +msgstr "" +"桥是指一个无向图中的边，如果删除它会增加该图的连通分量数量。此实现仅适用于无" +"向图。" -msgid "New **experimental** signature:" -msgstr "新 **实验性** 签名：" +msgid "``edge`` ascending" +msgstr "``edge`` 升序" -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "``pgr_bellmanFord`` (`组合`_)" +msgid "Running time: :math:`O(E * (V + E))`" +msgstr "运行时间： :math:`O(E * (V + E))`" -msgid "New **experimental** signatures:" -msgstr "新 **实验** 签名：" +msgid "pgr_bridges(`Edges SQL`_)" +msgstr "pgr_bridges(`Edges SQL`_)" -msgid "``pgr_bellmanFord`` (`One to One`_)" -msgstr "``pgr_bellmanFord`` (`一对一`_)" +msgid "Returns set of |result-edge|" +msgstr "返回集合 |result-edge|" -msgid "``pgr_bellmanFord`` (`One to Many`_)" -msgstr "``pgr_bellmanFord`` (`一对多`_)" +msgid "The bridges of the graph" +msgstr "图的桥" -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "``pgr_bellmanFord`` (`多对一`_)" +msgid "Identifier of the edge that is a bridge." +msgstr "作为桥的边的标识符。" -msgid "``pgr_bellmanFord`` (`Many to Many`_)" -msgstr "``pgr_bellmanFord`` (`多对多`_)" +msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +#, fuzzy 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." +"`Boost: Connected components `__" msgstr "" -"Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和" -"1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点" -"（``start_vid``）到终点顶点（``end_vid``）的最短路径，其中一些边的权重可以为" -"负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" +"Boost: ` 已连接组件 `__" -msgid "" -"Process is valid for edges with both positive and negative edge weights." -msgstr "该过程对于具有正边权重和负边权重的边都有效。" +msgid "``pgr_chinesePostman`` - Experimental" +msgstr "``pgr_chinesePostman`` - 实验" msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." +"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " +"every edge in a directed graph and starts and ends on the same vertex." msgstr "" -"当起始顶点和结束顶点相同时，不存在路径。聚合成本（agg_cost）将为 :math:`0`。" +"``pgr_chinesePostman`` — 计算包含有向图中的每条边并从同一顶点开始和结束的最短" +"回路路径。" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." -msgstr "" -"当起始顶点和结束顶点不同，并且它们之间存在路径且不存在*负循环*时。 agg_cost " -"将是某个有限值，表示它们之间的最短距离。" +msgid "Returns ``EMPTY SET`` on a disconnected graph" +msgstr "在一个不连通的图上返回 ``EMPTY SET``" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them, but it contains a *negative cycle*. In such case, " -"agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost " -"can’t be defined for them." -msgstr "" -"当起始顶点和结束顶点不同，并且它们之间存在路径，但包含*负循环*时。 在这种情况" -"下，这些顶点的 agg_cost 继续减少，因此无法为它们定义 agg_cost 。" +msgid "pgr_chinesePostman(`Edges SQL`_)" +msgstr "pgr_chinesePostman(`Edges SQL`_)" -msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." -msgstr "" -"当起始顶点和结束顶点不同且不存在路径时，聚合成本（agg_cost）为 :math:" -"`\\infty`。" +msgid "Returns set of |result-1-1-no-seq|" +msgstr "返回 |result-1-1-no-seq| 的集合" -msgid "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." -msgstr "出于优化目的，`start_vids`或 `end_vids` 中的任何重复值都将被忽略。" +msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgstr "Returns set of ``(seq, node, edge, cost, agg_cost)``" -msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" -msgstr "运行时间： :math:`O(| start\\_vids | * ( V * E))`" +msgid "Sequential value starting from ``1``" +msgstr "从 ``1`` 开始的顺序值" msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +"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 "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +"用于从路径序列中的 ``节点`` 到下一个节点的边的标识符。``-1`` 表示路径的最后一" +"个节点。" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "Aggregate cost from ``start_v`` to ``node``." +msgstr "从 ``start_v`` 到 ``node`` 的总成本。" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "``pgr_chinesePostmanCost`` - Experimental" +msgstr "``pgr_chinesePostmanCost`` - 实验" msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +"``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_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +"``pgr_chinesePostmanCost`` — 计算一个包含有向图中的每条边、以同一顶点为起点和" +"终点的最短成本的回路路径。" -msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "Return value when the graph if disconnected" +msgstr "当图是不连通的时候返回的数值" -#, fuzzy -msgid "" -"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " -"graph" -msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" +msgid "pgr_chinesePostmanCost(`Edges SQL`_)" +msgstr "pgr_chinesePostmanCost(`Edges SQL`_)" -msgid "Using a combinations table on an **undirected** graph." -msgstr "在 **无向** 图上使用组合表。" +msgid "RETURNS ``FLOAT``" +msgstr "RETURNS ``FLOAT``" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" -msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "``pgr_chinesepostmancost``" +msgstr "``pgr_chinesepostmancost``" -msgid "``pgr_betweennessCentrality``" -msgstr "" +msgid "Minimum costs of a circuit path." +msgstr "一个回路路径的最小成本。" + +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " -"centrality using Brandes Algorithm" +"``pgr_connectedComponents`` — Connected components of an undirected graph " +"using a DFS-based approach." msgstr "" +"``pgr_connectedComponents`` — 使用基于深度优先搜索（DFS）的方法计算无向图的连" +"通分量。" -#, fuzzy -msgid "Version 3.7.0" -msgstr "版本3.6.0" +msgid "" +"A connected component of an undirected graph is a set of vertices that are " +"all reachable from each other." +msgstr "无向图的连通部分是指相互之间均可到达的顶点集合。" -msgid "New **experimental** function:" -msgstr "新的 **实验** 函数：" +msgid "Components are described by vertices" +msgstr "连通分量由顶点描述" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." -msgstr "" +msgid "``component`` ascending" +msgstr "``component`` 升序" -msgid "" -"Betweenness centrality measures the extent to which a vertex lies on the " -"shortest paths between all other pairs of vertices. Vertices with a high " -"betweenness centrality score may have considerable influence in a network by " -"the virtue of their control over the shortest paths passing between them." -msgstr "" +msgid "pgr_connectedComponents(`Edges SQL`_)" +msgstr "pgr_connectedComponents(`Edges SQL`_)" -msgid "" -"The removal of these vertices will affect the network by disrupting the it, " -"as most of the shortest paths between vertices pass through them." -msgstr "" +msgid "Returns set of |result-component-V|" +msgstr "返回集合 |result-component-V|" -#, fuzzy -msgid "This implementation work for both directed and undirected graphs." -msgstr "该实现适用于 **有向** 图和 **无向** 图。" +msgid "The connected components of the graph" +msgstr "图的连通分量" -#, fuzzy -msgid "Running time: :math:`\\Theta(VE)`" -msgstr "运行时间： :math:`O(V + E)`" +msgid "Has the value of the minimum node identifier in the component." +msgstr "具有组件中最小节点标识符的值。" -#, fuzzy -msgid "Running space: :math:`\\Theta(VE)`" -msgstr "运行时间： :math:`O(V + E)`" +msgid "Identifier of the vertex that belongs to the ``component``." +msgstr "属于该 ``组件`` 的顶点的标识符。" -#, fuzzy -msgid "Throws when there are no edges in the graph" -msgstr "当图中没有边时，返回 EMPTY SET。" +msgid "Connecting disconnected components" +msgstr "连接不连通的组件" -msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" -msgstr "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])" +msgid "" +"wikipedia: `Connected component `__" +msgstr "" +"维基百科: `连通分量 `__" -#, fuzzy -msgid "Returns set of ``(vid, centrality)``" -msgstr "返回集合 ``(edge, cost)``" +msgid "``pgr_contraction``" +msgstr "``pgr_contraction``" -#, fuzzy -msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." -msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" +msgid "" +"``pgr_contraction`` — Performs graph contraction and returns the contracted " +"vertices and edges." +msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" #, fuzzy -msgid "Explanation" -msgstr "应用" +msgid "New signature:" +msgstr "新签名" -msgid "The betweenness centrality are between parenthesis." +msgid "" +"Previously compulsory parameter **Contraction order** is now optional with " +"name ``methods``." msgstr "" +"之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 " +"``methods``。" -msgid "The leaf vertices have betweenness centrality :math:`0`." -msgstr "" +#, fuzzy +msgid "New name and order of optional parameters." +msgstr "接近可选参数" #, fuzzy msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." -msgstr "从顶点 :math:`11` 到顶点 :math:`12`" +"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -#, fuzzy -msgid "Removing vertex :math:`6` will create three graph components." -msgstr "顶点 :math:`w` 已从图中移除" +msgid "Name change from ``pgr_contractGraph``" +msgstr "``pgr_contractGraph`` 的名称更改" -msgid "Removing vertex :math:`10` will create two graph components." -msgstr "" +msgid "Bug fixes" +msgstr "Bug修复" -msgid "``vid``" -msgstr "``vid``" +msgid "" +"Contraction reduces the size of the graph by removing some of the vertices " +"and edges and, for example, might add edges that represent a sequence of " +"original edges decreasing the total time and space used in graph algorithms." +msgstr "" +"收缩通过移除部分顶点和边来减小图的大小，例如，可以添加代表原始边序列的边，从" +"而减少图算法所用的总时间和空间。" #, fuzzy -msgid "``centrality``" -msgstr "``capacity``" - -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" -msgstr "" +msgid "Does not return the full contracted graph." +msgstr "不返回完整的收缩图" #, fuzzy -msgid "" -"Boost's `betweenness_centrality `_" -msgstr "" -"`Boost：Hawick 电路算法 `__" +msgid "Only changes on the graph are returned." +msgstr "仅返回图上的更改" -msgid "Queries use the :doc:`sampledata` network." -msgstr "查询使用 :doc:`sampledata` 网络。" +#, fuzzy +msgid "The returned values include:" +msgstr "返回值包括" -msgid "``pgr_biconnectedComponents``" -msgstr "``pgr_biconnectedComponents``" +#, fuzzy +msgid "The new edges generated by linear contraction." +msgstr "插入由 pgr_contraction 生成的新边。" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." -msgstr "``pgr_biconnectedComponents`` — 无向图的双连通分量。" +#, fuzzy +msgid "The modified vertices generated by dead end contraction." +msgstr "通过死端收缩修改顶点。" -msgid "Result columns change:" -msgstr "结果列发生变化：" +msgid "The returned values are ordered as follows:" +msgstr "返回值的排序如下：" -msgid "``n_seq`` is removed" -msgstr "``n_seq`` 被删除" +#, fuzzy +msgid "column ``id`` ascending when its a modified vertex." +msgstr "当类型为 ``v``时，按列 ``id`` 升序" -msgid "``seq`` changed type to ``BIGINT``" -msgstr "``seq`` 将类型更改为``BIGINT``" +#, fuzzy +msgid "column ``id`` with negative numbers descending when its a new edge." +msgstr "当类型为 ``e`` 时，按列``id`` 降序" +#, fuzzy msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." -msgstr "" -"无向图的双连通分量是顶点的最大子集，因此从特定分量中删除顶点不会断开该分量。 " -"与连接组件不同，顶点可以属于多个双连接组件。 顶点可以存在于多个双连通分量中，" -"但每条边只能包含在单个双连通分量中。" +"Currently there are two types of contraction methods included in this " +"function:" +msgstr "目前有两种类型的收缩方法" -msgid "Components are described by edges." -msgstr "组件由边描述。" +msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." +msgstr "死角收缩。参考 :doc:`pgr_contractionDeadEnd`。" -msgid "``component`` ascending." -msgstr "``component`` 升序。" +msgid "Linear Contraction. See :doc:`pgr_contractionLinear`." +msgstr "线性收缩。参考 :doc:`pgr_contractionLinear`。" -msgid "``edge`` ascending." -msgstr "``edge`` 升序。" +#, fuzzy +msgid "pgr_contraction(`Edges SQL`_, [**options**])" +msgstr "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" -msgid "pgr_biconnectedComponents(`Edges SQL`_)" -msgstr "pgr_biconnectedComponents(`Edges SQL`_)" +#, fuzzy +msgid "**options:** ``[directed, methods, cycles, forbidden]``" +msgstr "**options:** ``[directed, details]``" -msgid "Returns set of |result-component-E|" -msgstr "Returns set of |result-component-E|" +msgid "Returns set of |result-contract|" +msgstr "Returns set of |result-contract|" -msgid "The biconnected components of the graph" -msgstr "图的双连通分量" +#, fuzzy +msgid "Dead end and linear contraction in that order on an undirected graph." +msgstr "在无向图上按顺序进行死端和线性收缩。" -msgid "``component``" -msgstr "``component``" +msgid "Contraction optional parameters" +msgstr "可选收缩参数" -msgid "Component identifier." -msgstr "分量标识符。" +msgid "``methods``" +msgstr "``methods``" -msgid "Has the value of the minimum edge identifier in the component." -msgstr "具有组件中最小边标识符的值。" +#, fuzzy +msgid "``INTEGER[]``" +msgstr "``INTEGER``" -msgid "Identifier of the edge that belongs to the ``component``." -msgstr "属于该 ``分量`` 的边的标识符。" +#, fuzzy +msgid "``ARRAY[1,2]``" +msgstr "``ARRAY[BIGINT]``" -msgid "" -"Boost: `Biconnected components `__" -msgstr "" -"Boost: `双连通分量 `__" +msgid "Ordered contraction operations." +msgstr "有序收缩操作。" -msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgstr "``pgr_binaryBreadthFirstSearch`` - 实验" +msgid "1 = Dead end contraction" +msgstr "1 = 死端收缩" -#, fuzzy -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." -msgstr "``pgr_binaryBreadthFirstSearch`` — 返回二元图中的最短路径。" +msgid "2 = Linear contraction" +msgstr "2 = 线性收缩" -msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" -"negative integer, is termed as a 'binary graph'." -msgstr "任何边权属于集合 {0,X} 的图（其中“X”是任何非负整数）都被称为“二元图”。" +#, fuzzy +msgid "``cycles``" +msgstr "``max_cycles``" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "pgr_binaryBreadthFirstSearch(`组合`_)" +msgid ":math:`1`" +msgstr ":math:`1`" -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`一对一`_)" +#, fuzzy +msgid "Number of times the contraction methods will be performed." +msgstr "对 ``contraction_order`` 执行收缩操作的次数。" -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`一对多`_)" +#, fuzzy +msgid "``forbidden``" +msgstr "``forbidden_vertices``" -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`多对一`_)" +msgid "``BIGINT[]``" +msgstr "``BIGINT[]``" -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`多对多`_)" +#, fuzzy +msgid "``ARRAY[]::BIGINT[]``" +msgstr "``ARRAY[BIGINT]``" -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 "" -"众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:" -"`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点" -"到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权" -"重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，" -"比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。" +msgid "Identifiers of vertices forbidden for contraction." +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." -msgstr "" -"然而，如果权重受到更多限制，我们可以使用一种更快的算法。这个算法被称为'二进制" -"广度优先搜索'，也称为'0-1 BFS'，它是标准广度优先搜索问题的一种变体，用于解决" -"单源最短路径（SSSP）问题，当每条边的权重属于集合{0，X}，其中'X'是任意非负实数" -"时，其时间复杂度为 :math:`O(|E|)`。" +msgid "The function returns a single row. The columns of the row are:" +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.)" -msgstr "" -"过程仅在“二元图”上完成。 （“二元图”：边权重属于集合 {0,X} 的任何图，其中“X”是" -"任何非负实整数。）" +msgid "``type``" +msgstr "``type``" -msgid "Running time: :math:`O(| start\\_vids | * |E|)`" -msgstr "运行时间： :math:`O(| start\\_vids | * |E|)`" +#, fuzzy +msgid "Type of the row." +msgstr "``id`` 的类型。" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "``v`` when the row is a vertex." +msgstr "当该行表示一个顶点时，列为 ``v``。" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +#, fuzzy +msgid "Column ``id`` has a positive value." +msgstr "列 ``id`` 具有正值" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "``e`` when the row is an edge." +msgstr "当行是边时，则为 ``e``。" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +#, fuzzy +msgid "Column ``id`` has a negative value." +msgstr "列 ``id`` 具有负值" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "All numbers on this column are ``DISTINCT``" +msgstr "此列中的所有数字都是 ``DISTINCT``" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" -msgstr "" -"**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同（即为 :math:`1`）" +msgid "When ``type`` = **'v'**." +msgstr "当 ``type`` = **'v'** 时。" -msgid "https://cp-algorithms.com/graph/01_bfs.html" -msgstr "https://cp-algorithms.com/graph/01_bfs.html" +msgid "Identifier of the modified vertex." +msgstr "修改顶点的标识符。" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "When ``type`` = **'e'**." +msgstr "当 ``type`` = **'e'** 时。" -msgid "pgr_bipartite -Experimental" -msgstr "pgr_bipartite -实验" +msgid "Decreasing sequence starting from **-1**." +msgstr "从 **-1** 开始递减序列。" msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." -msgstr "`pgr_bipartite` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。" - -msgid "New **experimental** signature" -msgstr "新的 **实验** 签名" +"Representing a pseudo `id` as is not incorporated in the set of original " +"edges." +msgstr "表示未包含在原始边集中的伪`id` 。" -msgid "" -"A bipartite graph is a graph with two sets of vertices which are connected " -"to each other, but not within themselves. A bipartite graph is possible if " -"the graph coloring is possible using two colors such that vertices in a set " -"are colored with the same color." -msgstr "" -"二方图是指有两组顶点的图，这两组顶点相互连接，但内部没有连接。如果可以使用两" -"种颜色对图形着色，从而使一个集合中的顶点着色为相同的颜色，那么就可能是一个二" -"方图。" +msgid "``contracted_vertices``" +msgstr "``contracted_vertices``" -msgid "The algorithm works in undirected graph only." -msgstr "该算法只适用于无向图。" +msgid "Array of contracted vertex identifiers." +msgstr "收缩顶点标识符数组。" -msgid "The returned values are not ordered." -msgstr "返回值没有排序。" +msgid "When ``type`` = **'v'**: :math:`-1`" +msgstr "当 ``type`` = **'v'**: :math:`-1` 时" 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." +"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " +"(``source``, ``target``)." msgstr "" -"该算法检查图是否是二分图。 如果它是二分的，那么它返回节点以及代表两个不同集合" -"的两种颜色 `0` 和`1`。" - -msgid "If graph is not bipartite then algorithm returns empty set." -msgstr "如果图不是两部分的，那么算法会返回空集。" +"当 ``type`` = **'e'** 时：当前边（``source``，``target`` ）的source顶点标识" +"符。" -msgid "pgr_bipartite(`Edges SQL`_)" -msgstr "pgr_bipartite(`Edges SQL`_)" +msgid "" +"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " +"(``source``, ``target``)." +msgstr "" +"当 ``type`` = **'e'** 时：当前边(``source``, ``target``)的target 顶点标识符。" -msgid "Returns set of |result-node-color|" -msgstr "Returns set of |result-node-color|" +msgid "" +"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "当 ``type`` = **'e'** 时：当前边(``source``, ``target``)的权重。" -msgid "When the graph is bipartite" -msgstr "当图形为两方时" +msgid "Only dead end contraction" +msgstr "仅死端收缩" -msgid "Additional Example" -msgstr "附加示例" +msgid "Only linear contraction" +msgstr "仅线性收缩" -msgid "The odd length cyclic graph can not be bipartite." -msgstr "奇长循环图不可能是两部分的。" +msgid "The cycle" +msgstr "循环" +#, fuzzy 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." +"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 "" -"边 :math:`5 \\rightarrow 1` 将使顶点为 :math:`\\{1, 3, 7, 6, 5\\}` 的子图成为" -"奇数长度的循环图，因为循环有 5 个顶点。" +"收缩一张图可以通过多个操作来完成。 操作的顺序会影响生成的收缩图，在应用一个操" +"作后，可以由另一操作收缩的顶点集会发生变化。" -msgid "Edges in blue represent odd length cycle subgraph." -msgstr "蓝色边代表奇数长度循环子图。" +#, fuzzy +msgid "This implementation cycles ``cycles`` times through the ``methods`` ." +msgstr "此实现通过 ``operations_order``循环 ``max_cycles`` 次。" -msgid "``pgr_boykovKolmogorov``" -msgstr "``pgr_boykovKolmogorov``" +msgid "Contracting sample data" +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." -msgstr "" -"`pgr_boykovKolmogorov`` - 使用 Boykov Kolmogorov 算法计算图边的流量，使从源到" -"目标的流量最大。" +"In this section, building and using a contracted graph will be shown by " +"example." +msgstr "在本节中，将通过示例展示构建和使用收缩图。" -msgid "New **proposed** signature" -msgstr "新的 **拟议** 签名" +msgid "The :doc:`sampledata` for an undirected graph is used" +msgstr "使用无向图的 :doc:`sampledata`" -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" -msgstr "``pgr_boykovKolmogorov`` (`组合`_)" +msgid "a dead end operation first followed by a linear operation." +msgstr "首先是死端操作，然后是线性操作。" -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" -msgstr "从 ``pgr_maxFlowBoykovKolmogorov`` 更名而来" +msgid "Construction of the graph in the database" +msgstr "数据库中图的构建" -msgid "**Proposed** function" -msgstr "**拟议** 函数" +msgid "The original graph:" +msgstr "原始图：" -msgid "New **Experimental** function" -msgstr "新的 **实验** 函数" +#, fuzzy +msgid "" +"The results do not represent the contracted graph. They represent the " +"changes that need to be done to the graph after applying the contraction " +"methods." +msgstr "结果不代表收缩图。 它们表示应用收缩算法后对图所做的更改。" -msgid "Running time: Polynomial" -msgstr "运行时间：多项式时间" +msgid "" +"Observe that vertices, for example, :math:`6` do not appear in the results " +"because it was not affected by the contraction algorithm." +msgstr "" +"例如，观察到顶点 :math:`6` 没有出现在结果中，因为它不受收缩算法的影响。" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)" +msgid "After doing the dead end contraction operation:" +msgstr "进行死端收缩操作后：" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)" +msgid "After doing the linear contraction operation to the graph above:" +msgstr "对上图进行线性收缩运算后：" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)" +msgid "The process to create the contraction graph on the database:" +msgstr "在数据库上创建收缩图的过程：" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)" +msgid "Add additional columns" +msgstr "添加附加列" -msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" -msgstr "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)" +msgid "" +"Adding extra columns to the edges and vertices tables. In this documentation " +"the following will be used:" +msgstr "" -msgid "Returns set of |result-flow|" -msgstr "Returns set of |result-flow|" +#, fuzzy +msgid "Column." +msgstr "列" -msgid "From vertex :math:`11` to vertex :math:`12`" -msgstr "从顶点 :math:`11` 到顶点 :math:`12`" +msgid "The vertices set belonging to the vertex/edge" +msgstr "属于顶点/边的顶点集" -msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "从顶点 :math:`11` 到顶点 :math:`\\{5, 10, 12\\}`" +msgid "``is_contracted``" +msgstr "``is_contracted``" -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" -msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`12`" +msgid "On the vertex table" +msgstr "在顶点表上" msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`\\{5, 10, 12\\}`" +"when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." -msgstr "" -"使用组合表，相当于计算从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`{\\10, 15, " -"14\\}` 的结果。" +"when ``false`` the vertex is not contracted, its part of the contracted " +"graph." +msgstr "当 ``false`` 时，顶点不收缩，它是收缩图的一部分。" -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 "``is_new``" +msgstr "``is_new``" -msgid "``pgr_breadthFirstSearch`` - Experimental" -msgstr "``pgr_breadthFirstSearch`` - 实验" +msgid "On the edge table" +msgstr "在边表上" msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." -msgstr "``pgr_breadthFirstSearch`` —使用广度优先搜索算法返回遍历顺序。" +"when ``true`` the edge was generated by the contraction algorithm. its part " +"of the contracted graph." +msgstr "当 ``true`` 时，边缘由收缩算法生成。 它是收缩图的一部分。" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_breadthFirstSearch`` (`单顶点搜索`_)" +msgid "" +"when ``false`` the edge is an original edge, might be or not part of the " +"contracted graph." +msgstr "当 ``false`` 时，边是原始边，可能是也可能不是收缩图的一部分。" -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_breadthFirstSearch`` (`多顶点搜索`_)" +msgid "Store contraction information" +msgstr "存储收缩信息" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." -msgstr "提供从根顶点到特定深度的广度优先搜索遍历顺序。" +#, fuzzy +msgid "Store the contraction results in a table." +msgstr "将 `收缩结果`_ 存储在表中" -msgid "The implementation will work on any type of graph." -msgstr "该实现适用于任何类型的图。" +#, fuzzy +msgid "Update the edges and vertices tables" +msgstr "创建顶点表" msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." -msgstr "提供从源节点到目标深度级别的广度优先搜索遍历顺序。" +"Use ``is_contracted`` column to indicate the vertices that are contracted." +msgstr "使用 ``is_contracted`` 列来指示收缩的顶点。" -msgid "Running time: :math:`O(E + V)`" -msgstr "运行时间： :math:`O(E + V)`" +#, fuzzy +msgid "" +"Fill ``contracted_vertices`` with the information from the results that " +"belong to the vertices." +msgstr "使用属于顶点的结果中的信息填充 ``contracted_vertices``。" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" +msgid "Insert the new edges generated by pgr_contraction." +msgstr "插入由 pgr_contraction 生成的新边。" -msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" -msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" +msgid "The contracted graph" +msgstr "收缩图" -msgid "**options:** ``[max_depth, directed]``" -msgstr "**options:** ``[max_depth, directed]``" +msgid "Vertices that belong to the contracted graph." +msgstr "属于收缩图的顶点。" -msgid "Returns set of |result-bfs|" -msgstr "返回 |result-bfs| 的集合" +msgid "Edges that belong to the contracted graph." +msgstr "属于收缩图的边。" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" -msgstr "" -"从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列" +#, fuzzy +msgid "Visually:" +msgstr "视觉效果" + +msgid "Using the contracted graph" +msgstr "使用收缩图" msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" +"Depending on the final application the graph is to be prepared. In this " +"example the final application will be to calculate the cost from two " +"vertices in the original graph by using the contracted graph with " +"``pgr_dijkstraCost``" msgstr "" -"从根顶点开始 :math:`{12, 6\\}` 在一个 **无向** 图上，**depth** :math:`<=2`，" -"边按 ``id`` 升序排列" +"根据最终应用的需求，图需要进行预处理。在本示例中，最终应用是使用收缩图通过 " +"``pgr_dijkstraCost`` 计算原始图中两个顶点之间的成本" -msgid "DFS optional parameters" -msgstr "DFS 可选参数" +msgid "" +"There are three cases when calculating the shortest path between a given " +"source and target in a contracted graph:" +msgstr "计算收缩图中给定源和目标之间的最短路径时，存在三种情况：" -msgid "Same as `Single vertex`_ with edges in ascending order of ``id``." -msgstr "与 `单个顶点`_ 相同，边按 ``id`` 升序排列。" +msgid "Case 1: Both source and target belong to the contracted graph." +msgstr "情况1：源和目标都属于收缩图。" -msgid "Same as `Single vertex`_ with edges in descending order of ``id``." -msgstr "与 `单个顶点`_ 相同，边按 ``id`` 降序排列。" +msgid "Case 2: Source and/or target belong to an edge subgraph." +msgstr "情况 2：源和/或目标属于边缘子图。" -msgid "The resulting traversal is different." -msgstr "由此产生的遍历是不同的。" +msgid "Case 3: Source and/or target belong to a vertex." +msgstr "情况 3：源和/或目标属于一个顶点。" -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." -msgstr "" -"左图显示的是按 ID 升序排列的结果，右图显示的是按边缘标识符降序排列的结果。" +msgid "The final application should consider all of those cases." +msgstr "最终应用应考虑所有这些情况。" -msgid "|ascending| |descending|" -msgstr "|ascending| |descending|" +#, fuzzy +msgid "Create a view (or table) of the contracted graph:" +msgstr "属于收缩图的顶点。" -msgid "ascending" -msgstr "升序" +#, fuzzy +msgid "Create the function that will use the contracted graph." +msgstr "情况1：源和目标都属于收缩图。" -msgid "descending" -msgstr "降序" +#, fuzzy +msgid "" +"Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "情况 2：源和/或目标属于边缘子图。" +#, fuzzy msgid "" -"`Boost: Breadth First Search algorithm documentation `__" -msgstr "" -"`Boost：广度优先搜索算法文档 `__" +"Case 3: Source and/or target belong to a vertex that has been contracted." +msgstr "情况 3：源和/或目标属于一个顶点。" + +#, fuzzy +msgid "``pgr_contractionDeadEnd`` - Proposed" +msgstr "``pgr_trspVia`` - 拟议" +#, fuzzy msgid "" -"`Wikipedia: Breadth First Search algorithm `__" -msgstr "" -"`维基百科：广度优先搜索算法 `__" +"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " +"contracted vertices and edges." +msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" -msgid "``pgr_bridges``" -msgstr "``pgr_bridges``" +#, fuzzy +msgid "A node is considered a dead end node when:" +msgstr "当一个节点被认为是 **死端** 节点时" + +msgid "On undirected graphs:" +msgstr "在无向图上：" + +msgid "The number of adjacent vertices is 1." +msgstr "相邻顶点的个数为1。" + +msgid "On directed graphs:" +msgstr "在有向图上：" -msgid "``pgr_bridges`` - Return the bridges of an undirected graph." -msgstr "``pgr_bridges`` - 返回无向图的桥。" +#, fuzzy +msgid "When there is only one adjacent vertex or" +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." +"When all edges are incoming regardless of the number of adjacent vertices." msgstr "" -"桥是指一个无向图中的边，如果删除它会增加该图的连通分量数量。此实现仅适用于无" -"向图。" -msgid "``edge`` ascending" -msgstr "``edge`` 升序" +#, fuzzy +msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" +msgstr "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" -msgid "Running time: :math:`O(E * (V + E))`" -msgstr "运行时间： :math:`O(E * (V + E))`" +#, fuzzy +msgid "**options:** ``[directed, forbidden]``" +msgstr "**options:** ``[directed, details]``" -msgid "pgr_bridges(`Edges SQL`_)" -msgstr "pgr_bridges(`Edges SQL`_)" +#, fuzzy +msgid "Dead end contraction on an undirected graph." +msgstr "无向图上的死端顶点" -msgid "Returns set of |result-edge|" -msgstr "返回集合 |result-edge|" +#, fuzzy +msgid "The green nodes are dead end nodes." +msgstr "绿色节点是 `死端`_ 节点" -msgid "The bridges of the graph" -msgstr "图的桥" +#, fuzzy +msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." +msgstr "节点 :math:`u` 有已收缩节点的信息。" -msgid "Identifier of the edge that is a bridge." -msgstr "作为桥的边的标识符。" +#, fuzzy +msgid "``ARRAY[`` |ANY-INTEGER| ``]``" +msgstr "``ARRAY[`` **ANY-INTEGER** ``]``" -msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" +msgid "**Empty**" +msgstr "**Empty**" -msgid "**Supported versions**" -msgstr "**支持版本**" +#, fuzzy +msgid "Value = ``e`` indicating the row is an edge." +msgstr "当行是边时，则为 ``e``。" -msgid "``pgr_chinesePostman`` - Experimental" -msgstr "``pgr_chinesePostman`` - 实验" +#, fuzzy +msgid "A pseudo `id` of the edge." +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." -msgstr "" -"``pgr_chinesePostman`` — 计算包含有向图中的每条边并从同一顶点开始和结束的最短" -"回路路径。" +msgid "Identifier of the source vertex of the current edge." +msgstr "当前边的源顶点的标识符。" -msgid "Returns ``EMPTY SET`` on a disconnected graph" -msgstr "在一个不连通的图上返回 ``EMPTY SET``" +msgid "Identifier of the target vertex of the current edge." +msgstr "当前边的目标顶点的标识符。" -msgid "pgr_chinesePostman(`Edges SQL`_)" -msgstr "pgr_chinesePostman(`Edges SQL`_)" +#, fuzzy +msgid "Weight of the current edge." +msgstr "当前边的源顶点的标识符。" -msgid "Returns set of |result-1-1-no-seq|" -msgstr "返回 |result-1-1-no-seq| 的集合" +msgid "Dead end vertex on undirected graph" +msgstr "无向图上的死端顶点" -msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``" -msgstr "Returns set of ``(seq, node, edge, cost, agg_cost)``" +msgid "They have only one adjacent node." +msgstr "它们只有一个相邻节点。" -msgid "Sequential value starting from ``1``" -msgstr "从 ``1`` 开始的顺序值" +msgid "Dead end vertex on directed graph" +msgstr "有向图上的死端顶点" + +#, fuzzy +msgid "The green nodes are dead end nodes" +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." -msgstr "" -"用于从路径序列中的 ``节点`` 到下一个节点的边的标识符。``-1`` 表示路径的最后一" -"个节点。" +"The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgstr "蓝色节点具有无限数量的传入和/或传出边缘。" -msgid "Aggregate cost from ``start_v`` to ``node``." -msgstr "从 ``start_v`` 到 ``node`` 的总成本。" +msgid "Node" +msgstr "节点" -msgid "``pgr_chinesePostmanCost`` - Experimental" -msgstr "``pgr_chinesePostmanCost`` - 实验" +msgid "Adjacent nodes" +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." -msgstr "" -"``pgr_chinesePostmanCost`` — 计算一个包含有向图中的每条边、以同一顶点为起点和" -"终点的最短成本的回路路径。" +msgid "Dead end" +msgstr "死端" -msgid "Return value when the graph if disconnected" -msgstr "当图是不连通的时候返回的数值" +msgid "Reason" +msgstr "Reason" -msgid "pgr_chinesePostmanCost(`Edges SQL`_)" -msgstr "pgr_chinesePostmanCost(`Edges SQL`_)" +#, fuzzy +msgid ":math:`6`" +msgstr ":math:`a`" -msgid "RETURNS ``FLOAT``" -msgstr "RETURNS ``FLOAT``" +#, fuzzy +msgid ":math:`\\{1\\}`" +msgstr ":math:`\\{u\\}`" -msgid "``pgr_chinesepostmancost``" -msgstr "``pgr_chinesepostmancost``" +#, fuzzy +msgid "Yes" +msgstr "是" -msgid "Minimum costs of a circuit path." -msgstr "一个回路路径的最小成本。" +#, fuzzy +msgid "Has only one adjacent node." +msgstr "相邻节点数" -msgid "pgr_connectedComponents" -msgstr "pgr_connectedComponents" +#, fuzzy +msgid ":math:`7`" +msgstr ":math:`a`" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." -msgstr "" -"``pgr_connectedComponents`` — 使用基于深度优先搜索（DFS）的方法计算无向图的连" -"通分量。" +#, fuzzy +msgid ":math:`\\{2\\}`" +msgstr ":math:`\\{u\\}`" -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." -msgstr "无向图的连通部分是指相互之间均可到达的顶点集合。" +#, fuzzy +msgid ":math:`8`" +msgstr ":math:`a`" -msgid "Components are described by vertices" -msgstr "连通分量由顶点描述" +#, fuzzy +msgid ":math:`\\{2, 3\\}`" +msgstr ":math:`\\{v, w\\}`" -msgid "``component`` ascending" -msgstr "``component`` 升序" +msgid "Has more than one adjacent node and all edges are incoming." +msgstr "有一个以上的相邻节点，且所有边都是传入的。" -msgid "pgr_connectedComponents(`Edges SQL`_)" -msgstr "pgr_connectedComponents(`Edges SQL`_)" +#, fuzzy +msgid ":math:`\\{4\\}`" +msgstr ":math:`\\{u\\}`" -msgid "Returns set of |result-component-V|" -msgstr "返回集合 |result-component-V|" +#, fuzzy +msgid ":math:`10`" +msgstr ":math:`1`" -msgid "The connected components of the graph" -msgstr "图的连通分量" +#, fuzzy +msgid ":math:`\\{4, 5\\}`" +msgstr ":math:`\\{v, w\\}`" -msgid "Has the value of the minimum node identifier in the component." -msgstr "具有组件中最小节点标识符的值。" +#, fuzzy +msgid "No" +msgstr "节点" -msgid "Identifier of the vertex that belongs to the ``component``." -msgstr "属于该 ``组件`` 的顶点的标识符。" +msgid "Has more than one adjacent node and all edges are outgoing." +msgstr "有一个以上的相邻节点，且所有边都是向外的。" -msgid "Connecting disconnected components" -msgstr "连接不连通的组件" +#, fuzzy +msgid ":math:`1,2,3,4,5`" +msgstr ":math:`1`" + +#, fuzzy +msgid "Many adjacent nodes." +msgstr "相邻节点" msgid "" -"Boost: `Connected components `__" +"Has more than one adjacent node and some edges are incoming and some are " +"outgoing." msgstr "" -"Boost: ` 已连接组件 `__" +#, fuzzy msgid "" -"wikipedia: `Connected component `__" +"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " +"number of adjacent vertices is one." msgstr "" -"维基百科: `连通分量 `__" - -msgid "``pgr_contraction``" -msgstr "``pgr_contraction``" +"从上面来看，节点 :math:`\\{a, b, d\\}` 是死端，因为相邻顶点的数量为 1。不需要" +"对这些节点进行进一步检查。" msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." -msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" - -msgid "Name change from ``pgr_contractGraph``" -msgstr "``pgr_contractGraph`` 的名称更改" +"When there are more than one adjacent vertex, all edges need to be all " +"incoming edges otherwise it is not a dead end." +msgstr "" -msgid "Bug fixes" -msgstr "Bug修复" +#, fuzzy +msgid "Step by step dead end contraction" +msgstr "仅死端收缩" +#, fuzzy 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." +"The dead end contraction will stop until there are no more dead end nodes. " +"For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -"收缩通过移除部分顶点和边来减小图的大小，例如，可以添加代表原始边序列的边，从" -"而减少图算法所用的总时间和空间。" +"死端收缩将停止，直到不再有死端节点。 例如，从下图中，其中 :math:`w` 是 `死端" +"`_ 节点：" -msgid "Does not return the full contracted graph" -msgstr "不返回完整的收缩图" +#, fuzzy +msgid "" +"After contracting :math:`3`, node :math:`2` is now a dead end node and is " +"contracted:" +msgstr "收缩 :math:`w` 后，节点 :math:`v` 现在是一个 `死端`_ 节点并且已收缩：" -msgid "Only changes on the graph are returned" -msgstr "仅返回图上的更改" +#, fuzzy +msgid "" +"After contracting :math:`2`, stop. Node :math:`1` has the information of " +"nodes that were contracted." +msgstr "在收缩 :math:`v` 之后，停止。节点 :math:`u` 有已收缩节点的信息。" -msgid "Currnetly there are two types of contraction methods" -msgstr "目前有两种类型的收缩方法" +#, fuzzy +msgid "Creating the contracted graph" +msgstr "使用收缩图" -msgid "Dead End Contraction" -msgstr "死端收缩" +#, fuzzy +msgid "Steps for the creation of the contracted graph" +msgstr "属于收缩图的边。" -msgid "Linear Contraction" -msgstr "线性收缩" +#, fuzzy +msgid "Add additional columns." +msgstr "添加附加列" -msgid "The returned values include" -msgstr "返回值包括" +#, fuzzy +msgid "Save results into a table." +msgstr "将 `收缩结果`_ 存储在表中" -msgid "the added edges by linear contraction." -msgstr "由线性收缩添加的边。" +#, fuzzy +msgid "The contracted vertices are not part of the contracted graph." +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" -msgid "the modified vertices by dead end contraction." -msgstr "通过死端收缩修改顶点。" +#, fuzzy +msgid "Using when departure and destination are in the contracted graph" +msgstr "情况1：源和目标都属于收缩图。" -msgid "The returned values are ordered as follows:" -msgstr "返回值的排序如下：" +#, fuzzy +msgid "Using when departure/destination is not in the contracted graph" +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" -msgid "column ``id`` ascending when type is ``v``" -msgstr "当类型为 ``v``时，按列 ``id`` 升序" +#, fuzzy +msgid "Using when departure and destination are not in the contracted graph" +msgstr "情况1：源和目标都属于收缩图。" -msgid "column ``id`` descending when type is ``e``" -msgstr "当类型为 ``e`` 时，按列``id`` 降序" +#, fuzzy +msgid "``pgr_contractionLinear`` - Proposed" +msgstr "``pgr_dijkstraNear`` - 拟议" -msgid "The pgr_contraction function has the following signature:" -msgstr "pgr_contraction 函数具有以下签名：" +#, fuzzy +msgid "" +"``pgr_contractionLinear`` — Performs graph contraction and returns the " +"contracted vertices and edges." +msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" -msgid "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" +#, fuzzy +msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" msgstr "pgr_contraction(`Edges SQL`_, **contraction order**, [**options**])" -msgid "**options:** ``[ max_cycles, forbidden_vertices, directed]``" -msgstr "**options:** ``[ max_cycles, forbidden_vertices, directed]``" - -msgid "Returns set of |result-contract|" -msgstr "Returns set of |result-contract|" +#, fuzzy +msgid "Linear contraction on an undirected graph." +msgstr "在无向图上使用组合表。" +#, fuzzy msgid "" -"Making a dead end and linear contraction in that order on an undirected " +"The green nodes are linear nodes and will not be part of the contracted " "graph." -msgstr "在无向图上按顺序进行死端和线性收缩。" +msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" + +#, fuzzy +msgid "All edges adjacent will not be part of the contracted graph." +msgstr "属于收缩图的边。" + +#, fuzzy +msgid "The red lines will be new edges of the contracted graph." +msgstr "属于收缩图的顶点。" msgid "**contraction Order**" msgstr "**contraction Order**" -msgid "Ordered contraction operations." -msgstr "有序收缩操作。" +msgid "" +"Number of times the contraction operations on ``contraction_order`` will be " +"performed." +msgstr "对 ``contraction_order`` 执行收缩操作的次数。" + +msgid "A node connects two (or more) `linear` edges when" +msgstr "" + +msgid "The number of adjacent vertices is 2." +msgstr "相邻顶点的数量为2。" -msgid "1 = Dead end contraction" -msgstr "1 = 死端收缩" +msgid "In case of a directed graph, a node is considered a `linear` node when" +msgstr "在有向图的情况下，当满足以下条件时，节点被视为`线性`节点" -msgid "2 = Linear contraction" -msgstr "2 = 线性收缩" +#, fuzzy +msgid "Linearity is symmetrical." +msgstr "线性是对称的" -msgid "Contraction optional parameters" -msgstr "可选收缩参数" +#, fuzzy +msgid "Linearity is not symmetrical" +msgstr "线性是对称的" -msgid "``forbidden_vertices``" -msgstr "``forbidden_vertices``" +#, fuzzy +msgid "Graph where linearity is not symmetrical." +msgstr "线性是对称的" -msgid "**Empty**" -msgstr "**Empty**" +msgid "" +"When the graph is processed as a directed graph, linearity is not " +"symmetrical, therefore the graph can not be contracted." +msgstr "" -msgid "Identifiers of vertices forbidden for contraction." -msgstr "禁止收缩的顶点标识符。" +msgid "" +"When the same graph is processed as an undirected graph, linearity is " +"symmetrical, therefore the graph can be contracted." +msgstr "" -msgid ":math:`1`" +#, fuzzy +msgid "The three edges can be replaced by one undirected edge" +msgstr "图可以是有向或无向的。" + +#, fuzzy +msgid "Edge :math:`1 - 3`." msgstr ":math:`1`" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." -msgstr "对 ``contraction_order`` 执行收缩操作的次数。" +#, fuzzy +msgid "With cost: :math:`4`." +msgstr "使用 ``cost``" -msgid "The function returns a single row. The columns of the row are:" -msgstr "该函数返回一行数据。该行的列包括：" +#, fuzzy +msgid "Contracted vertices in the edge: :math:`\\{2\\}`." +msgstr "对于带边的directed graph:math:`\\{1, 2, 3, 4\\}`." -msgid "``type``" -msgstr "``type``" +msgid "Linearity is symmetrical" +msgstr "线性是对称的" -msgid "Type of the ``id``." -msgstr "``id`` 的类型。" +#, fuzzy +msgid "Graph where linearity is symmetrical." +msgstr "线性是对称的" -msgid "``v`` when the row is a vertex." -msgstr "当该行表示一个顶点时，列为 ``v``。" +#, fuzzy +msgid "The four edges can be replaced by two directed edges." +msgstr "图可以是有向或无向的。" -msgid "Column ``id`` has a positive value" -msgstr "列 ``id`` 具有正值" +#, fuzzy +msgid "Edge :math:`3 - 1`." +msgstr ":math:`-1`" -msgid "``e`` when the row is an edge." -msgstr "当行是边时，则为 ``e``。" +#, fuzzy +msgid "With cost: :math:`6`." +msgstr "使用 ``cost``" -msgid "Column ``id`` has a negative value" -msgstr "列 ``id`` 具有负值" +#, fuzzy +msgid "The four edges can be replaced by one undirected edge." +msgstr "图可以是有向或无向的。" -msgid "All numbers on this column are ``DISTINCT``" -msgstr "此列中的所有数字都是 ``DISTINCT``" +#, fuzzy +msgid "Step by step linear contraction" +msgstr "仅线性收缩" -msgid "When ``type`` = **'v'**." -msgstr "当 ``type`` = **'v'** 时。" +#, fuzzy +msgid "" +"The linear contraction will stop when there are no more linear edges. For " +"example from the following graph there are linear edges" +msgstr "" +"当不再有线性节点时，线性收缩将停止。 例如，在下图中，其中 :math:`v` 和 :math:" +"`w` 是 `线性`_ 节点：" -msgid "Identifier of the modified vertex." -msgstr "修改顶点的标识符。" +#, fuzzy +msgid "Contracting vertex :math:`3`," +msgstr "收缩 :math:`w`，" -msgid "When ``type`` = **'e'**." -msgstr "当 ``type`` = **'e'** 时。" +#, fuzzy +msgid "The vertex :math:`3` is removed from the graph" +msgstr "顶点 :math:`w` 已从图中移除" -msgid "Decreasing sequence starting from **-1**." -msgstr "从 **-1** 开始递减序列。" +#, fuzzy +msgid "" +"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " +"from the graph." +msgstr "从图中删除边 :math:`v \\rightarrow w` 和 :math:`w \\rightarrow z`。" +#, fuzzy msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." -msgstr "表示未包含在原始边集中的伪`id` 。" +"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgstr "插入一条新边 :math:`v \\rightarrow z`，以红色表示。" -msgid "Array of contracted vertex identifiers." -msgstr "收缩顶点标识符数组。" +#, fuzzy +msgid "Contracting vertex :math:`2`:" +msgstr "收缩 :math:`v`：" -msgid "When ``type`` = **'v'**: :math:`-1`" -msgstr "当 ``type`` = **'v'**: :math:`-1` 时" +#, fuzzy +msgid "The vertex :math:`2` is removed from the graph" +msgstr "顶点 :math:`w` 已从图中移除" +#, fuzzy msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"当 ``type`` = **'e'** 时：当前边（``source``，``target`` ）的source顶点标识" -"符。" +"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " +"from the graph." +msgstr "从图中删除边 :math:`v \\rightarrow w` 和 :math:`w \\rightarrow z`。" +#, fuzzy msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"当 ``type`` = **'e'** 时：当前边(``source``, ``target``)的target 顶点标识符。" +"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "插入一条新边 :math:`v \\rightarrow z`，以红色表示。" +#, fuzzy msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." -msgstr "当 ``type`` = **'e'** 时：当前边(``source``, ``target``)的权重。" - -msgid "Only dead end contraction" -msgstr "仅死端收缩" +"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " +"were contracted." +msgstr "边 :math:`u \\rightarrow z` 有收缩点的信息。" -msgid "Only linear contraction" -msgstr "仅线性收缩" +#, fuzzy +msgid "Create the contracted graph." +msgstr "收缩图" -msgid "pgr_createTopology" -msgstr "pgr_createTopology" +#, fuzzy +msgid "``pgr_createTopology`` - Deprecated since v3.8.0" +msgstr "``pgr_analyzeGraph``" msgid "" "``pgr_createTopology`` — Builds a network topology based on the geometry " @@ -10595,36 +10815,17 @@ msgstr "引用顶点表的 ``id`` 填充边表的 source列和target列。" msgid "``FAIL`` when the network topology was not built due to an error:" msgstr "``FAIL`` 当由于错误原因未能构建网络拓扑时：" -msgid "" -"The vertices table is a requirement of the :doc:`pgr_analyzeGraph` and the :" -"doc:`pgr_analyzeOneWay` functions." -msgstr "" -"顶点表是 :doc:`pgr_analyzeGraph` 和 :doc:`pgr_analyzeOneWay` 函数的必需条件。" - -msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex. " -"See :doc:`pgr_analyzeGraph`." -msgstr "" -"``integer`` edge_table 中引用该顶点的顶点数。 参见 :doc:`pgr_analyzeGraph`。" - -msgid "" -"``integer`` Indicator that the vertex might have a problem. See :doc:" -"`pgr_analyzeGraph`." -msgstr "``integer`` 指示顶点可能有问题。 请参阅 :doc:`pgr_analyzeGraph`。" - +#, fuzzy msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " -"AS incoming. See :doc:`pgr_analyzeOneWay`." -msgstr "" -"``integer`` 边表中引用此顶点作为入边的顶点数量。请参考 :doc:" -"`pgr_analyzeOneWay`。" +"AS incoming." +msgstr "``integer`` edge_table 中引用该顶点作为传入的顶点数。" +#, fuzzy msgid "" "``integer`` Number of vertices in the edge_table that reference this vertex " -"AS outgoing. See :doc:`pgr_analyzeOneWay`." -msgstr "" -"``integer`` 边表中引用此顶点作为出边的顶点数量。请参考 :doc:" -"`pgr_analyzeOneWay`。" +"AS outgoing." +msgstr "``integer`` Edge_table 中引用该顶点作为传出的顶点数。" msgid "The simplest way to use pgr_createTopology is:" msgstr "使用 pgr_createTopology 最简单的方法是：" @@ -10742,11 +10943,9 @@ msgid "" "to the rest of the edges." msgstr "该示例以 5 条边的简洁拓扑结构为起点，然后递增到其余的边。" -msgid "The example uses the :doc:`sampledata` network." -msgstr "本例使用 :doc:`sampledata` 网络。" - -msgid "pgr_createVerticesTable" -msgstr "pgr_createVerticesTable" +#, fuzzy +msgid "``pgr_createVerticesTable`` - Deprecated since 3.8.0" +msgstr "``pgr_analyzeGraph``" msgid "" "``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " @@ -10786,20 +10985,6 @@ msgstr "" msgid "The names of source, target are the same." msgstr "source, target的名称相同。" -msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as incoming. See :doc:`pgr_analyzeOneWay`." -msgstr "" -"``integer`` edge_table 中引用该顶点作为传入的顶点数。 请参阅 :doc:" -"`pgr_analyzeOneWay`。" - -msgid "" -"``integer`` Number of vertices in the edge_table that reference this vertex " -"as outgoing. See :doc:`pgr_analyzeOneWay`." -msgstr "" -"``integer`` Edge_table 中引用该顶点作为传出的顶点数。 请参阅 :doc:" -"`pgr_analyzeOneWay`。" - msgid "The simplest way to use pgr_createVerticesTable" msgstr "使用 pgr_createVerticesTable 最简单的方法" @@ -10895,19 +11080,6 @@ msgid "" "algorithms." msgstr ":doc:`topology-functions` 用于路由算法的拓扑概述。" -msgid "" -":doc:`pgr_createTopology` ` to create a topology based " -"on the geometry." -msgstr "" -":doc:`pgr_createTopology` ` 根据几何图形创建拓扑。" - -msgid "" -":doc:`pgr_analyzeGraph` to analyze the edges and vertices of the edge table." -msgstr ":doc:`pgr_analyzeGraph` 分析边表的边和顶点。" - -msgid ":doc:`pgr_analyzeOneWay` to analyze directionality of the edges." -msgstr ":doc:`pgr_analyzeOneWay` 分析边缘的方向性。" - msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "pgr_cuthillMckeeOrdering`` - 试验性的" @@ -10985,17 +11157,17 @@ msgstr "" "`Wikipedia: Cuthill-McKee 排序 `__" -msgid "pgr_dagShortestPath - Experimental" +#, fuzzy +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "pgr_dagShortestPath - 实验" -#, fuzzy msgid "" "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " "acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " "implemented by Boost.Graph." msgstr "" -"``pgr_dagShortestPath`` — 返回加权有向无环图（DAG）的最短路径（path）。特别" -"是，由Boost.Graph实现的DAG最短路径算法。" +"``pgr_dagShortestPath`` — 返回加权有向无环图（DAG）中的最短路径。特别是使用 " +"Boost.Graph 实现的 DAG 最短路径算法。" msgid "pgr_dagShortestPath(Combinations)" msgstr "pgr_dagShortestPath(组合)" @@ -11072,39 +11244,111 @@ msgstr "返回列" msgid "Making **start_vids** the same as **end_vids**" msgstr "使 **start_vids** 与 **end_vids** 相同" +#, fuzzy +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" -msgid "``pgr_degree`` -- Proposed" -msgstr "``pgr_degree`` -- 拟议" +msgid "``pgr_degree``" +msgstr "``pgr_degree``" msgid "" "``pgr_degree`` — For each vertex in an undirected graph, return the count of " "edges incident to the vertex." msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" -msgid "Calculates the degree of the vertices of an **undirected** graph" +msgid "Error messages adjustment." +msgstr "" + +msgid "New signature with only Edges SQL." +msgstr "" + +#, fuzzy +msgid "Calculates the degree of the vertices of an undirected graph" msgstr "计算 **无向** 图顶点的度数" #, fuzzy +msgid "" +"The degree (or valency) of a vertex of a graph is the number of edges that " +"are incident to the vertex." +msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" + +msgid "A loop contributes 2 to a vertex's degree." +msgstr "" + +msgid "A vertex with degree 0 is called an isolated vertex." +msgstr "" + +#, fuzzy +msgid "Isolated vertex is not part of the result" +msgstr "修复顶点不在图中时的行驶距离问题" + +msgid "" +"Vertex not participating on the subgraph is considered and isolated vertex." +msgstr "" + +#, fuzzy +msgid "" +"There can be a ``dryrun`` execution and the code used to get the answer will " +"be shown in a PostgreSQL ``NOTICE``." +msgstr "" +"由于这是一次 **模拟** 执行，所有计算的代码都显示在 PostgreSQL 的 ``NOTICE`` " +"中。" + +msgid "" +"The code can be used as base code for the particular application " +"requirements." +msgstr "" + +#, fuzzy +msgid "No ordering is performed." +msgstr "不进行排序" + +#, fuzzy +msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])" +msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" + msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" -msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_ , [``dryrun``])" +msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgid "RETURNS SETOF |result-degree|" msgstr "RETURNS SETOF |result-degree|" +msgid "Edges" +msgstr "边" + +#, fuzzy +msgid "example" +msgstr "示例" + +#, fuzzy +msgid "Get the degree of the vertices defined on the edges table" +msgstr ":math:`m` 是图中顶点的最大度数。" + +#, fuzzy +msgid "Edges and Vertices" +msgstr "添加新的顶点" + msgid "Extracting the vertex information" msgstr "提取顶点信息" +msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." +msgstr "" + msgid "" -"pgr_degree can utilize output from `pgr_extractVertices` or can have " -"`pgr_extractVertices` embedded in the call. For decent size networks, it is " -"best to prep your vertices table before hand and use that vertices table for " -"pgr_degree calls." +"For decent size networks, it is best to prepare your vertices table before " +"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" -"`pgr_degree`可以利用 `pgr_extractVertices` 的输出，或者可以在调用中嵌入" -"`pgr_extractVertices`。对于较大规模的网络，最好提前准备好顶点表并在" -"`pgr_degree`调用中使用该顶点表。" + +#, fuzzy +msgid "Calculate the degree of the nodes:" +msgstr "计算 **无向** 图顶点的度数" msgid "`Vertex SQL`_" msgstr "`Vertex SQL`_" @@ -11118,15 +11362,20 @@ msgstr "``dryrun``" msgid "When true do not process and get in a NOTICE the resulting query." msgstr "当为真时，不要处理查询，而是获取一个通知（NOTICE）来显示查询的结果。" +#, fuzzy +msgid "For the `Edges and Vertices`_ signature:" +msgstr "关于已弃用的签名：" + +#, fuzzy +msgid "For the `Edges`_ signature:" +msgstr "关于已弃用的签名：" + msgid "Vertex SQL" msgstr "Vertex SQL" msgid "``in_edges``" msgstr "``in_edges``" -msgid "``BIGINT[]``" -msgstr "``BIGINT[]``" - msgid "" "Array of identifiers of the edges that have the vertex ``id`` as *first end " "point*." @@ -11143,20 +11392,67 @@ msgid "" "point*." msgstr "以顶点 ``id`` 作为*第二个端点*的边的标识符数组。" -msgid "When missing, ``in_edges`` must exist." -msgstr "缺失时， ``in_edges`` 必须存在。" +msgid "When missing, ``in_edges`` must exist." +msgstr "缺失时， ``in_edges`` 必须存在。" + +msgid "Vertex identifier" +msgstr "顶点标识符" + +msgid "``degree``" +msgstr "``degree``" + +msgid "Number of edges that are incident to the vertex ``id``" +msgstr "与顶点 ``id`` 关联的边数" + +#, fuzzy +msgid "Degree of a loop" +msgstr "子图的度数" + +#, fuzzy +msgid "Using the `Edges`_ signature." +msgstr "关于已弃用的签名：" + +msgid "Using the `Edges and Vertices`_ signature." +msgstr "" + +msgid "Degree of a sub graph" +msgstr "子图的度数" + +#, fuzzy +msgid "For the following is a subgraph of the :doc:`sampledata`:" +msgstr "pgRouting :doc:`sampledata` 的图形着色" + +msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr "" + +msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" +msgstr "" + +msgid "The vertices not participating on the edge are considered isolated" +msgstr "" -msgid "Vertex identifier" -msgstr "顶点标识符" +msgid "their degree is 0 in the subgraph and" +msgstr "" -msgid "``degree``" -msgstr "``degree``" +msgid "their degree is not shown in the output." +msgstr "" -msgid "Number of edges that are incident to the vertex ``id``" -msgstr "与顶点 ``id`` 关联的边数" +#, fuzzy +msgid "Using a vertex table" +msgstr "在顶点表上" -msgid "Degree of a sub graph" -msgstr "子图的度数" +#, fuzzy +msgid "" +"For decent size networks, it is best to prepare your vertices table before " +"hand and use it on ``pgr_degree`` calls." +msgstr "" +"`pgr_degree`可以利用 `pgr_extractVertices` 的输出，或者可以在调用中嵌入" +"`pgr_extractVertices`。对于较大规模的网络，最好提前准备好顶点表并在" +"`pgr_degree`调用中使用该顶点表。" + +#, fuzzy +msgid "Extract the vertex information and save into a table:" +msgstr "提取顶点信息" msgid "Dry run execution" msgstr "模拟执行" @@ -11171,18 +11467,38 @@ msgid "" "backend development needs." msgstr "结果可作为基础代码，根据后台开发需要进行改进。" -msgid "Degree from an existing table" -msgstr "来自现有表的度数" +#, fuzzy +msgid "Finding dead ends" +msgstr "死端" +#, fuzzy msgid "" -"If you have a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, you can forgo using " -"pgr_degree and work with the ``in_edges`` and ``out_edges`` columns directly." +"If there is a vertices table already built using ``pgr_extractVertices`` and " +"want the degree of the whole graph rather than a subset, it can be forgo " +"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " +"columns directly." msgstr "" "如果您已经使用 ``pgr_extractVertices`` 构建了一个顶点表，并且想要整个图的度而" "不是子集，则可以放弃使用 pgr_degree 并直接使用 ``in_edges`` 和 ``out_edges`` " "列。" +#, fuzzy +msgid "The degree of a dead end is 1." +msgstr "绿色节点是 `死端`_ 节点" + +#, fuzzy +msgid "Finding linear vertices" +msgstr "添加新的顶点" + +#, fuzzy +msgid "The degree of a linear vertex is 2." +msgstr "相邻顶点的数量为2。" + +#, fuzzy +msgid "" +"If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "要获取顶点信息，请使用 :doc:`pgr_extractVertices`" + msgid ":doc:`pgr_extractVertices`" msgstr ":doc:`pgr_extractVertices`" @@ -11199,15 +11515,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "版本 3.3.0" -msgid "Promoted to **proposed** function" -msgstr "升级至 **拟议** 函数" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_depthFirstSearch`` (`单个顶点`_)" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_depthFirstSearch`` (`多个顶点`_)" - 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 " @@ -11263,16 +11570,18 @@ msgstr "**options:** ``[directed, max_depth]``" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "与 `单顶点`_ 相同，但边按 ``id`` 降序排列。" +#, fuzzy msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" "`Boost：深度优先搜索算法文档 `__" +#, fuzzy msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" "`Boost：非定向 DFS 算法文档 `__" @@ -11287,53 +11596,40 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "`pgr_dijkstra``" -#, fuzzy msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." -msgstr "`pgr_dijkstra`` - 使用 Dijkstra 算法的最短路径。" +msgstr "`pgr_dijkstra`` - 使用 Dijkstra 算法计算的最短路径。" msgid "Version 3.5.0" msgstr "版本 3.5.0" -msgid "" -"``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_dijkstra`` (`一对一`_)增加``start_vid`` 和``end_vid`` 列。" +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_dijkstra（一对一）增加了``start_vid`` 和``end_vid`` 列。" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_dijkstra`` (`一对多`_) 增加``end_vid`` 列。" +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "pgr_dijkstra（一对多）添加了 ``end_vid`` 列。" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_dijkstra`` (`多对一`_) 增加 ``start_vid`` 列。" +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgstr "pgr_dijkstra（多对一）添加了 ``start_vid`` 列。" msgid "Version 3.1.0" msgstr "版本 3.1.0" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "``pgr_dijkstra`` (`组合`_)" - -msgid "**Official** functions" -msgstr "**官方** 函数" - msgid "Version 2.2.0" msgstr "版本 2.2.0" -msgid "New **proposed** functions:" -msgstr "新的 **拟议** 函数：" +msgid "pgr_dijkstra(One to Many)" +msgstr "pgr_dijkstra(一对多)" -msgid "``pgr_dijkstra`` (`One to Many`_)" -msgstr "``pgr_dijkstra`` (`一对多`_)" +msgid "pgr_dijkstra(Many to One)" +msgstr "pgr_dijkstra(多对一)" -msgid "``pgr_dijkstra`` (`Many to One`_)" -msgstr "``pgr_dijkstra`` (`多对一`_)" - -msgid "``pgr_dijkstra`` (`Many to Many`_)" -msgstr "``pgr_dijkstra`` (`多对多`_)" +msgid "pgr_dijkstra(Many to Many)" +msgstr "pgr_dijkstra（多对多）" -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" +#, fuzzy +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "``pgr_dijkstra`` (`一对一`_)的签名更改" -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" -msgstr "**官方** ``pgr_dijkstra`` (`一对一`_)" - msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -11519,26 +11815,29 @@ msgstr "36) 使用 `多对多`_" msgid "37) Using `Combinations`_" msgstr "37) 使用 `组合`_" +#, fuzzy +msgid "" +"`Boost: Dijkstra shortest paths `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraCost``" msgstr "`pgr_dijkstraCost``" -#, fuzzy msgid "" "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " "algorithm." -msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算的最短路径总成本。" - -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "``pgr_dijkstraCost`` (`组合`_)" +msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算最短路径的总成本。" -#, fuzzy msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " "using Dijkstra Algorithm." -msgstr "``pgr_dijkstraCost`` 函数总结了使用Dijkstra算法的最短路径的成本。" +msgstr "``pgr_dijkstraCost`` 函数总结了使用 Dijkstra 算法计算最短路径的成本。" msgid "" "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -11847,9 +12146,6 @@ msgstr "``true`` 时：仅返回 ``cap`` 结果" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "当 ``false`` 时：将返回每个 ``Start vid`` 的 ``cap`` 限值" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "维基百科：https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -11966,11 +12262,11 @@ msgstr "**选项：** ``[directed, strict, U_turn_on_edge]``" msgid "Returns set of |via-result|" msgstr "返回 |via-result| 的集合" -#, fuzzy msgid "" "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " "on an directed graph." -msgstr "在有向图上查找按顺序访问顶点 :math:`\\{ 5, 1, 8\\}` 的路线。" +msgstr "" +"在一个directed graph中，找到按顺序访问顶点 :math:`\\ {5, 1, 8\\}` 的路径。" msgid "Via optional parameters" msgstr "Via可选参数" @@ -12033,6 +12329,9 @@ msgid "" "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" +msgid "Standarizing output columns to |result-spantree|" +msgstr "将输出列标准化为 |result-spantree|" + msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "添加了 ``depth`` 和 ``start_vid`` 结果列。" @@ -12042,14 +12341,17 @@ msgstr "结果列名称更改： ``from_v``改为 ``start_vid``。" msgid "Added ``depth`` and ``pred`` result columns." msgstr "添加了 ``depth`` 和``pred`` 结果列。" -msgid "Signature change pgr_drivingDistance(single vertex)" -msgstr "签名更改 pgr_drivingDistance（单顶点）" +msgid "Signature change:" +msgstr "签名变更：" + +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance （单顶点）" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" -msgstr "新 **官方** pgr_drivingDistance(多顶点)" +msgid "New official signature:" +msgstr "新签名：" -msgid "Official:: pgr_drivingDistance(single vertex)" -msgstr "官方:: pgr_drivingDistance(单顶点)" +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance （多顶点）" msgid "" "Using the Dijkstra algorithm, extracts all the nodes that have costs less " @@ -12109,7 +12411,8 @@ msgid "" "undirected graph" msgstr "在无向图上，从顶点 :math:`{11, 16\\}` 开始的距离为 :math:`3.0`" -msgid "pgr_edgeColoring - Experimental" +#, fuzzy +msgid "``pgr_edgeColoring`` - Experimental" msgstr "pgr_edgeColoring - 实验" msgid "" @@ -12189,6 +12492,18 @@ msgstr "Returns set of |result-edge-color|" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "pgRouting :doc:`sampledata` 的图形着色" +#, fuzzy +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" +"`Boost：边缘着色算法文档 `__" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "`维基百科：图着色 `__" + msgid "``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" @@ -12197,9 +12512,6 @@ msgid "" "groups of vertices." msgstr "``pgr_edgeDisjointPaths`` - 计算两组顶点之间的边不相交路径。" -msgid "New **proposed** function:" -msgstr "新的 **拟议** 函数：" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(组合)" @@ -12294,9 +12606,6 @@ msgstr "" "``pgr_edmondsKarp`` —使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到目" "标的流量。" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "``pgr_edmondsKarp`` (`组合`_)" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "从 ``pgr_maxFlowEdmondsKarp`` 更名而来" @@ -12318,33 +12627,25 @@ msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +#, fuzzy +msgid "" +"`Boost: Edmonds Karp max flow `__" msgstr "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "``pgr_edwardMoore - Experimental``" -msgstr "``pgr_edwardMoore - 实验``" +#, fuzzy +msgid "``pgr_edwardMoore`` - Experimental" +msgstr "``pgr_edwardMoore`` - 实验" msgid "" "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "`pgr_edwardMoore`` - 使用 Edward-Moore 算法返回最短路径。" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "``pgr_edwardMoore`` (`组合`_)" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "``pgr_edwardMoore`` (`一对一`_)" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "``pgr_edwardMoore`` (`一对多`_)" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "``pgr_edwardMoore`` (`多对一`_)" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" -msgstr "``pgr_edwardMoore`` (`多对多`_)" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(组合)" msgid "" "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " @@ -12417,15 +12718,13 @@ msgstr "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "pgr_extractVertices -- Proposed" -msgstr "pgr_extractVertices -- 拟议" +#, fuzzy +msgid "``pgr_extractVertices``" +msgstr "pgr_extractVertices" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` — 提取顶点信息" -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." @@ -12530,14 +12829,9 @@ msgstr "``pgr_findCloseEdges``" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "``pgr_findCloseEdges`` -查找点几何图形的闭合边。" -msgid "New **proposed** signatures:" -msgstr "新的 **拟议** 签名：" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "``pgr_findCloseEdges`` (`一个点`_)" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "``pgr_findCloseEdges`` (`多个点`_)" +#, fuzzy +msgid "``partial`` option is removed." +msgstr "``n_seq`` 被删除" msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " @@ -12553,7 +12847,8 @@ msgid "" "adjustments needed by the application." msgstr "可以获取计算代码，以便根据应用需要进行进一步的具体调整。" -msgid "``EMTPY SET`` is returned on dryrun executions" +#, fuzzy +msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "空运行执行时返回 ``EMTPY SET``" msgid "" @@ -12566,7 +12861,8 @@ msgid "" msgstr "" "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgid "**options:** ``[cap, partial, dryrun]``" +#, fuzzy +msgid "**options:** ``[cap, dryrun]``" msgstr "**options:** ``[cap, partial, dryrun]``" msgid "Returns set of |result-find|" @@ -12575,53 +12871,17 @@ msgstr "返回集合 |result-find|" msgid "One point" msgstr "一个点" -msgid "Default: ``cap => 1``" -msgstr "默认： ``cap => 1``" - -msgid "Maximum one row answer." -msgstr "最多回答一行。" - -msgid "Default: ``partial => true``" -msgstr "默认： ``partial => true``" - -msgid "With less calculations as possible." -msgstr "尽可能减少计算。" - -msgid "Default: ``dryrun => false``" -msgstr "默认： ``dryrun => false``" - -msgid "Process query" -msgstr "过程查询" - -msgid "Returns" -msgstr "返回" - -msgid "values on ``edge_id``, ``fraction``, ``side`` columns." -msgstr "``edge_id``, ``fraction``, ``side`` 列的值。" +msgid "Get two close edges to points of interest with :math:`pid = 5`" +msgstr "" -msgid "``NULL`` on ``distance``, ``geom``, ``edge`` columns." -msgstr "``distance``, ``geom``, ``edge``列上为``NULL``。" +msgid "``cap => 2``" +msgstr "``cap => 2``" msgid "Many points" msgstr "多点" -msgid "" -"Find at most :math:`2` edges close to all vertices on the points of interest " -"table." -msgstr "最多找出 :math:`2` 接近兴趣点表上所有顶点的边。" - -msgid "One answer per point, as small as possible." -msgstr "每点一个答案，越小越好。" - -msgid "" -"Columns ``edge_id``, ``fraction``, ``side`` and ``geom`` are returned with " -"values." -msgstr "返回了带有值的列 ``edge_id``, ``fraction``, ``side`` 和 ``geom``。" - -msgid "" -"``geom`` contains the original point geometry to assist on deterpartialing " -"to which point geometry the row belongs to." -msgstr "``geom`` 包含原始的点几何信息，以帮助确定该行属于哪个点几何。" +msgid "For each points of interests, find the closest edge." +msgstr "" msgid "**point**" msgstr "**point**" @@ -12647,17 +12907,6 @@ msgstr "几何图形之间的最大距离" msgid "Limit output rows" msgstr "限制输出行数" -msgid "``partial``" -msgstr "``partial``" - -msgid "" -"When ``true`` only columns needed for :doc:`withPoints-category` are " -"calculated." -msgstr "当为 ``true`` 时，只计算 :doc:`withPoints-category` 需要的列。" - -msgid "When ``false`` all columns are calculated" -msgstr "当为 ``false`` 时，所有的列都计算" - msgid "When ``false`` calculations are performed." msgstr "当为 ``false`` 时，执行计算。" @@ -12674,290 +12923,120 @@ msgstr "边的 ``LINESTRING`` 几何。" msgid "When :math:`cap = 1`, it is the closest edge." msgstr "当 :math:`cap = 1` 时，它是最近的边。" +#, fuzzy msgid "" -"Value in <0,1> that indicates the relative postition from the first end-" -"point of the edge." +"Value in <0,1> that indicates the relative position from the first end-point " +"of the edge." msgstr "在 <0,1> 范围内的值，表示相对于边的第一个端点的相对位置。" msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "``[r, l]`` 中的值指示该点是否为：" -msgid "In the right ``r``." -msgstr "在右边的 ``r``。" - -msgid "In the left ``l``." -msgstr "在左边的 ``l``。" +#, fuzzy +msgid "At the right ``r`` of the segment." +msgstr "分段的几何形状。" msgid "When the point is on the line it is considered to be on the right." msgstr "当点在直线上时，它被认为是在右边。" +#, fuzzy +msgid "At the left ``l`` of the segment." +msgstr "位于该段的两侧。" + msgid "``distance``" msgstr "``distance``" -msgid "Distance from point to edge." +#, fuzzy +msgid "Distance from the point to the edge." msgstr "点到边缘的距离。" -msgid "``NULL`` when ``cap = 1`` on the `One point`_ signature" -msgstr "``NULL`` 当在 `一个点`_ 签名，``cap = 1`` 时" - -msgid "``POINT`` geometry" +#, fuzzy +msgid "Original ``POINT`` geometry." msgstr "``POINT`` 几何" +#, fuzzy msgid "" -"`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 that connects the original **point** to the closest " +"point of the edge with identifier ``edge_id``" msgstr "" "从 **原始点** 到具有标识符 ``edge_id`` 的边的最近点的 ``LINESTRING`` 几何图形" -msgid "One point results" -msgstr "单一点的结果" +#, fuzzy +msgid "One point in an edge" +msgstr "单点模拟执行" -msgid "The green nodes is the **original point**" +#, fuzzy +msgid "The green node is the original point." msgstr "绿色节点是 **原始点**" -msgid "" -"The geometry ``geom`` is a point on the :math:`sp \\rightarrow ep` edge." -msgstr "几何 ``geom`` 是 :math:`sp \\rightarrow ep` 边上的一个点。" - -msgid "" -"The geometry ``edge`` is a line that connects the **original point** with " -"``geom``" -msgstr "几何 ``edge`` 是连接 **original point** 和 ``geom`` 的线" - -msgid "Many point results" -msgstr "多点成果" - -msgid "The green nodes are the **original points**" -msgstr "绿色节点为 **原始点**" - -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" -msgstr "标为 **g1** 和 **g2** 的几何体 ``geom`` 是 **原始点**" +#, fuzzy +msgid "``geom`` has the value of the original point." +msgstr "边 :math:`5` 是距离 **原始点** 最近的边" +#, fuzzy msgid "" -"The geometry ``edge``, marked as **edge1** and **edge2** is a line that " -"connects the **original point** with the closest point on the :math:`sp " -"\\rightarrow ep` edge." +"The geometry ``edge`` is a line that connects the original point with the " +"edge :math:`sp \\rightarrow ep` edge." msgstr "" "标为 **edge1** 和 **edge2** 的几何图形 ``edge`` 是一条连接 ** 原始点** 和 :" "math:`sp \\rightarrow ep` 边上最近点的线。" -msgid "One point examples" -msgstr "单点示例" - -msgid "At most two answers" -msgstr "最多两个答案" - -msgid "``cap => 2``" -msgstr "``cap => 2``" - -msgid "Maximum two row answer." -msgstr "最多回答两行。" - -msgid "Understanding the result" -msgstr "了解结果" - -msgid "``NULL`` on ``geom``, ``edge``" -msgstr "``NULL`` 在 ``geom``, ``edge`` 上" - -msgid "``edge_id`` identifier of the edge close to the **original point**" -msgstr "``edge_id`` 靠近 **原始点** 的边的标识符" - -msgid "" -"Two edges are withing :math:`0.5` distance units from the **original " -"point**: :math:`{5, 8}`" -msgstr "有两条边与 **原始点** : :math:`{5, 8}` 的距离在 :math:`0.5` 单位范围内" - -msgid "For edge :math:`5`:" -msgstr "对于边 :math:`5`:" - -msgid "" -"``fraction``: The closest point from the **original point** is at the :math:" -"`0.8` fraction of the edge :math:`5`." -msgstr "" -"``fraction``：离 **原始点** 最近的点位于边 :math:`5` 处的 :math:`0.8` 分数位" -"置。" - -msgid "" -"``side``: The **original point** is located to the left side of edge :math:" -"`5`." +#, fuzzy +msgid "The point is located at the left of the edge." msgstr "``side``： **原始点** 位于边 :math:`5` 的左侧。" -msgid "" -"``distance``: The **original point** is located :math:`0.1` length units " -"from edge :math:`5`." -msgstr "``distance``： **原始点** 位于边 :math:`5` 的 :math:`0.1` 长度单位处。" - -msgid "For edge :math:`8`:" -msgstr "对于边 :math:`8`：" - -msgid "" -"``fraction``: The closest point from the **original point** is at the :math:" -"`0.89..` fraction of the edge :math:`8`." -msgstr "" -"``fraction``：离 **原始点** 最近的点位于边 :math:`8` 的 :math:`0.89..` 分数位" -"置。" - -msgid "" -"``side``: The **original point** is located to the right side of edge :math:" -"`8`." -msgstr "``side``： **原始点** 位于边 :math:`8` 的右侧。" - -msgid "" -"``distance``: The **original point** is located :math:`0.19..` length units " -"from edge :math:`8`." -msgstr "" -"``distance``： **原始点** 距离边 :math:`8` 有 :math:`0.19..` 长度单位。" - -msgid "One answer, all columns" -msgstr "一个答案，所有列" - -msgid "``partial => false``" -msgstr "``partial => false``" - -msgid "Calculate all columns" -msgstr "计算所有列" - -msgid "" -"``edge_id`` identifier of the edge **closest** to the **original point**" -msgstr "``edge_id`` 与 **原始点** 最 **接近** 的边的标识符" - -msgid "" -"From all edges within :math:`0.5` distance units from the **original " -"point**: :math:`{5}` is the closest one." -msgstr "" -"从距离 **原始点** 不超过 :math:`0.5` 距离单位的所有边中，边 :math:`{5}` 是最" -"近的一条。" - -msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`5` from " -"the **original point**." -msgstr "``geom``:包含了从 **原始点** 到边 :math:`5` 上最近点的几何形状。" - -msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " -"the closest point on on edge :math:`5` ``geom``" -msgstr "" -"``edge``：包含了从 **原始点** 到边 :math:`5` ``geom`` 上最近点的 " -"``LINESTRING`` 几何形状" - -msgid "At most two answers with all columns" -msgstr "所有列最多有两个答案" - -msgid "Understanding the result:" -msgstr "了解结果：" - -msgid "" -"``geom``: Contains the geometry of the closest point on edge :math:`8` from " -"the **original point**." -msgstr "``geom``：包含了从 **原始点** 到边 :math:`8` 上最近点的几何形状。" - -msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** to " -"the closest point on on edge :math:`8` ``geom``" -msgstr "" -"``edge``：包含了从 **原始点** 到边 :math:`8` ``geom`` 上最近点的 " -"``LINESTRING`` 几何形状" - msgid "One point dry run execution" msgstr "单点模拟执行" +#, fuzzy +msgid "Using the query from the previous example:" +msgstr "本示例使用此表设计：" + msgid "Returns ``EMPTY SET``." msgstr "返回 ``EMPTY SET``。" -msgid "``partial => true``" -msgstr "``partial => true``" - -msgid "Is ignored" -msgstr "被忽略" - -msgid "" -"Because it is a **dry run** excecution, the code for all calculations are " -"shown on the PostgreSQL ``NOTICE``." -msgstr "" -"由于这是一次 **模拟** 执行，所有计算的代码都显示在 PostgreSQL 的 ``NOTICE`` " -"中。" - msgid "``dryrun => true``" msgstr "``dryrun => true``" -msgid "Do not process query" -msgstr "不处理查询" - -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +#, fuzzy +msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE``" -msgid "``cap`` and **original point** are used in the code" -msgstr "代码中使用了 ``cap`` 和 **原始点**" - -msgid "Many points examples" -msgstr "多点示例" - -msgid "At most two answers per point" -msgstr "每个点最多两个答案" - -msgid "``NULL`` on ``edge``" -msgstr "``edge``为``NULL``" - -msgid "" -"``edge_id`` identifier of the edge close to a **original point** (``geom``)" -msgstr "``edge_id``是与一个 **原始点** （``geom``）靠近的边的标识符" - -msgid "" -"Two edges at most withing :math:`0.5` distance units from each of the " -"**original points**:" -msgstr "" -"每个 **原始点** 中，最多有两条边位于距离不超过 :math:`0.5` 距离单位的范围内：" - -msgid "For ``POINT(1.8 0.4)`` and ``POINT(0.3 1.8)`` only one edge was found." -msgstr "对于 ``POINT(1.8 0.4)`` 和 ``POINT(0.3 1.8)`` ，只找到一条边。" - -msgid "For the rest of the points two edges were found." -msgstr "其余的点有两条边。" - -msgid "For point ``POINT(2.9 1.8)``" -msgstr "对于点 ``POINT(2.9 1.8)``" - msgid "" -"Edge :math:`5` is before :math:`8` therefore edge :math:`5` has the shortest " -"distance to ``POINT(2.9 1.8)``." +"The generated code can be used as a starting base code for additional " +"requirements, like taking into consideration the SRID." msgstr "" -"边 :math:`5` 在 :math:`8` 之前，因此边 :math:`5` 到 ``POINT(2.9 1.8)`` 的距离" -"最短。" - -msgid "One answer per point, all columns" -msgstr "每点一个答案，所有列" -msgid "For the **original point** ``POINT(2.9 1.8)``" -msgstr "对于 **原始点** ``POINT(2.9 1.8)``" +#, fuzzy +msgid "Many points in an edge" +msgstr "多点示例" -msgid "Edge :math:`5` is the closest edge to the **original point**" -msgstr "边 :math:`5` 是距离 **原始点** 最近的边" +msgid "The green nodes are the **original points**" +msgstr "绿色节点为 **原始点**" msgid "" -"``geom``: Contains the geometry of the **original point** ``POINT(2.9 1.8)``" -msgstr "``geom``：包含了 **原始点** 的几何形状，即 ``POINT(2.9 1.8)``" +"The geometry ``geom``, marked as **g1** and **g2** are the **original " +"points**" +msgstr "标为 **g1** 和 **g2** 的几何体 ``geom`` 是 **原始点**" msgid "" -"``edge``: Contains the ``LINESTRING`` geometry of the **original point** " -"(``geom``) to the closest point on on edge." +"The geometry ``edge``, marked as **edge1** and **edge2** is a line that " +"connects the **original point** with the closest point on the :math:`sp " +"\\rightarrow ep` edge." msgstr "" -"``edge``：包含了 **原始点** （``geom``）到最接近的边上的 ``LINESTRING`` 几何" -"形状。" +"标为 **edge1** 和 **edge2** 的几何图形 ``edge`` 是一条连接 ** 原始点** 和 :" +"math:`sp \\rightarrow ep` 边上最近点的线。" msgid "Many points dry run execution" msgstr "多点模拟执行" +msgid "Do not process query" +msgstr "不处理查询" + +msgid "" +"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE``" + msgid "Find at most two routes to a given point" msgstr "最多找到两条到达给定点的路线" @@ -12994,11 +13073,12 @@ msgstr "在这份文档中，将有6个固定的兴趣点，并且它们将被 msgid "A unique identifier." msgstr "唯一标识符。" -msgid "" -"Identifier of the edge nearest edge that allows an arrival to the point." -msgstr "允许到达该点的最近边的标识符。" +#, fuzzy +msgid "Identifier of the nearest segment." +msgstr "顶点的标识符。" -msgid "Is it on the left, right or both sides of the segment ``edge_id``" +#, fuzzy +msgid "Is it on the left, right or both sides of the segment ``edge_id``." msgstr "它位于边 ``edge_id`` 的左侧、右侧还是两侧" msgid "Where in the segment is the point located." @@ -13007,15 +13087,43 @@ msgstr "该点位于边的哪个位置。" msgid "The geometry of the points." msgstr "点的几何形状。" +#, fuzzy +msgid "The distance between ``geom`` and the segment ``edge_id``." +msgstr "它位于边 ``edge_id`` 的左侧、右侧还是两侧" + +#, fuzzy +msgid "" +"A segment that connects the ``geom`` of the point to the closest point on " +"the segment ``edge_id``." +msgstr "它位于边 ``edge_id`` 的左侧、右侧还是两侧" + msgid "``newPoint``" msgstr "``newPoint``" -msgid "The geometry of the points moved on top of the segment." -msgstr "在线段顶部移动的点的几何形状。" +msgid "A point on segment ``edge_id`` that is the closest to ``geom``." +msgstr "" -msgid "Points of interest fillup" +#, fuzzy +msgid "Points of interest fill up" msgstr "兴趣点填充" +#, fuzzy +msgid "Inserting the points of interest." +msgstr "兴趣点" + +#, fuzzy +msgid "Filling the rest of the table." +msgstr "填写映射表" + +msgid "" +"Any other additional modification: In this manual, point :math:`6` can be " +"reached from both sides." +msgstr "" + +#, fuzzy +msgid "The points of interest:" +msgstr "兴趣点" + msgid "``pgr_floydWarshall``" msgstr "``pgr_floydWarshall``" @@ -13049,9 +13157,6 @@ msgstr "" "Boost `floyd-Warshall `_" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "查询使用 :doc:`sampledata` 网络。" - msgid "``pgr_full_version``" msgstr "``pgr_full_version``" @@ -13059,9 +13164,6 @@ msgid "" "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "``pgr_full_version`` — 获取pgRouting版本信息的详细信息。." -msgid "New **official** function" -msgstr "**官方** 新功能" - msgid "Get complete details of pgRouting version information" msgstr "获取 pgRouting 版本信息的完整详细信息" @@ -13128,17 +13230,16 @@ msgstr "``hash``" msgid "Git hash of pgRouting build" msgstr "pgRouting 构建的 Git 哈希" -msgid "``pgr_hawickCircuits - Experimental``" +#, fuzzy +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits - 实验``" +#, fuzzy msgid "" -"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " +"``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits " "algorithm." msgstr "``pgr_hawickCircuits`` — 使用 Hawick 回路算法返回回路列表。" -msgid "``pgr_hawickCircuits``" -msgstr "``pgr_hawickCircuits``" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -13279,7 +13380,10 @@ msgstr "" "新图不是平面图，因为它具有一个 :math:`K_5` 子图。蓝色的边代表 :math:`K_5` 子" "图。" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +#, fuzzy +msgid "" +"`Boost: Boyer Myrvold `__" msgstr "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" msgid "``pgr_johnson``" @@ -13339,6 +13443,9 @@ msgid "" "breadth First Search ordering." msgstr "``pgr_kruskalBFS`` — Kruskal 的最小生成树算法，具有广度优先搜索排序。" +msgid "Added ``pred`` result columns." +msgstr "添加了 ``pred`` 结果列。" + msgid "" "Visits and extracts the nodes information in Breath First Search ordering of " "the Minimum Spanning Tree created using Kruskal's algorithm." @@ -13421,8 +13528,9 @@ msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" -msgstr "pgr_lengauerTarjanDominatorTree -实验" +#, fuzzy +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - 实验" msgid "" "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " @@ -13480,11 +13588,12 @@ msgstr "顶点的直接支配者。" msgid "Dominator tree of another component." msgstr "另一个组件的支配树。" +#, fuzzy msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" -"`BOOST：Languer-Tarzan 支配树算法 `__" msgid "" @@ -13493,51 +13602,50 @@ msgid "" msgstr "" "`维基百科:支配树 `__" -#, fuzzy -msgid "pgr_lineGraph - Proposed" -msgstr "pgr_trsp - 拟议" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - 提议" msgid "" "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" "based graph." msgstr "``pgr_lineGraph`` — 将给定图转换为其相应的基于边的图。" -#, fuzzy +msgid "Works for directed and undirected graphs." +msgstr "适用于有向和无向图。" + msgid "" "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" -msgstr "给定一个图 G，它的线图 L(G) 是这样的图：" +msgstr "给定一个图 :math:`G`，其线图 :math:`L(G)` 是一个图，满足以下条件：" -#, fuzzy msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr ":math:`L(G)` 的每个顶点代表 :math:`G` 的一条边。" -#, fuzzy msgid "" "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " "edges share a common endpoint in :math:`G`" msgstr "" -":math:`L(G)` 的两个顶点相邻当且仅当它们对应的边共享 :math:`G` 中的公共端点" +":math:`L(G)` 的两个顶点相邻，当且仅当它们对应的边在 :math:`G` 中共享一个共同" +"端点时" -#, fuzzy msgid "" "The ``cost`` and ``reverse_cost`` columns of the result represent existence " "of the edge." -msgstr "使用 ``cost`` 和 ``reverse_cost`` 列来表示边的存在。" +msgstr "结果中的 ``cost`` 和 ``reverse_cost`` 列表示边的存在性。" -#, fuzzy msgid "When the graph is directed the result is directed." -msgstr "当图无向时，成本矩阵是对称的。" +msgstr "当图形是有向的，结果也是有向的。" msgid "" "To get the complete Line Graph use unique identifiers on the double way " "edges (See `Additional Examples`_)." msgstr "" +"要获取完整的线图，请在双向边上使用唯一标识符 (See `Additional Examples`_)." msgid "When the graph is undirected the result is undirected." msgstr "当图无向时，成本矩阵是对称的。" msgid "The ``reverse_cost`` is always :math:`-1`." -msgstr "" +msgstr "``reverse_cost`` 始终为 :math:`-1`。" msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" msgstr "pgr_lineGraph(`Edges SQL`_, [``directed``])" @@ -13545,22 +13653,15 @@ msgstr "pgr_lineGraph(`Edges SQL`_, [``directed``])" msgid "Returns set of |result-lineg|" msgstr "Returns set of |result-lineg|" -#, fuzzy msgid "For an undirected graph with edges :math:'{2,4,5,8}'" -msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图" +msgstr "对于一个undirected graph(无向图)，其边为 :math:'{2,4,5,8}'" msgid "Gives a local identifier for the edge" msgstr "给出边的本地标识符" -msgid "Identifier of the source vertex of the current edge." -msgstr "当前边的源顶点的标识符。" - msgid "When `negative`: the source is the reverse edge in the original graph." msgstr "为负时：源是原始图中的反向边。" -msgid "Identifier of the target vertex of the current edge." -msgstr "当前边的目标顶点的标识符。" - msgid "When `negative`: the target is the reverse edge in the original graph." msgstr "为负时：目标是原始图中的反向边。" @@ -13580,152 +13681,146 @@ msgid "" "it’s not part of the graph." msgstr "当为负时：边(``target``, ``source``)不存在，因此它不是图的一部分。" -#, fuzzy msgid "Given the following directed graph" -msgstr "给出以下查询" +msgstr "给定以下有向图" msgid "" ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 " "\\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 " "\\rightarrow 3\\})`" msgstr "" +":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 " +"\\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 " +"\\rightarrow 3\\})`" msgid "Representation as directed with shared edge identifiers" -msgstr "" +msgstr "用共享边标识符定向表示" msgid "" "For the simplicity, the design of the edges table on the database, has the " "edge's identifiers are represented with 3 digits:" -msgstr "" +msgstr "为了简化数据库中边表的设计，边的标识符采用3位数字表示：" msgid "hundreds" -msgstr "" +msgstr "百位" -#, fuzzy msgid "the source vertex" -msgstr "获取最近的顶点" +msgstr "源点" msgid "tens" -msgstr "" +msgstr "十位" msgid "always 0, acts as a separator" -msgstr "" +msgstr "始终为 0，用作分隔符" -#, fuzzy msgid "units" -msgstr "单位" +msgstr "个位" -#, fuzzy msgid "the target vertex" -msgstr "获取最近的顶点" +msgstr "目标顶点" msgid "In this image," -msgstr "" +msgstr "在这张图片中，" msgid "" "Single or double head arrows represent one edge (row) on the edges table." -msgstr "" +msgstr "单向或双向箭头表示边表中的一条边（行）。" -#, fuzzy msgid "The numbers in the yellow shadow are the edge identifiers." -msgstr "返回的行按边标识符升序排列。" +msgstr "黄色阴影中的数字是边缘标识符。" msgid "" "Two pair of edges share the same identifier when the ``reverse_cost`` column " "is used." -msgstr "" +msgstr "当使用 ``reverse_cost`` 列时，两个边对会共享相同的标识符。" -#, fuzzy msgid "" "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " "edge row with :math:`id=203`." -msgstr "从图中删除边 :math:`v \\rightarrow w` 和 :math:`w \\rightarrow z`。" +msgstr "" +"边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` 用一条边行表示，标识符其 :" +"math:`id=203` 。" -#, fuzzy msgid "" "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " "edge row with :math:`id=304`." -msgstr "从图中删除边 :math:`v \\rightarrow w` 和 :math:`w \\rightarrow z`。" +msgstr "" +"边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` 用一条边的行表示，标识符为 :" +"math:`id=304` 。" -#, fuzzy msgid "The graph can be created as follows:" -msgstr "图定义如下：" +msgstr "图表的创建过程如下：" -#, fuzzy msgid "Line Graph of a directed graph represented with shared edges" -msgstr "就有向图而言，就像有四个边" +msgstr "用共享边表示的有向图的线图" -#, fuzzy msgid "The result is a directed graph." -msgstr "有向图。" +msgstr "结果就是一个有向图。" -#, fuzzy msgid "" "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" -msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分" +msgstr "对于 :math:`seq=4` ，从:math:`203 \\leftrightarrow 304` 表示两条边" msgid "For all the other values of ``seq`` represent one edge." -msgstr "" +msgstr "所有其他的 ``seq`` 值都代表一条边。" -#, fuzzy msgid "" "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." -msgstr "使用 ``cost`` 和 ``reverse_cost`` 列来表示边的存在。" +msgstr "``cost`` 和 ``reverse_cost`` 的值表示边的存在。" -#, fuzzy msgid "When positive: the edge exists." -msgstr "当正数时是顶点的标识符。" +msgstr "当为正数时：边缘存在。" -#, fuzzy msgid "When negative: the edge does not exist." -msgstr "为负数时抛出错误。" +msgstr "负数时：边缘不存在。" msgid "Representation as directed with unique edge identifiers" -msgstr "" +msgstr "作为有向图表示，并使用唯一的边标识符" -#, fuzzy msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "红色箭头对应边表中 ``cost`` > 0的情况。" +msgstr "单头箭头代表边表中的一条边（行）。" msgid "There are no double head arrows" -msgstr "" +msgstr "没有双向头箭" msgid "" "Two pair of edges share the same ending nodes and the ``reverse_cost`` " "column is not used." -msgstr "" +msgstr "两对边共享相同的结束节点，不使用 ``reverse_cost`` 列。" msgid "" "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " "edges :math:`id=203` and :math:`id=302` respectively." msgstr "" +"边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}`分别用两条边表示，边标识符为 :" +"math:`id=203` 和:math:`id=302` 。" msgid "" "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two " "edges :math:`id=304` and :math:`id=403` respectively." msgstr "" +"边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}`分别用两条边表示，边标识符为 :" +"math:`id=304` 和 :math:`id=403` 。" -#, fuzzy msgid "Line Graph of a directed graph represented with unique edges" -msgstr "就有向图而言，就像有四个边" +msgstr "用唯一边表示的有向图的线图" -#, fuzzy msgid "" "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." -msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" +msgstr "对于 :math:`seq=7` 从 :math:`203 \\leftrightarrow 302` 代表两条边。" -#, fuzzy msgid "" "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." -msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" +msgstr "对于 :math:`seq=8` ，从 :math:`304 \\leftrightarrow 403` 表示两条边。" -#, fuzzy msgid "wikipedia: `Line Graph `__" -msgstr "`维基百科：二分图 `__" +msgstr "维基百科: `Line Graph `__" msgid "" "mathworld: `Line Graph `__" msgstr "" +"MathWorld在线数学资源: `Line Graph `__" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "``pgr_lineGraphFull`` - 实验" @@ -13792,9 +13887,9 @@ msgstr "返回 |result-linegf| 的集合" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "边 :math:`\\{4, 7, 8, 10\\}` 子图的全线图" +#, fuzzy 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 include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" "本节的示例基于 :doc:`sampledata` 网络。 这些示例包括包含具有 " @@ -14028,30 +14123,36 @@ msgstr "pgr_makeConnected(`Edges SQL`_)" msgid "Returns set of |result-component-make|" msgstr "Returns set of |result-component-make|" -msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +#, fuzzy +msgid "List of edges that are needed to connect the graph." msgstr "在 :doc:`sampledata` 网络上完成的查询给出了连接图所需的边列表。" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +#, fuzzy +msgid "" +"`Boost: make connected `__" msgstr "https://www.boost.org/libs/graph/doc/make_connected.html" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" msgid "" "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " "graph." msgstr "``pgr_maxCardinalityMatch`` — 计算图中的最大基数匹配。." +#, fuzzy +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "``pgr_maxCardinalityMatch(text)`` 仅仅返回``边`` 列." + msgid "Deprecated signature" msgstr "已弃用的签名" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "``directed => false`` when used." -msgstr "使用时 ``directed => false``。" +msgid "directed => ``false`` when used." +msgstr "使用时 directed => ``false``。" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "从 ``pgr_maximumCardinalityMatching`` 重命名" @@ -14101,7 +14202,10 @@ msgstr "正值表示存在边(``target``, ``source``)" msgid "Identifier of the edge in the original query." msgstr "原始查询中边的标识符。" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +#, fuzzy +msgid "" +"`Boost: maximum_matching `__" msgstr "https://www.boost.org/libs/graph/doc/maximum_matching.html" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -14119,15 +14223,8 @@ msgid "" msgstr "" "``pgr_maxFlow`` —使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "``pgr_maxFlow`` (`组合`_)" - -msgid "New **Proposed** function" -msgstr "新 **拟议** 的函数" - -#, fuzzy msgid "Calculates the maximum flow from the sources to the targets." -msgstr "计算从 `source(s)` 到 `target(s)` 的最大流量。" +msgstr "计算从源头到目标的最大流量。" msgid "" "When the maximum flow is **0** then there is no flow and **0** is returned." @@ -14160,7 +14257,10 @@ msgstr "RETURNS ``BIGINT``" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "从 source(s)到 target(s)的可能最大流量" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +#, fuzzy +msgid "" +"`Boost: push relabel max flow `__" msgstr "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" msgid "" @@ -14176,8 +14276,11 @@ msgid "" "of the maximum flow on a graph" msgstr "``pgr_maxFlowMinCost`` — 计算图上最大流的总成本最小化的边" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost`` (`组合`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(组合)" + +msgid "|boost| graph inside." +msgstr "|boost| 图内部。" msgid "**TODO** check which statement is true:" msgstr "**TODO** 检查哪个陈述是正确的：" @@ -14222,13 +14325,6 @@ msgstr "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" msgid "Returns set of |result-flow-mincost|" msgstr "返回 |result-flow-mincost| 的集合" -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 "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - 实验" @@ -14237,8 +14333,8 @@ msgid "" "maximum flow on a graph" msgstr "``pgr_maxFlowMinCost_Cost`` — 计算图上最大流量的最小总成本" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost_Cost`` (`组合`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(组合)" msgid "**The cost value of all input edges must be nonnegative.**" msgstr "**所有输入边的成本值必须是非负的。**" @@ -14270,8 +14366,8 @@ msgstr "RETURNS FLOAT" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "从source(s) 到target(s)的最小成本最大流量" -msgid "pgr_nodeNetwork" -msgstr "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" +msgstr "``pgr_nodeNetwork``" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." msgstr "``pgr_nodeNetwork`` - 网络边表的节点。" @@ -14341,9 +14437,8 @@ msgstr "``bigint`` 表的唯一标识符" msgid "old_id" msgstr "old_id" -#, fuzzy msgid "``bigint`` Identifier of the edge in original table" -msgstr "``bigint`` 原表中边的标识符" +msgstr "``bigint`` 是原始表中边的标识符" msgid "sub_id" msgstr "sub_id" @@ -14351,15 +14446,13 @@ msgstr "sub_id" msgid "``integer`` Segment number of the original edge" msgstr "``integer`` 原边的段号" -msgid "" -"``integer`` Empty source column to be used with :doc:`pgr_createTopology` " -"function" -msgstr "``integer`` 与 :doc:`pgr_createTopology` 函数一起使用的空source列" +#, fuzzy +msgid "``integer`` Empty source column" +msgstr "在source 列" -msgid "" -"``integer`` Empty target column to be used with :doc:`pgr_createTopology` " -"function" -msgstr "``integer`` 与 :doc:`pgr_createTopology` 函数一起使用的空target列" +#, fuzzy +msgid "``integer`` Empty target column" +msgstr "在target列" msgid "the geom" msgstr "the geom" @@ -14370,175 +14463,74 @@ msgstr "``geometry`` 节点网络的几何列" msgid "Examples" msgstr "示例" -msgid "Let's create the topology for the data in :doc:`sampledata`" +#, fuzzy +msgid "Create the topology for the data in :doc:`sampledata`" msgstr "让我们为 :doc:`sampledata` 中的数据创建拓扑" -msgid "Now we can analyze the network." +msgid "Analyze the network for intersections." +msgstr "" + +#, fuzzy +msgid "Analyze the network for gaps." msgstr "现在我们可以分析网络了。" -msgid "" -"The analysis tell us that the network has a gap and an intersection. We try " -"to fix the problem using:" +#, fuzzy +msgid "The analysis tell us that the network has a gap and an intersection." msgstr "分析告诉我们，网络存在缺口和交叉点。 我们尝试使用以下方法解决该问题：" -msgid "" -"Inspecting the generated table, we can see that edges 13,14 and 18 has been " -"segmented" -msgstr "检查生成的表，我们可以看到边 13,14 和 18 已被分段" - -msgid "We can create the topology of the new network" -msgstr "我们可以创建新网络的拓扑" - -msgid "Now let's analyze the new topology" -msgstr "现在我们来分析一下新的拓扑" - -msgid "Images" -msgstr "图片" - -msgid "Before Image" -msgstr "之前的图像" - -msgid "Before image" -msgstr "图片前" - -msgid "After Image" -msgstr "后面的图像" - -msgid "After image" -msgstr "图像后" - -msgid "Comparing the results" -msgstr "比较结果" - -msgid "Comparing with the Analysis in the original edge_table, we see that." -msgstr "与原始edge_table中的分析相比，我们看到了这一点。" - -msgid "Before" -msgstr "前" - -msgid "After" -msgstr "后" - -msgid "Table name" -msgstr "表名" - -msgid "edge_table_noded" -msgstr "edge_table_noded" - -msgid "Fields" -msgstr "字段" - -msgid "All original fields" -msgstr "所有原始字段" - -msgid "Has only basic fields to do a topology analysis" -msgstr "仅具有进行拓扑分析的基本字段" +#, fuzzy +msgid "Fixing an intersection" +msgstr "交叉口" -msgid "Edges with 1 dead end: 1,6,24" -msgstr "有 1 个死端的边：1、6、24" +#, fuzzy +msgid "Storing the intersections." +msgstr "添加限制" #, fuzzy -msgid "Edges with 2 dead ends: 17,18" -msgstr "有两个死端的边：17，18" +msgid "Calling ``pgr_nodeNetwork``." +msgstr "``pgr_nodeNetwork``" +#, fuzzy msgid "" -"Edge 17's right node is a dead end because there is no other edge sharing " -"that same node. (cnt=1)" -msgstr "边 17 的右侧节点是一个死端，因为没有其他边共享同一节点。 （cnt=1）" - -msgid "Edges with 1 dead end: 1-1 ,6-1,14-2, 18-1 17-1 18-2" -msgstr "有 1 个死端的边：1-1 ,6-1,14-2, 18-1 17-1 18-2" - -msgid "Isolated segments" -msgstr "孤立的片段" +"Inspecting the generated table, we can see that edges 13 and 18 have been " +"segmented." +msgstr "检查生成的表，我们可以看到边 13,14 和 18 已被分段" #, fuzzy -msgid "two isolated segments: 17 and 18 both they have 2 dead ends" -msgstr "两个孤立的段：17 和 18 都有 2 个死端" - -msgid "No Isolated segments" -msgstr "无孤立段" - -msgid "Edge 17 now shares a node with edges 14-1 and 14-2" -msgstr "边 17 现在与边 14-1 和 14-2 共享一个节点" - -msgid "Edges 18-1 and 18-2 share a node with edges 13-1 and 13-2" -msgstr "边 18-1 和 18-2 与边 13-1 和 13-2 共享一个节点" - -msgid "Gaps" -msgstr "差距" +msgid "Update the topology" +msgstr "更新边拓扑" -msgid "" -"There is a gap between edge 17 and 14 because edge 14 is near to the right " -"node of edge 17" -msgstr "边 17 和边 14 之间有间隙，因为边 14 靠近边 17 的右侧节点" +#, fuzzy +msgid "Add new segments to the edges table." +msgstr "在边表上" -msgid "" -"Edge 14 was segmented Now edges: 14-1 14-2 17 share the same node The " -"tolerance value was taken in account" -msgstr "" -"边缘14 被分段了，现在边缘14-1、14-2 和 17 共享同一个节点。容差值已被考虑" +#, fuzzy +msgid "Insert the intersection as new vertices." +msgstr "兴趣点" -msgid "Intersections" -msgstr "交叉口" +#, fuzzy +msgid "Update source and target information on the edges table." +msgstr "红色箭头显示边表上的边 ``(source, target)``" -msgid "Edges 13 and 18 were intersecting" -msgstr "边 13 和 18 相交" +#, fuzzy +msgid "Delete original edge." +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" -msgstr "" -"边被分段，所以，现在在交点处有一个节点，并且以下边共享它： 13-1 13-2 18-1 " -"18-2" +#, fuzzy +msgid "Update the vertex topology" +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:" +msgid "Fixing a gap" msgstr "" -"现在，我们将包括段 13-1、13-2、14-1、14-2、18-1 和 18-2 到我们的边表中，并复" -"制 dir、cost 和 reverse cost 的数据，按照以下步骤进行：" - -msgid "" -"Add a column old_id into edge_table, this column is going to keep track the " -"id of the original edge" -msgstr "在边表中添加一列old_id，该列将跟踪原始边的id" - -msgid "Insert only the segmented edges, that is, the ones whose max(sub_id) >1" -msgstr "仅插入分段边，即 max(sub_id) >1 的边" - -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:" -msgstr "为了获得与edge_table_noded的拓扑相同的分析结果，我们执行以下查询：" - -msgid "" -"To get the same analysis results as the original edge_table, we do the " -"following query:" -msgstr "为了获得与原始edge_table相同的分析结果，我们执行以下查询：" -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." -msgstr "" -"或者我们可以分析所有内容，因为也许边 18 是立交桥，边 14 是地下通道，还有一个" -"街道水平交汇处，边 17 和 13 也会发生同样的情况。" +#, fuzzy +msgid "Store the deadends" +msgstr "获取死端：" +#, fuzzy 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." -msgstr "" -":doc:`topology-functions` 用于概述路由算法的拓扑。 :doc:`pgr_analyzeOneWay` " -"分析边方向性的方法。 :doc:`pgr_createTopology` 根据几何图创建拓扑。 :doc:" -"`pgr_analyzeGraph` 分析边表的边和顶点。" +"Inspecting the generated table, we can see that edge 14 has been segmented." +msgstr "检查生成的表，我们可以看到边 13,14 和 18 已被分段" msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - 实验" @@ -14723,7 +14715,8 @@ msgstr "" "此数据示例 **lc101** 来自 https://www.sintef.no/projectweb/top/pdptw/li-lim-" "benchmark/ 上发布的数据" -msgid "There are 25 vehciles in the problem all with the same characteristics." +#, fuzzy +msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "问题中有 25 辆车都具有相同的特征。" msgid "The original orders" @@ -14734,7 +14727,8 @@ msgid "" "order." msgstr "对于同一订单的取货和配送，数据位于不同的行中。" -msgid "The original data needs to be converted to an appropiate table:" +#, fuzzy +msgid "The original data needs to be converted to an appropriate table:" msgstr "需要将原始数据转换为合适的表格：" msgid "The query" @@ -14787,12 +14781,12 @@ msgid "" "First Search ordering." msgstr "``pgr_primBFS`` — Prim 的深度优先搜索排序最小生成树算法。" -#, fuzzy msgid "" "Visits and extracts the nodes information in Breath First Search ordering of " "the Minimum Spanning Tree created using Prims's algorithm." msgstr "" -"访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" +"访问并提取使用 Prims 算法创建的最小生成树的 Breath First Search 排序中的节点" +"信息。" msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14803,14 +14797,13 @@ msgstr "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "``pgr_primDD`` — 使用 Prim 算法的集水区节点。" -#, fuzzy msgid "" "Using Prim's algorithm, extracts the nodes that have aggregate costs less " "than or equal to a distance from a root vertex (or vertices) within the " "calculated minimum spanning tree." msgstr "" -"使用 Prim 算法，在计算的最小生成树中提取总成本小于或等于距根顶点（或多个顶" -"点）距离的节点。" +"使用 Prim 算法，从计算出最小生成树中提取出那些与根节点（或根节点组）之间的聚" +"合成本小于或等于某个距离的节点。" msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" @@ -14845,9 +14838,6 @@ msgstr "" "``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到" "目标的流量。" -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "``pgr_pushRelabel`` (`组合`_)" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "由 ``pgr_maxFlowPushRelabel`` 重命名" @@ -14866,17 +14856,14 @@ msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgid "pgr_sequentialVertexColoring - Proposed" -msgstr "pgr_sequentialVertexColoring - 拟议" +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "``pgr_sequentialVertexColoring`` - 拟议" msgid "" "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " "undirected graph, using greedy approach." msgstr "``pgr_sequentialVertexColoring`` — 使用贪婪方法返回无向图的顶点着色。" -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 " @@ -14923,8 +14910,16 @@ msgstr ":math:`k` 是使用的颜色数量。" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgid "pgr_stoerWagner - Experimental" -msgstr "pgr_stoerWagner - 实验" +#, fuzzy +msgid "" +"`Boost: Sequential Vertex Coloring `__" +msgstr "" +"`Boost：顺序顶点着色算法文档 `__" + +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - 实验" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "``pgr_stoerWagner`` — 使用 stoerWagner 算法对图进行最小分割。" @@ -15017,6 +15012,14 @@ msgstr "边的最小割" msgid "Using :doc:`pgr_connectedComponents`" msgstr "使用 :doc:`pgr_connectedComponents`" +#, fuzzy +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" +"Boost: `强大组件 `__" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -15047,8 +15050,9 @@ msgstr "pgr_strongComponents(`Edges SQL`_)" msgid "The strong components of the graph" msgstr "图的重要组成部分" +#, fuzzy msgid "" -"Boost: `Strong components `__" msgstr "" "Boost: `强大组件 `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - 实验" @@ -15176,58 +15188,55 @@ msgstr "边目标的标识符" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "从顶点 v 可到达的顶点的标识符。" +#, fuzzy +msgid "" +"`Boost: transitive closure `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "pgr_trsp - Proposed" -msgstr "pgr_trsp - 拟议" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "``pgr_trsp`` -有限制的路由顶点。" -msgid "New proposed signatures" -msgstr "新拟议的签名" - -msgid "``pgr_trsp`` (`One to One`_)" -msgstr "``pgr_trsp`` (`一对一`_)" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp （一对一）" -msgid "``pgr_trsp`` (`One to Many`_)" -msgstr "``pgr_trsp`` (`一对多`_)" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp （一对多）" -msgid "``pgr_trsp`` (`Many to One`_)" -msgstr "``pgr_trsp`` (`多对一`_)" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp （多对一）" -msgid "``pgr_trsp`` (`Many to Many`_)" -msgstr "``pgr_trsp`` (`多对多`_)" +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp （多对多）" -msgid "``pgr_trsp`` (`Combinations`_)" -msgstr "``pgr_trsp`` (`组合`_)" +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp （组合）" msgid "Deprecated signatures" msgstr "弃用签名" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" - -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" -msgstr "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" - -msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" -msgstr "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgid "New prototypes" msgstr "新原型" -msgid "``pgr_trspViaVertices``" -msgstr "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "``pgr_trspViaEdges``" -msgstr "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" msgid "" "Turn restricted shortest path (TRSP) is an algorithm that receives turn " @@ -15311,19 +15320,13 @@ msgid "" "`Deprecated documentation `_" msgstr "` 已弃用文档 `_" -msgid "``pgr_trspVia`` - Proposed" -msgstr "``pgr_trspVia`` - 拟议" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "``pgr_trspVia`` 穿过有限制的顶点列表的路线。" -msgid "New proposed function:" -msgstr "新提议的函数：" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "``pgr_trspVia`` (`One Via`_)" - 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 :" @@ -15416,17 +15419,14 @@ msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints`` - Proposed" -msgstr "``pgr_trspVia_withPoints`` - 拟议" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" msgid "" "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" "or points with restrictions." msgstr "``pgr_trspVia_withPoints`` - 经过一系列具有限制的顶点和/或点的路线。" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "``pgr_trspVia_withPoints`` (`One Via`_)" - 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 " @@ -15610,35 +15610,17 @@ msgstr "" "`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结" "果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" -msgid "pgr_trsp_withPoints - Proposed" -msgstr "pgr_trsp_withPoints - 拟议" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" -msgid "New proposed signatures:" -msgstr "新拟议的签名：" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "``pgr_trsp_withPoints`` (`一对一`_)" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "``pgr_trsp_withPoints`` (`一对多`_)" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "``pgr_trsp_withPoints`` (`多对一`_)" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "``pgr_trsp_withPoints`` (`多对多`_)" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "``pgr_trsp_withPoints`` (`组合`_)" - -#, fuzzy msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" -msgstr "修改图以包括由points_sql 定义的点。 使用 Dijkstra 算法，找到最短路径" +msgstr "" +"修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" msgid "Characteristics:" msgstr "特征：" @@ -15759,17 +15741,15 @@ msgstr "" "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细" "信息。" -msgid "pgr_turnRestrictedPath - Experimental" -msgstr "pgr_turnRestrictedPath - 实验性" +msgid "``pgr_turnRestrictedPath`` - Experimental" +msgstr "``pgr_turnRestrictedPath`` - 实验性" +#, fuzzy msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex -Vertex routing with " -"restrictions" +"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " +"with restrictions" msgstr "``pgr_turnRestrictedPath`` 使用 Yen 算法顶点- 带限制的顶点路由" -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" @@ -15843,8 +15823,8 @@ msgstr "pgr_version()" msgid "pgRouting Version for this documentation" msgstr "本文档的 pgRouting 版本" -msgid "pgr_vrpOneDepot - Experimental" -msgstr "pgr_vrpOneDepot -实验" +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - 实验" msgid "**No documentation available**" msgstr "**无可用文档**" @@ -15852,8 +15832,8 @@ msgstr "**无可用文档**" msgid "**TBD**" msgstr "**TBD**" -msgid "``pgr_withPoints`` - Proposed" -msgstr "``pgr_withPoints`` -拟议" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -16011,28 +15991,25 @@ msgstr "对于点 :math:`6` 和顶点 :math:`11`。" msgid "Passes in front or visits with left side driving." msgstr "从前方超车或以左侧驾驶方式行驶。" -msgid "``pgr_withPointsCost`` - Proposed" -msgstr "``pgr_withPointsCost`` -拟议" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" -#, fuzzy msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " "aggregate cost of the shortest path found, for the combination of points " "given." msgstr "" -"``pgr_withPointsCost`` -对于给定的点组合，计算最短路径并仅返回找到的最短路径" -"的总成本。" +"``pgr_withPointsCost`` - 计算最短路径，并只返回所给点组合的最短路径的总成本。" msgid "pgr_withPointsCost(Combinations)" msgstr "pgr_withPointsCost（组合）" -#, fuzzy msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, return only the aggregate cost of the shortest path found." msgstr "" -"修改图以包括由points_sql 定义的点。 使用 Dijkstra 算法，仅返回找到的最短路径" -"的总成本。" +"修改图形以包含由 points_sql 定义的点。使用 Dijkstra 算法，只返回找到的最短路" +"径的总成本。" msgid "" "Returns the sum of the costs of the shortest path for pair combination of " @@ -16182,8 +16159,8 @@ msgstr "左侧驾驶拓扑" msgid "Does not matter driving side driving topology" msgstr "与驱动端驱动拓扑无关" -msgid "``pgr_withPointsCostMatrix`` - proposed" -msgstr "``pgr_withPointsCostMatrix`` - 拟议" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -16219,8 +16196,8 @@ msgid "" msgstr "" "求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" -msgid "``pgr_withPointsDD`` - Proposed" -msgstr "``pgr_withPointsDD`` - 拟议" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -16234,8 +16211,11 @@ msgstr "" "签名更改： ``driving_side`` 参数从已命名的可选参数改为未命名的必选参数 " "**driving side**。" -msgid "``pgr_withPointsDD`` (`Single vertex`)" -msgstr "``pgr_withPointsDD`` （`单顶点`）" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "pgr_withPointsDD （单顶点）" + +msgid "pgr_withPointsDD(Multiple vertices)" +msgstr "pgr_withPointsDD（多顶点）" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." msgstr "添加了 ``depth``、``pred`` 和 ``start_vid`` 列。" @@ -16243,9 +16223,8 @@ msgstr "添加了 ``depth``、``pred`` 和 ``start_vid`` 列。" msgid "Added ``depth``, ``pred`` columns." msgstr "添加了 ``depth``，``pred`` 列。" -#, fuzzy msgid "When ``details`` is ``false``:" -msgstr "当 ``details`` 为``false`` 时：" +msgstr "当 ``details`` 为 ``false`` 时：" msgid "" "Only points that are visited are removed, that is, points reached within the " @@ -16255,18 +16234,16 @@ msgstr "" "被包含在内" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgid "" "Modify the graph to include points and using Dijkstra algorithm, extracts " @@ -16384,11 +16361,8 @@ msgstr "" "从点 :math:`1` 开始，在距离不超过 :math:`3.3` 的范围内，无论驾驶方向如何，提" "供详细信息。" -msgid ":doc:`pgr_alphaShape`" -msgstr ":doc:`pgr_alphaShape`" - -msgid "pgr_withPointsKSP - Proposed" -msgstr "pgr_withPointsKSP -拟议" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -16397,29 +16371,26 @@ msgstr "``pgr_withPointsKSP`` — Yen 使用 Dijkstra 计算 K 最短路径的 msgid "Standarizing output columns to |nksp-result|" msgstr "标准化输出列为 |nksp-result|" -msgid "``pgr_withPointsKSP`` (One to One)" -msgstr "``pgr_withPointsKSP`` (一对一)" - -msgid "New overload functions" -msgstr "新的重载函数" +msgid "pgr_withPointsKSP(One to One)" +msgstr "pgr_withPointsKSP(一对一)" -msgid "``pgr_withPointsKSP`` (One to Many)" -msgstr "``pgr_withPointsKSP`` (一对多)" +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP (一对多)" -msgid "``pgr_withPointsKSP`` (Many to One)" -msgstr "``pgr_withPointsKSP`` (多对一)" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(多对一)" -msgid "``pgr_withPointsKSP`` (Many to Many)" -msgstr "``pgr_withPointsKSP`` (多对多)" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(多对多)" -msgid "``pgr_withPointsKSP`` (Combinations)" -msgstr "``pgr_withPointsKSP`` (组合)" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP（组合）" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgid "" @@ -16540,257 +16511,528 @@ msgid "Left driving side" msgstr "左驾驶侧" msgid "" -"Get :math:`2` paths using left side driving topology, from point :math:`1` " -"to point :math:`3` with details." +"Get :math:`2` paths using left side driving topology, from point :math:`1` " +"to point :math:`3` with details." +msgstr "" +"使用左侧驾驶拓扑，从点 :math:`1` 到点 :math:`3` 获取 :math:`2` 条路径，并包含" +"详细信息。" + +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." +msgstr "" +"使用右侧驾驶拓扑，从点 :math:`1` 到点 :math:`2` 获取 :math:`2` 条路径，同时使" +"用堆路径（heap paths）并包含详细信息。" + +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" + +msgid "" +"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " +"points." +msgstr "``pgr_withPointsVia`` - 经过一系列顶点和/或点的路线。" + +msgid "" +"Given a graph, a set of points on the graphs edges and a list of vertices, " +"this function is equivalent to finding the shortest path between :math:" +"`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or " +"a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "" +"给定一个图、图上边缘的一组点以及一个顶点列表，此函数相当于找到 :math:" +"`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是" +"一个顶点或图上的一个点），对于所有的 :math:`i`，满足 :math:`i < " +"size\\_of(via\\;vertices)`。" + +msgid "" +"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " +"[**options**])" +msgstr "" +"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " +"[**options**])" + +msgid "" +"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " +"order on a **directed** graph." +msgstr "在 **有向** 图上按顺序访问顶点 :math:`\\{ -6, 15, -1\\}` 的路线。" + +msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" +msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 函数" + +msgid "" +"All this examples are about the route that visits the vertices :math:`\\{-1, " +"7, -3, 16, 15\\}` in that order on a **directed** graph." +msgstr "" +"所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{-1, 7, -3, 16, " +"15\\}` 的路线。" + +msgid "Prim - Family of functions" +msgstr "Prim - 函数族" + +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 "" +"prim 算法由捷克数学家 Vojtěch Jarník 于 1930 年开发。 它是一种贪心算法，为带" +"权无向图找到最小生成树。 这意味着它找到形成包含每个顶点的树的边的子集，其中树" +"中所有边的总权重最小化。 该算法的运行方式是从任意起始顶点一次构建一个顶点，在" +"每一步添加从树到另一个顶点的最便宜的可能连接。" + +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 "" +"该算法在可能不连通的图中找到最小生成森林； 相反，Prim 算法的最基本形式只能在" +"连通图中找到最小生成树。 然而，对图的每个连通分量分别运行Prim算法，则称为最小" +"生成森林。" + +msgid "" +"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " +"produce correct results on graphs with parallel edges.\"" +msgstr "" +"来自 boost Graph：“Boost.Graph 中实现的算法不会在具有平行边的图上产生正确的结" +"果。”" + +msgid "" +"Boost: `Prim's algorithm `__" +msgstr "" +"Boost: `Prim算法 `__" + +msgid "" +"Wikipedia: `Prim's algorithm `__" +msgstr "" +"维基百科: `Prim算法 `__" + +msgid "Proposed Functions" +msgstr "拟议的功能" + +msgid ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph." +msgstr ":doc:`pgr_withPoints` - 从/到图表上任意点的路线。" + +msgid ":doc:`pgr_withPointsCost` - Costs of the shortest paths." +msgstr ":doc:`pgr_withPointsCost` - 最短路径的成本。" + +msgid ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths." +msgstr ":doc:`pgr_withPointsCostMatrix` - 最短路径的成本。" + +msgid ":doc:`pgr_withPointsKSP` - K shortest paths." +msgstr ":doc:`pgr_withPointsKSP` -K 最短路径。" + +msgid ":doc:`pgr_withPointsDD` - Driving distance." +msgstr ":doc:`pgr_withPointsDD` -行驶距离。" + +msgid ":doc:`pgr_withPointsVia` - Via routing" +msgstr ":doc:`pgr_withPointsVia` - 通过路由" + +msgid "" +":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - 用于生成折线图的转换算法。" + +msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." +msgstr ":doc:`withPoints-family` -基于 Dijkstra 算法的函数。" + +msgid "From the :doc:`TRSP-family`:" +msgstr "来自 :doc:`TRSP-family`:" + +msgid "Reference" +msgstr "参考" + +msgid "Release Notes" +msgstr "发行说明" + +msgid "" +"To see the full list of changes check the list of `Git commits `_ on Github." +msgstr "" +"要查看完整的更改列表，请检查 Github 上的 `Git提交列表 `_。" + +msgid "Mayors" +msgstr "主要版本" + +msgid "pgRouting 4" +msgstr "pgRouting 4" + +msgid "Minors 4.x" +msgstr "Minors 4.x" + +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" + +msgid "pgRouting 3" +msgstr "pgRouting 3" + +msgid "Minors 3.x" +msgstr "3.x小版本" + +#, fuzzy +msgid "pgRouting 3.8" +msgstr "pgRouting 3.7" + +#, fuzzy +msgid "pgRouting 3.8.0 Release Notes" +msgstr "pgRouting 3.7.0 发布说明" + +#, fuzzy +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.8.0 `__" +msgstr "" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.7.0版本里程碑关闭列" +"表 >`__" + +#, fuzzy +msgid "Promotion to official function of pgRouting." +msgstr "pgRouting 中的拟议已升级为正式版本" + +#, fuzzy +msgid "" +"`#2772 `__: " +"pgr_extractVertices" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" + +#, fuzzy +msgid "" +"`#2760 `__: pgr_degree" +msgstr "" +"`#2266 `__：错误处理限制" + +#, fuzzy +msgid "" +"`#2774 `__: " +"pgr_findCloseEdges" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" + +#, fuzzy +msgid "Deprecation of functions." +msgstr "已废弃的函数" + +#, fuzzy +msgid "" +"`#2749 `__: " +"pgr_alphaShape" +msgstr "" +"`#2266 `__：错误处理限制" + +#, fuzzy +msgid "" +"`#2754 `__: " +"pgr_analyzeOneWay" +msgstr "" +"`#2266 `__：错误处理限制" + +#, fuzzy +msgid "" +"`#2753 `__: " +"pgr_analyzeGraph" +msgstr "" +"`#2266 `__：错误处理限制" + +#, fuzzy +msgid "" +"`#2750 `__: " +"pgr_createTopology" +msgstr "" +"`#2266 `__：错误处理限制" + +#, fuzzy +msgid "" +"`#2826 `__: " +"pgr_createVerticesTable" msgstr "" -"使用左侧驾驶拓扑，从点 :math:`1` 到点 :math:`3` 获取 :math:`2` 条路径，并包含" -"详细信息。" +"`#2087 `__:拟议的 " +"pgr_extractVertices" -msgid "Right driving side" -msgstr "右驾驶侧" +msgid "Official functions changes" +msgstr "官方功能变更" +#, fuzzy msgid "" -"Get :math:`2` paths using right side driving topology from, point :math:`1` " -"to point :math:`2` with heap paths and details." +"`#2786 `__: " +"pgr_contraction" msgstr "" -"使用右侧驾驶拓扑，从点 :math:`1` 到点 :math:`2` 获取 :math:`2` 条路径，同时使" -"用堆路径（heap paths）并包含详细信息。" +"`#2266 `__：错误处理限制" -msgid "``pgr_withPointsVia`` - Proposed" -msgstr "``pgr_withPointsVia`` - 拟议" +msgid "New proposed functions" +msgstr "新的拟议函数" -msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " -"points." -msgstr "``pgr_withPointsVia`` - 经过一系列顶点和/或点的路线。" +#, fuzzy +msgid "Contraction" +msgstr "收缩：" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "新 **拟议** 的函数 ``pgr_withPointsVia`` (`One Via`_)" +#, fuzzy +msgid "" +"`#2790 `__: " +"pgr_contractionDeadEnd" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" +#, fuzzy 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)`." +"`#2791 `__: " +"pgr_contractionLinear" msgstr "" -"给定一个图、图上边缘的一组点以及一个顶点列表，此函数相当于找到 :math:" -"`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是" -"一个顶点或图上的一个点），对于所有的 :math:`i`，满足 :math:`i < " -"size\\_of(via\\;vertices)`。" +"`#1002 `__：修复收缩问" +"题：" +msgid "pgRouting 3.7" +msgstr "pgRouting 3.7" + +msgid "pgRouting 3.7.3 Release Notes" +msgstr "pgRouting 3.7.3 发布说明" + +#, fuzzy msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " -"[**options**])" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.3 `__" msgstr "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " -"[**options**])" +"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.1 " +"`__" +#, fuzzy msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order on a **directed** graph." -msgstr "在 **有向** 图上按顺序访问顶点 :math:`\\{ -6, 15, -1\\}` 的路线。" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" +"`#2607 `__ 在 C++ 上读取 " +"postgresql 数据" -msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" -msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 函数" +msgid "pgRouting 3.7.2 Release Notes" +msgstr "pgRouting 3.7.2 发布说明" 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." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.2 `__" msgstr "" -"所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{-1, 7, -3, 16, " -"15\\}` 的路线。" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.7.2版本里程碑关闭列" +"表 `__" -msgid "Prim - Family of functions" -msgstr "Prim - 函数族" +msgid "Build" +msgstr "构建" +#, fuzzy 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." +"`#2713 `__ cmake missing " +"some policies and min version" msgstr "" -"prim 算法由捷克数学家 Vojtěch Jarník 于 1930 年开发。 它是一种贪心算法，为带" -"权无向图找到最小生成树。 这意味着它找到形成包含每个顶点的树的边的子集，其中树" -"中所有边的总权重最小化。 该算法的运行方式是从任意起始顶点一次构建一个顶点，在" -"每一步添加从树到另一个顶点的最便宜的可能连接。" +"`#2517 `__ Astar 代码简化。" -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." +msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" msgstr "" -"该算法在可能不连通的图中找到最小生成森林； 相反，Prim 算法的最基本形式只能在" -"连通图中找到最小生成树。 然而，对图的每个连通分量分别运行Prim算法，则称为最小" -"生成森林。" -msgid "" -"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " -"produce correct results on graphs with parallel edges.\"" +msgid "Minimum cmake version 3.12" msgstr "" -"来自 boost Graph：“Boost.Graph 中实现的算法不会在具有平行边的图上产生正确的结" -"果。”" +#, fuzzy msgid "" -"Boost: `Prim's algorithm `__" +"`#2707 `__ Build failure " +"in pgRouting 3.7.1 on Alpine" msgstr "" -"Boost: `Prim算法 `__" +"`#2607 `__ 在 C++ 上读取 " +"postgresql 数据" +#, fuzzy msgid "" -"Wikipedia: `Prim's algorithm `__" +"`#2706 `__ winnie crashing " +"on pgr_betweennessCentrality" msgstr "" -"维基百科: `Prim算法 `__" - -msgid "Proposed Functions" -msgstr "拟议的功能" +"`#2505 `__ 使用命名空间。" -msgid ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph." -msgstr ":doc:`pgr_withPoints` - 从/到图表上任意点的路线。" +msgid "pgRouting 3.7.1 Release Notes" +msgstr "pgRouting 3.7.1 发布说明" -msgid ":doc:`pgr_withPointsCost` - Costs of the shortest paths." -msgstr ":doc:`pgr_withPointsCost` - 最短路径的成本。" +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.1 `__" +msgstr "" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub " +"3.7.1版本里程碑关闭列表 `__" -msgid ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths." -msgstr ":doc:`pgr_withPointsCostMatrix` - 最短路径的成本。" +msgid "" +"`#2680 `__ fails to " +"compile under mingw64 gcc 13.2" +msgstr "" +"`#2680 `__ 在 mingw64 gcc " +"13.2 下编译失败" -msgid ":doc:`pgr_withPointsKSP` - K shortest paths." -msgstr ":doc:`pgr_withPointsKSP` -K 最短路径。" +msgid "" +"`#2689 `__ When point is a " +"vertex, the withPoints family do not return results." +msgstr "" +"`#2689 `__ 当 point 是顶点" +"时，withPoints 系列不返回结果。" -msgid ":doc:`pgr_withPointsDD` - Driving distance." -msgstr ":doc:`pgr_withPointsDD` -行驶距离。" +#, fuzzy +msgid "C/C++ code enhancemet" +msgstr "C/C++ 代码增强" -msgid ":doc:`pgr_withPointsVia` - Via routing" -msgstr ":doc:`pgr_withPointsVia` - 通过路由" +#, fuzzy +msgid "TRSP family" +msgstr "Prim族" -msgid "These proposed functions do not modify the database." -msgstr "这些拟议的功能不会修改数据库。" +msgid "pgRouting 3.7.0 Release Notes" +msgstr "pgRouting 3.7.0 发布说明" msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incidet edges to the vertex." -msgstr ":doc:`pgr_degree` -返回一组顶点以及该顶点对应的关联边数。" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.0 `__" +msgstr "" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.7.0版本里程碑关闭列" +"表 `__" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." -msgstr ":doc:`pgr_extractVertices` - 根据边表信息提取顶点信息。" +msgid "Support" +msgstr "支持" msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr ":doc:`pgr_lineGraph` - 用于生成折线图的转换算法。" - -msgid ":doc:`pgr_withPointsVia`" -msgstr ":doc:`pgr_withPointsVia`" +"`#2656 `__ Stop support of " +"PostgreSQL12 on pgrouting v3.7" +msgstr "" +"`#2656 `__ 在 pgrouting " +"v3.7 上停止支持 PostgreSQL12" -msgid ":doc:`pgr_trspVia`" -msgstr ":doc:`pgr_trspVia`" +msgid "Stopping support of PostgreSQL 12" +msgstr "停止支持 PostgreSQL 12" -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr ":doc:`pgr_trspVia_withPoints`" +msgid "CI does not test for PostgreSQL 12" +msgstr "CI 不测试 PostgreSQL 12" -msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." -msgstr ":doc:`withPoints-family` -基于 Dijkstra 算法的函数。" +msgid "New experimental functions" +msgstr "新的实验函数" -msgid "From the :doc:`TRSP-family`:" -msgstr "来自 :doc:`TRSP-family`:" +msgid "Metrics" +msgstr "Metrics" -msgid "Utilities" -msgstr "实用程序" +msgid "pgr_betweennessCentrality" +msgstr "pgr_betweennessCentrality" -msgid ":doc:`pgr_findCloseEdges`" -msgstr ":doc:`pgr_findCloseEdges`" +#, fuzzy +msgid "" +"`#2605 `__ Standardize " +"spanning tree functions output" +msgstr "" +"`#2605 `__ 将生成树函数输出" +"标准化" -msgid "Reference" -msgstr "参考" +msgid "Functions:" +msgstr "新函数:" -msgid "Release Notes" -msgstr "发行说明" +msgid "Experimental promoted to proposed." +msgstr "实验提升为拟议。" msgid "" -"To see the full list of changes check the list of `Git commits `_ on Github." +"`#2635 `__ pgr_LineGraph " +"ignores directed flag and use negative values for identifiers." msgstr "" -"要查看完整的更改列表，请检查 Github 上的 `Git提交列表 `_。" +"`#2635 `__ pgr_LineGraph 忽" +"略了有向标志，并使用负值作为标识符。" -msgid "Mayors" -msgstr "主要版本" +msgid "``pgr_lineGraph``" +msgstr "``pgr_lineGraph``" -msgid "pgRouting 3" -msgstr "pgRouting 3" +msgid "Code enhancement" +msgstr "代码改进" -msgid "Minors 3.x" -msgstr "3.x小版本" +msgid "" +"`#2599 `__ Driving " +"distance cleanup" +msgstr "" +"`#2599 `__ 行车距离清理" -msgid "pgRouting 3.7" -msgstr "pgRouting 3.7" +msgid "" +"`#2607 `__ Read postgresql " +"data on C++" +msgstr "" +"`#2607 `__ 在 C++ 上读取 " +"postgresql 数据" + +msgid "" +"`#2614 `__ Clang tidy does " +"not work" +msgstr "" +"`#2614 `__ Clang tidy 不工" +"作" msgid "pgRouting 3.6" msgstr "pgRouting 3.6" -#, fuzzy msgid "pgRouting 3.6.3 Release Notes" -msgstr "pgRouting 3.6.1 发布说明" +msgstr "pgRouting 3.6.3 发布说明" -#, fuzzy msgid "" "To see all issues & pull requests closed by this release see the `Git closed " "milestone for 3.6.3 `__" msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.6.1Git 关闭里程碑 `_" - -msgid "Build" -msgstr "构建" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.6.3版本里程碑关闭列" +"表 `__" msgid "Explicit minimum requirements:" -msgstr "" +msgstr "最低要求：" msgid "postgres 11.0.0" -msgstr "" +msgstr "postgres 11.0.0" -#, fuzzy msgid "postgis 3.0.0" -msgstr "版本3.0.0" +msgstr "postgis 3.0.0" msgid "g++ 13+ is supported" -msgstr "" +msgstr "支持 g++ 13+" msgid "Code fixes" msgstr "代码修正" msgid "Fix warnings from cpplint." -msgstr "" +msgstr "修复来自 cpplint 的警告。" msgid "Fix warnings from clang 18." -msgstr "" +msgstr "修复来自 clang 18 的警告。" -#, fuzzy msgid "CI tests" -msgstr "pgtap 测试" +msgstr "CI tests" msgid "Add a clang tidy test on changed files." -msgstr "" +msgstr "为已更改的文件添加 clang tidy 测试。" msgid "" "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, " "3.1.2" msgstr "" +"未对以下版本进行更新测试3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" msgid "Documentation" msgstr "文档" msgid "Results of documentation queries adujsted to boost 1.83.0 version:" -msgstr "" +msgstr "根据 boost 1.83.0 版本进行的文档查询结果：" msgid "pgr_edgeDisjointPaths" msgstr "pgr_edgeDisjointPaths" @@ -16801,32 +17043,29 @@ msgstr "pgr_stoerWagner" msgid "pgtap tests" msgstr "pgtap 测试" -#, fuzzy msgid "bug fixes" -msgstr "Bug修复" +msgstr "bug fixes" -#, fuzzy msgid "pgRouting 3.6.2 Release Notes" -msgstr "pgRouting 3.6.1 发布说明" +msgstr "pgRouting 3.6.2 发布说明" -#, fuzzy msgid "" "To see all issues & pull requests closed by this release see the `Git closed " "milestone for 3.6.2 `__" msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.6.1Git 关闭里程碑 `_" +"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.6.2 " +"`__" msgid "Upgrade fix" -msgstr "" +msgstr "升级修复" msgid "The upgrade was failing for same minor" -msgstr "" +msgstr "升级失败的主要原因是" msgid "Fix warnings from cpplint" -msgstr "" +msgstr "修复来自 cpplint 的警告" msgid "Others" msgstr "其他" @@ -16868,50 +17107,38 @@ msgstr "" "拉取请求 `_" +#, fuzzy msgid "" -"`#2516 `__ Standarize " +"`#2516 `__ Standardize " "output pgr_aStar" msgstr "" "`#2516 `__ 标准化输出" "pgr_aStar" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_aStar`` （`一对一`）增加了 ``start_vid`` 和 ``end_vid`` 列。" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_aStar``（`一对多`）添加了 ``end_vid`` 列。" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_aStar``（`多对一`）添加了 ``start_vid`` 列。" +#, fuzzy +msgid "Standardize output columns to |short-generic-result|" +msgstr "标准输出列|short-generic-result|" +#, fuzzy msgid "" -"`#2523 `__ Standarize " +"`#2523 `__ Standardize " "output pgr_bdAstar" msgstr "" "`#2523 `__ 标准化输出 " "pgr_bdAstar" +#, fuzzy msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_bdAstar``（`一对一`）增加了 ``start_vid`` 和``end_vid`` 列。" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_bdAstar``（`一对多）添加了``end_vid`` 列。" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_bdAstar``（`多对一`）添加了``start_vid`` 列。" - -msgid "" -"`#2547 `__ Standarize " +"`#2547 `__ Standardize " "output and modifying signature pgr_KSP" msgstr "" "`#2547 `__ 标准化输出并修改" "签名 pgr_KSP" +#, fuzzy msgid "" -"`#2548 `__ Standarize " -"output pgr_drivingdistance" +"`#2548 `__ Standardize " +"output pgr_drivingDistance" msgstr "" "`#2548 `__ 标准化输出 " "pgr_drivingdistance" @@ -16919,15 +17146,17 @@ msgstr "" msgid "Proposed functions changes" msgstr "拟议函数改变" +#, fuzzy msgid "" -"`#2544 `__ Standarize " +"`#2544 `__ Standardize " "output and modifying signature pgr_withPointsDD" msgstr "" "`#2544 `__ 标准化输出并修改" "签名 pgr_withPointsDD" +#, fuzzy msgid "" -"`#2546 `__ Standarize " +"`#2546 `__ Standardize " "output and modifying signature pgr_withPointsKSP" msgstr "" "`#2546 `__ 标准化输出并修改" @@ -16985,11 +17214,13 @@ msgstr "" "`#2490 `__ 自动页面历史链" "接。" -msgid "..rubric:: SQL standarization" +#, fuzzy +msgid "..rubric:: Standardize SQL" msgstr "..rubric::SQL 标准化" +#, fuzzy msgid "" -"`#2555 `__ standarize " +"`#2555 `__ Standardize " "deprecated messages" msgstr "" "`#2555 `__ 标准化已弃用的消" @@ -17040,7 +17271,7 @@ msgstr "问题修复" msgid "" "`#2565 `__ " -"pgr_pgr_lengauerTarjanDominatorTree triggers an assertion" +"pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" "`#2565 `__ " "pgr_pgr_lengauerTarjanDominatorTree 触发了一个断言" @@ -17089,16 +17320,6 @@ msgstr "" msgid "Dijkstra" msgstr "Dijkstra" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_dijkstra``（`一对一`）增加了``start_vid`` 和``end_vid`` 列。" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_dijkstra``（`一对多`）添加了 ``end_vid`` 列。" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_dijkstra`` （`多对一`）添加了 ``start_vid`` 列。" - msgid "pgRouting 3.4" msgstr "pgRouting 3.4" @@ -17174,14 +17395,15 @@ msgstr "" "`#1891 `__: pgr_ksp 没有" "给出所有正确的最短路径" -msgid "New proposed functions" -msgstr "新的拟议函数" +msgid "New proposed functions." +msgstr "新的拟议函数。" msgid "With points" msgstr "带点" -msgid "``pgr_withPointsVia`` (One Via)" -msgstr "``pgr_withPointsVia`` (One Via)" +#, fuzzy +msgid "pgr_withPointsVia(One Via)" +msgstr "pgr_withPointsVia (One Via)" msgid "Turn Restrictions" msgstr "转弯限制" @@ -17189,83 +17411,70 @@ msgstr "转弯限制" msgid "Via with turn restrictions" msgstr "有转弯限制的通道" -msgid "``pgr_trspVia`` (One Via)" -msgstr "``pgr_trspVia`` (One Via)" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "pgr_trspVia_withPoints``（一次通过）" - -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" - -msgid "``pgr_trsp`` (One to One)" -msgstr "``pgr_trsp`` （一对一）" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "``pgr_trsp`` （一对多）" - -msgid "``pgr_trsp`` (Many to One)" -msgstr "``pgr_trsp`` （多对一）" - -msgid "``pgr_trsp`` (Many to Many)" -msgstr "``pgr_trsp`` （多对多）" - -msgid "``pgr_trsp`` (Combinations)" -msgstr "``pgr_trsp`` （组合）" +#, fuzzy +msgid "pgr_trspVia(One Via)" +msgstr "pgr_trspVia(One Via)" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "pgr_trspVia_withPoints(One Via)" +msgstr "pgr_trspVia_withPoints（一次通过）" -msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "``pgr_trsp_withPoints`` （一对一）" +msgid "pgr_trsp_withPoints(One to One)" +msgstr "pgr_trsp_withPoints（一对一）" -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "``pgr_trsp_withPoints`` （一对多）" +msgid "pgr_trsp_withPoints(One to Many)" +msgstr "pgr_trsp_withPoints（一对多）" -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "pgr_trsp_withPoints``（多对一）" +msgid "pgr_trsp_withPoints(Many to One)" +msgstr "pgr_trsp_withPoints（多对一）" -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "``pgr_trsp_withPoints`` （多对多）" +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr "pgr_trsp_withPoints（多对多）" -msgid "``pgr_trsp_withPoints`` (Combinations)" -msgstr "``pgr_trsp_withPoints`` （组合）" +msgid "pgr_trsp_withPoints(Combinations)" +msgstr "pgr_trsp_withPoints（组合）" msgid "Topology" msgstr "拓扑结构" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" +msgid "Utilities" +msgstr "实用程序" -msgid "``pgr_findCloseEdges`` (One point)" -msgstr "``pgr_findCloseEdges`` （单点）" +msgid "pgr_findCloseEdges(One point)" +msgstr "pgr_findCloseEdges（单点）" -msgid "``pgr_findCloseEdges`` (Many points)" -msgstr "``pgr_findCloseEdges`` （多点）" +msgid "pgr_findCloseEdges(Many points)" +msgstr "pgr_findCloseEdges（多点）" msgid "Ordering" msgstr "排序" -msgid "``pgr_cuthillMckeeOrdering``" -msgstr "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" +msgstr "pgr_cuthillMckeeOrdering" + +msgid "Unclassified" +msgstr "未分类" + +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" msgid "Flow functions" msgstr "流程函数" -msgid "``pgr_maxCardinalityMatch(text)``" -msgstr "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" +msgstr "pgr_maxCardinalityMatch(text)" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +#, fuzzy +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "弃用 ``pgr_maxCardinalityMatch(text,boolean)``" msgid "Deprecated Functions" msgstr "已废弃的函数" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" -msgstr "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" +msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgid "pgRouting 3.3" msgstr "pgRouting 3.3" @@ -17579,12 +17788,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "删除对 Boost v1.53、v1.54 和 v1.55 的支持" -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(组合)" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(组合)" - msgid "pgr_bipartite" msgstr "pgr_bipartite" @@ -17594,9 +17797,6 @@ msgstr "pgr_depthFirstSearch" msgid "Dijkstra Near" msgstr "Dijkstra Near" -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(组合)" - msgid "pgr_isPlanar" msgstr "pgr_isPlanar" @@ -17606,51 +17806,15 @@ msgstr "pgr_lengauerTarjanDominatorTree" msgid "pgr_makeConnected" msgstr "pgr_makeConnected" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(组合)" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(组合)" - msgid "Astar" msgstr "Astar" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(组合)" - -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(组合)" - msgid "Bidirectional Astar" msgstr "双向Astar" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(组合)" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(组合)" - msgid "Bidirectional Dijkstra" msgstr "双向 Dijkstra" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(组合)" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(组合)" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov (组合)" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(组合)" - -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(组合)" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(组合)" - msgid "pgRouting 3.1" msgstr "pgRouting 3.1" @@ -17958,7 +18122,7 @@ msgid "" msgstr "" "`#1006 `__：无信息丢失" -msgid "New functions" +msgid "New Functions" msgstr "新函数" msgid "Kruskal family" @@ -17997,148 +18161,119 @@ msgstr "pgRouting 中的拟议已升级为正式版本" msgid "aStar Family" msgstr "aStar族" -msgid "pgr_aStar(one to many)" -msgstr "pgr_aStar（一对多）" - -msgid "pgr_aStar(many to one)" -msgstr "pgr_aStar（多对一）" - -msgid "pgr_aStar(many to many)" -msgstr "pgr_aStar（多对多）" - -msgid "pgr_aStarCost(one to one)" +#, fuzzy +msgid "pgr_aStarCost(One to One)" msgstr "pgr_aStarCost(一对一)" -msgid "pgr_aStarCost(one to many)" +#, fuzzy +msgid "pgr_aStarCost(One to Many)" msgstr "pgr_aStarCost(一对多)" -msgid "pgr_aStarCost(many to one)" +#, fuzzy +msgid "pgr_aStarCost(Many to One)" msgstr "pgr_aStarCost(多对一)" -msgid "pgr_aStarCost(many to many)" +#, fuzzy +msgid "pgr_aStarCost(Many to Many)" msgstr "pgr_aStarCost（多对多）" -msgid "pgr_aStarCostMatrix(one to one)" -msgstr "pgr_aStarCostMatrix(一对一)" - -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "pgr_aStarCostMatrix (一对多)" - -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "pgr_aStarCostMatrix (多对一)" - -msgid "pgr_aStarCostMatrix(many to many)" -msgstr "pgr_aStarCostMatrix（多对多）" +#, fuzzy +msgid "pgr_aStarCostMatrix" +msgstr "pgr_astarCostMatrix" msgid "bdAstar Family" msgstr "bdAstar 族" -msgid "pgr_bdAstar(one to many)" -msgstr "pgr_bdAstar（一对多）" - -msgid "pgr_bdAstar(many to one)" -msgstr "pgr_bdAstar（多对一）" - -msgid "pgr_bdAstar(many to many)" -msgstr "pgr_bdAstar（多对多）" - -msgid "pgr_bdAstarCost(one to one)" +#, fuzzy +msgid "pgr_bdAstarCost(One to One)" msgstr "pgr_bdAstarCost(一对一)" -msgid "pgr_bdAstarCost(one to many)" +#, fuzzy +msgid "pgr_bdAstarCost(One to Many)" msgstr "pgr_bdAstarCost(一对多)" -msgid "pgr_bdAstarCost(many to one)" +#, fuzzy +msgid "pgr_bdAstarCost(Many to One)" msgstr "pgr_bdAstarCost （多对一）" -msgid "pgr_bdAstarCost(many to many)" +#, fuzzy +msgid "pgr_bdAstarCost(Many to Many)" msgstr "pgr_bdAstarCost (多对多)" -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "pgr_bdAstarCostMatrix(一对一)" - -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "pgr_bdAstarCostMatrix(一对多)" - -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "pgr_bdAstarCostMatrix （多对一）" - -msgid "pgr_bdAstarCostMatrix(many to many)" -msgstr "pgr_bdAstarCostMatrix （多对多）" +msgid "pgr_bdAstarCostMatrix" +msgstr "pgr_bdAstarCostMatrix" msgid "bdDijkstra Family" msgstr "bdDijkstra族" -msgid "pgr_bdDijkstra(one to many)" -msgstr "pgr_bdDijkstra（一对多）" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "pgr_bdDijkstra（多对一）" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "pgr_bdDijkstra（多对多）" - -msgid "pgr_bdDijkstraCost(one to one)" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to One)" msgstr "pgr_bdDijkstraCost (一对一)" -msgid "pgr_bdDijkstraCost(one to many)" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to Many)" msgstr "pgr_bdDijkstraCost(一对多)" -msgid "pgr_bdDijkstraCost(many to one)" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to One)" msgstr "pgr_bdDijkstraCost (多对一)" -msgid "pgr_bdDijkstraCost(many to many)" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to Many)" msgstr "pgr_bdDijkstraCost（多对多）" -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "pgr_bdDijkstraCostMatrix(一对一)" - -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "pgr_bdDijkstraCostMatrix(一对多)" - -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "pgr_bdDijkstraCostMatrix (多对一)" - -msgid "pgr_bdDijkstraCostMatrix(many to many)" -msgstr "pgr_bdDijkstraCostMatrix（多对多）" +msgid "pgr_bdDijkstraCostMatrix" +msgstr "pgr_bdDijkstraCostMatrix" msgid "Flow Family" msgstr "Flow族" -msgid "pgr_pushRelabel(one to one)" +#, fuzzy +msgid "pgr_pushRelabel(One to One)" msgstr "pgr_pushRelabel(一对一)" -msgid "pgr_pushRelabel(one to many)" +#, fuzzy +msgid "pgr_pushRelabel(One to Many)" msgstr "pgr_pushRelabel(一对多)" -msgid "pgr_pushRelabel(many to one)" +#, fuzzy +msgid "pgr_pushRelabel(Many to One)" msgstr "pgr_pushRelabel(多对一)" -msgid "pgr_pushRelabel(many to many)" +#, fuzzy +msgid "pgr_pushRelabel(Many to Many)" msgstr "pgr_pushRelabel(多对多)" -msgid "pgr_edmondsKarp(one to one)" +#, fuzzy +msgid "pgr_edmondsKarp(One to One)" msgstr "pgr_edmondsKarp（一对一）" -msgid "pgr_edmondsKarp(one to many)" +#, fuzzy +msgid "pgr_edmondsKarp(One to Many)" msgstr "pgr_edmondsKarp（一对多）" -msgid "pgr_edmondsKarp(many to one)" +#, fuzzy +msgid "pgr_edmondsKarp(Many to One)" msgstr "pgr_edmondsKarp（多对一）" -msgid "pgr_edmondsKarp(many to many)" +#, fuzzy +msgid "pgr_edmondsKarp(Many to Many)" msgstr "pgr_edmondsKarp（多对多）" -msgid "pgr_boykovKolmogorov (one to one)" +#, fuzzy +msgid "pgr_boykovKolmogorov (One to One)" msgstr "pgr_boykovKolmogorov (一对一)" -msgid "pgr_boykovKolmogorov (one to many)" +#, fuzzy +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "pgr_boykovKolmogorov (一对多)" -msgid "pgr_boykovKolmogorov (many to one)" +#, fuzzy +msgid "pgr_boykovKolmogorov (Many to One)" msgstr "pgr_boykovKolmogorov (多对一)" -msgid "pgr_boykovKolmogorov (many to many)" +#, fuzzy +msgid "pgr_boykovKolmogorov (Many to Many)" msgstr "pgr_boykovKolmogorov (多对多)" msgid "pgr_maxCardinalityMatching" @@ -18147,21 +18282,28 @@ msgstr "pgr_maxCardinalityMatching" msgid "pgr_maxFlow" msgstr "pgr_maxFlow" -msgid "pgr_edgeDisjointPaths(one to one)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "pgr_edgeDisjointPaths (一对一)" -msgid "pgr_edgeDisjointPaths(one to many)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "pgr_edgeDisjointPaths （一对多）" -msgid "pgr_edgeDisjointPaths(many to one)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to One)" msgstr "pgr_edgeDisjointPaths (多对一)" -msgid "pgr_edgeDisjointPaths(many to many)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to Many)" msgstr "pgr_edgeDisjointPaths （多对多）" msgid "Components family" msgstr "分量族" +msgid "pgr_connectedComponents" +msgstr "pgr_connectedComponents" + msgid "pgr_strongComponents" msgstr "pgr_strongComponents" @@ -18369,8 +18511,8 @@ msgstr "pgr_floydWarshall" msgid "pgr_johnson" msgstr "pgr_johnson" -msgid "pgr_astar" -msgstr "pgr_astar" +msgid "pgr_aStar" +msgstr "pgr_aStar" msgid "pgr_bdAstar" msgstr "pgr_bdAstar" @@ -18390,6 +18532,9 @@ msgstr "pgr_dijkstraCost" msgid "pgr_drivingDistance" msgstr "pgr_drivingDistance" +msgid "pgr_KSP" +msgstr "pgr_KSP" + msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (拟议)" @@ -18611,24 +18756,17 @@ msgstr "在结果中添加了 path_id、cost 和 agg_cost 列" msgid "Parameter names changed" msgstr "更改参数名称" -msgid "The many version results are the union of the one to one version" +#, fuzzy +msgid "The many version results are the union of the One to One version" msgstr "多版本结果是一对一版本的并集" msgid "New Signatures" msgstr "新签名" -msgid "pgr_bdAstar(one to one)" +#, fuzzy +msgid "pgr_bdAstar(One to One)" msgstr "pgr_bdAstar（一对一）" -msgid "New Proposed functions" -msgstr "新的拟议函数" - -msgid "pgr_bdAstarCostMatrix" -msgstr "pgr_bdAstarCostMatrix" - -msgid "pgr_bdDijkstraCostMatrix" -msgstr "pgr_bdDijkstraCostMatrix" - msgid "pgr_lineGraph" msgstr "pgr_lineGraph" @@ -18717,32 +18855,8 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "pgr_bdDijkstra" -msgid "New Proposed Signatures" -msgstr "新的拟议签名" - -msgid "pgr_astar(one to many)" -msgstr "pgr_astar（一对多）" - -msgid "pgr_astar(many to one)" -msgstr "pgr_astar（多对一）" - -msgid "pgr_astar(many to many)" -msgstr "pgr_astar（多对多）" - -msgid "pgr_astarCost(one to one)" -msgstr "pgr_astarCost(一对一)" - -msgid "pgr_astarCost(one to many)" -msgstr "pgr_astarCost(一对多)" - -msgid "pgr_astarCost(many to one)" -msgstr "pgr_astarCost(多对一)" - -msgid "pgr_astarCost(many to many)" -msgstr "pgr_astarCost（多对多）" - -msgid "pgr_astarCostMatrix" -msgstr "pgr_astarCostMatrix" +msgid "Deprecated signatures." +msgstr "弃用签名。" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" msgstr "pgr_bddijkstra - 使用 pgr_bdDijkstra代替" @@ -18822,52 +18936,55 @@ msgstr "" msgid "pgr_TSP" msgstr "pgr_TSP" -msgid "pgr_aStar" -msgstr "pgr_aStar" - -msgid "New Functions" -msgstr "新函数" - msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" - -msgid "pgr_maxFlowPushRelabel(one to one)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "pgr_maxFlowPushRelabel(一对一)" -msgid "pgr_maxFlowPushRelabel(one to many)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(One to Many)" msgstr "pgr_maxFlowPushRelabel(一对多)" -msgid "pgr_maxFlowPushRelabel(many to one)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to One)" msgstr "pgr_maxFlowPushRelabel(多对一)" -msgid "pgr_maxFlowPushRelabel(many to many)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to Many)" msgstr "pgr_maxFlowPushRelabel(多对多)" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "pgr_maxFlowEdmondsKarp（一对一）" -msgid "pgr_maxFlowEdmondsKarp(one to many)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to Many)" msgstr "pgr_maxFlowEdmondsKarp（一对多）" -msgid "pgr_maxFlowEdmondsKarp(many to one)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to One)" msgstr "pgr_maxFlowEdmondsKarp（多对一）" -msgid "pgr_maxFlowEdmondsKarp(many to many)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" msgstr "pgr_maxFlowEdmondsKarp（多对多）" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "pgr_maxFlowBoykovKolmogorov （一对一）" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" msgstr "pgr_maxFlowBoykovKolmogorov （一对多）" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" msgstr "pgr_maxFlowBoykovKolmogorov （多对一）" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" msgstr "pgr_maxFlowBoykovKolmogorov （多对多）" msgid "pgr_maximumCardinalityMatching" @@ -18879,7 +18996,8 @@ msgstr "pgr_contractGraph" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "pgr_tsp - 使用 pgr_TSP 或 pgr_eucledianTSP 代替" -msgid "pgr_astar - use pgr_aStar instead" +#, fuzzy +msgid "pgr_aStar - use pgr_aStar instead" msgstr "pgr_astar - 使用 pgr_aStar 代替" msgid "pgr_flip_edges" @@ -18980,6 +19098,9 @@ msgstr "" msgid "Improvements" msgstr "改进" +msgid "pgr_nodeNetwork" +msgstr "pgr_nodeNetwork" + msgid "Adding a row_where and outall optional parameters" msgstr "添加 row_where 和 outall 可选参数" @@ -18992,43 +19113,55 @@ msgstr "pgr_dijkstra -- 与文档中的内容相匹配" msgid "pgr_Johnson" msgstr "pgr_Johnson" -msgid "pgr_dijkstraCost(one to one)" +#, fuzzy +msgid "pgr_dijkstraCost(One to One)" msgstr "pgr_dijkstraCost(一对一)" -msgid "pgr_dijkstraCost(one to many)" -msgstr "pgr_dijkstraCost(一对多)" +#, fuzzy +msgid "pgr_dijkstraCost(One to Many)" +msgstr "pgr_dijkstraNearCost(一对多)" -msgid "pgr_dijkstraCost(many to one)" -msgstr "pgr_dijkstraCost（多对一）" +#, fuzzy +msgid "pgr_dijkstraCost(Many to One)" +msgstr "pgr_dijkstraNearCost(多对一)" -msgid "pgr_dijkstraCost(many to many)" -msgstr "pgr_dijkstraCost（多对多）" +#, fuzzy +msgid "pgr_dijkstraCost(Many to Many)" +msgstr "pgr_dijkstraNearCost (多对多)" msgid "Proposed Functionality" msgstr "建议的功能" -msgid "pgr_withPoints(one to one)" -msgstr "pgr_withPoints(一对一)" +#, fuzzy +msgid "pgr_withPoints(One to One)" +msgstr "pgr_withPointsKSP(一对一)" -msgid "pgr_withPoints(one to many)" -msgstr "pgr_withPoints（一对多）" +#, fuzzy +msgid "pgr_withPoints(One to Many)" +msgstr "pgr_withPointsKSP (一对多)" -msgid "pgr_withPoints(many to one)" -msgstr "pgr_withPoints(多对一)" +#, fuzzy +msgid "pgr_withPoints(Many to One)" +msgstr "pgr_withPointsKSP(多对一)" -msgid "pgr_withPoints(many to many)" -msgstr "pgr_withPoints(多对多)" +#, fuzzy +msgid "pgr_withPoints(Many to Many)" +msgstr "pgr_withPointsKSP(多对多)" -msgid "pgr_withPointsCost(one to one)" +#, fuzzy +msgid "pgr_withPointsCost(One to One)" msgstr "pgr_withPointsCost(一对一)" -msgid "pgr_withPointsCost(one to many)" +#, fuzzy +msgid "pgr_withPointsCost(One to Many)" msgstr "pgr_withPointsCost(一对多)" -msgid "pgr_withPointsCost(many to one)" +#, fuzzy +msgid "pgr_withPointsCost(Many to One)" msgstr "pgr_withPointsCost(多对一)" -msgid "pgr_withPointsCost(many to many)" +#, fuzzy +msgid "pgr_withPointsCost(Many to Many)" msgstr "pgr_withPointsCost(多对多)" msgid "pgr_withPointsDD(single vertex)" @@ -19037,9 +19170,6 @@ msgstr "pgr_withPointsDD （单顶点）" msgid "pgr_withPointsDD(multiple vertices)" msgstr "pgr_withPointsDD（多顶点）" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - msgid "pgr_dijkstraVia" msgstr "pgr_dijkstraVia" @@ -19076,27 +19206,13 @@ msgstr "" "github.com/pgRouting/pgrouting/issues?" "q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ 。" -msgid "pgr_dijkstra(one to many)" -msgstr "pgr_dijkstra（一对多）" - -msgid "pgr_dijkstra(many to one)" -msgstr "pgr_dijkstra（多对一）" - -msgid "pgr_dijkstra(many to many)" -msgstr "pgr_dijkstra（多对多）" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance （多顶点）" - msgid "Refactored" msgstr "重构" -msgid "pgr_dijkstra(one to one)" +#, fuzzy +msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra（一对一）" -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance （单顶点）" - msgid "" "pgr_alphaShape function now can generate better (multi)polygon with holes " "and alpha parameter." @@ -19445,10 +19561,11 @@ msgstr "函数族" msgid "Sample Data" msgstr "示例数据" +#, 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 majority of " +"the examples queries, follow the instructions below." msgstr "" "该文档提供了基于类似于城市的小型示例网络的非常简单的示例查询。 为了能够执行大" "部分示例查询，请按照以下说明进行操作。" @@ -19462,9 +19579,11 @@ msgstr "图由一组边和一组顶点组成。" msgid "The following city is to be inserted into the database:" msgstr "要在数据库中插入以下城市：" +#, fuzzy 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." +"capacity values, category values and some locations that are not in the " +"graph." msgstr "" "此时已知的信息是边的几何形状、成本值、容量值、类别值和一些不在图中的位置。" @@ -19473,14 +19592,12 @@ msgid "" "that everything else is calculated." msgstr "拓扑结构的工作流程从插入边开始。然后再计算其他所有内容。" -msgid "Edges" -msgstr "边" - +#, fuzzy 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." +"opposite direction. Therefore some information has the ``reverse_`` prefix " +"which corresponds to the segment on the opposite direction of the geometry." msgstr "" "pgRouting文档的数据库设计将同一行中的两段保留在一个方向上，其中一个是与几何形" "状相同方向的，另一个是与几何形状相反方向的。因此，一些信息具有 ``reverse_`` " @@ -19513,8 +19630,9 @@ msgstr "``reverse_category``" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr ":math:`x` 几何图形起始顶点的坐标。" +#, fuzzy msgid "" -"For convinience it is saved on the table but can be calculated as " +"For convenience it is saved on the table but can be calculated as " "``ST_X(ST_StartPoint(geom))``." msgstr "" "为了方便起见，它被保存在表格中，但也可以计算为 " @@ -19523,8 +19641,9 @@ msgstr "" msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr ":math:`y` 几何图形结束顶点的坐标。" +#, fuzzy msgid "" -"For convinience it is saved on the table but can be calculated as " +"For convenience it is saved on the table but can be calculated as " "``ST_Y(ST_EndPoint(geom))``." msgstr "" "为方便起见，它保存在表格中，但也可以计算为 ``ST_Y(ST_EndPoint(geom))``。" @@ -19535,9 +19654,10 @@ msgstr "分段的几何形状。" msgid "Starting on PostgreSQL 12::" msgstr "从 PostgreSQL 12 开始：：" +#, fuzzy msgid "" -"Optionally indexes on different columns can be created. The recomendation is " -"to have" +"Optionally indexes on different columns can be created. The recommendation " +"is to have" msgstr "可以选择在不同的列上创建索引。建议的做法是" msgid "``id`` indexed." @@ -19547,8 +19667,9 @@ msgid "" "``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "``source`` 和 ``target`` 列建立索引以加快 pgRouting 查询。" +#, fuzzy msgid "" -"``geom`` indexed to speed up gemetry processes that might be needed in the " +"``geom`` indexed to speed up geometry processes that might be needed in the " "front end." msgstr "``geom`` 列建立索引以加快前端可能需要的 gemetry 处理。" @@ -19622,8 +19743,9 @@ msgstr "" "当需要从 ``source`` 到 ``target`` 的路由时，许多函数都可以与 ``(source, " "target)`` 对组合使用。" +#, fuzzy msgid "" -"For convinence of this documentations, some combinations will be stored on a " +"For convenience of this documentation, some combinations will be stored on a " "table:" msgstr "为便于阅读，某些组合将存储在一个表中：" @@ -19636,6 +19758,9 @@ msgstr "组合数据" msgid "Some functions accept soft restrictions about the segments." msgstr "一些函数接受关于段的软约束。" +msgid "Images" +msgstr "图片" + msgid "Red arrows correspond when ``cost`` > 0 in the edge table." msgstr "红色箭头对应边表中 ``cost`` > 0 的情况。" @@ -19772,15 +19897,14 @@ msgid "" "User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" msgstr "用户邮件列表：https://lists.osgeo.org/mailman/listinfo/pgrouting-users" -#, fuzzy msgid "" "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" "dev/" -msgstr "开发者邮件列表：https://lists.osgeo.org/mailman/listinfo/pgrouting-dev" +msgstr "" +"开发人员邮件列表： https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" -#, fuzzy msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" -msgstr "开发者邮件列表：https://lists.osgeo.org/mailman/listinfo/pgrouting-dev" +msgstr "订阅：https://discourse.osgeo.org/g/pgrouting-dev" msgid "" "For general questions and topics about how to use pgRouting, please write to " @@ -19857,9 +19981,10 @@ msgstr "" "与表关联的属性有助于指示图是有向的还是无向的，边是否是有向图上的单向，并且根" "据最终应用程序的需要，需要创建合适的拓扑。" +#, fuzzy msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "pgRouting 提供一些函数来创建路由拓扑并分析拓扑。" msgid "Additional functions to create a graph:" @@ -19868,9 +19993,8 @@ msgstr "创建图表的附加函数：" msgid "Additional functions to analyze a graph:" msgstr "用于分析图表的附加函数：" -#, fuzzy msgid "Transformation - Family of functions" -msgstr "收缩 - 函数族" +msgstr "转换 - 函数族" msgid "" "This family of functions is used for transforming a given input graph :math:" @@ -19881,7 +20005,8 @@ msgstr "" msgid "Traversal - Family of functions" msgstr "Traversal - 函数族" -msgid "Aditionaly there are 2 categories under this family" +#, fuzzy +msgid "Additionally there are 2 categories under this family" msgstr "此外，该家族下还有 2 个类别" msgid "Via - Category" @@ -19897,8 +20022,9 @@ msgstr "" "给定一个图和一个顶点列表，找到所有相邻顶点对 :math:`vertex_i` 和 :math:" "`vertex_{i+1}` 之间的最短路径" +#, fuzzy msgid "" -"In other words, find a continuos route that visits all the vertices in the " +"In other words, find a continuous route that visits all the vertices in the " "order given." msgstr "换句话说，找到一条按给定顺序访问所有顶点的连续路线。" @@ -20277,6 +20403,6 @@ msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" msgid "pgr_withPointsDD is pgr_drivingDistance **with points**" msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" -#, fuzzy msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" -msgstr "pgr_withPointsvia 是 **带有点** 的" +msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" +