diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index c774c618cf..33f5f49b0a 100644 --- a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po @@ -6,7 +6,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.6.0-dev\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-16 18:52+0000\n" +"POT-Creation-Date: 2024-09-23 01:17+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: Automatically generated\n" "Language-Team: none\n" @@ -2752,10 +2752,6 @@ msgid "" "graph/doc/edge_coloring.html>`__" msgstr "" -msgid "" -"`Wikipedia: Graph Coloring `__" -msgstr "" - msgid "Components - Family of functions" msgstr "" @@ -4005,10 +4001,10 @@ msgid "" "returned." msgstr "" -msgid "There is no flow when a **source** is the same as a **target**." +msgid "There is no flow when source has the same vaule as target." msgstr "" -msgid "Any duplicated value in the source(s) or target(s) are ignored." +msgid "Any duplicated values in source or target are ignored." msgstr "" msgid "Calculates the flow/residual capacity for each edge. In the output" @@ -4017,9 +4013,13 @@ msgstr "" msgid "Edges with zero flow are omitted." msgstr "" -msgid "" -"Creates a **super source** and edges to all the source(s), and a **super " -"target** and the edges from all the targets(s)." +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 "" @@ -6529,8 +6529,8 @@ msgstr "" msgid "" "There are several kinds of valid inner queries and also the columns returned " "are depending of the function. Which kind of inner query will depend on the " -"function(s) requirements. To simplify variety of types, **ANY-INTEGER** and " -"**ANY-NUMERICAL** is used." +"function's requirements. To simplify the variety of types, **ANY-INTEGER** " +"and **ANY-NUMERICAL** is used." msgstr "" msgid "Edges SQL for" @@ -6957,9 +6957,6 @@ msgid "" "pgrouting/releases/latest" msgstr "" -msgid "wget" -msgstr "" - msgid "To download this release:" msgstr "" @@ -8069,8 +8066,7 @@ msgid "pgr_aStarCost" msgstr "" msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* " -"algorithm." +"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" msgid "``pgr_aStarCost`` (`Combinations`_)" @@ -8080,7 +8076,7 @@ msgid "New **proposed** function" msgstr "" msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) " +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " "using the A* algorithm." msgstr "" @@ -8796,7 +8792,7 @@ msgid "pgr_bdAstarCost" msgstr "" msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the " +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " "bidirectional A* algorithm." msgstr "" @@ -8804,8 +8800,8 @@ msgid "``pgr_bdAstarCost`` (`Combinations`_)" msgstr "" msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest " -"path(s) using the bidirectional A* algorithm." +"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." msgstr "" msgid "" @@ -8845,8 +8841,8 @@ msgid "``pgr_bdDijkstra``" msgstr "" msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional " -"Dijkstra algorithm." +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." msgstr "" msgid "pgr_bdDijkstra(`Combinations`_)" @@ -8886,7 +8882,7 @@ msgid "" "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "Returns set of |old-generic-result|" @@ -8918,9 +8914,6 @@ msgid "" "**undirected** graph" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" - msgid "Using a combinations table on an **undirected** graph" msgstr "" @@ -8936,7 +8929,7 @@ msgid "``pgr_bdDijkstraCost``" msgstr "" msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path(s)'s cost using " +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " "Bidirectional Dijkstra algorithm." msgstr "" @@ -8998,7 +8991,7 @@ msgstr "" msgid "``pgr_bellmanFord - Experimental``" msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm." +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" msgid "New **experimental** signature:" @@ -9172,9 +9165,6 @@ msgstr "" msgid "``vid``" msgstr "" -msgid "Identifier of the vertex" -msgstr "" - msgid "``centrality``" msgstr "" @@ -9255,7 +9245,7 @@ msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary " +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " "graph." msgstr "" @@ -10289,7 +10279,7 @@ msgid "pgr_dagShortestPath - Experimental" msgstr "" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed " +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " "acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " "implemented by Boost.Graph." msgstr "" @@ -10561,7 +10551,7 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" msgid "Version 3.5.0" @@ -10797,7 +10787,7 @@ msgid "``pgr_dijkstraCost``" msgstr "" msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path(s) using Dijkstra " +"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " "algorithm." msgstr "" @@ -10805,8 +10795,8 @@ msgid "``pgr_dijkstraCost`` (`Combinations`_)" msgstr "" msgid "" -"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " -"path(s) using Dijkstra Algorithm." +"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " +"using Dijkstra Algorithm." msgstr "" msgid "" @@ -11196,7 +11186,7 @@ msgstr "" msgid "" "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an **directed** graph." +"on an directed graph." msgstr "" msgid "Via optional parameters" @@ -13190,7 +13180,7 @@ msgstr "" msgid "New **Proposed** function" msgstr "" -msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" msgid "" @@ -14336,11 +14326,6 @@ msgid "" "[**options**])" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "" - msgid "" "All this examples are about the route that visits the vertices :math:`\\{5, " "7, 1, 8, 15\\}` in that order on a directed graph." @@ -14587,7 +14572,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, find the shortest path(s)" +"algorithm, find the shortest path" msgstr "" msgid "Characteristics:" @@ -14932,7 +14917,7 @@ msgstr "" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path(s) found, for the combination of points " +"aggregate cost of the shortest path found, for the combination of points " "given." msgstr "" @@ -14941,7 +14926,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path(s) found." +"algorithm, return only the aggregate cost of the shortest path found." msgstr "" msgid "" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 1cb741bb2f..194ffbd28b 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -10,9 +10,9 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.4.0-dev\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-16 18:52+0000\n" -"PO-Revision-Date: 2024-08-17 20:45+0000\n" -"Last-Translator: DeepL \n" +"POT-Creation-Date: 2024-08-26 11:20+0000\n" +"PO-Revision-Date: 2024-09-23 19:49+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Spanish \n" "Language: es\n" @@ -6074,7 +6074,7 @@ msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_withPoints``" msgstr "Migrando ``pgr_trsp`` (Aristas) usando ``pgr_withPoints``" msgid "Use :doc:`pgr_withPoints` instead." -msgstr "Utiliza en su lugar :doc:`pgr_withPoints`." +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." @@ -7940,7 +7940,7 @@ msgstr "" "pgRouting/pgrouting/releases/latest" msgid "wget" -msgstr "Wget" +msgstr "wget" msgid "To download this release:" msgstr "Para descargar esta versión:" @@ -10519,7 +10519,7 @@ msgid "" "centrality using Brandes Algorithm" msgstr "" "``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa " -"mediante el algoritmo de Brandes." +"mediante el algoritmo de Brandes" msgid "Version 3.7.0" msgstr "Versión 3.7.0" @@ -10595,7 +10595,8 @@ msgid "Removing vertex :math:`6` will create three graph components." msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes." msgid "Removing vertex :math:`10` will create two graph components." -msgstr "Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." +msgstr "" +"Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." msgid "``vid``" msgstr "``vid``" @@ -14041,99 +14042,113 @@ msgstr "" "punto más cercano de la arista :math:`8` ``geom``" msgid "One point dry run execution" -msgstr "" +msgstr "Ejecución en seco de un punto" msgid "Returns ``EMPTY SET``." -msgstr "" +msgstr "Devuelve ``CONJUNTO VACÍO``." msgid "``partial => true``" -msgstr "" +msgstr "``partial => true``" msgid "Is ignored" -msgstr "" +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 "" +msgstr "``dryrun => true``" msgid "Do not process query" -msgstr "" +msgstr "No procesar la consulta" msgid "" "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" +"Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular " +"todas las columnas" msgid "``cap`` and **original point** are used in the code" -msgstr "" +msgstr "``cap`` y **punto original** se utilizan en el código" msgid "Many points examples" -msgstr "" +msgstr "Ejemplos de muchos puntos" msgid "At most two answers per point" -msgstr "" +msgstr "Un máximo de dos respuestas por punto" msgid "``NULL`` on ``edge``" -msgstr "" +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 "" +msgstr "Para el resto de los puntos se encontraron dos aristas." msgid "For point ``POINT(2.9 1.8)``" -msgstr "" +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 "" +msgstr "Una respuesta por punto, todas las columnas" msgid "For the **original point** ``POINT(2.9 1.8)``" -msgstr "" +msgstr "Para el **punto original** ``POINT(2.9 1.8)``" msgid "Edge :math:`5` is the closest edge to the **original point**" -msgstr "" +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 "" +msgstr "Ejecución en seco de muchos puntos" msgid "Find at most two routes to a given point" -msgstr "" +msgstr "Encontrar como máximo dos rutas a un punto dado" msgid "Using :doc:`pgr_withPoints`" -msgstr "" +msgstr "Usando :doc:`pgr_withPoints`" msgid "A point of interest table" -msgstr "" +msgstr "Una tabla de puntos de interés" msgid "Handling points outside the graph." -msgstr "" +msgstr "Manejo de puntos fuera del gráfico." msgid "Points of interest" msgstr "Puntos de interés" @@ -14143,38 +14158,47 @@ msgid "" "that is not a vertex in the graph. Those locations, in pgRrouting are called " "points of interest." msgstr "" +"Algunas veces las aplicaciones trabajan \"sobre la marcha\" comenzando desde " +"una localización que no es un vértice en el grafo. Esas localizaciones, en " +"pgRrouting se llaman puntos de interés." msgid "" "The information needed in the points of interest is ``pid``, ``edge_id``, " "``side``, ``fraction``." msgstr "" +"La información necesaria en los puntos de interés es ``pid``, ``edge_id``, " +"``side``, ``fraction``." msgid "" "On this documentation there will be some 6 fixed points of interest and they " "will be stored on a table." msgstr "" +"En esta documentación habrá unos 6 puntos de interés fijos y se almacenarán " +"en una tabla." msgid "A unique identifier." -msgstr "" +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 "Is it on the left, right or both sides of the segment ``edge_id``" msgstr "" +"¿Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``?" msgid "Where in the segment is the point located." -msgstr "" +msgstr "En qué parte del segmento se encuentra el punto." msgid "The geometry of the points." -msgstr "" +msgstr "La geometría de los puntos." msgid "``newPoint``" -msgstr "" +msgstr "``newPoint``" msgid "The geometry of the points moved on top of the segment." -msgstr "" +msgstr "La geometría de los puntos desplazados sobre el segmento." msgid "Points of interest fillup" msgstr "LLenado de puntos de interés" @@ -14315,6 +14339,12 @@ msgid "" "performance im-plementation. It is an extension of Johnson's Algorithm of " "finding all the elementary circuits of a directed graph." msgstr "" +"El algoritmo Hawick Circuit fue publicado en 2008 por Ken Hawick y Health A. " +"James. Este algoritmo resuelve el problema de detectar y enumerar circuitos " +"en grafos. Es capaz de enumerar circuitos en grafos con arcos dirigidos, " +"arcos múltiples y autoarcos con una implementación eficiente en memoria y de " +"alto rendimiento. Es una extensión del Algoritmo de Johnson para encontrar " +"todos los circuitos elementales de un grafo dirigido." msgid "" "There are 2 variations defined in the Boost Graph Library. Here, we have " @@ -14324,18 +14354,25 @@ msgid "" "you want to count the no. of circuits.Maybe in future, we will also " "implemenent this variation." msgstr "" +"Hay 2 variaciones definidas en la librería Boost Graph. Aquí hemos " +"implementado sólo la segunda, ya que es la más adecuada y práctica. En esta " +"variación obtenemos los circuitos después de filtrar los circuitos causados " +"por aristas paralelas. Los circuitos de aristas paralelas tienen más casos " +"de uso cuando se quiere contar el número de circuitos." msgid "The algorithm implementation works only for directed graph" msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" msgid "It is a variation of Johnson's algorithm for circuit enumeration." msgstr "" +"Es una variación del algoritmo de Johnson para la enumeración de circuitos." msgid "The algorithm outputs the distinct circuits present in the graph." msgstr "" +"El algoritmo da como resultado los distintos circuitos presentes en el grafo." msgid "Time Complexity: :math:`O((V + E) (c + 1))`" -msgstr "" +msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`" msgid ":math:`|c|` is the number of circuts in the graph." msgstr ":math:`|c|` es la cantidad de vertices del grafo." @@ -14417,7 +14454,7 @@ msgid "pgr_isPlanar(`Edges SQL`)" msgstr "pgr_isPlanar(`SQL de aristas`)" msgid "RETURNS ``BOOLEAN``" -msgstr "" +msgstr "DEVUELVE ``BOOLEAN``" msgid "Returns a boolean ``(pgr_isplanar)``" msgstr "Devuelve un valor boolean ``(pgr_isplanar)``" @@ -14731,12 +14768,14 @@ msgid "" "To get the complete Line Graph use unique identifiers on the double way " "edges (See `Additional Examples`_)." msgstr "" +"Para obtener el Grafo lineal completo utilizar identificadores únicos en las " +"aristas de doble sentido (Ver `Ejemplos Adicionales`_)." msgid "When the graph is undirected the result is undirected." msgstr "Cuando el grafo es no dirigido el resultado es no dirigido." msgid "The ``reverse_cost`` is always :math:`-1`." -msgstr "" +msgstr "El ``reverse_cost`` es siempre :math:`-1`." msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])" msgstr "pgr_lineGraph(`SQL de aristas`_, [``directed``])" @@ -19431,13 +19470,13 @@ msgid "pgr_bdDijkstra(many to one)" msgstr "pgr_bdDijkstra(muchos a uno)" msgid "pgr_bdDijkstra(many to many)" -msgstr "pgr_bdDijkstra(muchos to muchos)" +msgstr "pgr_bdDijkstra(muchos a muchos)" msgid "pgr_bdDijkstraCost(one to one)" -msgstr "pgr_bdDijkstraCost(Uno a Uno)" +msgstr "pgr_bdDijkstraCost(uno a uno)" msgid "pgr_bdDijkstraCost(one to many)" -msgstr "pgr_bdDijkstraCost(Uno a Muchos)" +msgstr "pgr_bdDijkstraCost(uno a muchos)" msgid "pgr_bdDijkstraCost(many to one)" msgstr "pgr_bdDijkstraCost(muchos a uno)" @@ -19446,10 +19485,10 @@ msgid "pgr_bdDijkstraCost(many to many)" msgstr "pgr_bdDijkstraCost(muchos a muchos)" msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "pgr_bdDijkstraCostMatrix(Uno a Uno)" +msgstr "pgr_bdDijkstraCostMatrix(uno a uno)" msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "pgr_bdDijkstraCostMatrix(Uno a Muchos)" +msgstr "pgr_bdDijkstraCostMatrix(uno a muchos)" msgid "pgr_bdDijkstraCostMatrix(many to one)" msgstr "pgr_bdDijkstraCostMatrix(muchos a uno)" @@ -20112,7 +20151,7 @@ msgid "pgr_astarCostMatrix" msgstr "pgr_astarCostMatrix" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" -msgstr "pgr_bddijkstra - utilice pgr_bdDijkstra en su lugar" +msgstr "pgr_bddijkstra - utilizar pgr_bdDijkstra en su lugar" msgid "pgr_pointsToVids" msgstr "pgr_pointsToVids" @@ -21738,3 +21777,143 @@ msgstr "pgr_withPointsDD es pgr_drivingDistance **con puntos**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" + +msgid "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 "Any duplicated values in source or target are ignored." +msgstr "Los valores duplicados en origen o destino se ignoran." + +msgid "Creates" +msgstr "Crea" + +msgid "a **super source** and edges from it to all the sources," +msgstr "una **super fuente** y aristas desde ella a todas las fuentes," + +msgid "a **super target** and edges from it to all the targetss." +msgstr "un **super objetivo** y aristas desde él a todos los objetivos." + +msgid "" +"There are several kinds of valid inner queries and also the columns returned " +"are depending of the function. Which kind of inner query will depend on the " +"function's requirements. To simplify the variety of types, **ANY-INTEGER** " +"and **ANY-NUMERICAL** is used." +msgstr "" +"Existen varios tipos de consultas internas válidas y también las columnas " +"devueltas dependen de la función. El tipo de consulta interna dependerá de " +"los requisitos de la función. Para simplificar la variedad de tipos, se " +"utiliza **ANY-INTEGER** y **ANY-NUMERICAL**." + +msgid "" +"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "" +"``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo " +"A*." + +msgid "" +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " +"using the A* algorithm." +msgstr "" +"La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando " +"el algoritmo A*." + +msgid "" +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " +"bidirectional A* algorithm." +msgstr "" +"``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el " +"algoritmo bidireccional A*." + +msgid "" +"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." +msgstr "" +"La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando " +"el algoritmo bidireccional A*." + +msgid "" +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." +msgstr "" +"``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo " +"Bidireccional de Dijkstra." + +msgid "" +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " +"Bidirectional Dijkstra algorithm." +msgstr "" +"``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando " +"el algoritmo Bidireccional de Dijkstra." + +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." +msgstr "" +"``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-" +"Ford." + +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 "" +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " +"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " +"implemented by Boost.Graph." +msgstr "" +"``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos " +"dirigidos ponderados (DAG). En particular, el algoritmo de caminos más " +"cortos DAG implementado por Boost.Graph." + +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." +msgstr "" +"``pgr_dijkstra`` - Camino más corto utilizando el algoritmo de Dijkstra." + +msgid "" +"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " +"algorithm." +msgstr "" +"``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el " +"algoritmo de Dijkstra." + +msgid "" +"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " +"using Dijkstra Algorithm." +msgstr "" +"La función ``pgr_dijkstraCost`` suma el coste del camino más corto " +"utilizando el Algoritmo de Dijkstra." + +msgid "" +"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " +"on an directed graph." +msgstr "" +"Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden " +"en un grafo dirigido." + +msgid "Calculates the maximum flow from the sources to the targets." +msgstr "Calcula el flujo máximo de las fuentes a los objetivos." + +msgid "" +"Modify the graph to include points defined by points_sql. Using Dijkstra " +"algorithm, find the shortest path" +msgstr "" +"Modificar el grafo para incluir los puntos definidos por points_sql. " +"Utilizando el algoritmo de Dijkstra, encontrar el camino más corto" + +msgid "" +"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " +"aggregate cost of the shortest path found, for the combination of points " +"given." +msgstr "" +"``pgr_withPointsCost`` - Calcula el camino más corto y devuelve sólo el " +"coste agregado del camino más corto encontrado, para la combinación de " +"puntos dada." + +msgid "" +"Modify the graph to include points defined by points_sql. Using Dijkstra " +"algorithm, return only the aggregate cost of the shortest path found." +msgstr "" +"Modificar el grafo para incluir los puntos definidos por points_sql. " +"Utilizando el algoritmo de Dijkstra, devolver sólo el coste agregado del " +"camino más corto encontrado." diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 29afdc8518..db06297942 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -21,8 +21,8 @@ msgid "" msgstr "" "Project-Id-Version: PROJECT VERSION\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-16 18:52+0000\n" -"PO-Revision-Date: 2024-05-01 03:45+0000\n" +"POT-Creation-Date: 2024-09-23 01:17+0000\n" +"PO-Revision-Date: 2024-09-23 01:16+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Japanese \n" @@ -2789,10 +2789,6 @@ msgid "" "graph/doc/edge_coloring.html>`__" msgstr "" -msgid "" -"`Wikipedia: Graph Coloring `__" -msgstr "" - msgid "Components - Family of functions" msgstr "" @@ -4089,10 +4085,10 @@ msgid "" "returned." msgstr "" -msgid "There is no flow when a **source** is the same as a **target**." +msgid "There is no flow when source has the same vaule as target." msgstr "" -msgid "Any duplicated value in the source(s) or target(s) are ignored." +msgid "Any duplicated values in source or target are ignored." msgstr "" msgid "Calculates the flow/residual capacity for each edge. In the output" @@ -4101,9 +4097,13 @@ msgstr "" msgid "Edges with zero flow are omitted." msgstr "" -msgid "" -"Creates a **super source** and edges to all the source(s), and a **super " -"target** and the edges from all the targets(s)." +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 "" @@ -5767,9 +5767,8 @@ msgid "" "negative are part of the graph." msgstr "" -#, fuzzy msgid "The set of vertices :math:`V`:" -msgstr "ノードのセット :math:`V`" +msgstr "ノードのセット :math:`V`:" msgid "In a directed graph both edges have directionality" msgstr "" @@ -6630,8 +6629,8 @@ msgstr "" msgid "" "There are several kinds of valid inner queries and also the columns returned " "are depending of the function. Which kind of inner query will depend on the " -"function(s) requirements. To simplify variety of types, **ANY-INTEGER** and " -"**ANY-NUMERICAL** is used." +"function's requirements. To simplify the variety of types, **ANY-INTEGER** " +"and **ANY-NUMERICAL** is used." msgstr "" msgid "Edges SQL for" @@ -7060,9 +7059,6 @@ msgid "" "pgrouting/releases/latest" msgstr "" -msgid "wget" -msgstr "" - msgid "To download this release:" msgstr "" @@ -7580,9 +7576,8 @@ msgstr "" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -#, fuzzy msgid "New overload functions:" -msgstr "新しい **公式** 機能" +msgstr "新しい **公式** 機能:" msgid "``pgr_ksp`` (One to Many)" msgstr "" @@ -8188,10 +8183,10 @@ msgstr "" msgid "pgr_aStarCost" msgstr "" +#, fuzzy msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* " -"algorithm." -msgstr "" +"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" msgid "``pgr_aStarCost`` (`Combinations`_)" msgstr "" @@ -8200,7 +8195,7 @@ msgid "New **proposed** function" msgstr "" msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) " +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " "using the A* algorithm." msgstr "" @@ -8916,7 +8911,7 @@ msgid "pgr_bdAstarCost" msgstr "" msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the " +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " "bidirectional A* algorithm." msgstr "" @@ -8924,8 +8919,8 @@ msgid "``pgr_bdAstarCost`` (`Combinations`_)" msgstr "" msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest " -"path(s) using the bidirectional A* algorithm." +"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." msgstr "" msgid "" @@ -8965,8 +8960,8 @@ msgid "``pgr_bdDijkstra``" msgstr "" msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional " -"Dijkstra algorithm." +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." msgstr "" msgid "pgr_bdDijkstra(`Combinations`_)" @@ -9006,7 +9001,7 @@ msgid "" "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "Returns set of |old-generic-result|" @@ -9038,9 +9033,6 @@ msgid "" "**undirected** graph" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" - msgid "Using a combinations table on an **undirected** graph" msgstr "" @@ -9056,7 +9048,7 @@ msgid "``pgr_bdDijkstraCost``" msgstr "" msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path(s)'s cost using " +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " "Bidirectional Dijkstra algorithm." msgstr "" @@ -9118,7 +9110,7 @@ msgstr "" msgid "``pgr_bellmanFord - Experimental``" msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm." +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" msgid "New **experimental** signature:" @@ -9296,10 +9288,6 @@ msgstr "" msgid "``vid``" msgstr "" -#, fuzzy -msgid "Identifier of the vertex" -msgstr "終了ノードの識別子。" - msgid "``centrality``" msgstr "" @@ -9382,7 +9370,7 @@ msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary " +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " "graph." msgstr "" @@ -10418,7 +10406,7 @@ msgid "pgr_dagShortestPath - Experimental" msgstr "" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed " +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " "acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " "implemented by Boost.Graph." msgstr "" @@ -10693,7 +10681,7 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" #, fuzzy @@ -10932,18 +10920,20 @@ msgstr "" msgid "``pgr_dijkstraCost``" msgstr "" +#, fuzzy msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path(s) using Dijkstra " +"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " "algorithm." -msgstr "" +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" msgid "``pgr_dijkstraCost`` (`Combinations`_)" msgstr "" +#, fuzzy msgid "" -"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " -"path(s) using Dijkstra Algorithm." -msgstr "" +"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " +"using Dijkstra Algorithm." +msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" #, fuzzy msgid "" @@ -11334,7 +11324,7 @@ msgstr "" msgid "" "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an **directed** graph." +"on an directed graph." msgstr "" msgid "Via optional parameters" @@ -13338,7 +13328,7 @@ msgstr "" msgid "New **Proposed** function" msgstr "" -msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" msgid "" @@ -14488,11 +14478,6 @@ msgid "" "[**options**])" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "" - msgid "" "All this examples are about the route that visits the vertices :math:`\\{5, " "7, 1, 8, 15\\}` in that order on a directed graph." @@ -14739,7 +14724,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, find the shortest path(s)" +"algorithm, find the shortest path" msgstr "" msgid "Characteristics:" @@ -15086,7 +15071,7 @@ msgstr "" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path(s) found, for the combination of points " +"aggregate cost of the shortest path found, for the combination of points " "given." msgstr "" @@ -15095,7 +15080,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path(s) found." +"algorithm, return only the aggregate cost of the shortest path found." msgstr "" msgid "" @@ -18869,3 +18854,7 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" + +#, fuzzy +#~ msgid "Identifier of the vertex" +#~ msgstr "終了ノードの識別子。" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index f5b001a61a..36d86529b7 100644 --- a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.4.0\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-16 18:52+0000\n" +"POT-Creation-Date: 2024-09-23 01:17+0000\n" "PO-Revision-Date: 2022-12-13 12:30+0000\n" "Last-Translator: Hyung-Gyu Ryoo \n" "Language-Team: Korean `__" msgstr "" -msgid "" -"`Wikipedia: Graph Coloring `__" -msgstr "" - msgid "Components - Family of functions" msgstr "" @@ -4020,10 +4016,10 @@ msgid "" "returned." msgstr "" -msgid "There is no flow when a **source** is the same as a **target**." +msgid "There is no flow when source has the same vaule as target." msgstr "" -msgid "Any duplicated value in the source(s) or target(s) are ignored." +msgid "Any duplicated values in source or target are ignored." msgstr "" msgid "Calculates the flow/residual capacity for each edge. In the output" @@ -4032,9 +4028,13 @@ msgstr "" msgid "Edges with zero flow are omitted." msgstr "" -msgid "" -"Creates a **super source** and edges to all the source(s), and a **super " -"target** and the edges from all the targets(s)." +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 "" @@ -6564,8 +6564,8 @@ msgstr "" msgid "" "There are several kinds of valid inner queries and also the columns returned " "are depending of the function. Which kind of inner query will depend on the " -"function(s) requirements. To simplify variety of types, **ANY-INTEGER** and " -"**ANY-NUMERICAL** is used." +"function's requirements. To simplify the variety of types, **ANY-INTEGER** " +"and **ANY-NUMERICAL** is used." msgstr "" msgid "Edges SQL for" @@ -6993,9 +6993,6 @@ msgid "" "pgrouting/releases/latest" msgstr "" -msgid "wget" -msgstr "wget" - msgid "To download this release:" msgstr "" @@ -8109,10 +8106,10 @@ msgstr "" msgid "pgr_aStarCost" msgstr "" +#, fuzzy msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path(s) using the A* " -"algorithm." -msgstr "" +"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." msgid "``pgr_aStarCost`` (`Combinations`_)" msgstr "" @@ -8120,10 +8117,11 @@ msgstr "" msgid "New **proposed** function" msgstr "" +#, fuzzy msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path(s) " +"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " "using the A* algorithm." -msgstr "" +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." msgid "" "Let be the case the values returned are stored in a table, so the unique " @@ -8837,7 +8835,7 @@ msgid "pgr_bdAstarCost" msgstr "" msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path(s) using the " +"``pgr_bdAstarCost`` - Total cost of the shortest path using the " "bidirectional A* algorithm." msgstr "" @@ -8845,8 +8843,8 @@ msgid "``pgr_bdAstarCost`` (`Combinations`_)" msgstr "" msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest " -"path(s) using the bidirectional A* algorithm." +"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." msgstr "" msgid "" @@ -8885,10 +8883,11 @@ msgstr "" msgid "``pgr_bdDijkstra``" msgstr "" +#, fuzzy msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path(s) using Bidirectional " -"Dijkstra algorithm." -msgstr "" +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." +msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." msgid "pgr_bdDijkstra(`Combinations`_)" msgstr "" @@ -8927,7 +8926,7 @@ msgid "" "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "Returns set of |old-generic-result|" @@ -8959,9 +8958,6 @@ msgid "" "**undirected** graph" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" - msgid "Using a combinations table on an **undirected** graph" msgstr "" @@ -8977,7 +8973,7 @@ msgid "``pgr_bdDijkstraCost``" msgstr "" msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path(s)'s cost using " +"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " "Bidirectional Dijkstra algorithm." msgstr "" @@ -9039,7 +9035,7 @@ msgstr "" msgid "``pgr_bellmanFord - Experimental``" msgstr "" -msgid "``pgr_bellmanFord`` — Shortest path(s) using Bellman-Ford algorithm." +msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" msgid "New **experimental** signature:" @@ -9214,9 +9210,6 @@ msgstr "" msgid "``vid``" msgstr "" -msgid "Identifier of the vertex" -msgstr "" - msgid "``centrality``" msgstr "" @@ -9298,7 +9291,7 @@ msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary " +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " "graph." msgstr "" @@ -10333,7 +10326,7 @@ msgid "pgr_dagShortestPath - Experimental" msgstr "" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed " +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " "acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " "implemented by Boost.Graph." msgstr "" @@ -10606,7 +10599,7 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "" -msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm." +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "" msgid "Version 3.5.0" @@ -10841,18 +10834,22 @@ msgstr "" msgid "``pgr_dijkstraCost``" msgstr "" +#, fuzzy msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path(s) using Dijkstra " +"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " "algorithm." -msgstr "" +msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." msgid "``pgr_dijkstraCost`` (`Combinations`_)" msgstr "" +#, fuzzy msgid "" -"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " -"path(s) using Dijkstra Algorithm." +"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " +"using Dijkstra Algorithm." msgstr "" +":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트" +"라 알고리즘" msgid "" "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -11241,7 +11238,7 @@ msgstr "" msgid "" "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an **directed** graph." +"on an directed graph." msgstr "" msgid "Via optional parameters" @@ -13236,7 +13233,7 @@ msgstr "" msgid "New **Proposed** function" msgstr "" -msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." +msgid "Calculates the maximum flow from the sources to the targets." msgstr "" msgid "" @@ -14382,11 +14379,6 @@ msgid "" "[**options**])" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "" - msgid "" "All this examples are about the route that visits the vertices :math:`\\{5, " "7, 1, 8, 15\\}` in that order on a directed graph." @@ -14633,7 +14625,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, find the shortest path(s)" +"algorithm, find the shortest path" msgstr "" msgid "Characteristics:" @@ -14978,7 +14970,7 @@ msgstr "" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path(s) found, for the combination of points " +"aggregate cost of the shortest path found, for the combination of points " "given." msgstr "" @@ -14987,7 +14979,7 @@ msgstr "" msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path(s) found." +"algorithm, return only the aggregate cost of the shortest path found." msgstr "" msgid "" @@ -18750,3 +18742,6 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" + +#~ msgid "wget" +#~ msgstr "wget" diff --git a/locale/zh_Hans/LC_MESSAGES/index.po b/locale/zh_Hans/LC_MESSAGES/index.po index ba2a8f34ef..225a3549e6 100644 --- a/locale/zh_Hans/LC_MESSAGES/index.po +++ b/locale/zh_Hans/LC_MESSAGES/index.po @@ -8,8 +8,8 @@ msgstr "" "Project-Id-Version: pgRouting v3.4.0-dev\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" -"PO-Revision-Date: 2023-10-21 03:23+0000\n" -"Last-Translator: Zuochenwei \n" +"PO-Revision-Date: 2024-09-23 14:18+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" "Language: zh_Hans\n" @@ -17,7 +17,7 @@ msgstr "" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=1; plural=0;\n" -"X-Generator: Weblate 5.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 `__" @@ -59,11 +59,11 @@ 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 手册根据 `知识共享署名-相同方式共享3.0许可证 " "`_。 您可以随意使用本材料，" "但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://" -"pgrouting.org 的链接。 有关 pgRouting " -"中使用的其他许可证，请参阅:ref:`license` page.。" +"pgrouting.org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 " +":ref:`license` page.。" #: ../../build/doc/index.rst:50 msgid "General" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 1607972d56..26379ba9f2 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -11,8 +11,8 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.6.0-dev\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2024-08-16 18:52+0000\n" -"PO-Revision-Date: 2024-05-28 16:17+0000\n" +"POT-Creation-Date: 2024-09-23 01:17+0000\n" +"PO-Revision-Date: 2024-09-23 14:18+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" @@ -220,7 +220,7 @@ msgid "Depth of the ``node``." msgstr "``node`` 的深度。" msgid ":math:`0` when ``node`` = ``start_vid``." -msgstr ":math:`0` 当``node`` = ``start_vid``。" +msgstr ":math:`0` 当 ``node`` = ``start_vid``。" msgid "``start_vid``" msgstr "``start_vid``" @@ -241,7 +241,7 @@ msgid "Identifier of the ``edge`` used to arrive to ``node``." msgstr "用于到达``node``的``edge``的标识符。" msgid ":math:`-1` when ``node`` = ``start_vid``." -msgstr ":math:`-1` 当``node`` = ``start_vid``。" +msgstr ":math:`-1` 当 ``node`` = ``start_vid``。" msgid "``FLOAT``" msgstr "``FLOAT``" @@ -593,13 +593,13 @@ msgstr "" "ps>`__" msgid "To calculate the number of different tours through :math:`n` cities:" -msgstr "计算经过:math:`n` 城市的不同旅行次数：" +msgstr "计算经过 : math:`n` 城市的不同旅行次数：" msgid "Given a starting city," msgstr "给定一个起始城市，" msgid "There are :math:`n-1` choices for the second city," -msgstr "第二个城市还有:math:`n-1`个选择，" +msgstr "第二个城市还有 :math:`n-1` 个选择，" msgid "And :math:`n-2` choices for the third city, etc." msgstr "第三个城市的 :math:`n-2` 选项等。" @@ -819,7 +819,7 @@ msgid "Time based calculations:" msgstr "基于时间的计算：" msgid "Travel time between customers is :math:`distance / speed`" -msgstr "客户之间的旅行时间为:math:`distance / speed`" +msgstr "客户之间的旅行时间为 :math:`distance / speed`" msgid "Pickup and delivery order pair is done by the same vehicle." msgstr "取货和送货订单对由同一辆车完成。" @@ -994,31 +994,31 @@ msgstr "送货的节点标识符必须与 `Matrix SQL`_中的顶点标识符匹 msgid "" "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the " "locations are needed:" -msgstr "对于 :doc:`pgr_pickDeliverEuclidean`，这需要位置的:math:`(x, y)`值：" +msgstr "对于 :doc:`pgr_pickDeliverEuclidean`，这需要位置的 :math:`(x, y)` 值：" msgid "``p_x``" msgstr "``p_x``" msgid ":math:`x` value of the pick up location" -msgstr "取货地点的:math:`x`值" +msgstr "取货地点的 :math:`x` 值" msgid "``p_y``" msgstr "``p_y``" msgid ":math:`y` value of the pick up location" -msgstr "取货地点的:math:`y`值" +msgstr "取货地点的 :math:`y` 值" msgid "``d_x``" msgstr "``d_x``" msgid ":math:`x` value of the delivery location" -msgstr "送货地点的:math:`x`值" +msgstr "送货地点的 :math:`x` 值" msgid "``d_y``" msgstr "``d_y``" msgid ":math:`y` value of the delivery location" -msgstr "送货地点的:math:`y` 值" +msgstr "送货地点的 :math:`y` 值" msgid "Vehicles SQL" msgstr "车辆 SQL" @@ -1111,19 +1111,19 @@ msgid "``start_x``" msgstr "``start_x``" msgid ":math:`x` value of the starting location" -msgstr "起始位置的:math:`x`值" +msgstr "起始位置的 :math:`x` 值" msgid "``start_y``" msgstr "``start_y``" msgid ":math:`y` value of the starting location" -msgstr "起始位置的:math:`y`值" +msgstr "起始位置的 :math:`y` 值" msgid "[``end_x``]" msgstr "[``end_x``]" msgid ":math:`x` value of the ending location" -msgstr "结束位置的:math:`x`值" +msgstr "结束位置的 :math:`x` 值" msgid "When missing: ``start_x`` is used." msgstr "缺失时：使用``start_x``值。" @@ -1132,7 +1132,7 @@ msgid "[``end_y``]" msgstr "[``end_y``]" msgid ":math:`y` value of the ending location" -msgstr "结束位置的:math:`y`值" +msgstr "结束位置的 :math:`y` 值" msgid "When missing: ``start_y`` is used." msgstr "缺失时：使用``start_y``值。" @@ -1194,7 +1194,7 @@ msgstr "INTEGER" msgid "" "Sequential value starting from **1** for the stops made by the current " "vehicle. The :math:`m_{th}` stop of the current vehicle." -msgstr "当前车辆停止的顺序值，从 **1** 开始。 当前第:math:`m_{th}`车辆的停止。" +msgstr "当前车辆停止的顺序值，从 **1** 开始。 当前第 :math:`m_{th}` 车辆的停止。" msgid "Sumary row has the **total time windows violations**." msgstr "摘要行包含**总时间窗口违规情况**。" @@ -1232,7 +1232,7 @@ msgstr "取货-送货订单对标识符。" msgid "" "Value :math:`-1`: When no order is involved on the current stop location." -msgstr "值:math:`-1`: 当前停留位置没有订单参与。" +msgstr "值 :math:`-1`: 当前停留位置没有订单参与。" msgid "``cargo``" msgstr "``cargo``" @@ -1241,7 +1241,7 @@ msgid "Cargo units of the vehicle when leaving the stop." msgstr "车辆离开停车点时的货物单位。" msgid "Value :math:`-1` on solution summary row." -msgstr "值:math:`-1`在解决方案摘要行。" +msgstr "值 :math:`-1` 在解决方案摘要行。" msgid "``travel_time``" msgstr "``travel_time``" @@ -1363,13 +1363,13 @@ msgid "The `capacity` of a vehicle, can be measured in:" msgstr "车辆的`容量`可以通过以下方式测量：" msgid "Volume units like :math:`m^3`." -msgstr "体积单位如:math:`m^3`。" +msgstr "体积单位如 :math:`m^3`。" msgid "Area units like :math:`m^2` (when no stacking is allowed)." -msgstr "面积单位如:math:`m^2`（不允许堆叠时）。" +msgstr "面积单位如 : math:`m^2` （不允许堆叠时）。" msgid "Weight units like :math:`kg`." -msgstr "重量单位如:math:`kg`。" +msgstr "重量单位如 :math:`kg`。" msgid "Number of boxes that fit in the vehicle." msgstr "车辆内可容纳的箱子数量。" @@ -1439,10 +1439,10 @@ msgid "When using :doc:`pgr_pickDeliverEuclidean`:" msgstr "当使用 :doc:`pgr_pickDeliverEuclidean`：" msgid "The vehicles have :math:`(x, y)` pairs for start and ending locations." -msgstr "车辆有起点和终点:math:`(x, y)`对。" +msgstr "车辆有起点和终点 :math:`(x, y)` 对。" msgid "The orders Have :math:`(x, y)` pairs for pickup and delivery locations." -msgstr "订单有取货和送货地点:math:`(x, y)`对。" +msgstr "订单有取货和送货地点 :math:`(x, y)` 对。" msgid "When using :doc:`pgr_pickDeliver`:" msgstr "当使用:doc:`pgr_pickDeliver`:" @@ -1584,8 +1584,7 @@ msgstr "用于:doc:`pgr_pickDeliver`:" msgid "" "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " "becomes :math:`1 / v`" -msgstr "" -"给定 :math:`v = d / t` 因此:math:`t = d / v` 并且``因子``变为:math:`1 / v`" +msgstr "给定 :math:`v = d / t` 因此 :math:`t = d / v` 并且 ``因子`` 变为:math:`1 / v`" msgid "v" msgstr "v" @@ -1671,7 +1670,7 @@ 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` 网络。" +msgstr "查询使用 :doc:`sampledata` 网络。" msgid "A* - Family of functions" msgstr "A* - 函数族" @@ -1703,10 +1702,10 @@ msgid "Ordering is:" msgstr "顺序是：" msgid "first by ``start_vid`` (if exists)" -msgstr "首先按``start_vid``（如果存在）" +msgstr "首先按 ``start_vid`` （如果存在）" msgid "then by ``end_vid``" -msgstr "然后按``end_vid``" +msgstr "然后按 ``end_vid``" msgid "Values are returned when there is a path." msgstr "当存在路径时返回值。" @@ -1715,28 +1714,28 @@ msgid "Let :math:`v` and :math:`u` be nodes on the graph:" msgstr "设 :math:`v` 和 :math:`u` 为图上的节点：" msgid "If there is no path from :math:`v` to :math:`u`:" -msgstr "如果没有从:math:`v` 到 :math:`u`的路径：" +msgstr "如果没有从 :math:`v` 到 :math:`u` 的路径：" msgid "no corresponding row is returned" msgstr "没有返回对应的行" msgid "``agg_cost`` from :math:`v` to :math:`u` is :math:`\\infty`" -msgstr "从:math:`v`到:math:`u`的``agg_cost`` 是 :math:`\\infty`" +msgstr "从 :math:`v` 到 :math:`u` 的 ``agg_cost`` 是 :math:`\\infty`" msgid "There is no path when :math:`v = u` therefore" -msgstr "当:math:`v = u`没有路径，因此" +msgstr "当 :math:`v = u` 没有路径，因此" msgid "``agg_cost`` from `v` to `u` is :math:`0`" -msgstr "从`v`到`u`的``agg_cost``是:math:`0`" +msgstr "从 `v` 到 `u` 的 ``agg_cost`` 是 :math:`0`" msgid "When :math:`(x,y)` coordinates for the same vertex identifier differ:" -msgstr "当同一顶点标识符的:math:`(x,y)` 坐标不同时：" +msgstr "当同一顶点标识符的 :math:`(x,y)` 坐标不同时：" msgid "A random selection of the vertex's :math:`(x,y)` coordinates is used." -msgstr "使用随机选择的顶点的:math:`(x,y)`坐标。" +msgstr "使用随机选择的顶点的 :math:`(x,y)` 坐标。" msgid "Running time: :math:`O((E + V) * \\log V)`" -msgstr "运行时间：:math:`O((E + V) * \\log V)`" +msgstr "运行时间： :math:`O((E + V) * \\log V)`" msgid "aStar optional parameters" msgstr "aStar 可选参数" @@ -1769,20 +1768,20 @@ msgid "``1``" msgstr "``1``" msgid "For units manipulation. :math:`factor > 0`." -msgstr "对于单位操作。:math:`factor > 0`。" +msgstr "对于单位操作。 :math:`factor > 0`。" msgid "``epsilon``" msgstr "``epsilon``" msgid "For less restricted results. :math:`epsilon >= 1`." -msgstr "对于限制较少的结果。:math:`epsilon >= 1`。" +msgstr "对于限制较少的结果。 :math:`epsilon >= 1`。" msgid "" "See :ref:`heuristics ` available and :ref:`factor " "` handling." msgstr "" -"查看可用的:ref:`heuristics `和:ref:`factor `" -"处理。" +"查看可用的 :ref:`heuristics ` 和 :ref:`factor " +"` 处理。" msgid "Advanced documentation" msgstr "高级文档" @@ -1794,7 +1793,7 @@ msgid "Currently the heuristic functions available are:" msgstr "目前可用的heuristic函数有：" msgid "where :math:`\\Delta x = x_1 - x_0` and :math:`\\Delta y = y_1 - y_0`" -msgstr "其中 :math:`\\Delta x = x_1 - x_0`和:math:`\\Delta y = y_1 - y_0`" +msgstr "其中 :math:`\\Delta x = x_1 - x_0` 和 :math:`\\Delta y = y_1 - y_0`" msgid "Analysis 1" msgstr "分析1" @@ -1874,9 +1873,8 @@ msgstr "返回图中每对节点的最短路径成本之和。" msgid "" "Boost returns a :math:`V \\times V` matrix, where the infinity values. " "Represent the distance between vertices for which there is no path." -msgstr "" -"Boost 返回一个:math:`V \\times V`矩阵，其中无穷大值。 表示没有路径的顶点之间" -"的距离。" +msgstr "Boost 返回一个 :math:`V \\times V` 矩阵，其中无穷大值。 " +"表示没有路径的顶点之间的距离。" msgid "" "We return only the non infinity values in form of a set of `(start_vid, " @@ -1984,7 +1982,7 @@ msgid "DENSITY" msgstr "DENSITY" msgid "is the density of the data :math:`\\dfrac{E}{V \\times (V-1)}`." -msgstr "是数据:math:`\\dfrac{E}{V \\times (V-1)}`的密度。" +msgstr "是数据 :math:`\\dfrac{E}{V \\times (V-1)}` 的密度。" msgid "OUT ROWS" msgstr "OUT ROWS" @@ -2650,8 +2648,8 @@ msgid "" msgstr "" "基于A*算法，双向搜索找到从起始顶点(``start_vid``)到结束顶点(``end_vid``)的最" "短路径。 它同时运行两项搜索：一项从 ``start_vid`` 向前搜索，一项从 " -"``end_vid``向后搜索，当两者在中间相遇时停止。 该实现可以与有向图和无向图一起" -"使用。" +"``end_vid`` 向后搜索，当两者在中间相遇时停止。 " +"该实现可以与有向图和无向图一起使用。" msgid "" "For large graphs where there is a path bewtween the starting vertex and " @@ -2718,7 +2716,7 @@ msgstr "当起始顶点和结束顶点相同时。" msgid "" "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" -msgstr "未包含值:math:`(v, v)`的**aggregate cost**为:math:`0`" +msgstr "未包含值 :math:`(v, v)` 的 **aggregate cost** 为 :math:`0`" msgid "" "When the starting vertex and ending vertex are the different and there is no " @@ -2728,7 +2726,7 @@ msgstr "当起始顶点和结束顶点不同且不存在路径时：" msgid "" "The **aggregate cost** the non included values :math:`(u, v)` is :math:" "`\\infty`" -msgstr "未包含值:math:`(u, v)`的**aggregate cost**是:math:`\\infty`" +msgstr "未包含值 :math:`(u, v)` 的 **aggregate cost** 是 :math:`\\infty`" msgid "" "For optimization purposes, any duplicated value in the starting vertices or " @@ -2736,7 +2734,7 @@ msgid "" msgstr "出于优化目的，起始顶点或结束顶点中的任何重复值都将被忽略。" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" -msgstr "运行时间（最坏情况）：:math:`O((V \\log V + E))`" +msgstr "运行时间（最坏情况）： :math:`O((V \\log V + E))`" msgid "It is expected to terminate faster than pgr_dijkstra" msgstr "预计终止速度比 pgr_dijkstra 更快" @@ -2757,7 +2755,7 @@ msgid "Process is done only on edges with **positive** costs." msgstr "仅在具有**正**成本的边缘进行处理。" msgid "Running time: :math:`O(E * (E + V * logV))`" -msgstr "运行时间：:math:`O(E * (E + V * logV))`" +msgstr "运行时间： :math:`O(E * (E + V * logV))`" msgid "Graph must be connected." msgstr "图必须是连通的。" @@ -2840,10 +2838,6 @@ msgstr "" "`Boost：边缘着色算法文档 `__" -msgid "" -"`Wikipedia: Graph Coloring `__" -msgstr "`维基百科：图着色 `__" - msgid "Components - Family of functions" msgstr "分量 - 函数族" @@ -3006,14 +3000,13 @@ msgstr ":math:`\\{x, y\\}`" msgid "" "From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number of " "adjacent vertices is 1. No further checks are needed for those nodes." -msgstr "" -"从上面来看，节点:math:`\\{a, b, d\\}`是死端，因为相邻顶点的数量为 1。不需要对" -"这些节点进行进一步检查。" +msgstr "从上面来看，节点 :math:`\\{a, b, d\\}` 是死端，因为相邻顶点的数量为 " +"1。不需要对这些节点进行进一步检查。" 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的偶数为" +msgstr "下表中，节点 :math:`\\{c, e\\}` 因为相邻顶点数不为1的偶数为" msgid "Operation: Dead End Contraction" msgstr "操作：死端收缩" @@ -3021,19 +3014,18 @@ msgstr "操作：死端收缩" msgid "" "The dead end contraction will stop until there are no more dead end nodes. " "For example from the following graph where :math:`w` is the `dead end`_ node:" -msgstr "" -"死端收缩将停止，直到不再有死端节点。 例如，从下图中，其中:math:`w`是`死端`_节" -"点：" +msgstr "死端收缩将停止，直到不再有死端节点。 例如，从下图中，其中 :math:`w` " +"是`死端`_节点：" msgid "" "After contracting :math:`w`, node :math:`v` is now a `dead end`_ node and is " "contracted:" -msgstr "收缩 :math:`w`后，节点:math:`v`现在是一个`死端`_ 节点并且已收缩：" +msgstr "收缩 :math:`w` 后，节点 :math:`v` 现在是一个`死端`_ 节点并且已收缩：" msgid "" "After contracting :math:`v`, stop. Node :math:`u` has the information of " "nodes that were contrcted." -msgstr "在收缩:math:`v`之后，停止。节点:math:`u`有已收缩节点的信息。" +msgstr "在收缩 :math:`v` 之后，停止。节点 :math:`u` 有已收缩节点的信息。" msgid "Node :math:`u` has the information of nodes that were contracted." msgstr "节点:math:`u`有已收缩节点的信息。" @@ -3177,7 +3169,7 @@ msgid "" msgstr "在本节中，将通过示例展示构建和使用收缩图。" msgid "The :doc:`sampledata` for an undirected graph is used" -msgstr "使用无向图的:doc:`sampledata`" +msgstr "使用无向图的 :doc:`sampledata`" msgid "a dead end operation first followed by a linear operation." msgstr "首先是死端操作，然后是线性操作。" @@ -3760,15 +3752,14 @@ 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`" +msgstr "顶点集 :math:`V`" msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" msgid "the set of edges :math:`E`" -msgstr "边集:math:`E`" +msgstr "边集 :math:`E`" -#, fuzzy msgid "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " "\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " @@ -3778,25 +3769,24 @@ msgid "" "\\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}`" +":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 \\n" +"eq \\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)`的定义如下：" +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}}`" -#, fuzzy msgid "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " "\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " @@ -3809,17 +3799,17 @@ msgid "" "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}`" +":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 \\n" +"eq \\varnothing \\\\ \\end{cases}`" msgid "The problem" msgstr "问题" @@ -3899,8 +3889,8 @@ msgid "" "`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}`之间存在最短路径，算法会" -"根据节点和边的序列返回该路径、" +"换句话说：如果 :math:`start_{vid}` 和 :math:`end_{vid}` " +"之间存在最短路径，算法会根据节点和边的序列返回该路径、" msgid "" ":math:`path\\_seq` indicates the relative position in the path of the :math:" @@ -3912,7 +3902,7 @@ 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}`到节点的成本。" +msgstr ":math:`agg\\_cost` 是从 :math:`start_{vid}` 到节点的成本。" msgid "If there is no path, the resulting set is empty." msgstr "如果没有路径，则结果集为空。" @@ -3954,7 +3944,7 @@ 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`的距离>限制距离。" +msgstr "从 **root** 到 :math:`u` 的距离>限制距离。" msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "从 **root**到 :math:`v`的距离>限制距离。" @@ -4053,9 +4043,8 @@ msgid "" "an undirected graph." msgstr ":doc:`pgr_cuthillMckeeOrdering` -返回无向图的反向 Cuthill-McKee 排序。" -#, fuzzy msgid ":doc:`metrics-family`" -msgstr ":doc:`prim-family`" +msgstr ":doc:`metrics-family`" msgid "" ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " @@ -4151,11 +4140,13 @@ msgid "" "returned." msgstr "当最大流量为0时则没有流量并返回**EMPTY SET**。" -msgid "There is no flow when a **source** is the same as a **target**." -msgstr "当 **source**与 **target**相同时，就没有流量。" +#, fuzzy +msgid "There is no flow when source has the same vaule as target." +msgstr "当 source与 target相同时，就没有流量。" -msgid "Any duplicated value in the source(s) or target(s) are ignored." -msgstr "source(s)或target(s) 中的任何重复值都将被忽略。" +#, 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 "计算每条边的流量/剩余容量。 在输出中" @@ -4163,11 +4154,14 @@ msgstr "计算每条边的流量/剩余容量。 在输出中" msgid "Edges with zero flow are omitted." msgstr "流量为零的边被忽略。" -msgid "" -"Creates a **super source** and edges to all the source(s), and a **super " -"target** and the edges from all the targets(s)." +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 "" -"创建**super source**和所有源的边，以及 **super target** 和所有目标的边。" msgid "" "The maximum flow through the graph is guaranteed to be the value returned " @@ -4430,10 +4424,11 @@ msgid "" "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.。" +"pgRouting 手册根据 `知识共享署名-相同方式共享3.0许可证 " +"`_。 您可以随意使用本材料，" +"但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://" +"pgrouting.org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 " +":ref:`license` page.。" msgid "General" msgstr "常规" @@ -4578,13 +4573,10 @@ msgstr "" msgid "Official functions changes" msgstr "官方功能变更" -#, fuzzy msgid "" "`#2605 `__ Standarize " "spanning tree functions output" msgstr "" -"`#2516 `__标准化输出" -"pgr_aStar" msgid "Functions:" msgstr "新函数:" @@ -4625,28 +4617,23 @@ msgstr "" "`#2516 `__标准化输出" "pgr_aStar." -#, fuzzy msgid "``pgr_lineGraph``" -msgstr "pgr_lineGraph" +msgstr "``pgr_lineGraph``" msgid "Promoted to **proposed** signature." msgstr "晋升为 **拟议** 签名。" -#, fuzzy msgid "Works for directed and undirected graphs." -msgstr "适用于**有向**和**无向**图。" +msgstr "适用于有向和无向图。" msgid "Code enhancement" msgstr "代码改进" -#, fuzzy msgid "" "`#2599 `__ Driving " "distance cleanup" -msgstr "" -"`#2599 `__ 行车距离清理" +msgstr "`#2599 `__ 行车距离清理" -#, fuzzy msgid "" "`#2607 `__ Read postgresql " "data on C++" @@ -4654,13 +4641,12 @@ msgstr "" "`#2607 `__ 在 C++ 上读取 " "postgresql 数据" -#, fuzzy msgid "" "`#2614 `__ Clang tidy does " "not work" msgstr "" -"`#2614 `__ Clang tidy 不工" -"作" +"`#2614 `__ Clang tidy " +"不工作" msgid "All releases" msgstr "所有版本" @@ -4688,9 +4674,8 @@ msgstr "树或森林中所有边的总权重最小化。" msgid "Kruskal's running time: :math:`O(E * log E)`" msgstr "克鲁斯卡尔的运行时间： :math:`O(E * log E)`" -#, fuzzy msgid "Metrics - Family of functions" -msgstr "Prim - 函数族" +msgstr "" msgid "Migration guide" msgstr "迁移指南" @@ -4877,13 +4862,12 @@ msgstr "如果需要，过滤掉添加的列，例如：" msgid "Migration of ``pgr_drivingdistance``" msgstr "迁移``pgr_drivingdistance``" -#, fuzzy msgid "" "Starting from `v3.6.0 `__ :" "doc:`pgr_drivingDistance` result columns are being standardized." msgstr "" -"从 `v3.6.0 `__开始， :doc:" -"`pgr_drivingDistance`结果列正在标准化。" +"从 `v3.6.0 `__开始， " +":doc:`pgr_drivingDistance` 结果列正在标准化。" msgid "from" msgstr "从" @@ -4957,18 +4941,14 @@ msgid "" "Migration of ``pgr_kruskalDD`` / ``pgr_kruskalBFS`` / ``pgr_kruskalDFS``" msgstr "" -#, fuzzy msgid "" "Starting from `v3.7.0 `__ :" "doc:`pgr_kruskalDD`, :doc:`pgr_kruskalBFS` and :doc:`pgr_kruskalDFS` result " "columns are being standardized." msgstr "" -"从 `v3.6.0 `__开始， :doc:" -"`pgr_drivingDistance`结果列正在标准化。" -#, fuzzy msgid "|result-bfs|" -msgstr "|result-spantree|" +msgstr "|result-bfs|" msgid "Single vertex" msgstr "单顶点" @@ -4976,17 +4956,15 @@ msgstr "单顶点" msgid "Multiple vertices" msgstr "多个顶点" -#, fuzzy msgid "Output columns were |result-bfs|" -msgstr "输出列是 |ksp-result|" +msgstr "" #, fuzzy msgid "Single vertex and Multiple vertices" msgstr "多个顶点" -#, fuzzy msgid "Do not have ``pred`` result column." -msgstr "没有``depth``结果列。" +msgstr "" #, fuzzy msgid "Be aware of the existence of `pred` result columns." @@ -5118,7 +5096,7 @@ msgstr "所使用的列是 ``going`` 和 ``coming``，用于表示边的存在 msgid "" "Flag ``directed`` was used to indicate if it was for a **directed** or " "**undirected** graph." -msgstr "``directed``标志用于指示是**有向**图还是 **无向**图。" +msgstr "``directed`` 标志用于指示是 **有向** 图还是 **无向** 图。" msgid "The flag ``directed`` is ignored." msgstr "``directed``标志被忽略。" @@ -5126,7 +5104,7 @@ msgstr "``directed``标志被忽略。" msgid "" "Regardless of it's value it gives the result considering the graph as " "**undirected**." -msgstr "无论它的值如何，它都会给出将图视为**无向**的结果。" +msgstr "无论它的值如何，它都会给出将图视为 **无向** 的结果。" msgid "" "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " @@ -5862,7 +5840,7 @@ msgstr "当为负时，图上不存在边(``target``, ``source``)。" msgid "" "The decision of the graph to be **directed** or **undirected** is done when " "executing a pgRouting algorithm." -msgstr "图是**有向**图还是**无向**图的决定是在执行 pgRouting 算法时完成的。" +msgstr "图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" msgid "Graph with ``cost``" msgstr "``成本``图" @@ -6317,7 +6295,7 @@ msgid "" msgstr "最后使用存储在顶点表上的数据填充 ``source``和``target`` 。" msgid "See :doc:`sampledata` for an example for building a topology." -msgstr "有关构建拓扑的示例，请参阅 :doc:`示例数据`。" +msgstr "有关构建拓扑的示例，请参阅 :doc:`sampledata`。" msgid "" "Data coming from OSM and using `osm2pgrouting `__" -#, fuzzy msgid "Queries use the :doc:`sampledata` network." -msgstr "查询使用 :doc:`示例数据`网络。" +msgstr "查询使用 :doc:`sampledata` 网络。" msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" @@ -9843,8 +9816,9 @@ msgstr "" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - 实验" +#, fuzzy msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path(s) in a binary " +"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " "graph." msgstr "``pgr_binaryBreadthFirstSearch`` — 返回二元图中的最短路径。" @@ -10143,8 +10117,8 @@ msgid "" "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " "**depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" -"从根顶点开始 :math:`{12, 6\\}` 在一个**无向**图上，**depth** :math:`<=2`，边" -"按``id``升序排列" +"从根顶点开始 :math:`{12, 6\\}` 在一个**无向**图上，**depth** :math:`<=2`，" +"边按 ``id`` 升序排列" msgid "DFS optional parameters" msgstr "DFS 可选参数" @@ -10927,7 +10901,7 @@ msgstr "" "顺序排列在队列中。" msgid "The implementation is for **undirected** graphs." -msgstr "该实现适用于**无向**图。" +msgstr "该实现适用于 **无向** 图。" msgid "" "The bandwidth minimization problems are considered NP-complete problems." @@ -10977,8 +10951,9 @@ msgstr "" msgid "pgr_dagShortestPath - Experimental" msgstr "pgr_dagShortestPath - 实验" +#, fuzzy msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path(s) for weighted directed " +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " "acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " "implemented by Boost.Graph." msgstr "" @@ -11051,7 +11026,7 @@ msgstr "从顶点:math:`\\{5, 10\\}`到顶点 :math:`11`" msgid "" "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " "**undirected** graph" -msgstr "在**无向**图上，从顶点:math:`\\{5, 15\\}`到顶点:math:`\\{11, 17\\}`" +msgstr "在 **无向** 图上，从顶点:math:`\\{5, 15\\}`到顶点:math:`\\{11, 17\\}`" msgid "Return columns" msgstr "返回列" @@ -11071,7 +11046,7 @@ msgid "" msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" msgid "Calculates the degree of the vertices of an **undirected** graph" -msgstr "计算**无向**图顶点的度数" +msgstr "计算 **无向** 图顶点的度数" msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" msgstr "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])" @@ -11207,7 +11182,7 @@ msgstr "" msgid "" "The implementation works for both **directed** and **undirected** graphs." -msgstr "该实现适用于**有向**图和**无向**图。" +msgstr "该实现适用于 **有向** 图和 **无向** 图。" msgid "" "Provides the Depth First Search traversal order from a root vertex or from a " @@ -11273,7 +11248,8 @@ msgstr "" msgid "``pgr_dijkstra``" msgstr "`pgr_dijkstra```" -msgid "``pgr_dijkstra`` — Shortest path(s) using Dijkstra algorithm." +#, fuzzy +msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "`pgr_dijkstra`` - 使用 Dijkstra 算法的最短路径。" msgid "Version 3.5.0" @@ -11346,10 +11322,10 @@ msgstr "在**有向**图上，从顶点 :math:`6`到顶点 :math:`\\{10, 17\\}`" msgid "" "The examples of this section are based on the :doc:`sampledata` network." -msgstr "本节的示例基于 :doc:`示例数据` 网络。" +msgstr "本节的示例基于 :doc:`sampledata` 网络。" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "对于带有 ``cost``和``reverse_cost``列的**有向**图" +msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **有向** 图" msgid "Directed graph with cost and reverse cost columns" msgstr "带成本列和反向成本列的有向图" @@ -11393,7 +11369,7 @@ msgstr "" "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "对于带有 ``cost``和``reverse_cost``列的**无向**图" +msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **无向** 图" msgid "Undirected graph with cost and reverse cost columns" msgstr "带成本列和反向成本列的无向图" @@ -11423,7 +11399,7 @@ msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" msgstr "16) 使用 `组合`_ 来获取示例9到11的解决方案" msgid "For **directed** graphs only with ``cost`` column" -msgstr "仅适用于**有向**图，且仅包含``cost``列" +msgstr "仅适用于 **有向** 图，且仅包含 ``cost`` 列" msgid "Directed graph only with cost column" msgstr "仅有成本列的有向图" @@ -11453,7 +11429,7 @@ msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" msgstr "24) 使用 `组合`_ 来获取示例17到19的解决方案" msgid "For **undirected** graphs only with ``cost`` column" -msgstr "仅适用于带有``cost``列的**无向**图" +msgstr "仅适用于带有 ``cost`` 列的 **无向** 图" msgid "Undirected graph only with cost column" msgstr "仅有成本列的无向图" @@ -11510,17 +11486,19 @@ 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(s) using Dijkstra " +"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " "algorithm." msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算的最短路径总成本。" msgid "``pgr_dijkstraCost`` (`Combinations`_)" msgstr "``pgr_dijkstraCost`` (`组合`_)" +#, fuzzy msgid "" -"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " -"path(s) using Dijkstra Algorithm." +"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " +"using Dijkstra Algorithm." msgstr "``pgr_dijkstraCost`` 函数总结了使用Dijkstra算法的最短路径的成本。" msgid "" @@ -11580,7 +11558,7 @@ msgid "Uses Dijkstra algorithm." msgstr "使用 Dijkstra 算法。" msgid "Works for **directed** and **undirected** graphs." -msgstr "适用于**有向**和**无向**图。" +msgstr "适用于 **有向** 和 **无向** 图。" msgid "When there are more than one path to the same vertex with same cost:" msgstr "当有多条路径通向同一顶点且成本相同时：" @@ -11708,7 +11686,7 @@ msgid "Find the best pedestrian connection between two lines of buses" msgstr "在两条公交线路之间寻找最佳的行人通道" msgid "Unsing an **undirected** graph for pedestrian routing" -msgstr "使用**无向**图进行行人路线规划" +msgstr "使用 **无向** 图进行行人路线规划" msgid "The first subway line stations are at :math:`\\{15, 16\\}`" msgstr "第一条地铁线的站点位于 :math:`\\{15, 16\\}`" @@ -11815,7 +11793,7 @@ msgid "Near optional parameters" msgstr "接近可选参数" msgid "``cap``" -msgstr "`cap``" +msgstr "``cap``" msgid "Find at most ``cap`` number of nearest shortest paths" msgstr "查找最多 ``cap`` 条最近的最短路径" @@ -11824,10 +11802,10 @@ msgid "``global``" msgstr "``global``" msgid "When ``true``: only ``cap`` limit results will be returned" -msgstr "``true``时：仅返回``cap``结果" +msgstr "``true`` 时：仅返回 ``cap`` 结果" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" -msgstr "当 ``false` 时：将返回每个 ``Start vid` 的 ``cap` 限值" +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" @@ -11948,11 +11926,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\\}` 的路径。" +"on an directed graph." +msgstr "在有向图上查找按顺序访问顶点 :math:`\\{ 5, 1, 8\\}` 的路线。" msgid "Via optional parameters" msgstr "Via可选参数" @@ -12108,7 +12086,7 @@ msgstr "" "条边没有相同的颜色。" msgid "The implementation is for **undirected** and **loop-free** graphs" -msgstr "针对**无向**和**无环**图实施" +msgstr "针对 **无向** 和 **无环** 图实施" msgid "loop free" msgstr "无环" @@ -12169,7 +12147,7 @@ msgid "Returns set of |result-edge-color|" msgstr "Returns set of |result-edge-color|" msgid "Graph coloring of pgRouting :doc:`sampledata`" -msgstr "pgRouting :doc:`示例数据`的图着色" +msgstr "" msgid "``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" @@ -12878,7 +12856,7 @@ msgid "" msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE``" msgid "``cap`` and **original point** are used in the code" -msgstr "代码中使用了``cap``和 **原始点**" +msgstr "代码中使用了 ``cap`` 和 **原始点**" msgid "Many points examples" msgstr "多点示例" @@ -13030,7 +13008,7 @@ msgstr "" "floyd_warshall_shortest.html>`_" msgid "Queries uses the :doc:`sampledata` network." -msgstr "查询使用 :doc:`示例数据`网络。" +msgstr "查询使用 :doc:`sampledata` 网络。" msgid "``pgr_full_version``" msgstr "``pgr_full_version``" @@ -13167,7 +13145,7 @@ msgid "Returns set of |generic-result|" msgstr "返回 |eneric-result| 的集合" msgid "Circuits present in the pgRouting :doc:`sampledata`" -msgstr "pgRouting :doc:`示例数据`中存在的电路" +msgstr "pgRouting :doc:`sampledata` 中存在的电路" msgid "Id of the circuit starting from ``1``" msgstr "电路id从``1``开始" @@ -13219,7 +13197,7 @@ msgid "" msgstr "它将根据图形的平面性返回一个布尔值。" msgid "Applicable only for **undirected** graphs." -msgstr "仅适用于**无向**图。" +msgstr "仅适用于 **无向** 图。" msgid "The algorithm does not considers traversal costs in the calculations." msgstr "该算法在计算中不考虑遍历成本。" @@ -13778,8 +13756,8 @@ msgid "" "examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" -"本节的示例基于 :doc:`示例数据`网络。 这些示例包括包含具有``reverse_cost``的" -"边 4、7、8 和 10 的子图。" +"本节的示例基于 :doc:`sampledata` 网络。 这些示例包括包含具有 ``reverse_cost``" +" 的边 4、7、8 和 10 的子图。" msgid "The data" msgstr "数据" @@ -14012,7 +13990,7 @@ 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." -msgstr "在:doc:`示例数据`网络上完成的查询给出了连接图所需的边列表。" +msgstr "在 :doc:`sampledata` 网络上完成的查询给出了连接图所需的边列表。" msgid "https://www.boost.org/libs/graph/doc/make_connected.html" msgstr "https://www.boost.org/libs/graph/doc/make_connected.html" @@ -14106,7 +14084,8 @@ msgstr "``pgr_maxFlow`` (`组合`_)" msgid "New **Proposed** function" msgstr "新**拟议** 的函数" -msgid "Calculates the maximum flow from the `source(s)` to the `target(s)`." +#, fuzzy +msgid "Calculates the maximum flow from the sources to the targets." msgstr "计算从 `source(s)`到 `target(s)`的最大流量。" msgid "" @@ -14351,7 +14330,7 @@ msgid "Examples" msgstr "示例" msgid "Let's create the topology for the data in :doc:`sampledata`" -msgstr "让我们为 :doc:`示例数据`中的数据创建拓扑" +msgstr "让我们为 :doc:`sampledata` 中的数据创建拓扑" msgid "Now we can analyze the network." msgstr "现在我们可以分析网络了。" @@ -14866,7 +14845,7 @@ msgstr "" "得没有边连接两个相同颜色的顶点。" msgid "The implementation is applicable only for **undirected** graphs." -msgstr "该实现仅适用于**无向**图。" +msgstr "该实现仅适用于 **无向** 图。" msgid "" "Provides the color to be assigned to all the vertices present in the graph." @@ -15336,11 +15315,6 @@ msgstr "" "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " "[**options**])" -msgid "" -"Find the route that visits the vertices :math:`\\{ 5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "在有向图上查找按顺序访问顶点 :math:`\\{ 5, 1, 8\\}` 的路线。" - msgid "" "All this examples are about the route that visits the vertices :math:`\\{5, " "7, 1, 8, 15\\}` in that order on a directed graph." @@ -15558,7 +15532,7 @@ msgstr "" msgid "" "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." -msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP 算法`。" +msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP algorithm`。" msgid "" "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " @@ -15619,9 +15593,10 @@ 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(s)" +"algorithm, find the shortest path" msgstr "修改图以包括由points_sql 定义的点。 使用 Dijkstra 算法，找到最短路径" msgid "Characteristics:" @@ -15634,7 +15609,7 @@ msgid "**positive** when it belongs to the `Edges SQL`_" msgstr "当它属于`Edges SQL`_ 时为**正**" msgid "**negative** when it belongs to the `Points SQL`_" -msgstr "当它属于 `Points SQL`_为**负**" +msgstr "当它属于 `Points SQL`_ 为**负**" msgid "Driving side can not be ``b``" msgstr "驾驶侧不可能为 ``b``" @@ -15977,7 +15952,7 @@ msgid "``b`` for both." msgstr "``b``对于两者。" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." -msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 。" +msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges`。" msgid "" "All the examples are about traveling from point :math:`1` and vertex :math:" @@ -15998,9 +15973,10 @@ msgstr "从前方超车或以左侧驾驶方式行驶。" msgid "``pgr_withPointsCost`` - Proposed" msgstr "``pgr_withPointsCost`` -拟议" +#, fuzzy msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path(s) found, for the combination of points " +"aggregate cost of the shortest path found, for the combination of points " "given." msgstr "" "``pgr_withPointsCost`` -对于给定的点组合，计算最短路径并仅返回找到的最短路径" @@ -16009,9 +15985,10 @@ msgstr "" 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(s) found." +"algorithm, return only the aggregate cost of the shortest path found." msgstr "" "修改图以包括由points_sql 定义的点。 使用 Dijkstra 算法，仅返回找到的最短路径" "的总成本。" @@ -16039,7 +16016,7 @@ msgstr "" "如果返回的值存储在表中，则唯一索引将是这一对：`(start_vid, end_vid)`.。" msgid "For **undirected** graphs, the results are **symmetric**." -msgstr "对于**无向**图，结果是**对称**的。" +msgstr "对于 **无向** 图，结果是 **对称** 的。" msgid "" "For optimization purposes, any duplicated value in the `start_vids` or " @@ -16182,8 +16159,7 @@ msgstr "" msgid "" "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " "on an **undirected** graph" -msgstr "" -"**无向**图上的点 :math:`\\{1, 6\\}`和顶点:math:`\\{10, 11\\}`的成本矩阵" +msgstr "**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵" msgid "Returning a **symmetrical** cost matrix" msgstr "返回**对称**成本矩阵" @@ -16405,8 +16381,7 @@ msgstr "" msgid "" "Modifies the graph to include the points defined in the `Points SQL`_ and " "using Yen algorithm, finds the :math:`K` shortest paths." -msgstr "" -"修改图以包括`Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K`最短路径。" +msgstr "修改图以包括 `Points SQL`_ 中定义的点并使用 Yen 算法查找 :math:`K`最短路径。" msgid "" "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " @@ -19418,16 +19393,16 @@ msgid "Identifier of the ending vertex of the geometry ``geom``" msgstr "几何体 ``geom`` 终止顶点的标识符" msgid "Cost to traverse from `source` to ``target``." -msgstr "从`source` 到 ``target`` 的遍历成本。" +msgstr "从 `source` 到 ``target`` 的遍历成本。" msgid "Cost to traverse from `target` to ``source``." -msgstr "从 `target`到 ``source``的遍历成本。" +msgstr "从 `target` 到 ``source`` 的遍历成本。" msgid "Flow capacity from `source` to ``target``." -msgstr "从`source`到``target``的流量。" +msgstr "从 `source` 到 ``target`` 的流量。" msgid "Flow capacity from `target` to ``source``." -msgstr "从`target`到``source``的流量。" +msgstr "从 `target` 到 ``source`` 的流量。" msgid "``category``" msgstr "``category``" @@ -19441,18 +19416,16 @@ msgstr ":math:`x` 几何图形起始顶点的坐标。" msgid "" "For convinience it is saved on the table but can be calculated as " "``ST_X(ST_StartPoint(geom))``." -msgstr "" -"为了方便起见，它被保存在表格中，但也可以计算为 ``ST_X(ST_StartPoint(geom)) " -"``。" +msgstr "为了方便起见，它被保存在表格中，但也可以计算为 " +"``ST_X(ST_StartPoint(geom))``。" msgid ":math:`y` coordinate of the ending vertex of the geometry." -msgstr ":math:`y`几何图形结束顶点的坐标。" +msgstr ":math:`y` 几何图形结束顶点的坐标。" msgid "" "For convinience it is saved on the table but can be calculated as " "``ST_Y(ST_EndPoint(geom))``." -msgstr "" -"为方便起见，它保存在表格中，但也可以计算为``ST_Y(ST_EndPoint(geom))``。" +msgstr "为方便起见，它保存在表格中，但也可以计算为 ``ST_Y(ST_EndPoint(geom))``。" msgid "The geometry of the segments." msgstr "分段的几何形状。" @@ -19466,11 +19439,11 @@ msgid "" msgstr "可以选择在不同的列上创建索引。建议的做法是" msgid "``id`` indexed." -msgstr "``id``列创建索引 。" +msgstr "``id`` 列创建索引 。" msgid "" "``source`` and ``target`` columns indexed to speed up pgRouting queries." -msgstr "``source``和``target``列建立索引以加快 pgRouting 查询。" +msgstr "``source`` 和 ``target`` 列建立索引以加快 pgRouting 查询。" msgid "" "``geom`` indexed to speed up gemetry processes that might be needed in the " @@ -19478,7 +19451,7 @@ msgid "" msgstr "``geom`` 列建立索引以加快前端可能需要的 gemetry 处理。" msgid "For this small example the indexes are skipped, except for ``id``" -msgstr "在这个小例子中，除了 ``id``以外，其他索引都被跳过" +msgstr "在这个小例子中，除了 ``id`` 以外，其他索引都被跳过" msgid "Edges data" msgstr "边数据" @@ -19584,7 +19557,7 @@ msgid "Directed, with cost and reverse_cost" msgstr "具有cost和reverse_cost的有向图" msgid "Undirected graph with ``cost`` and ``reverse_cost``" -msgstr "具有``cost``和``reverse_cost``的无向图" +msgstr "具有 ``cost`` 和 ``reverse_cost`` 的无向图" msgid "" "When working with city networks, this is recommended for point of view of " @@ -19595,13 +19568,13 @@ msgid "Undirected, with cost and reverse cost" msgstr "带有cost和 reverse cost的无向图" msgid "Directed graph with ``cost``" -msgstr "有``cost``的有向图" +msgstr "有 ``cost`` 的有向图" msgid "Directed, with cost" msgstr "有向，有成本" msgid "Undirected graph with ``cost``" -msgstr "带有 ``cost``的无向图" +msgstr "带有 ``cost`` 的无向图" msgid "Undirected, with cost" msgstr "无向，有成本" @@ -19630,9 +19603,9 @@ msgid "" "companies providing pgRouting development and consulting services." msgstr "" "pgRouting 社区支持可通过 `pgRouting 网站 `_、`文档`_、教程、邮件列表等获得。 如果您正" -"在寻求:ref:`商业支持`，请在下面找到提供 pgRouting 开发和" -"咨询服务的公司列表。" +"html>`_、`文档 `_、教程、邮件列表等获得。 " +"如果您正在寻求 :ref:`商业支持 `，请在下面找到提供 " +"pgRouting 开发和咨询服务的公司列表。" msgid "Reporting Problems" msgstr "报告问题" @@ -19898,7 +19871,7 @@ msgid "**directed** graph" msgstr "**有向**图" msgid "**undirected** graph" -msgstr "**无向**图" +msgstr "**无向** 图" msgid "Arriving at the point:" msgstr "到达点：" @@ -19938,7 +19911,7 @@ msgid "**Temporal**: for example points given through a web application" msgstr "**时间**：例如通过 Web 应用程序给出的点" msgid "The numbering of the points are handled with negative sign." -msgstr "在点 SQL 中使用pgr_findCloseEdges。" +msgstr "" msgid "" "This sign change is to avoid confusion when there is a vertex with the same " @@ -19958,7 +19931,7 @@ msgid "positive sign is a vertex of the original graph" msgstr "正号是原始图的顶点" msgid "negative sign is a point of the `Points SQL`_" -msgstr "负号是`Points SQL`_ 的一个点" +msgstr "负号是 `Points SQL`_ 的一个点" msgid "About points" msgstr "关于积分" @@ -19967,9 +19940,8 @@ msgid "" "For this section the following city (see :doc:`sampledata`) some interesing " "points such as restaurant, supermarket, post office, etc. will be used as " "example." -msgstr "" -"对于本节，将使用以下城市（参见:doc:`示例数据`）一些有趣的点（例如餐馆、超市、" -"邮局等）作为示例。" +msgstr "对于本节，将使用以下城市（参见 " +":doc:`sampledata`）一些有趣的点（例如餐馆、超市、邮局等）作为示例。" msgid "The graph is **directed**" msgstr "图是**有向**的" @@ -19986,10 +19958,10 @@ msgid "" msgstr "每个点位置显示它与边 ``(source, target)``的关系" msgid "On the right for points **2** and **4**." -msgstr "在右侧为第** 2 **点和第** 4** 点。" +msgstr "在右侧为第 **2** 点和第 **4** 点。" msgid "On the left for points **1**, **3** and **5**." -msgstr "左侧为第 **1**、**3** 和** 5 **点。" +msgstr "左侧为第 **1**、 **3** 和 **5** 点。" msgid "On both sides for point **6**." msgstr "在两侧为第**6**点。" @@ -20017,10 +19989,10 @@ msgid "" msgstr "直观地显示不同驾驶侧数据解释方式的差异。" msgid "Point **1** located on edge ``(6, 5)``" -msgstr "点** 1 **位于边``(6, 5)``" +msgstr "点 **1** 位于边 ``(6, 5)``" msgid "Point **2** located on edge ``(16, 17)``" -msgstr "点** 2 **位于边缘 ``(16, 17)``" +msgstr "点 **2** 位于边缘 ``(16, 17)``" msgid "Point **3** located on edge ``(8, 12)``" msgstr "点 **3** 位于边缘``(8, 12)``" @@ -20035,10 +20007,10 @@ msgid "Point **6** located on edges ``(6, 7)`` and ``(7, 6)``" msgstr "点** 6** 位于边``(6, 7)``和``(7, 6)``" msgid "Point **1** located on edge ``(5, 6)``" -msgstr "点 **1 **位于边 ``(5, 6)``" +msgstr "点 **1 ** 位于边 ``(5, 6)``" msgid "Point **2** located on edge ``(17, 16)``" -msgstr "点** 2** 位于边 ``(17, 16)``" +msgstr "点 **2** 位于边 ``(17, 16)``" msgid "Point **4** located on edge ``(3, 1)``" msgstr "点 4 位于边``(3, 1)``" @@ -20047,16 +20019,16 @@ msgid "Like having all points to be considered in both sides ``b``" msgstr "就像双方都要考虑所有点 ``b``" msgid "Prefered usage on **undirected** graphs" -msgstr "**无向**图上的首选用法" +msgstr "**无向** 图上的首选用法" msgid "On the :doc:`TRSP-family` this option is not valid" -msgstr "在 :doc:`TRSP-family`上，此选项无效" +msgstr "在 :doc:`TRSP-family` 上，此选项无效" msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``" -msgstr "点**1**位于边``(5, 6)``和 ``(6, 5)``" +msgstr "点 **1** 位于边 ``(5, 6)`` 和 ``(6, 5)``" msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``" -msgstr "点**2**位于边``(17, 16)``和 ``16, 17``" +msgstr "点 **2** 位于边 ``(17, 16)`` 和 ``16, 17``" msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``" msgstr "点 **4**位于边``(3, 1)``和``(1, 3)``" @@ -20172,34 +20144,60 @@ msgid "" msgstr "边``(-2, 17)``变为``(17, -2)``，成本为``0.6``，并添加到图中。" msgid "withPoints - Family of functions" -msgstr "withPoints -函数族" +msgstr "withPoints - 函数族" msgid "" "This family of functions belongs to the :doc:`withPoints-category` and the " "functions that compose them are based one way or another on dijkstra " "algorithm." -msgstr "" -"这一系列函数属于:doc:`withPoints-category`，组成它们的函数以某种方式基于 " +msgstr "这一系列函数属于 :doc:`withPoints-category`，组成它们的函数以某种方式基于 " "dijkstra 算法。" msgid "Depending on the name:" msgstr "取决于名称：" msgid "pgr_withPoints is pgr_dijkstra **with points**" -msgstr "pgr_withPoints 是**带有点**的 pgr_dijkstra" +msgstr "pgr_withPoints 是 **带有点** 的 pgr_dijkstra" msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**" -msgstr "pgr_withPointsCost 是**带有点**的 pgr_dijkstraCost" +msgstr "pgr_withPointsCost 是 **带有点** 的 pgr_dijkstraCost" msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**" -msgstr "pgr_withPointsCostMatrix 是**带有点**的 pgr_dijkstraCostMatrix" +msgstr "pgr_withPointsCostMatrix 是 **带有点** 的 pgr_dijkstraCostMatrix" msgid "pgr_withPointsKSP is pgr_ksp **with points**" -msgstr "pgr_withPointsKSP 是**带有点**的 pgr_ksp" +msgstr "pgr_withPointsKSP 是 **带有点** 的 pgr_ksp" msgid "pgr_withPointsDD is pgr_drivingDistance **with points**" -msgstr "pgr_withPointsDD 是**带有点**的 pgr_drivenDistance" +msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" #, fuzzy msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia 是 **带有点** 的" + +#~ msgid "" +#~ "`Wikipedia: Graph Coloring `__" +#~ msgstr "`维基百科：图着色 `__" + +#~ msgid "" +#~ "Creates a **super source** and edges to all the source(s), and a **super " +#~ "target** and the edges from all the targets(s)." +#~ msgstr "" +#~ "创建**super source**和所有源的边，以及 **super target** 和所有目标的边。" + +#~ msgid "wget" +#~ msgstr "wget" + +#~ msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" +#~ msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_ , [``directed``])" + +#, fuzzy +#~ msgid "Identifier of the vertex" +#~ msgstr "顶点的标识符。" + +#~ msgid "" +#~ "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that " +#~ "order on an **directed** graph." +#~ msgstr "" +#~ "在一个**有向**图上，找出按此顺序访问顶点 :math:`\\{5, 1, 8\\}` 的路径。"